Home
last modified time | relevance | path

Searched refs:NILLNODE (Results 1 – 25 of 27) sorted by relevance

12

/original-bsd/usr.bin/make/lst.lib/
H A DlstSucc.c41 if (ln == NILLNODE) {
42 return (NILLNODE);
H A DlstPred.c49 if (ln == NILLNODE) {
50 return (NILLNODE);
H A DlstMember.c32 return NILLNODE;
42 return NILLNODE;
H A DlstMove.c59 if (lns == NILLNODE || lnd == NILLNODE) {
H A DlstFindFrom.c48 return (NILLNODE);
65 return (NILLNODE);
H A DlstInsert.c51 if (LstValid (l) && (LstIsEmpty (l) && ln == NILLNODE))
64 if (ln == NILLNODE) {
H A DlstDatum.c39 if (ln != NILLNODE) {
H A DlstFirst.c40 return (NILLNODE);
H A DlstLast.c40 return (NILLNODE);
H A DlstReplace.c40 if (ln == NILLNODE) {
H A DlstCur.c59 return (NILLNODE);
H A DlstNext.c51 return (NILLNODE);
H A DlstPrev.c61 return (NILLNODE);
H A DlstInt.h76 #define LstNodeValid(ln, l) ((((LstNode)ln) == NILLNODE) ? FALSE : TRUE)
H A DlstAppend.c48 if (LstValid (l) && (ln == NILLNODE && LstIsEmpty (l))) {
/original-bsd/usr.bin/make/
H A Dsuff.c310 if (ln != NILLNODE) {
407 if (ln == NILLNODE) {
480 srcLn = NILLNODE;
481 singleLn = NILLNODE;
710 if (ln != NILLNODE) {
736 if (ln != NILLNODE) {
1082 if (ln != NILLNODE)
1446 if (ln != NILLNODE) {
1723 if (ln != NILLNODE) {
1824 if (ln != NILLNODE) {
[all …]
H A Dmake.c318 while ((ln = Lst_Next (cgn->children)) != NILLNODE) {
321 if (Lst_Member (pgn->children, gn) == NILLNODE) {
459 while ((ln = Lst_Next (cgn->parents)) != NILLNODE) {
493 for (ln = Lst_First(cgn->successors); ln != NILLNODE; ln = Lst_Succ(ln)) {
497 Lst_Member(toBeMade, (ClientData)succ) == NILLNODE)
511 while ((ln = Lst_Next (cgn->iParents)) != NILLNODE) {
665 for (ln = Lst_First(gn->preds); ln != NILLNODE; ln = Lst_Succ(ln)){ in MakeStartJobs()
681 if (ln != NILLNODE) { in MakeStartJobs()
H A Ddir.c470 while ((ln = Lst_Next(path)) != NILLNODE) {
696 while ((ln = Lst_Next (path)) != NILLNODE) {
780 while ((ln = Lst_Next (path)) != NILLNODE) {
877 if (ln == NILLNODE) {
1010 if (ln != NILLNODE) {
1012 if (Lst_Member(path, (ClientData)p) == NILLNODE) {
1111 while ((ln = Lst_Next (path)) != NILLNODE) {
1204 for (ln = Lst_First(path2); ln != NILLNODE; ln = Lst_Succ(ln)) {
1206 if (Lst_Member(path1, (ClientData)p) == NILLNODE) {
1227 while ((ln = Lst_Next (openDirectories)) != NILLNODE) { in Dir_PrintDirectories()
H A Dlst.h35 #define NILLNODE ((LstNode) NIL) macro
H A Djob.c761 if (job->tailCmds != NILLNODE) {
1369 job->tailCmds = NILLNODE;
1439 if ((ln == NILLNODE) ||
1543 if (job->tailCmds != NILLNODE) {
1935 if (jnode == NILLNODE) {
1938 if (jnode == NILLNODE) {
2027 while (nfds && (ln = Lst_Next (jobs)) != NILLNODE) { in Job_CatchOutput()
2467 while ((ln = Lst_Next (jobs)) != NILLNODE) {
2614 while ((ln = Lst_Next (jobs)) != NILLNODE) { in Job_AbortAll()
H A Dcompat.c359 if (Lst_Member (gn->iParents, pgn) != NILLNODE) {
510 if (Lst_Member (gn->iParents, pgn) != NILLNODE) {
H A Dvar.c235 if ((var == NILLNODE) && (flags & FIND_CMD) && (ctxt != VAR_CMD)) {
238 if (!checkEnvFirst && (var == NILLNODE) && (flags & FIND_GLOBAL) &&
243 if ((var == NILLNODE) && (flags & FIND_ENV)) {
263 if (var == NILLNODE) {
271 } else if (var == NILLNODE) {
367 if (ln != NILLNODE) {
H A Dmain.c534 for (ln = Lst_First(create); ln != NILLNODE;
555 if (ln != NILLNODE)
H A Darch.c446 if (ln != NILLNODE) {
881 while ((ln = Lst_Next (gn->parents)) != NILLNODE) {
H A Dtarg.c274 while ((ln = Lst_Next (names)) != NILLNODE) {

12