Home
last modified time | relevance | path

Searched full:list (Results 1 – 25 of 8453) sorted by relevance

12345678910>>...339

/freebsd/contrib/bmake/unit-tests/
H A Dvarmod-select-words.mk14 LIST= one two three four five six
35 @echo 'LIST:[]="${LIST:[]}" is an error'
36 @echo 'LIST:[0]="${LIST:[0]}"'
37 @echo 'LIST:[0x0]="${LIST:[0x0]}"'
38 @echo 'LIST:[000]="${LIST:[000]}"'
39 @echo 'LIST:[*]="${LIST:[*]}"'
40 @echo 'LIST:[@]="${LIST:[@]}"'
41 @echo 'LIST:[0]:C/ /,/="${LIST:[0]:C/ /,/}"'
42 @echo 'LIST:[0]:C/ /,/g="${LIST:[0]:C/ /,/g}"'
43 @echo 'LIST:[0]:C/ /,/1g="${LIST:[0]:C/ /,/1g}"'
[all …]
H A Dvarmod-select-words.exp1 make: in target "mod-squarebrackets-0-star-at": while evaluating variable "LIST" with value "one tw…
2 LIST:[]="" is an error
3 LIST:[0]="one two three four five six"
4 LIST:[0x0]="one two three four five six"
5 LIST:[000]="one two three four five six"
6 LIST:[*]="one two three four five six"
7 LIST:[@]="one two three four five six"
8 LIST:[0]:C/ /,/="one,two three four five six"
9 LIST:[0]:C/ /,/g="one,two,three,four,five,six"
10 LIST:[0]:C/ /,/1g="one,two,three,four,five,six"
[all …]
/freebsd/sys/dev/ocs_fc/
H A Docs_list.h9 * this list of conditions and the following disclaimer.
12 * this list of conditions and the following disclaimer in the documentation
35 * OCS linked list API
49 #define ocs_list_set_list_magic list->magic = OCS_LIST_LIST_MAGIC
50 #define ocs_list_set_link_magic list->magic = OCS_LIST_LINK_MAGIC
64 * @brief list/link structure
66 * used for both the list object, and the link object(s). offset
67 * is specified when the list is initialized; this implies that a list
76 ocs_list_t *next; /*<< pointer to head of list (or next if link) */
77 ocs_list_t *prev; /*<< pointer to tail of list (or previous if link) */
[all …]
/freebsd/contrib/ofed/opensm/include/complib/
H A Dcl_qlist.h17 * copyright notice, this list of conditions and the following
21 * copyright notice, this list of conditions and the following
38 * Declaration of quick list.
55 /****h* Component Library/Quick List
57 * Quick List
60 * Quick list implements a doubly linked that stores user provided
62 * Quick list does not allocate any memory, and can therefore not fail any
63 * operations. Quick list can therefore be useful in minimizing the error
66 * Quick list is not thread safe, and users must provide serialization when
67 * adding and removing items from the list. Note that it is possible to
[all …]
H A Dcl_list.h17 * copyright notice, this list of conditions and the following
21 * copyright notice, this list of conditions and the following
38 * Declaration of list.
56 /****h* Component Library/List
58 * List
61 * List stores objects in a doubly linked list.
63 * Unlike quick list, users pass pointers to the object being stored, rather
64 * than to a cl_list_item_t structure. Insertion operations on a list can
67 * Use quick list in situations where insertion failures cannot be tolerated.
69 * List is not thread safe, and users must provide serialization.
[all …]
/freebsd/usr.sbin/ppp/
H A Diplist.c11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
56 iplist_first(struct iplist *list) in iplist_first() argument
58 list->cur.pos = -1; in iplist_first()
62 iplist_setrange(struct iplist *list, char *range) in iplist_setrange() argument
67 if (!inet_aton(range, &list->cur.ip)) in iplist_setrange()
69 list->cur.lstart = ntohl(list->cur.ip.s_addr); in iplist_setrange()
70 list->cur.nItems = 1; in iplist_setrange()
72 if (!do_inet_aton(range, ptr, &list->cur.ip)) in iplist_setrange()
75 list->cur.lstart = ntohl(list->cur.ip.s_addr); in iplist_setrange()
[all …]
/freebsd/sys/kern/
H A Dsubr_eventhandler.c11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
41 /* List of all eventhandler lists */
55 * Initialize the eventhandler mutex and list.
70 struct eventhandler_list *list, *new_list; in eventhandler_find_or_create_list() local
72 /* look for a matching, existing list */ in eventhandler_find_or_create_list()
73 list = _eventhandler_find_list(name); in eventhandler_find_or_create_list()
75 /* Do we need to create the list? */ in eventhandler_find_or_create_list()
76 if (list == NULL) { in eventhandler_find_or_create_list()
84 list = _eventhandler_find_list(name); in eventhandler_find_or_create_list()
[all …]
/freebsd/sys/contrib/openzfs/lib/libspl/
H A Dlist.c27 * Generic doubly-linked list implementation
30 #include <sys/list.h>
40 #define list_insert_after_node(list, node, object) { \ argument
41 list_node_t *lnew = list_d2l(list, object); \
48 #define list_insert_before_node(list, node, object) { \ argument
49 list_node_t *lnew = list_d2l(list, object); \
62 list_create(list_t *list, size_t size, size_t offset) in list_create() argument
64 ASSERT(list); in list_create()
70 list->list_offset = offset; in list_create()
71 list->list_head.next = list->list_head.prev = &list->list_head; in list_create()
[all …]
/freebsd/sys/contrib/openzfs/module/os/freebsd/spl/
H A Dlist.c27 * Generic doubly-linked list implementation
31 #include <sys/list.h>
40 #define list_insert_after_node(list, node, object) { \ argument
41 list_node_t *lnew = list_d2l(list, object); \
48 #define list_insert_before_node(list, node, object) { \ argument
49 list_node_t *lnew = list_d2l(list, object); \
62 list_create(list_t *list, size_t size, size_t offset) in list_create() argument
64 ASSERT3P(list, !=, NULL); in list_create()
69 list->list_offset = offset; in list_create()
70 list->list_head.list_next = list->list_head.list_prev = in list_create()
[all …]
/freebsd/share/man/man9/
H A Dsglist.910 .\" notice, this list of conditions and the following disclaimer.
12 .\" notice, this list of conditions and the following disclaimer in the
57 .Nd manage a scatter/gather list of physical memory addresses
115 Each list contains one or more elements.
118 If one wishes to alter an existing scatter/gather list and does not hold the
119 sole reference to the list,
120 then one should create a new list instead of modifying the existing list.
122 Each scatter/gather list object contains a reference count.
132 scatter/gather list elements.
135 function allocates a new list that contains a header and
[all …]
/freebsd/sys/contrib/openzfs/include/os/linux/spl/sys/
H A Dlist.h29 #include <linux/list.h>
32 * NOTE: I have implemented the Solaris list API in terms of the native
34 * list debugging infrastructure, but it also means that the internals of a
35 * list differ slightly than on Solaris. This is not a problem as long as
41 * 2) A list_node_t which is not attached to a list on Solaris is denoted
50 typedef struct list { struct
59 list_is_empty(list_t *list) in list_is_empty() argument
61 return (list_empty(&list->list_head)); in list_is_empty()
72 list_create(list_t *list, size_t size, size_t offset) in list_create() argument
76 list->list_offset = offset; in list_create()
[all …]
/freebsd/sys/dev/isci/scil/
H A Dsci_simple_list.h36 * notice, this list of conditions and the following disclaimer.
38 * notice, this list of conditions and the following disclaimer in
60 * @brief This header file contains simple linked list manipulation macros.
62 * an element from the list is O(n).
67 * 2) it is possible to detach the entire list from its anchor
71 * random locations within the list use instead the SCI_FAST_LIST.
82 * Initialize the singely linked list anchor. The other macros require the
83 * list anchor to be properly initialized.
93 * Initialze the singely linked list element. The other macros require the
94 * list element to be properly initialized.
[all …]
/freebsd/tools/tools/drm/radeon/mkregtable/
H A Dmkregtable.c2 * this includes inlined list.h safe for userspace.
32 * Simple doubly linked list implementation.
50 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
52 list->next = list; in INIT_LIST_HEAD()
53 list->prev = list; in INIT_LIST_HEAD()
59 * This is only for internal list manipulation where we know
79 * @head: list head to add it after
92 * @head: list head to add it before
103 * Delete a list entry by making the prev/next entries
106 * This is only for internal list manipulation where we know
[all …]
/freebsd/contrib/ntp/libntp/lib/isc/include/isc/
H A Dlist.h32 #define ISC_LIST_INIT(list) \ argument
33 do { (list).head = NULL; (list).tail = NULL; } while (0)
45 #define ISC_LIST_HEAD(list) ((list).head) argument
46 #define ISC_LIST_TAIL(list) ((list).tail) argument
47 #define ISC_LIST_EMPTY(list) ISC_TF((list).head == NULL) argument
49 #define __ISC_LIST_PREPENDUNSAFE(list, elt, link) \ argument
51 if ((list).head != NULL) \
52 (list).head->link.prev = (elt); \
54 (list).tail = (elt); \
56 (elt)->link.next = (list).head; \
[all …]
/freebsd/contrib/elftoolchain/ar/
H A Dacpyacc.y10 * notice, this list of conditions and the following disclaimer
13 * notice, this list of conditions and the following disclaimer in the
52 struct list { struct
54 struct list *next; argument
62 static void arscp_addlib(char *archive, struct list *list);
63 static void arscp_addmod(struct list *list);
66 static void arscp_delete(struct list *list);
67 static void arscp_dir(char *archive, struct list *list, char *rlt);
69 static void arscp_extract(struct list *list);
71 static void arscp_free_mlist(struct list *list);
[all …]
/freebsd/contrib/bmake/
H A Dlst.c14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
52 Lst_Done(List *list) in Lst_Done() argument
56 for (ln = list->first; ln != NULL; ln = next) { in Lst_Done()
63 Lst_DoneFree(List *list) in Lst_DoneCall() argument
67 for (ln = list->first; ln != NULL; ln = next) { in Lst_DoneCall()
76 Lst_InsertBefore(List *list, ListNod argument
94 Lst_Prepend(List * list,void * datum) Lst_Prepend() argument
113 Lst_Append(List * list,void * datum) Lst_Append() argument
135 Lst_Remove(List * list,ListNode * ln) Lst_Remove() argument
177 Lst_FindDatum(List * list,const void * datum) Lst_FindDatum() argument
234 Lst_Dequeue(List * list) Lst_Dequeue() argument
[all...]
H A Dlst.h14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
49 * notice, this list of conditions and the following disclaimer.
51 * notice, this list of conditions and the following disclaimer in the
90 /* A doubly-linked list of pointers. */
91 typedef struct List List; typedef
92 /* A single node in the doubly-linked list. */
96 ListNode *prev; /* previous node in list, or NULL */
97 ListNode *next; /* next node in list, o
101 struct List { global() struct
102 firstList global() argument
103 lastList global() argument
118 Lst_Init(List * list) Lst_Init() argument
127 Lst_IsEmpty(List * list) Lst_IsEmpty() argument
160 Lst_Enqueue(List * list,void * datum) Lst_Enqueue() argument
[all...]
/freebsd/usr.bin/ar/
H A Dacpyacc.y12 * notice, this list of conditions and the following disclaimer.
14 * notice, this list of conditions and the following disclaimer in the
49 struct list { struct
51 struct list *next; argument
58 static void arscp_addlib(char *archive, struct list *list);
59 static void arscp_addmod(struct list *list);
63 static void arscp_delete(struct list *list);
64 static void arscp_dir(char *archive, struct list *list, char *rlt);
66 static void arscp_extract(struct list *list);
68 static void arscp_free_mlist(struct list *list);
[all …]
/freebsd/sys/cam/ctl/
H A Dctl_tpc.c11 * notice, this list of conditions and the following disclaimer,
14 * notice, this list of conditions and the following disclaimer in the
90 struct tpc_list *list; member
161 struct tpc_list *list, *tlist; in tpc_timeout() local
166 TAILQ_FOREACH_SAFE(list, &lun->tpc_lists, links, tlist) { in tpc_timeout()
167 if (!list->completed || time_uptime < list->last_active + in tpc_timeout()
170 TAILQ_REMOVE(&lun->tpc_lists, list, links); in tpc_timeout()
171 free(list, M_CTL); in tpc_timeout()
229 struct tpc_list *list, *tlist; in ctl_tpc_lun_clear() local
231 TAILQ_FOREACH_SAFE(list, &lun->tpc_lists, links, tlist) { in ctl_tpc_lun_clear()
[all …]
/freebsd/contrib/dialog/
H A Dfselect.c82 } LIST; typedef
90 init_list(LIST * list, WINDOW *par, WINDOW *win, int mousex) in init_list() argument
92 list->par = par; in init_list()
93 list->win = win; in init_list()
94 list->length = 0; in init_list()
95 list->offset = 0; in init_list()
96 list->choice = 0; in init_list()
97 list->mousex = mousex; in init_list()
98 list->allocd = 0; in init_list()
99 list->data = 0; in init_list()
[all …]
/freebsd/contrib/wpa/src/utils/
H A Dlist.h2 * Doubly-linked list
13 * struct dl_list - Doubly-linked list
22 static inline void dl_list_init(struct dl_list *list) in dl_list_init() argument
24 list->next = list; in dl_list_init()
25 list->prev = list; in dl_list_init()
28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) in dl_list_add() argument
30 item->next = list->next; in dl_list_add()
31 item->prev = list; in dl_list_add()
32 list->next->prev = item; in dl_list_add()
33 list->next = item; in dl_list_add()
[all …]
/freebsd/contrib/netbsd-tests/ipf/expected/
H A Df1117 List of active MAP/Redirect filters:
19 List of active sessions:
22 List of active state sessions:
23 List of configured pools
24 List of configured hash tables
25 List of groups configured (set 0)
26 List of groups configured (set 1)
53 List of active MAP/Redirect filters:
55 List of active sessions:
58 List of active state sessions:
[all …]
/freebsd/contrib/libucl/uthash/
H A Dutlist.h9 notice, this list of conditions and the following disclaimer.
40 * Either way, the pointer to the head of the list must be initialized to NULL.
48 * struct item *list = NULL:
53 * DL_APPEND(list, item);
81 * namely, we always reassign our tmp variable to the list head if we need
84 #define _SV(elt,list) _tmp = (char*)(list); {char **_alias = (char**)&(list); *_alias = (elt); } argument
85 #define _NEXT(elt,list,next) ((char*)((list)->next)) argument
86 #define _NEXTASGN(elt,list,to,next) { char **_alias = (char**)&((list)->next); *_alias=(char*)(to);… argument
87 /* #define _PREV(elt,list,prev) ((char*)((list)->prev)) */
88 #define _PREVASGN(elt,list,to,prev) { char **_alias = (char**)&((list)->prev); *_alias=(char*)(to);… argument
[all …]
/freebsd/crypto/openssl/doc/man3/
H A DSSL_CTX_set0_CA_list.pod18 - get or set CA list
24 void SSL_CTX_set_client_CA_list(SSL_CTX *ctx, STACK_OF(X509_NAME) *list);
25 void SSL_set_client_CA_list(SSL *s, STACK_OF(X509_NAME) *list);
42 The functions described here set and manage the list of CA names that are sent
45 For TLS versions 1.2 and earlier the list of CA names is only sent from the
46 server to the client when requesting a client certificate. So any list of CA
47 names set is never sent from client to server and the list of CA names retrieved
50 For TLS 1.3 the list of CA names is sent using the B<certificate_authorities>
54 In most cases it is not necessary to set CA names on the client side. The list
57 if the list is large. This optional capability was introduced as part of TLSv1.3
[all …]
/freebsd/sys/dev/qat/qat_api/common/ctrl/
H A Dsal_list.c9 * List implementations for SAL
17 SalList_add(sal_list_t **list, sal_list_t **tail, void *pObj) in SalList_add() argument
21 if (NULL == *list) { in SalList_add()
22 /* First element in list */ in SalList_add()
23 *list = malloc(sizeof(sal_list_t), M_QAT, M_WAITOK); in SalList_add()
24 (*list)->next = NULL; in SalList_add()
25 (*list)->pObj = pObj; in SalList_add()
26 *tail = *list; in SalList_add()
28 /* add to tail of the list */ in SalList_add()
42 SalList_getObject(sal_list_t *list) in SalList_getObject() argument
[all …]

12345678910>>...339