/external/clang/test/CodeGen/ |
H A D | disable-tail-calls.c | 9 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/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | free_list.cc | 56 // empty list, the new list head becomes that which is pointed to by 57 // the former head's |next| pointer. If the list is doubly linked, the 58 // new head |previous| pointer gets changed from pointing to the former 59 // head to NULL. 71 // |*head|. |head| will be modified to point to the new head. 73 // to the last node in the range. |n| must be <= FL_Size(|*head|) 74 // If |n| > 0, |head| must not be NULL. 75 void FL_PopRange(void **head, in argument 99 FL_PushRange(void **head, void *start, void *end) argument 119 FL_Size(void *head) argument [all...] |
H A D | linked_list.h | 62 // Remove N elements from a linked list to which head points. head will be 63 // modified to point to the new head. start and end will point to the first 66 inline void SLL_PopRange(void **head, int N, void **start, void **end) { argument 73 void *tmp = *head; 78 *start = *head; 80 *head = SLL_Next(tmp); 85 inline void SLL_PushRange(void **head, void *start, void *end) { argument 87 SLL_SetNext(end, *head); 88 *head 91 SLL_Size(void *head) argument [all...] |
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | linked_list.h | 62 // Remove N elements from a linked list to which head points. head will be 63 // modified to point to the new head. start and end will point to the first 66 inline void SLL_PopRange(void **head, int N, void **start, void **end) { argument 73 void *tmp = *head; 78 *start = *head; 80 *head = SLL_Next(tmp); 85 inline void SLL_PushRange(void **head, void *start, void *end) { argument 87 SLL_SetNext(end, *head); 88 *head 91 SLL_Size(void *head) argument [all...] |
/external/doclava/res/assets/templates/ |
H A D | index.cs | 2 <head> 4 </head>
|
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
H A D | compat-queue.h | 45 * added to the list after an existing element or at the head of the list. 46 * Elements being removed from the head of the list should use the explicit 53 * head of the list and the other to the tail of the list. The elements are 56 * to the list after an existing element, at the head of the list, or at the 57 * end of the list. Elements being removed from the head of the tail queue 67 * or after an existing element or at the head of the list. A list 70 * A tail queue is headed by a pair of pointers, one to the head of the 74 * after an existing element, at the head of the list, or at the end of 112 #define SLIST_HEAD_INITIALIZER(head) \ 123 #define SLIST_EMPTY(head) ((hea [all...] |
/external/chromium_org/third_party/libevent/compat/sys/ |
H A D | 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 o [all...] |
/external/chromium_org/third_party/ots/src/ |
H A D | head.cc | 5 #include "head.h" 9 // head - Font Header 10 // http://www.microsoft.com/opentype/otspec/head.htm 16 file->head = new OpenTypeHEAD; 20 !table.ReadU32(&file->head->revision)) { 39 if (!table.ReadU16(&file->head->flags)) { 44 file->head->flags &= 0x381f; 46 if (!table.ReadU16(&file->head->ppem)) { 51 if (file->head->ppem < 16 || 52 file->head [all...] |
/external/qemu/include/qemu/ |
H A D | queue.h | 51 * head of the list. Elements being removed from the head of the list 61 * or after an existing element or at the head of the list. A list 64 * A simple queue is headed by a pair of pointers, one the head of the 67 * head of the list. New elements can be added to the list after 68 * an existing element, at the head of the list, or at the end of the 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 91 #define QLIST_HEAD_INITIALIZER(head) \ 103 #define QLIST_INIT(head) d [all...] |
/external/ipsec-tools/src/include-glibc/sys/ |
H A D | 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) ((hea 427 *head = (struct quehead *)b; local [all...] |
/external/libnl/include/netlink/ |
H A D | 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) 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 D | 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/chromium_org/third_party/usrsctp/usrsctplib/ |
H A D | user_queue.h | 44 * added to the list after an existing element or at the head of the list. 45 * Elements being removed from the head of the list should use the explicit 52 * head of the list and the other to the tail of the list. The elements are 55 * to the list after an existing element, at the head of the list, or at the 56 * end of the list. Elements being removed from the head of the tail queue 66 * or after an existing element or at the head of the list. A list 69 * A tail queue is headed by a pair of pointers, one to the head of the 73 * after an existing element, at the head of the list, or at the end of 105 /* Store the last 2 places the queue element or head was altered */ 117 #define QMD_TRACE_HEAD(head) d [all...] |
/external/llvm/utils/ |
H A D | findsym.pl | 24 my $head = 0; 28 if (!$head) { print "$lib:\n"; $head = 1; }
|
/external/eigen/doc/snippets/ |
H A D | MatrixBase_start_int.cpp | 3 cout << "Here is v.head(2):" << endl << v.head(2) << endl; 4 v.head(2).setZero();
|
H A D | MatrixBase_template_int_start.cpp | 3 cout << "Here is v.head(2):" << endl << v.head<2>() << endl; 4 v.head<2>().setZero();
|
/external/chromium_org/v8/tools/ |
H A D | profile_view.js | 49 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/e2fsprogs/lib/ext2fs/ |
H A D | 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) 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/chromium_org/third_party/skia/src/gpu/ |
H A D | GrResourceCache2.cpp | 38 while (GrGpuResource* head = fResources.head()) { 39 SkASSERT(!head->wasDestroyed()); 40 head->abandon(); 42 SkASSERT(head != fResources.head()); 49 while (GrGpuResource* head = fResources.head()) { 50 SkASSERT(!head->wasDestroyed()); 51 head [all...] |
/external/f2fs-tools/include/ |
H A D | list.h | 38 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/ipsec-tools/src/racoon/ |
H A D | 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/ |
H A D | 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) 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 D | ql.c | 15 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/e2fsprogs/lib/blkid/ |
H A D | 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) 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/oprofile/libutil/ |
H A D | op_list.h | 32 * Init a list head to create an empty list from it 59 * @param head list head to add it after 61 * Insert a new entry after the specified head. 64 static __inline__ void list_add(struct list_head * new_entry, struct list_head * head) argument 66 __list_add(new_entry, head, head->next); 72 * @param head list head to add it before 74 * Insert a new entry before the specified head 77 list_add_tail(struct list_head * new_entry, struct list_head * head) argument 120 list_empty(struct list_head const * head) argument 130 list_splice(struct list_head * list, struct list_head * head) argument [all...] |