Home
last modified time | relevance | path

Searched refs:head (Results 1 - 25 of 984) sorted by relevance

12345678910>>...40

/third_party/libcoap/include/coap3/
H A Dcoap_utlist_internal.h40 * Either way, the pointer to the head of the list must be initialized to NULL.
81 * namely, we always reassign our tmp variable to the list head if we need
82 * to dereference its prev/next pointers, and save/restore the real head.*/
314 #define LL_PREPEND(head,add) \
315 LL_PREPEND2(head,add,next)
317 #define LL_PREPEND2(head,add,next) \
319 (add)->next = (head); \
320 (head) = (add); \
338 #define LL_APPEND(head,add) \
339 LL_APPEND2(head,ad
[all...]
H A Dcoap_uthash_internal.h139 #define HASH_ROLLBACK_BKT(hh, head, itemptrhh) \
143 HASH_TO_BKT(_hd_hh_item->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \
144 (head)->hh.tbl->buckets[_hd_bkt].count++; \
154 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \
157 if (head) { \
159 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _hf_bkt); \
160 if (HASH_BLOOM_TEST((head)->hh.tbl, hashval) != 0) { \
161 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, out); \
166 #define HASH_FIND(hh,head,keypt
[all...]
/third_party/libwebsockets/lib/misc/lwsac/
H A Dlwsac.c29 lws_list_ptr_insert(lws_list_ptr *head, lws_list_ptr *add, in lws_list_ptr_insert() argument
32 while (sort_func && *head) { in lws_list_ptr_insert()
33 if (sort_func(add, *head) <= 0) in lws_list_ptr_insert()
36 head = *head; in lws_list_ptr_insert()
39 *add = *head; in lws_list_ptr_insert()
40 *head = add; in lws_list_ptr_insert()
73 lwsac_extend(struct lwsac *head, size_t amount) in lwsac_extend() argument
78 assert(head); in lwsac_extend()
79 lachead = (struct lwsac_head *)&head[ in lwsac_extend()
96 _lwsac_use(struct lwsac **head, size_t ensure, size_t chunk_size, char backfill) _lwsac_use() argument
202 lwsac_use(struct lwsac **head, size_t ensure, size_t chunk_size) lwsac_use() argument
208 lwsac_use_backfill(struct lwsac **head, size_t ensure, size_t chunk_size) lwsac_use_backfill() argument
214 lwsac_scan_extant(struct lwsac *head, uint8_t *find, size_t len, int nul) lwsac_scan_extant() argument
237 lwsac_total_overhead(struct lwsac *head) lwsac_total_overhead() argument
251 lwsac_use_zero(struct lwsac **head, size_t ensure, size_t chunk_size) lwsac_use_zero() argument
262 lwsac_free(struct lwsac **head) lwsac_free() argument
278 lwsac_info(struct lwsac *head) lwsac_info() argument
296 lwsac_total_alloc(struct lwsac *head) lwsac_total_alloc() argument
308 lwsac_reference(struct lwsac *head) lwsac_reference() argument
318 lwsac_unreference(struct lwsac **head) lwsac_unreference() argument
342 lwsac_detach(struct lwsac **head) lwsac_detach() argument
[all...]
/third_party/FreeBSD/sys/sys/
H A 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
54 * head of the list and the other to the tail of the list. The elements are
57 * to the list after an existing element, at the head of the list, or at the
58 * end of the list. Elements being removed from the head of the tail queue
68 * or after an existing element or at the head of the list. A list
71 * A tail queue is headed by a pair of pointers, one to the head of the
75 * after an existing element, at the head of the list, or at the end of
119 /* Store the last 2 places the queue element or head was altered */
132 #define QMD_TRACE_HEAD(head) d
[all...]
H A Dtree.h88 #define SPLAY_ROOT(head) (head)->sph_root
89 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
92 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
93 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
94 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
95 (head)->sph_root = tmp; \
98 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
99 SPLAY_RIGHT((head)
[all...]
/third_party/libwebsockets/lib/core/
H A Dbuflist.c34 lws_buflist_append_segment(struct lws_buflist **head, const uint8_t *buf, in lws_buflist_append_segment() argument
38 int first = !*head; in lws_buflist_append_segment()
39 void *p = *head; in lws_buflist_append_segment()
46 while (*head) { in lws_buflist_append_segment()
51 if (*head == (*head)->next) { in lws_buflist_append_segment()
55 head = &((*head)->next); in lws_buflist_append_segment()
77 *head = nbuf; in lws_buflist_append_segment()
83 lws_buflist_destroy_segment(struct lws_buflist **head) in lws_buflist_destroy_segment() argument
97 lws_buflist_destroy_all_segments(struct lws_buflist **head) lws_buflist_destroy_all_segments() argument
112 lws_buflist_next_segment_len(struct lws_buflist **head, uint8_t **buf) lws_buflist_next_segment_len() argument
139 lws_buflist_use_segment(struct lws_buflist **head, size_t len) lws_buflist_use_segment() argument
162 lws_buflist_total_len(struct lws_buflist **head) lws_buflist_total_len() argument
176 lws_buflist_linear_copy(struct lws_buflist **head, size_t ofs, uint8_t *buf, size_t len) lws_buflist_linear_copy() argument
201 lws_buflist_linear_use(struct lws_buflist **head, uint8_t *buf, size_t len) lws_buflist_linear_use() argument
221 lws_buflist_fragment_use(struct lws_buflist **head, uint8_t *buf, size_t len, char *frag_first, char *frag_fin) lws_buflist_fragment_use() argument
250 lws_buflist_describe(struct lws_buflist **head, void *id, const char *reason) lws_buflist_describe() argument
[all...]
/third_party/ltp/testcases/realtime/include/
H A 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
158 list_move(struct list_head *list, struct list_head *head) list_move() argument
169 list_move_tail(struct list_head *list, struct list_head *head) list_move_tail() argument
180 list_empty(const struct list_head *head) list_empty() argument
197 list_empty_careful(const struct list_head *head) list_empty_careful() argument
203 __list_splice(struct list_head *list, struct list_head *head) __list_splice() argument
222 list_splice(struct list_head *list, struct list_head *head) list_splice() argument
235 list_splice_init(struct list_head *list, struct list_head *head) list_splice_init() argument
[all...]
/third_party/exfatprogs/include/
H A Dlist.h64 * @head: list head to add it after
66 * Insert a new entry after the specified head.
69 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
71 __list_add(new, head, head->next); in list_add()
77 * @head: list head to add it before
79 * Insert a new entry before the specified head.
82 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
128 list_move(struct list_head *list, struct list_head *head) list_move() argument
139 list_move_tail(struct list_head *list, struct list_head *head) list_move_tail() argument
150 list_empty(const struct list_head *head) list_empty() argument
155 __list_splice(struct list_head *list, struct list_head *head) __list_splice() argument
174 list_splice(struct list_head *list, struct list_head *head) list_splice() argument
187 list_splice_init(struct list_head *list, struct list_head *head) list_splice_init() argument
[all...]
/third_party/libdrm/intel/
H A Duthash.h119 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \
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, out); \
131 #define HASH_FIND(hh,head,keyptr,keylen,out) \
135 HASH_FIND_BYHASHVALUE(hh, head, keyptr, keylen, _hf_hashv, out); \
172 #define HASH_MAKE_TABLE(hh,head) \
174 (head)
[all...]
/third_party/alsa-utils/alsactl/
H A Dlist.h73 * @head: list head to add it after
75 * Insert a new entry after the specified head.
78 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
80 __list_add(new, head, head->next); in list_add()
86 * @head: list head to add it before
88 * Insert a new entry before the specified head.
91 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
137 list_move(struct list_head *list, struct list_head *head) list_move() argument
148 list_move_tail(struct list_head *list, struct list_head *head) list_move_tail() argument
159 list_empty(struct list_head *head) list_empty() argument
164 __list_splice(struct list_head *list, struct list_head *head) __list_splice() argument
183 list_splice(struct list_head *list, struct list_head *head) list_splice() argument
196 list_splice_init(struct list_head *list, struct list_head *head) list_splice_init() argument
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Dptrlist.c36 // @head: the head of the list
37 // @return: the size of the list given by @head.
38 int ptr_list_size(struct ptr_list *head) in ptr_list_size() argument
42 if (head) { in ptr_list_size()
43 struct ptr_list *list = head; in ptr_list_size()
46 } while ((list = list->next) != head); in ptr_list_size()
53 // @head: the head of the list
55 bool ptr_list_empty(const struct ptr_list *head) in ptr_list_empty() argument
74 ptr_list_multiple(const struct ptr_list *head) ptr_list_multiple() argument
95 first_ptr_list(struct ptr_list *head) first_ptr_list() argument
114 last_ptr_list(struct ptr_list *head) last_ptr_list() argument
135 struct ptr_list *head = list; ptr_list_nth_entry() local
165 linearize_ptr_list(struct ptr_list *head, void **arr, int max) linearize_ptr_list() argument
197 struct ptr_list *head = *listp; pack_ptr_list() local
235 split_ptr_list_head(struct ptr_list *head) split_ptr_list_head() argument
314 lookup_ptr_list_entry(const struct ptr_list *head, const void *entry) lookup_ptr_list_entry() argument
381 undo_ptr_list_last(struct ptr_list **head) undo_ptr_list_last() argument
405 delete_ptr_list_last(struct ptr_list **head) delete_ptr_list_last() argument
444 struct ptr_list *head, *tail; copy_ptr_list() local
[all...]
H A Dptrlist.h14 #define CHECK_TYPE(head,ptr) (void)(&(ptr) == &(head)->list[0])
15 #define PTRLIST_TYPE(head) __typeof__((head)->list[0])
16 #define VRFY_PTR_LIST(head) (void)(sizeof((head)->list[0]))
32 void * undo_ptr_list_last(struct ptr_list **head);
33 void * delete_ptr_list_last(struct ptr_list **head);
36 bool lookup_ptr_list_entry(const struct ptr_list *head, const void *entry);
42 extern bool ptr_list_empty(const struct ptr_list *head);
[all...]
/third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/
H A Dlist.h68 list_empty(const struct list_head *head) in list_empty() argument
71 return (head->next == head); in list_empty()
75 list_empty_careful(const struct list_head *head) in list_empty_careful() argument
77 struct list_head *next = head->next; in list_empty_careful()
79 return ((next == head) && (next == head->prev)); in list_empty_careful()
158 #define list_for_each(p, head) \
159 for (p = (head)->next; p != (head);
206 list_add(struct list_head *new, struct list_head *head) list_add() argument
213 list_add_tail(struct list_head *new, struct list_head *head) list_add_tail() argument
220 list_move(struct list_head *list, struct list_head *head) list_move() argument
228 list_move_tail(struct list_head *entry, struct list_head *head) list_move_tail() argument
236 list_rotate_to_front(struct list_head *entry, struct list_head *head) list_rotate_to_front() argument
243 list_bulk_move_tail(struct list_head *head, struct list_head *first, struct list_head *last) list_bulk_move_tail() argument
272 list_splice(const struct list_head *list, struct list_head *head) list_splice() argument
279 list_splice_tail(struct list_head *list, struct list_head *head) list_splice_tail() argument
286 list_splice_init(struct list_head *list, struct list_head *head) list_splice_init() argument
294 list_splice_tail_init(struct list_head *list, struct list_head *head) list_splice_tail_init() argument
393 list_is_singular(const struct list_head *head) list_is_singular() argument
398 __list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) __list_cut_position() argument
410 list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) list_cut_position() argument
424 list_is_first(const struct list_head *list, const struct list_head *head) list_is_first() argument
431 list_is_last(const struct list_head *list, const struct list_head *head) list_is_last() argument
[all...]
/third_party/libuv/include/uv/
H A Dtree.h84 #define SPLAY_ROOT(head) (head)->sph_root
85 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
88 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
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 { \
95 SPLAY_RIGHT((head)
[all...]
/third_party/node/deps/uv/include/uv/
H A Dtree.h84 #define SPLAY_ROOT(head) (head)->sph_root
85 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
88 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
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 { \
95 SPLAY_RIGHT((head)
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_ring.cc64 // Unrefs the entries in `[head, tail)`.
66 void UnrefEntries(const CordRepRing* rep, index_type head, index_type tail) { in UnrefEntries() argument
67 rep->ForEach(head, tail, [rep](index_type ix) { in UnrefEntries()
86 << ", head = " << rep.head_ << ", tail = " << rep.tail_ in operator <<()
89 CordRepRing::index_type head = rep.head(); in operator <<() local
91 CordRep* child = rep.entry_child(head); in operator <<()
92 s << " entry[" << head << "] length = " << rep.entry_length(head) in operator <<()
96 << ", offset = " << rep.entry_data_offset(head) in operator <<()
116 index_type head() const { return head_; } head() function in absl::cord_internal::CordRepRing::Filler
155 index_type head = head_; IsValid() local
168 output << "entry[" << head << "].child == nullptr"; IsValid() local
249 Fill(const CordRepRing* src, index_type head, index_type tail) Fill() argument
268 Copy(CordRepRing* rep, index_type head, index_type tail, size_t extra) Copy() argument
374 Position head = ring->Find(offset); AddRing() local
483 index_type head = rep->retreat(rep->head_); PrependLeaf() local
584 FindBinary(index_type head, index_type tail, size_t offset) const FindBinary() argument
601 FindSlow(index_type head, size_t offset) const FindSlow() argument
630 FindTailSlow(index_type head, size_t offset) const FindTailSlow() argument
717 Position head = rep->Find(len); RemovePrefix() local
[all...]
/third_party/curl/tests/unit/
H A Dunit1300.c59 struct Curl_llist_element *head; variable
71 * 2: list head will be NULL
77 fail_unless(llist.head == NULL, "list head should initiate to NULL");
88 * 2: list head will hold the data "unusedData_case1"
89 * 3: list tail will be the same as list head
92 Curl_llist_insert_next(&llist, llist.head, &unusedData_case1, &case1_list);
96 /* test that the list head data holds my unusedData */
97 fail_unless(llist.head->ptr == &unusedData_case1,
98 "head pt
[all...]
/third_party/node/lib/internal/streams/
H A Dbuffer_list.js15 this.head = null;
25 this.head = entry;
31 const entry = { data: v, next: this.head };
34 this.head = entry;
41 const ret = this.head.data;
43 this.head = this.tail = null;
45 this.head = this.head.next;
51 this.head = this.tail = null;
58 let p = this.head;
[all...]
/third_party/toybox/toys/pending/
H A Dtcpsvd.c66 struct list *head; member
125 struct list_pid *prev, *free_node, *head = *pids; in delete() local
128 if (!head) return NULL; in delete()
130 while (head) { in delete()
131 if (head->pid == pid) { in delete()
132 ip = head->ip; in delete()
133 free_node = head; in delete()
134 if (!prev) *pids = head->next; in delete()
135 else prev->next = head->next; in delete()
139 prev = head; in delete()
148 struct list *head, *prev = NULL, *free_node = NULL; remove_connection() local
270 struct list *head, *newnode; tcpsvd_main() local
[all...]
/third_party/musl/src/stdlib/
H A Dqsort.c92 static void sift(unsigned char *head, size_t width, cmpfun cmp, void *arg, int pshift, size_t lp[]) in sift() argument
98 ar[0] = head; in sift()
100 rt = head - width; in sift()
101 lf = head - width - lp[pshift - 2]; in sift()
108 head = lf; in sift()
112 head = rt; in sift()
119 static void trinkle(unsigned char *head, size_t width, cmpfun cmp, void *arg, size_t pp[2], int pshift, int trusty, size_t lp[]) in trinkle() argument
131 ar[0] = head; in trinkle()
133 stepson = head - lp[pshift]; in trinkle()
138 rt = head in trinkle()
162 unsigned char *head, *high; __qsort_r() local
[all...]
/third_party/node/deps/v8/tools/
H A Dprofile_view.js49 var head;
56 if (viewParent === head) {
62 var viewNode = createViewNode(node.label, totalWeight, selfWeight, head);
66 head = viewNode;
70 var view = this.createView(head);
78 * @param {ProfileView.Node} head View head node.
81 ViewBuilder.prototype.createView = function(head) {
82 return new ProfileView(head);
95 * @param {ProfileView.Node} head Profil
[all...]
/third_party/ntfs-3g/ntfsprogs/
H A Dlist.h71 * @head: list head to add it after
73 * Insert a new entry after the specified head.
77 struct ntfs_list_head *head) in ntfs_list_add()
79 __ntfs_list_add(new, head, head->next); in ntfs_list_add()
85 * @head: list head to add it before
87 * Insert a new entry before the specified head.
91 struct ntfs_list_head *head) in ntfs_list_add_tail()
76 ntfs_list_add(struct ntfs_list_head *new, struct ntfs_list_head *head) ntfs_list_add() argument
90 ntfs_list_add_tail(struct ntfs_list_head *new, struct ntfs_list_head *head) ntfs_list_add_tail() argument
139 ntfs_list_empty(struct ntfs_list_head *head) ntfs_list_empty() argument
149 ntfs_list_splice(struct ntfs_list_head *list, struct ntfs_list_head *head) ntfs_list_splice() argument
[all...]
/third_party/selinux/checkpolicy/
H A Dqueue.c21 q->head = q->tail = NULL; in queue_create()
40 if (q->head == NULL) { in queue_insert()
41 q->head = q->tail = newnode; in queue_insert()
64 if (q->head == NULL) { in queue_push()
65 q->head = q->tail = newnode; in queue_push()
67 newnode->next = q->head; in queue_push()
68 q->head = newnode; in queue_push()
82 if (q->head == NULL) in queue_remove()
85 node = q->head; in queue_remove()
86 q->head in queue_remove()
[all...]
/third_party/libwebsockets/lib/misc/
H A Dlws-ring.c38 ring->head = 0; in lws_ring_create()
56 while (ring->oldest_tail != ring->head) { in lws_ring_destroy()
83 if (ring->head == ring->oldest_tail) in lws_ring_get_count_free_elements()
86 if (ring->head < ring->oldest_tail) in lws_ring_get_count_free_elements()
87 f = (int)((ring->oldest_tail - ring->head) - in lws_ring_get_count_free_elements()
90 f = (int)((ring->buflen - ring->head) + ring->oldest_tail - in lws_ring_get_count_free_elements()
114 if (ring->head == *tail) in lws_ring_get_count_waiting_elements()
117 if (ring->head > *tail) in lws_ring_get_count_waiting_elements()
118 f = (int)(ring->head - *tail); in lws_ring_get_count_waiting_elements()
120 f = (int)((ring->buflen - *tail) + ring->head); in lws_ring_get_count_waiting_elements()
[all...]
/third_party/eudev/src/shared/
H A Dlist.h24 /* The head of the linked list. Use this in the structure that shall
25 * contain the head of the linked list */
33 /* Initialize the list's head */
34 #define LIST_HEAD_INIT(head) \
36 (head) = NULL; } \
48 #define LIST_PREPEND(name,head,item) \
50 typeof(*(head)) **_head = &(head), *_item = (item); \
59 #define LIST_REMOVE(name,head,item) \
61 typeof(*(head)) **_hea
[all...]

Completed in 12 milliseconds

12345678910>>...40