Home
last modified time | relevance | path

Searched refs:LstValid (Results 1 – 19 of 19) sorted by relevance

/original-bsd/usr.bin/make/lst.lib/
H A DlstAppend.c48 if (LstValid (l) && (ln == NILLNODE && LstIsEmpty (l))) {
52 if (!LstValid (l) || LstIsEmpty (l) || ! LstNodeValid (ln, l)) {
H A DlstInsert.c51 if (LstValid (l) && (LstIsEmpty (l) && ln == NILLNODE))
54 if (!LstValid (l) || LstIsEmpty (l) || !LstNodeValid (ln, l)) {
H A DlstConcat.c53 if (!LstValid (l1) || !LstValid (l2)) {
H A DlstIsEmpty.c41 return ( ! LstValid (l) || LstIsEmpty(l));
H A DlstFirst.c39 if (!LstValid (l) || LstIsEmpty (l)) {
H A DlstLast.c39 if (!LstValid(l) || LstIsEmpty (l)) {
H A DlstClose.c46 if (LstValid(l) == TRUE) {
H A DlstEnQueue.c41 if (LstValid (l) == FALSE) {
H A DlstCur.c57 if ((LstValid(l) == FALSE) ||
H A DlstIsAtEnd.c52 return (!LstValid (l) || !list->isOpen ||
H A DlstOpen.c46 if (LstValid (l) == FALSE) {
H A DlstLength.c40 if (!LstValid(l)) {
H A DlstFindFrom.c47 if (!LstValid (l) || LstIsEmpty (l) || !LstNodeValid (ln, l)) {
H A DlstDupl.c46 if (!LstValid (l)) {
H A DlstNext.c49 if ((LstValid (l) == FALSE) ||
H A DlstPrev.c59 if ((LstValid (l) == FALSE) ||
H A DlstForEachFrom.c52 if (!LstValid (list) || LstIsEmpty (list)) {
H A DlstInt.h70 #define LstValid(l) (((Lst)l == NILLST) ? FALSE : TRUE) macro
H A DlstRemove.c45 if (!LstValid (l) ||