Home
last modified time | relevance | path

Searched refs:LstIsEmpty (Results 1 – 9 of 9) sorted by relevance

/trueos/contrib/bmake/lst.lib/
HDlstForEachFrom.c82 if (!LstValid (list) || LstIsEmpty (list)) { in Lst_ForEachFrom()
121 } while (!result && !LstIsEmpty(list) && !done); in Lst_ForEachFrom()
HDlstAppend.c83 if (LstValid (l) && (ln == NULL && LstIsEmpty (l))) { in Lst_InsertAfter()
87 if (!LstValid (l) || LstIsEmpty (l) || ! LstNodeValid (ln, l)) { in Lst_InsertAfter()
HDlstInsert.c86 if (LstValid (l) && (LstIsEmpty (l) && ln == NULL)) in Lst_InsertBefore()
89 if (!LstValid (l) || LstIsEmpty (l) || !LstNodeValid (ln, l)) { in Lst_InsertBefore()
HDlstIsEmpty.c73 return ( ! LstValid (l) || LstIsEmpty(l)); in Lst_IsEmpty()
HDlstFirst.c71 if (!LstValid (l) || LstIsEmpty (l)) { in Lst_First()
HDlstLast.c71 if (!LstValid(l) || LstIsEmpty (l)) { in Lst_Last()
HDlstOpen.c82 (l)->atEnd = LstIsEmpty (l) ? Head : Unknown; in Lst_Open()
HDlstFindFrom.c76 if (!LstValid (l) || LstIsEmpty (l) || !LstNodeValid (ln, l)) { in Lst_FindFrom()
HDlstInt.h103 #define LstIsEmpty(l) (((List)(l))->firstPtr == NULL) macro