Searched defs:list (Results 1 - 25 of 710) sorted by relevance

1234567891011>>

/freebsd-head/usr.bin/chpass/
H A Dtable.c11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
44 ENTRY list[] = { variable
/freebsd-head/contrib/binutils/binutils/
H A Darsup.h21 struct list { struct
23 struct list *next;
32 void ar_replace (struct list *);
34 void ar_delete (struct list *);
42 void ar_directory (char *, struct list *, char *);
44 void ar_addmod (struct list *);
46 void ar_addlib (char *, struct list *);
50 void ar_extract (struct list *);
/freebsd-head/contrib/bmake/lst.lib/
H A DlstClose.c14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
50 * Close a list for sequential access.
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 * Close a list which was opened for sequential access.
66 * l The list t
79 List list = l; local
[all...]
H A DlstIsAtEnd.c14 * 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 (thi
82 List list = l; local
[all...]
H A DlstNext.c14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
50 * Return the next node for a 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 the next node for the given list.
66 * The next node or NULL if the list ha
79 List list = l; local
[all...]
H A DlstDestroy.c14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
50 * Nuke a list and all its resources
58 * Destroy a list and free all its resources. If the freeProc is
66 * The given list is freed in its entirety.
71 Lst_Destroy(Lst list, FreeProc *freeProc) argument
76 if (list == NULL)
80 if (list->lastPtr != NULL)
81 list->lastPtr->nextPtr = NULL;
83 free(list);
[all...]
H A DlstDupl.c14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
50 * Duplicate a list. This includes duplicating the individual
59 * Duplicate an entire list. If a function to copy a void *is
63 * l the list to duplicate
70 * A new list is created.
78 List list = l; local
84 nl = Lst_Init(list->isCirc);
89 ln = list->firstPtr;
99 if (list
[all...]
H A DlstMember.c14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
50 * See if a given datum is on a given list.
58 List list = l; local
61 if (list == NULL) {
64 lNode = list->firstPtr;
74 } while (lNode != NULL && lNode != list->firstPtr);
H A DlstRemove.c14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
50 * Remove an element from a list
58 * Remove the given node from the given list.
64 * The list's firstPtr will be set to NULL if ln is the last
65 * node on the list. firsPtr and lastPtr will be altered if ln is
66 * either the first or last node, respectively, on the list.
73 List list = l; local
82 * unlink it from the list
92 * if either the firstPtr or lastPtr of the list poin
[all...]
H A DlstAppend.c14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
58 * Create a new node and add it to the given list after the given node.
61 * l affected list
71 * list. lastPtr and firstPtr will alter if the list was empty and
79 List list; local
92 list = l;
100 if (list->isCirc) {
105 list
[all...]
/freebsd-head/contrib/byacc/test/
H A Dcalc.y13 %start list
25 list : /* empty */ label
26 | list stat '\n'
27 | list error '\n'
H A Dpure_calc.y19 %start list
31 list : /* empty */ label
32 | list stat '\n'
33 | list error '\n'
H A Dquote_calc.y13 %start list
32 list : /* empty */ label
33 | list stat '\n'
34 | list error '\n'
H A Dquote_calc2.y13 %start list
32 list : /* empty */ label
33 | list stat '\n'
34 | list error '\n'
H A Dquote_calc3.y13 %start list
32 list : /* empty */ label
33 | list stat '\n'
34 | list error '\n'
H A Dquote_calc4.y13 %start list
32 list : /* empty */ label
33 | list stat '\n'
34 | list error '\n'
H A Dcalc2.y20 %start list
32 list : /* empty */ label
33 | list stat '\n'
34 | list error '\n'
H A Dcalc3.y23 %start list
35 list : /* empty */ label
36 | list stat '\n'
37 | list error '\n'
H A Derr_syntax27.y23 %start list
35 list : /* empty */ label
36 | list stat '\n'
37 | list error '\n'
H A Dok_syntax1.y23 %start list
63 list : /* empty */ label
64 | list stat '\n'
65 | list error '\n'
H A Dcode_calc.y17 %start list
29 list : /* empty */ label
30 | list stat '\n'
31 | list error '\n'
/freebsd-head/contrib/gcclibs/libgomp/
H A Derror.c42 gomp_verror (const char *fmt, va_list list) argument
45 vfprintf (stderr, fmt, list);
52 va_list list; local
54 va_start (list, fmt);
55 gomp_verror (fmt, list);
56 va_end (list);
62 va_list list; local
64 va_start (list, fmt);
65 gomp_verror (fmt, list);
66 va_end (list);
[all...]
/freebsd-head/contrib/wpa/src/common/
H A Dcli.h12 #include "utils/list.h"
18 struct dl_list list; member in struct:cli_txt_entry
23 void cli_txt_list_flush(struct dl_list *list);
/freebsd-head/contrib/llvm/tools/lldb/source/Target/
H A DJITLoader.cpp18 void JITLoader::LoadPlugins(Process *process, JITLoaderList &list) { argument
26 list.Append(std::move(instance_sp));
/freebsd-head/sys/dev/isci/scil/
H A Dsci_base_iterator.h36 * notice, this list of conditions and the following disclaimer.
38 * notice, this list of conditions and the following disclaimer in
95 * @brief This object represents an iterator of an abstract list.
101 * This field points to the list iterated by this iterator.
103 SCI_ABSTRACT_LIST_T * list; member in struct:SCI_BASE_ITERATOR
106 * This field points to the list element currently referenced by this
123 SCI_ABSTRACT_LIST_T * list

Completed in 366 milliseconds

1234567891011>>