NIL               211 browse/browse.c 			entries[nentries]->e_name = NIL(char *);
NIL               239 browse/browse.c 	if(nentries>=MAXENTS || entries[nentries]==NIL(struct entry *)) {
NIL               360 browse/browse.c 		entries[nentries]->e_name = NIL(char *);
NIL               363 browse/browse.c 		entries[nentries]->e_name = NIL(char *);
NIL                45 l_init.c           if (headerPtr == (List_Links *) NIL || !headerPtr) {
NIL                45 l_insert.c         if (itemPtr == (List_Links *) NIL || destPtr == (List_Links *) NIL
NIL                45 l_insert.c         if (itemPtr == (List_Links *) NIL || destPtr == (List_Links *) NIL
NIL                45 l_l_insert.c       if (headerPtr == (List_Links *) NIL || destPtr == (List_Links *) NIL
NIL                45 l_l_insert.c       if (headerPtr == (List_Links *) NIL || destPtr == (List_Links *) NIL
NIL                59 l_l_insert.c       headerPtr->nextPtr = (List_Links *) NIL;
NIL                60 l_l_insert.c       headerPtr->prevPtr = (List_Links *) NIL;
NIL                42 l_remove.c         if (itemPtr == (List_Links *) NIL || itemPtr == itemPtr->nextPtr
NIL               102 list.h             (elementPtr)->prevPtr = (List_Links *) NIL; \
NIL               103 list.h             (elementPtr)->nextPtr = (List_Links *) NIL;
NIL                68 stdlib.h       #define		free(ptr) {_free(ptr); (ptr) = (char *) NIL; }