Home
last modified time | relevance | path

Searched full:head (Results 1 – 25 of 5202) sorted by relevance

12345678910>>...209

/external/libevent/compat/sys/
Dqueue.h46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
57 * or after an existing element or at the head of the list. A list
60 * A simple queue is headed by a pair of pointers, one the head of the
63 * head of the list. New elements can be added to the list before or after
64 * an existing element, at the head of the list, or at the end of the
67 * A tail queue is headed by a pair of pointers, one to the head of the
71 * after an existing element, at the head of the list, or at the end of
74 * A circle queue is headed by a pair of pointers, one to the head of the
78 * an existing element, at the head of the list, or at the end of the list.
[all …]
/external/openssh/openbsd-compat/
Dsys-queue.h131 * added to the list after an existing element or at the head of the list.
132 * Elements being removed from the head of the list should use the explicit
142 * or after an existing element or at the head of the list. A list
145 * A simple queue is headed by a pair of pointers, one the head of the
148 * head of the list. New elements can be added to the list before or after
149 * an existing element, at the head of the list, or at the end of the
152 * A tail queue is headed by a pair of pointers, one to the head of the
156 * after an existing element, at the head of the list, or at the end of
159 * A circle queue is headed by a pair of pointers, one to the head of the
163 * an existing element, at the head of the list, or at the end of the list.
[all …]
Dsys-tree.h84 #define SPLAY_ROOT(head) (head)->sph_root argument
85 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
88 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
89 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
90 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
91 (head)->sph_root = tmp; \
94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
95 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
96 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
97 (head)->sph_root = tmp; \
[all …]
/external/iperf3/src/
Dqueue.h46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
57 * or after an existing element or at the head of the list. A list
60 * A simple queue is headed by a pair of pointers, one the head of the
63 * head of the list. New elements can be added to the list before or after
64 * an existing element, at the head of the list, or at the end of the
67 * A tail queue is headed by a pair of pointers, one to the head of the
71 * after an existing element, at the head of the list, or at the end of
74 * A circle queue is headed by a pair of pointers, one to the head of the
78 * an existing element, at the head of the list, or at the end of the list.
[all …]
/external/libevent/
Dht-internal.h41 #define HT_EMPTY(head) \ argument
42 ((head)->hth_n_entries == 0)
44 /* How many elements in 'head'? */
45 #define HT_SIZE(head) \ argument
46 ((head)->hth_n_entries)
49 #define HT_MEM_USAGE(head) \ argument
50 (sizeof(*head) + (head)->hth_table_length * sizeof(void*))
52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
53 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
54 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument
[all …]
/external/u-boot/include/linux/
Dlist.h56 * @head: list head to add it after
58 * Insert a new entry after the specified head.
61 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
63 __list_add(new, head, head->next); in list_add()
69 * @head: list head to add it before
71 * Insert a new entry before the specified head.
74 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
76 __list_add(new, head->prev, head); in list_add_tail()
139 * list_move - delete from one list and add as another's head
141 * @head: the head that will precede our entry
[all …]
/external/ipsec-tools/src/include-glibc/sys/
Dqueue.h50 * added to the list after an existing element or at the head of the list.
51 * Elements being removed from the head of the list should use the explicit
58 * head of the list and the other to the tail of the list. The elements are
61 * to the list after an existing element, at the head of the list, or at the
62 * end of the list. Elements being removed from the head of the tail queue
72 * or after an existing element or at the head of the list. A list
75 * A tail queue is headed by a pair of pointers, one to the head of the
79 * after an existing element, at the head of the list, or at the end of
114 #define SLIST_HEAD_INITIALIZER(head) \ argument
125 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
[all …]
/external/blktrace/iowatcher/
Dlist.h88 * @head: list head to add it after
90 * Insert a new entry after the specified head.
94 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
96 __list_add(new, head, head->next); in list_add()
99 extern void list_add(struct list_head *new, struct list_head *head);
106 * @head: list head to add it before
108 * Insert a new entry before the specified head.
111 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
113 __list_add(new, head->prev, head); in list_add_tail()
178 * list_move - delete from one list and add as another's head
[all …]
/external/ltp/testcases/realtime/include/
Dlist.h94 * @head: list head to add it after
96 * Insert a new entry after the specified head.
99 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
101 __list_add(new, head, head->next); in list_add()
107 * @head: list head to add it before
109 * Insert a new entry before the specified head.
112 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
114 __list_add(new, head->prev, head); in list_add_tail()
154 * list_move - delete from one list and add as another's head
156 * @head: the head that will precede our entry
[all …]
/external/libnfnetlink/include/
Dlinux_list.h89 * @head: list head to add it after
91 * Insert a new entry after the specified head.
94 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
96 __list_add(new, head, head->next); in list_add()
102 * @head: list head to add it before
104 * Insert a new entry before the specified head.
107 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
109 __list_add(new, head->prev, head); in list_add_tail()
131 * @head: list head to add it after
133 * Insert a new entry after the specified head.
[all …]
/external/iptables/libiptc/
Dlinux_list.h85 * @head: list head to add it after
87 * Insert a new entry after the specified head.
90 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
92 __list_add(new, head, head->next); in list_add()
98 * @head: list head to add it before
100 * Insert a new entry before the specified head.
103 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
105 __list_add(new, head->prev, head); in list_add_tail()
127 * @head: list head to add it after
129 * Insert a new entry after the specified head.
[all …]
/external/ltp/utils/ffsb-6.0-rc2/
Dcirlist.c27 cl->head = NULL; in init_cirlist()
40 assert(cl->head == NULL); in cl_insert_tail()
41 cl->head = new; in cl_insert_tail()
42 cl->head->next = cl->head; in cl_insert_tail()
43 cl->head->prev = cl->head; in cl_insert_tail()
47 assert(cl->head->next == cl->head); in cl_insert_tail()
48 assert(cl->head->prev == cl->head); in cl_insert_tail()
49 cl->head->next = new; in cl_insert_tail()
50 cl->head->prev = new; in cl_insert_tail()
51 new->next = cl->head; in cl_insert_tail()
[all …]
/external/libnetfilter_conntrack/include/internal/
Dlinux_list.h90 * @head: list head to add it after
92 * Insert a new entry after the specified head.
95 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
97 __list_add(new, head, head->next); in list_add()
103 * @head: list head to add it before
105 * Insert a new entry before the specified head.
108 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
110 __list_add(new, head->prev, head); in list_add_tail()
132 * @head: list head to add it after
134 * Insert a new entry after the specified head.
[all …]
/external/libevent/WIN32-Code/
Dtree.h77 #define SPLAY_ROOT(head) (head)->sph_root argument
78 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
81 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
82 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
83 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
84 (head)->sph_root = tmp; \
87 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
88 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
89 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
90 (head)->sph_root = tmp; \
[all …]
/external/jemalloc/test/unit/
Dql.c15 test_empty_list(list_head_t *head) in test_empty_list() argument
20 assert_ptr_null(ql_first(head), "Unexpected element for empty list"); in test_empty_list()
21 assert_ptr_null(ql_last(head, link), in test_empty_list()
25 ql_foreach(t, head, link) { in test_empty_list()
31 ql_reverse_foreach(t, head, link) { in test_empty_list()
39 list_head_t head; in TEST_BEGIN() local
41 ql_new(&head); in TEST_BEGIN()
42 test_empty_list(&head); in TEST_BEGIN()
58 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) in test_entries_list() argument
63 assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch"); in test_entries_list()
[all …]
/external/jemalloc_new/test/unit/
Dql.c17 test_empty_list(list_head_t *head) { in test_empty_list() argument
21 assert_ptr_null(ql_first(head), "Unexpected element for empty list"); in test_empty_list()
22 assert_ptr_null(ql_last(head, link), in test_empty_list()
26 ql_foreach(t, head, link) { in test_empty_list()
32 ql_reverse_foreach(t, head, link) { in test_empty_list()
39 list_head_t head; in TEST_BEGIN() local
41 ql_new(&head); in TEST_BEGIN()
42 test_empty_list(&head); in TEST_BEGIN()
57 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) { in test_entries_list() argument
61 assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch"); in test_entries_list()
[all …]
/external/curl/tests/unit/
Dunit1300.c58 struct curl_llist_element *head; variable
70 * 2: list head will be NULL
76 fail_unless(llist.head == NULL, "list head should initiate to NULL");
87 * 2: list head will hold the data "unusedData_case1"
88 * 3: list tail will be the same as list head
91 Curl_llist_insert_next(&llist, llist.head, &unusedData_case1, &case1_list);
95 /*test that the list head data holds my unusedData */
96 fail_unless(llist.head->ptr == &unusedData_case1,
97 "head ptr should be first entry");
99 fail_unless(llist.tail == llist.head,
[all …]
/external/libnetfilter_conntrack/src/conntrack/
Dbuild_mnl.c118 switch(ct->head.orig.protonum) { in nfct_build_protoinfo()
123 if (!(test_bit(ATTR_TCP_STATE, ct->head.set) || in nfct_build_protoinfo()
124 test_bit(ATTR_TCP_FLAGS_ORIG, ct->head.set) || in nfct_build_protoinfo()
125 test_bit(ATTR_TCP_FLAGS_REPL, ct->head.set) || in nfct_build_protoinfo()
126 test_bit(ATTR_TCP_MASK_ORIG, ct->head.set) || in nfct_build_protoinfo()
127 test_bit(ATTR_TCP_MASK_REPL, ct->head.set) || in nfct_build_protoinfo()
128 test_bit(ATTR_TCP_WSCALE_ORIG, ct->head.set) || in nfct_build_protoinfo()
129 test_bit(ATTR_TCP_WSCALE_REPL, ct->head.set))) { in nfct_build_protoinfo()
134 if (test_bit(ATTR_TCP_STATE, ct->head.set)) { in nfct_build_protoinfo()
138 if (test_bit(ATTR_TCP_FLAGS_ORIG, ct->head.set) && in nfct_build_protoinfo()
[all …]
Dbuild.c111 switch(ct->head.orig.protonum) { in __build_protoinfo()
116 if (!(test_bit(ATTR_TCP_STATE, ct->head.set) || in __build_protoinfo()
117 test_bit(ATTR_TCP_FLAGS_ORIG, ct->head.set) || in __build_protoinfo()
118 test_bit(ATTR_TCP_FLAGS_REPL, ct->head.set) || in __build_protoinfo()
119 test_bit(ATTR_TCP_MASK_ORIG, ct->head.set) || in __build_protoinfo()
120 test_bit(ATTR_TCP_MASK_REPL, ct->head.set) || in __build_protoinfo()
121 test_bit(ATTR_TCP_WSCALE_ORIG, ct->head.set) || in __build_protoinfo()
122 test_bit(ATTR_TCP_WSCALE_REPL, ct->head.set))) { in __build_protoinfo()
127 if (test_bit(ATTR_TCP_STATE, ct->head.set)) in __build_protoinfo()
132 if (test_bit(ATTR_TCP_FLAGS_ORIG, ct->head.set) && in __build_protoinfo()
[all …]
/external/flatbuffers/lobster/
Dflatbuffers.lobster35 head:int = 0
48 return buf.length - head
52 return head
70 object_end = head
78 object_offset := head
107 head = object_offset
115 buf.write_int32_le(buf.length - object_offset, head - object_offset)
118 vtables.push(head)
122 for(n): buf, head = buf.write_int8_le_back(head, 0)
130 align_size := ((~(head + additional_bytes)) + 1) & (size - 1)
[all …]
/external/adhd/cras/src/common/
Dutlist.h40 * Either way, the pointer to the head of the list must be initialized to NULL.
64 #define LL_PREPEND(head, add) \ argument
66 (add)->next = head; \
67 head = add; \
82 #define LL_APPEND(head, add) \ argument
84 __typeof(head) _tmp; \
86 if (head) { \
87 _tmp = head; \
92 (head) = (add); \
96 #define LL_DELETE(head, del) \ argument
[all …]
/external/libdrm/intel/
Duthash.h119 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \ argument
122 if (head) { \
124 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _hf_bkt); \
125 if (HASH_BLOOM_TEST((head)->hh.tbl, hashval) != 0) { \
126 …HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, …
131 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
135 HASH_FIND_BYHASHVALUE(hh, head, keyptr, keylen, _hf_hashv, out); \
172 #define HASH_MAKE_TABLE(hh,head) \ argument
174 (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \
176 if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \
[all …]
/external/ltp/testcases/kernel/syscalls/epoll2/include/
Ddbllist.h26 #define DBL_LIST_ADDH(new, head) DBL_LIST_ADD(new, head, (head)->pNext) argument
28 #define DBL_LIST_ADDT(new, head) DBL_LIST_ADD(new, (head)->pPrev, head) argument
44 #define DBL_LIST_EMTPY(head) ((head)->pNext == head) argument
46 #define DBL_LIST_SPLICE(list, head) \ argument
51 struct list_head * at = (head)->pNext; \
52 (first)->pPrev = head; \
53 (head)->pNext = first; \
68 #define DBL_LIST_FIRST(head) (((head)->pNext != (head)) ? (head)->pNext: NULL) argument
70 #define DBL_LIST_LAST(head) (((head)->pPrev != (head)) ? (head)->pPrev: NULL) argument
74 #define DBL_LIST_FOR_EACH(pos, head) for (pos = (head)->pNext; pos != (head); pos = (pos)->pNext) argument
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/MC/Sparc/
Dsparc-tls-relocations.s13 ! REL: 0x{{[0-9,A-F]+}} R_SPARC_TLS_LE_HIX22 Head 0x0
14 ! REL: 0x{{[0-9,A-F]+}} R_SPARC_TLS_LE_LOX10 Head 0x0
15 ! REL: 0x{{[0-9,A-F]+}} R_SPARC_TLS_LDO_HIX22 Head 0x0
16 ! REL: 0x{{[0-9,A-F]+}} R_SPARC_TLS_LDM_HI22 Head 0x0
17 ! REL: 0x{{[0-9,A-F]+}} R_SPARC_TLS_LDM_LO10 Head 0x0
18 ! REL: 0x{{[0-9,A-F]+}} R_SPARC_TLS_LDO_LOX10 Head 0x0
24 ! Here we use two different sequences to get the address of a static TLS variable 'Head'
31 ! OBJDUMP: {{[0-9,a-f]+}}: R_SPARC_TLS_LE_HIX22 Head
32 ! ASM: sethi %tle_hix22(Head), %i0 ! encoding: [0x31,0x00,0x00,0x00]
33 ! ASM: ! fixup A - offset: 0, value: %tle_hix22(Head), kind: fixu…
[all …]
/external/blktrace/btt/
Dlist.h68 * @head: list head to add it after
70 * Insert a new entry after the specified head.
73 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
75 __list_add(new, head, head->next); in list_add()
81 * @head: list head to add it before
83 * Insert a new entry before the specified head.
86 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
88 __list_add(new, head->prev, head); in list_add_tail()
120 * @head: the head for your list.
127 #define __list_for_each(pos, head) \ argument
[all …]

12345678910>>...209