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

1234567891011>>

/external/clang/test/CodeGen/
H A Ddisable-tail-calls.c9 List *find(List *head, int data) { argument
10 if (!head)
12 if (head->data == data)
13 return head;
15 return find(head->next, data);
/external/doclava/res/assets/templates/
H A Dindex.cs2 <head>
4 </head>
/external/strace/tests/
H A Dcaps.c12 int head[] = { v3, 0 }; local
14 if (capget(head, unused) || head[0] != v3 ||
15 capset(head, data) == 0 || errno != EPERM)
/external/ipsec-tools/src/include-glibc/sys/
H A 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) \
125 #define SLIST_EMPTY(head) ((hea
427 *head = (struct quehead *)b; local
[all...]
/external/libnl/include/netlink/
H A Dlist.h38 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) argument
57 return head->next == head;
67 #define nl_list_at_tail(pos, head, membe
37 nl_list_add_tail(struct nl_list_head *obj, struct nl_list_head *head) argument
43 nl_list_add_head(struct nl_list_head *obj, struct nl_list_head *head) argument
[all...]
/external/javassist/src/main/javassist/bytecode/analysis/
H A DIntQueue.java27 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/llvm/utils/
H A Dfindsym.pl24 my $head = 0;
28 if (!$head) { print "$lib:\n"; $head = 1; }
/external/eigen/doc/snippets/
H A DMatrixBase_start_int.cpp3 cout << "Here is v.head(2):" << endl << v.head(2) << endl;
4 v.head(2).setZero();
H A DMatrixBase_template_int_start.cpp3 cout << "Here is v.head(2):" << endl << v.head<2>() << endl;
4 v.head<2>().setZero();
/external/e2fsprogs/lib/ext2fs/
H A Dkernel-list.h45 * Insert a new entry after the specified head..
47 static __inline__ void list_add(struct list_head *new, struct list_head *head) argument
49 __list_add(new, head, head->next);
55 static __inline__ void list_add_tail(struct list_head *new, struct list_head *head) argument
57 __list_add(new, head->prev, head);
79 static __inline__ int list_empty(struct list_head *head) argument
81 return head->next == head;
87 list_splice(struct list_head *list, struct list_head *head) argument
[all...]
/external/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...]
/external/f2fs-tools/include/
H A Dlist.h38 static inline void list_add(struct list_head *new, struct list_head *head) argument
40 __list_add(new, head, head->next);
43 static inline void list_add_tail(struct list_head *new, struct list_head *head) argument
45 __list_add(new, head->prev, head);
66 static inline int list_empty(const struct list_head *head) argument
68 return head->next == head;
74 #define list_for_each(pos, head) \
[all...]
/external/openssh/openbsd-compat/
H A 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 o
[all...]
H A Dsys-tree.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...]
/external/ipsec-tools/src/racoon/
H A Dgenlist.h51 /* 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);
H A Dgenlist.c50 genlist_insert (struct genlist *head, void *data) argument
54 TAILQ_INSERT_HEAD(head, entry, chain);
59 genlist_append (struct genlist *head, void *data) argument
63 TAILQ_INSERT_TAIL(head, entry, chain);
68 genlist_foreach (struct genlist *head, genlist_func_t func, void *arg) argument
72 TAILQ_FOREACH(p, head, chain) {
82 genlist_next (struct genlist *head, struct genlist_entry **buf) argument
86 if (head)
87 p = TAILQ_FIRST(head);
96 genlist_free (struct genlist *head, genlist_freedata_ argument
[all...]
/external/iptables/libiptc/
H A 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) argument
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) argument
140 list_add_rcu(struct list_head *new, struct list_head *head) argument
161 list_add_tail_rcu(struct list_head *new, struct list_head *head) argument
238 list_move(struct list_head *list, struct list_head *head) argument
249 list_move_tail(struct list_head *list, struct list_head *head) argument
260 list_empty(const struct list_head *head) argument
277 list_empty_careful(const struct list_head *head) argument
283 __list_splice(struct list_head *list, struct list_head *head) argument
302 list_splice(struct list_head *list, struct list_head *head) argument
315 list_splice_init(struct list_head *list, struct list_head *head) argument
[all...]
/external/jemalloc/test/unit/
H A Dql.c15 test_empty_list(list_head_t *head) argument
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) argument
63 assert_c_eq(ql_first(head)
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/fio/
H A Dflist.h59 * @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
64 flist_add(struct flist_head *new_entry, struct flist_head *head) argument
70 flist_add_tail(struct flist_head *new_entry, struct flist_head *head) argument
117 flist_empty(const struct flist_head *head) argument
136 flist_splice(const struct flist_head *list, struct flist_head *head) argument
143 flist_splice_tail(struct flist_head *list, struct flist_head *head) argument
150 flist_splice_tail_init(struct flist_head *list, struct flist_head *head) argument
159 flist_splice_init(struct flist_head *list, struct flist_head *head) argument
[all...]
/external/e2fsprogs/lib/blkid/
H A Dlist.h53 * @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) argument
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) argument
116 list_empty(struct list_head *head) argument
126 list_splice(struct list_head *list, struct list_head *head) argument
[all...]
/external/blktrace/btt/
H A 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) argument
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) argument
165 list_empty(const struct list_head *head) argument
174 list_first(const struct list_head *head) argument
184 list_move_tail(struct list_head *list, struct list_head *head) argument
191 __list_splice(struct list_head *list, struct list_head *head) argument
210 list_splice(struct list_head *list, struct list_head *head) argument
[all...]
/external/icu/icu4c/source/layout/
H A DLEInsertionList.cpp26 : head(NULL), tail(NULL), growAmount(0), append(rightToLeft)
28 tail = (InsertionRecord *) &head;
38 while (head != NULL) {
39 InsertionRecord *record = head;
41 head = head->next;
45 tail = (InsertionRecord *) &head;
78 insertion->next = head;
79 head = insertion;
87 for (InsertionRecord *rec = head; re
[all...]
/external/f2fs-tools/tools/
H A Df2fstat.c69 static inline void remove_newline(char **head) argument
72 if (**head == '\n') {
73 *head = *head + 1;
87 char *head, *tail; local
126 head = buf;
129 head = strstr(buf, opt->partname);
130 if (head == NULL)
135 remove_newline(&head);
136 tail = strchr(head, '
215 __make_head(char *head, int index, int i, int len) argument
232 char buf[1024], head[1024]; local
[all...]
/external/linux-tools-perf/src/include/linux/
H A Dlist.h55 * @head: list head to add it after
57 * Insert a new entry after the specified head.
60 static inline void list_add(struct list_head *new, struct list_head *head) argument
62 __list_add(new, head, head->next);
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) argument
153 list_move(struct list_head *list, struct list_head *head) argument
164 list_move_tail(struct list_head *list, struct list_head *head) argument
176 list_is_last(const struct list_head *list, const struct list_head *head) argument
186 list_empty(const struct list_head *head) argument
204 list_empty_careful(const struct list_head *head) argument
214 list_rotate_left(struct list_head *head) argument
228 list_is_singular(const struct list_head *head) argument
233 __list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
259 list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
292 list_splice(const struct list_head *list, struct list_head *head) argument
304 list_splice_tail(struct list_head *list, struct list_head *head) argument
318 list_splice_init(struct list_head *list, struct list_head *head) argument
335 list_splice_tail_init(struct list_head *list, struct list_head *head) argument
[all...]
/external/wpa_supplicant_8/hs20/server/www/
H A Dremediation.php2 <head>
4 </head>

Completed in 960 milliseconds

1234567891011>>