/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | pr62004.c | 12 struct head struct 17 struct head heads[5]; 21 struct head *head = &heads[2]; variable in typeref:struct:head 30 node.prev = (void *)head; 32 head->first = &node; 34 struct node *n = head->first; 36 struct head *h = &heads[k];
|
H A D | pr62167-run.c | 12 struct head struct 17 struct head heads[5]; 21 struct head *head = &heads[2]; variable in typeref:struct:head 30 node.prev = (void *)head; 32 head->first = &node; 34 struct node *n = head->first; 36 struct head *h = &heads[k];
|
H A D | pr62167.c | 12 struct head struct 17 struct head heads[5]; 21 struct head *head = &heads[2]; variable in typeref:struct:head 30 node.prev = (void *)head; 32 head->first = &node; 34 struct node *n = head->first; 36 struct head *h = &heads[k];
|
H A D | pr62030.c | 14 struct head struct 19 struct head heads[5]; 23 struct head *head = &heads[2]; variable in typeref:struct:head 28 node.prev = (void *)head; 29 head->first = &node; 31 struct node *n = head->first; 32 struct head *h = &heads[k];
|
H A D | 20030626-1.c | 11 int head; member in struct:str
|
H A D | alias-10.c | 19 void foo (bitmap head, bitmap_element *elt) argument 25 if (head->using_obstack)
|
H A D | pr57287-2.c | 14 struct node *head (void); 23 list = head ();
|
/haiku-buildtools/gcc/gcc/ |
H A D | tree-browser.c | 148 tree head; local 158 head = N; \ 160 if (head) \ 162 print_generic_expr (TB_OUT_FILE, head, 0); \ 172 TB_update_up (head); 192 TB_update_up (head); 196 if (head && (INTEGRAL_TYPE_P (head) 197 || TREE_CODE (head) == REAL_TYPE 198 || TREE_CODE (head) [all...] |
H A D | tree-iterator.c | 121 struct tree_statement_list_node *head, *tail, *cur; local 128 head = STATEMENT_LIST_HEAD (t); 136 if (!head || !tail) 138 gcc_assert (head == tail); 144 head = ggc_alloc<tree_statement_list_node> (); 145 head->prev = NULL; 146 head->next = NULL; 147 head->stmt = t; 148 tail = head; 158 head 197 struct tree_statement_list_node *head, *tail, *cur; local [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/torture/ |
H A D | pr61964.c | 6 struct head { struct node *first; } heads[5]; struct 8 struct head *head = &heads[2]; variable in typeref:struct:head 13 node.prev = (void *)head; 14 head->first = &node; 16 struct node *n = head->first; 17 struct head *h = &heads[k];
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/mips/ |
H A D | pr62030-octeon.c | 14 struct head struct 19 struct head heads[5]; 23 struct head *head = &heads[2]; variable in typeref:struct:head 28 node.prev = (void *)head; 29 head->first = &node; 31 struct node *n = head->first; 32 struct head *h = &heads[k];
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/ |
H A D | pr61923.c | 11 char head; member in struct:__anon1783::__anon1784::__anon1785 30 switch (sizeof *&lock->tickets.head) 32 asm("" : "+m"(*&lock->tickets.head) : ""(0));
|
/haiku-buildtools/binutils/gprof/ |
H A D | 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 o [all...] |
H A D | search_list.h | 43 struct search_list_elem *head; 42 struct search_list_elem *head; member in struct:__anon596
|
/haiku-buildtools/legacy/binutils/gprof/ |
H A D | 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 o [all...] |
H A D | search_list.h | 42 struct search_list_elem *head; 41 struct search_list_elem *head; member in struct:__anon2638
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/forward_list/operations/ |
H A D | 6.cc | 59 std::forward_list<int> head(order[i], order[i] + n); 61 head.sort(); 63 VERIFY(head == sorted); 69 std::forward_list<int> head(order[i], order[i] + n); 72 head.sort( comp ); 74 VERIFY(head == reversed);
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | bitmap.c | 57 bitmap_element_free (head, elt) 58 bitmap head; 70 if (head->first == elt) 71 head->first = next; 75 if (head->current == elt) 76 head->current = next != 0 ? next : prev; 166 bitmap_element_link (head, element) 167 bitmap head; 174 if (head->first == 0) 177 head [all...] |
/haiku-buildtools/legacy/gcc/libobjc/objc/ |
H A D | objc-list.h | 32 void *head; member in struct:objc_list 36 /* Return a cons cell produced from (head . tail) */ 39 list_cons(void* head, struct objc_list* tail) argument 44 cell->head = head; 76 return list->head; 79 /* Remove the element at the head by replacing it by its successor */ 87 *(*list) = *tail; /* copy next to list head */ 104 if ((*list)->head == elem) 117 (*function)(list->head); [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | pr31345-1.c | 7 int hash, thash, head[2], off; local 21 off = head[2];
|
H A D | pr44831.c | 7 PNCB head; member in struct:NBCmdQueue 11 PNCB *ret = &queue->head;
|
/haiku-buildtools/gcc/mpfr/src/ |
H A D | mpfr-gmp.c | 361 struct tmp_marker *head; local 363 head = (struct tmp_marker *) 365 head->ptr = mpfr_default_allocate (size); 366 head->size = size; 367 head->next = *tmp_marker; 368 *tmp_marker = head; 369 return head->ptr;
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | default_initialization_5.f90 | 24 type(arr_t), pointer :: head => null() component in type:my_list 27 type(arr_t2), pointer :: head => tgt component in type:my_list2 46 if (associated(dum%my_data%head)) then 49 print *, 'OK: do_job my_data%head is NOT associated' 52 if (dum2%my_data%head%a /= 77) & 63 ! { dg-final { scan-tree-dump-times "my_data.head = 0B" 1 "original" } } 64 ! { dg-final { scan-tree-dump-times "my_data.head = &tgt" 1 "original" } }
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ipa/ |
H A D | PR64550.c | 38 struct __hlist_head * head = __dev_index_hash(net, ifindex); local 40 for (dev = ( { typeof((head)->first) ____ptr = ((head)->first); ____ptr ? ( { const typeof(((typeof(*(dev)) *) 0)->index_hlist) * __mptr = (____ptr); (typeof(*(dev)) *) ((char *)__mptr - __builtin_offsetof(typeof(*(dev)), index_hlist));}): ((void *) 0);}); 52 struct __hlist_head * head = __dev_index_hash(net, ifindex); local 54 for (dev = ( { typeof(( { typeof (* ((*((struct __hlist_node **)(&(head)->first))))) * _________p1 = (typeof(*((*((struct __hlist_node **)(&(head)->first))))) *) (*(volatile typeof(((*((struct __hlist_node **)(&(head)->first))))) *)&(((*((struct __hlist_node **)(&(head)->first)))))); do { } while (0);; do { } while (0); ((typeof(*((*((struct __hlist_node **)(&(head)->first))))) *) (_________p1));})) ____ptr = (( { typeof (* ((*((struct __hlist_node **)(&(head) [all...] |
/haiku-buildtools/cloog/osl/source/ |
H A D | relation_list.c | 161 osl_relation_list_p head = list; local 169 while (head) { 170 if (head->elt != NULL) { 171 osl_relation_pprint(file, head->elt, names); 172 if (head->next != NULL) 176 head = head->next; 430 * \param[in,out] head Pointer to the head of the relation stack. 432 * updated to the previous head o 434 osl_relation_list_push(osl_relation_list_p *head, osl_relation_list_p node) argument 452 osl_relation_list_pop(osl_relation_list_p *head) argument 473 osl_relation_list_dup(osl_relation_list_p *head) argument 489 osl_relation_list_drop(osl_relation_list_p *head) argument 503 osl_relation_list_destroy(osl_relation_list_p *head) argument [all...] |