| /external/ltp/tools/pounder21/ |
| proclist.c | 29 if (list->head == NULL) {
31 list->head = item;
35 curr = list->head;
48 if (list->head == NULL) {
52 if (list->head == item) {
53 list->head = item->next;
58 prev = list->head;
59 curr = list->head->next;
|
| /frameworks/av/media/libstagefright/codec2/vndk/include/util/ |
| _C2MacroUtils.h | 80 #define _C2_MAP_64(fn, arg, head, ...) fn(head, arg), _C2_MAP_63(fn, arg, ##__VA_ARGS__)
81 #define _C2_MAP_63(fn, arg, head, ...) fn(head, arg), _C2_MAP_62(fn, arg, ##__VA_ARGS__)
82 #define _C2_MAP_62(fn, arg, head, ...) fn(head, arg), _C2_MAP_61(fn, arg, ##__VA_ARGS__)
83 #define _C2_MAP_61(fn, arg, head, ...) fn(head, arg), _C2_MAP_60(fn, arg, ##__VA_ARGS__)
84 #define _C2_MAP_60(fn, arg, head, ...) fn(head, arg), _C2_MAP_59(fn, arg, ##__VA_ARGS__
[all...] |
| /external/dhcpcd-6.8.2/compat/ |
| queue.h | 41 #define TAILQ_END(head) (NULL)
52 #define TAILQ_HEAD_INITIALIZER(head) \
53 { TAILQ_END(head), &(head).tqh_first }
67 #define TAILQ_FIRST(head) ((head)->tqh_first)
69 #define TAILQ_LAST(head, headname) \
70 (*(((struct headname *)((head)->tqh_last))->tqh_last))
73 #define TAILQ_EMPTY(head) (TAILQ_FIRST(head) == TAILQ_END(head)
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| kernel-list.h | 45 * Insert a new entry after the specified head..
47 static __inline__ void list_add(struct list_head *new, struct list_head *head)
49 __list_add(new, head, head->next);
55 static __inline__ void list_add_tail(struct list_head *new, struct list_head *head)
57 __list_add(new, head->prev, head);
79 static __inline__ int list_empty(struct list_head *head)
81 return head->next == head;
[all...] |
| /external/flatbuffers/python/flatbuffers/ |
| encode.py | 20 def Get(packer_type, buf, head):
21 """ Get decodes a value at buf[head:] using `packer_type`. """
22 return packer_type.unpack_from(memoryview_type(buf), head)[0]
25 def Write(packer_type, buf, head, n):
26 """ Write encodes `n` at buf[head:] using `packer_type`. """
27 packer_type.pack_into(buf, head, n)
|
| /external/f2fs-tools/include/ |
| list.h | 38 static inline void list_add(struct list_head *new, struct list_head *head)
40 __list_add(new, head, head->next);
43 static inline void list_add_tail(struct list_head *new, struct list_head *head)
45 __list_add(new, head->prev, head);
66 static inline int list_empty(const struct list_head *head)
68 return head->next == head;
74 #define list_for_each(pos, head) \
[all...] |
| /external/openssh/openbsd-compat/ |
| sys-queue.h | 131 * 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...] |
| /external/ipsec-tools/src/racoon/ |
| genlist.h | 51 /* This function returns an initialized list head. */
55 struct genlist_entry *genlist_insert (struct genlist *head, void *data);
56 struct genlist_entry *genlist_append (struct genlist *head, void *data);
67 void *genlist_foreach (struct genlist *head, genlist_func_t func, void *arg);
69 /* Get first entry in list if head is not NULL, otherwise get next
72 void *genlist_next (struct genlist *head, struct genlist_entry **buf);
78 /* Free all storage associated with list at head using func to free any
80 void genlist_free (struct genlist *head, genlist_freedata_t func);
|
| /external/iptables/libiptc/ |
| linux_list.h | 85 * @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)
92 __list_add(new, head, head->next);
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)
[all...] |
| /external/libnetfilter_conntrack/include/internal/ |
| linux_list.h | 90 * @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)
97 __list_add(new, head, head->next);
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)
[all...] |
| /external/libnfnetlink/include/ |
| linux_list.h | 89 * @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)
96 __list_add(new, head, head->next);
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)
[all...] |
| /external/jemalloc/test/unit/ |
| ql.c | 15 test_empty_list(list_head_t *head)
20 assert_ptr_null(ql_first(head), "Unexpected element for empty list");
21 assert_ptr_null(ql_last(head, link),
25 ql_foreach(t, head, link) {
31 ql_reverse_foreach(t, head, link) {
39 list_head_t head; local
41 ql_new(&head);
42 test_empty_list(&head);
58 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries)
63 assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch")
96 list_head_t head; local
111 list_head_t head; local
130 list_head_t head; local
145 list_head_t head; local
164 list_head_t head; local
[all...] |
| /external/c-ares/ |
| ares_llist.c | 23 * dummy head.
26 /* Initialize a new head node */
27 void ares__init_list_head(struct list_node* head) {
28 head->prev = head;
29 head->next = head;
30 head->data = NULL;
41 int ares__is_list_empty(struct list_node* head) {
42 return ((head->next == head) && (head->prev == head))
[all...] |
| /external/libcxxabi/src/ |
| cxa_thread_atexit.cpp | 72 while (auto head = dtors) {
73 dtors = head->next;
74 head->dtor(head->obj);
75 std::free(head);
124 auto head = static_cast<DtorList*>(std::malloc(sizeof(DtorList)));
125 if (!head) {
129 head->dtor = dtor;
130 head->obj = obj;
131 head->next = dtors
[all...] |
| /external/fio/ |
| flist.h | 59 * @head: list head to add it after
61 * Insert a new entry after the specified head.
65 struct flist_head *head)
67 __flist_add(new_entry, head, head->next);
71 struct flist_head *head)
73 __flist_add(new_entry, head->prev, head);
115 * @head: the list to test
[all...] |
| /external/syslinux/com32/lib/syslinux/ |
| setup_data.c | 17 int setup_data_add(struct setup_data *head, uint32_t type,
29 setup_data->prev = head->prev;
30 setup_data->next = head;
31 head->prev->next = setup_data;
32 head->prev = setup_data;
37 int setup_data_load(struct setup_data *head, uint32_t type,
46 return setup_data_add(head, type, data, len);
|
| /external/ltp/utils/ffsb-6.0-rc2/ |
| list.h | 17 void list_add(struct list_head *new, struct list_head *head);
18 void list_add_tail(struct list_head *new, struct list_head *head);
26 #define list_for_each(pos, head) \
27 for (pos = (head)->next; pos->next, pos != (head); pos = pos->next)
38 #define list_for_each_entry(pos, head, member) \
39 for (pos = list_entry((head)->next, typeof(*pos), member); \
40 pos->member.next, &pos->member != (head); \
43 #define list_for_each_entry_safe(pos, n, head, member) \
44 for (pos = list_entry((head)->next, typeof(*pos), member),
[all...] |
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/decoder/ |
| UnboundedFifoByteBuffer.java | 58 protected int head; field in class:UnboundedFifoByteBuffer
85 head = 0;
97 if (tail < head) {
98 size = buffer.length - head + tail;
100 size = tail - head;
127 for (int i = head; i != tail;) {
139 head = 0;
162 return buffer[head];
176 byte element = buffer[head];
178 head++
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| list.h | 53 * @head: list head to add it after
55 * Insert a new entry after the specified head.
58 _INLINE_ void list_add(struct list_head *add, struct list_head *head)
60 __list_add(add, head, head->next);
66 * @head: list head to add it before
68 * Insert a new entry before the specified head.
71 _INLINE_ void list_add_tail(struct list_head *add, struct list_head *head)
[all...] |
| /external/blktrace/btt/ |
| list.h | 68 * @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)
75 __list_add(new, head, head->next);
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)
[all...] |
| /toolchain/binutils/binutils-2.25/gprof/ |
| cg_dfn.c | 92 Sym *head = 0; local
99 head = dfn_stack[cycle_top].sym;
100 if (child == head)
104 if (child->cg.cyc.head != child && child->cg.cyc.head == head)
111 fprintf (stderr, "[find_cycle] couldn't find head of cycle\n");
119 if (head)
121 print_name (head);
149 * field points to the head of the cycle they are glomme
[all...] |
| /external/libnl/python/netlink/ |
| utils.h | 8 static inline int list_empty(const struct list_head *head)
10 return head->next == head;
13 static inline void list_add(struct list_head *new, struct list_head *head)
15 new->next = head->next;
16 head->next = new;
25 #define list_for_each_safe(pos, n, head) \
26 for (n = (head), pos = (head)->next; pos != (head); \
[all...] |
| /device/google/marlin/camera/QCamera2/stack/common/ |
| cam_queue.h | 42 cam_node_t head; /* dummy head */ member in struct:__anon3530
50 cam_list_init(&queue->head.list);
67 cam_list_add_tail_node(&node->list, &queue->head.list);
78 struct cam_list *head = NULL; local
82 head = &queue->head.list;
83 pos = head->next;
84 if (pos != head) {
102 struct cam_list *head = NULL local
[all...] |
| /device/huawei/angler/camera/QCamera2/stack/common/ |
| cam_queue.h | 38 cam_node_t head; /* dummy head */ member in struct:__anon4157
46 cam_list_init(&queue->head.list);
63 cam_list_add_tail_node(&node->list, &queue->head.list);
74 struct cam_list *head = NULL; local
78 head = &queue->head.list;
79 pos = head->next;
80 if (pos != head) {
98 struct cam_list *head = NULL local
[all...] |
| /device/lge/bullhead/camera/QCamera2/stack/common/ |
| cam_queue.h | 38 cam_node_t head; /* dummy head */ member in struct:__anon4709
46 cam_list_init(&queue->head.list);
63 cam_list_add_tail_node(&node->list, &queue->head.list);
74 struct cam_list *head = NULL; local
78 head = &queue->head.list;
79 pos = head->next;
80 if (pos != head) {
98 struct cam_list *head = NULL local
[all...] |
