Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/bmake/lst.lib/
H A DlstForEachFrom.c82 if (!LstValid (list) || LstIsEmpty (list)) { in Lst_ForEachFrom()
121 } while (!result && !LstIsEmpty(list) && !done); in Lst_ForEachFrom()
H A DlstAppend.c83 if (LstValid (l) && (ln == NULL && LstIsEmpty (l))) { in Lst_InsertAfter()
87 if (!LstValid (l) || LstIsEmpty (l) || ! LstNodeValid (ln, l)) { in Lst_InsertAfter()
H A DlstInsert.c86 if (LstValid (l) && (LstIsEmpty (l) && ln == NULL)) in Lst_InsertBefore()
89 if (!LstValid (l) || LstIsEmpty (l) || !LstNodeValid (ln, l)) { in Lst_InsertBefore()
H A DlstIsEmpty.c73 return ( ! LstValid (l) || LstIsEmpty(l)); in Lst_IsEmpty()
H A DlstFirst.c71 if (!LstValid (l) || LstIsEmpty (l)) { in Lst_First()
H A DlstLast.c71 if (!LstValid(l) || LstIsEmpty (l)) { in Lst_Last()
H A DlstOpen.c82 (l)->atEnd = LstIsEmpty (l) ? Head : Unknown; in Lst_Open()
H A DlstFindFrom.c76 if (!LstValid (l) || LstIsEmpty (l) || !LstNodeValid (ln, l)) { in Lst_FindFrom()
H A DlstInt.h103 #define LstIsEmpty(l) (((List)(l))->firstPtr == NULL) macro