Lines Matching defs:list
14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
50 * Tell if the current node is at the end of the list.
51 * The sequential functions access the list in a slightly different way.
52 * CurPtr points to their idea of the current node in the list and they
53 * access the list based on it. Because the list is circular, Lst_Next
54 * and Lst_Prev will go around the list forever. Lst_IsAtEnd must be
63 * Return true if have reached the end of the given list.
66 * TRUE if at the end of the list (this includes the list not being
67 * open or being invalid) or FALSE if not. We return TRUE if the list
82 List list = l;
84 return (!LstValid (l) || !list->isOpen ||
85 (list->atEnd == Head) || (list->atEnd == Tail));