| /external/clang/test/CodeGen/ |
| disable-tail-calls.c | 9 List *find(List *head, int data) {
10 if (!head)
12 if (head->data == data)
13 return head;
15 return find(head->next, data);
|
| /external/ltp/utils/ffsb-6.0-rc2/ |
| cirlist.c | 27 cl->head = NULL;
40 assert(cl->head == NULL);
41 cl->head = new;
42 cl->head->next = cl->head;
43 cl->head->prev = cl->head;
47 assert(cl->head->next == cl->head);
48 assert(cl->head->prev == cl->head)
[all...] |
| /external/adhd/cras/src/common/ |
| utlist.h | 40 * Either way, the pointer to the head of the list must be initialized to NULL.
64 #define LL_PREPEND(head, add) \
66 (add)->next = head; \
67 head = add; \
82 #define LL_APPEND(head, add) \
84 __typeof(head) _tmp; \
86 if (head) { \
87 _tmp = head; \
92 (head) = (add); \
96 #define LL_DELETE(head, del)
[all...] |
| /device/google/marlin/power/ |
| list.h | 37 int init_list_head(struct list_node *head);
38 struct list_node * add_list_node(struct list_node *head, void *data);
39 int remove_list_node(struct list_node *head, struct list_node *del_node);
40 void dump_list(struct list_node *head);
41 struct list_node *find_node(struct list_node *head, void *comparison_data);
|
| list.c | 37 int init_list_head(struct list_node *head)
39 if (head == NULL)
42 memset(head, 0, sizeof(*head));
47 struct list_node *add_list_node(struct list_node *head, void *data)
52 if (head == NULL) {
61 new_node->next = head->next;
62 new_node->compare = head->compare;
63 new_node->dump = head->dump;
64 head->next = new_node
[all...] |
| /external/strace/tests/ |
| caps.c | 45 int * const head = tail_alloc(sizeof(int) * 2); local
46 head[0] = v3;
47 head[1] = 0;
51 capget(head + 2, tail_data);
52 capget(head, tail_data + ARRAY_SIZE(data));
54 if (capget(head, tail_data))
56 if (head[0] != v3)
62 capset(head + 2, tail_data);
64 head[0] = 0xbadc0ded;
65 head[1] = 2718281828U
[all...] |
| /external/strace/tests-m32/ |
| caps.c | 45 int * const head = tail_alloc(sizeof(int) * 2); local
46 head[0] = v3;
47 head[1] = 0;
51 capget(head + 2, tail_data);
52 capget(head, tail_data + ARRAY_SIZE(data));
54 if (capget(head, tail_data))
56 if (head[0] != v3)
62 capset(head + 2, tail_data);
64 head[0] = 0xbadc0ded;
65 head[1] = 2718281828U
[all...] |
| /external/strace/tests-mx32/ |
| caps.c | 45 int * const head = tail_alloc(sizeof(int) * 2); local
46 head[0] = v3;
47 head[1] = 0;
51 capget(head + 2, tail_data);
52 capget(head, tail_data + ARRAY_SIZE(data));
54 if (capget(head, tail_data))
56 if (head[0] != v3)
62 capset(head + 2, tail_data);
64 head[0] = 0xbadc0ded;
65 head[1] = 2718281828U
[all...] |
| /frameworks/base/libs/hwui/utils/ |
| StringUtils.cpp | 25 const char* head = current; local
27 head = strchr(current, ' ');
28 std::string s(current, head ? head - current : strlen(current));
32 current = head + 1;
33 } while (head);
|
| /external/libevent/ |
| ht-internal.h | 41 #define HT_EMPTY(head) \
42 ((head)->hth_n_entries == 0)
44 /* How many elements in 'head'? */
45 #define HT_SIZE(head) \
46 ((head)->hth_n_entries)
49 #define HT_MEM_USAGE(head) \
50 (sizeof(*head) + (head)->hth_table_length * sizeof(void*))
52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)
[all...] |
| /bionic/libc/include/sys/ |
| queue.h | 45 * head of the list. Elements being removed from the head of the list
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
65 * A tail queue is headed by a pair of pointers, one to the head of the
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head of the list, or at the end of the list
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/i386-linux-gnu/sys/ |
| queue.h | 43 * head of the list. Elements being removed from the head of the list
53 * or after an existing element or at the head of the list. A list
56 * A simple queue is headed by a pair of pointers, one the head of the
59 * head of the list. New elements can be added to the list after
60 * an existing element, at the head of the list, or at the end of the
63 * A tail queue is headed by a pair of pointers, one to the head of the
67 * after an existing element, at the head of the list, or at the end of
70 * A circle queue is headed by a pair of pointers, one to the head of the
74 * an existing element, at the head of the list, or at the end of the list
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/x86_64-linux-gnu/sys/ |
| queue.h | 43 * head of the list. Elements being removed from the head of the list
53 * or after an existing element or at the head of the list. A list
56 * A simple queue is headed by a pair of pointers, one the head of the
59 * head of the list. New elements can be added to the list after
60 * an existing element, at the head of the list, or at the end of the
63 * A tail queue is headed by a pair of pointers, one to the head of the
67 * after an existing element, at the head of the list, or at the end of
70 * A circle queue is headed by a pair of pointers, one to the head of the
74 * an existing element, at the head of the list, or at the end of the list
[all...] |
| /external/ltp/testcases/kernel/syscalls/epoll2/include/ |
| dbllist.h | 26 #define DBL_LIST_ADDH(new, head) DBL_LIST_ADD(new, head, (head)->pNext)
28 #define DBL_LIST_ADDT(new, head) DBL_LIST_ADD(new, (head)->pPrev, head)
44 #define DBL_LIST_EMTPY(head) ((head)->pNext == head)
46 #define DBL_LIST_SPLICE(list, head) \
[all...] |
| /external/syslinux/gpxe/src/include/gpxe/ |
| list.h | 57 * Add a new entry to the head of a list
60 * @v head List head to add it after
62 * Insert a new entry after the specified head. This is good for
65 static inline void list_add ( struct list_head *new, struct list_head *head ) {
66 __list_add ( new, head, head->next );
68 #define list_add( new, head ) do { \
69 assert ( (head)->next->prev == (head) ); \
[all...] |
| /external/linux-kselftest/tools/testing/selftests/rcutorture/formal/srcu-cbmc/src/ |
| misc.c | 9 void wakeme_after_rcu(struct rcu_head *head)
|
| /external/libevent/compat/sys/ |
| queue.h | 46 * 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/ipsec-tools/src/include-glibc/sys/ |
| queue.h | 50 * 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) \
125 #define SLIST_EMPTY(head) ((head)->slh_first == NULL
427 *head = (struct quehead *)b; local
[all...] |
| /external/libnl/include/netlink/ |
| list.h | 38 struct nl_list_head *head)
40 __nl_list_add(obj, head->prev, head);
44 struct nl_list_head *head)
46 __nl_list_add(obj, head, head->next);
55 static inline int nl_list_empty(struct nl_list_head *head)
57 return head->next == head;
67 #define nl_list_at_tail(pos, head, member)
[all...] |
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| IntQueue.java | 27 private IntQueue.Entry head; field in class:IntQueue
37 if (head == null)
38 head = entry;
42 return head == null;
46 if (head == null)
49 int value = head.value;
50 head = head.next;
51 if (head == null)
|
| /external/syslinux/com32/include/linux/ |
| list.h | 5 // http://git.kernel.org/?p=linux/kernel/git/stable/linux-2.6.25.y.git;a=blob_plain;f=include/linux/list.h;hb=HEAD
57 * @head: list head to add it after
59 * Insert a new entry after the specified head.
62 static inline void list_add(struct list_head *new, struct list_head *head)
64 __list_add(new, head, head->next);
72 * @head: list head to add it before
74 * Insert a new entry before the specified head
[all...] |
| /external/ltp/testcases/realtime/include/ |
| list.h | 94 * @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)
101 __list_add(new, head, head->next);
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)
[all...] |
| /external/eigen/doc/snippets/ |
| MatrixBase_start_int.cpp | 3 cout << "Here is v.head(2):" << endl << v.head(2) << endl;
4 v.head(2).setZero();
|
| MatrixBase_template_int_start.cpp | 3 cout << "Here is v.head(2):" << endl << v.head<2>() << endl;
4 v.head<2>().setZero();
|
| /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;
|
