| /toolchain/binutils/binutils-2.25/opcodes/ |
| D | aarch64-gen.c | 45 struct opcode_node *next; member
76 ent->next = NULL; in new_opcode_node()
135 new_ent = &opcode_nodes_head.next; in read_table()
138 new_ent = &(*new_ent)->next; in read_table()
156 new_ent = &((*new_ent)->next); in read_table()
173 opcode_node* ent = opcode_nodes_head.next; in print_opcode_nodes()
178 ent = ent->next; in print_opcode_nodes()
241 if (!opcode->next) in divide_table_1()
257 ent = ent->next; in divide_table_1()
274 ptr = ptr->next; in divide_table_1()
[all …]
|
| D | i386-gen.c | 660 next_field (char *str, char sep, char **next, char *last) in next_field() argument
670 *next = str + 1; in next_field()
763 char *str, *next, *last; in process_i386_cpu_flag() local
785 next = flag + 2; in process_i386_cpu_flag()
792 next = flag + 1; in process_i386_cpu_flag()
800 for (; next && next < last; ) in process_i386_cpu_flag()
802 str = next_field (next, '|', &next, last); in process_i386_cpu_flag()
811 for (next = flag; next && next < last; ) in process_i386_cpu_flag()
813 str = next_field (next, '|', &next, last); in process_i386_cpu_flag()
846 char *str, *next, *last; in process_i386_opcode_modifier() local
[all …]
|
| D | arc-ext.c | 83 for (r = arc_extension_map.auxRegisters; r; r = r->next) { in arcExtMap_auxRegName()
96 if (r -> next) in clean_aux_registers()
98 clean_aux_registers( r->next); in clean_aux_registers()
100 free(r -> next); in clean_aux_registers()
101 r ->next = NULL; in clean_aux_registers()
224 newAuxRegister->next = arc_extension_map.auxRegisters; in arcExtMap_add()
249 for (p = text_bfd->sections; p != NULL; p = p->next)
|
| /toolchain/binutils/binutils-2.25/libiberty/ |
| D | objalloc.c | 61 struct objalloc_chunk *next; member
103 chunk->next = NULL; in objalloc_create()
148 chunk->next = (struct objalloc_chunk *) o->chunks; in _objalloc_alloc()
162 chunk->next = (struct objalloc_chunk *) o->chunks; in _objalloc_alloc()
184 struct objalloc_chunk *next; in objalloc_free() local
186 next = l->next; in objalloc_free()
188 l = next; in objalloc_free()
206 for (p = (struct objalloc_chunk *) o->chunks; p != NULL; p = p->next) in objalloc_free_block()
241 struct objalloc_chunk *next; in objalloc_free_block() local
243 next = q->next; in objalloc_free_block()
[all …]
|
| D | partition.c | 54 part->elements[e].next = &(part->elements[e]); in partition_new()
108 for (p = e2->next; p != e2; p = p->next) in partition_union()
113 old_next = e1->next; in partition_union()
114 e1->next = e2->next; in partition_union()
115 e2->next = old_next; in partition_union()
168 c = elements[c].next - elements; in partition_print()
|
| /toolchain/binutils/binutils-2.25/bfd/ |
| D | elf-nacl.c | 93 for (seg = *m; seg != NULL; seg = seg->next) in nacl_modify_segment_map()
181 goto next; in nacl_modify_segment_map()
197 prevseg = prevseg->next) in nacl_modify_segment_map()
212 next: in nacl_modify_segment_map()
213 m = &seg->next; in nacl_modify_segment_map()
222 *first_load = first->next; in nacl_modify_segment_map()
223 first->next = last->next; in nacl_modify_segment_map()
224 last->next = first; in nacl_modify_segment_map()
252 m = &(*m)->next; in nacl_modify_program_headers()
266 m = &(*m)->next; in nacl_modify_program_headers()
[all …]
|
| D | hash.c | 471 hashp = hashp->next) in bfd_hash_lookup()
515 hashp->next = table->table[_index]; in bfd_hash_insert()
549 while (chain_end->next && chain_end->next->hash == chain->hash) in bfd_hash_insert()
550 chain_end = chain_end->next; in bfd_hash_insert()
552 table->table[hi] = chain_end->next; in bfd_hash_insert()
554 chain_end->next = newtable[_index]; in bfd_hash_insert()
575 for (pph = &table->table[_index]; *pph != NULL; pph = &(*pph)->next) in bfd_hash_rename()
581 *pph = ent->next; in bfd_hash_rename()
585 ent->next = table->table[_index]; in bfd_hash_rename()
602 pph = &(*pph)->next) in bfd_hash_replace()
[all …]
|
| D | merge.c | 54 struct sec_merge_hash_entry *next; member
77 struct sec_merge_info *next; member
87 struct sec_merge_sec_info *next; member
126 ret->next = NULL; in sec_merge_hash_newfunc()
197 hashp = (struct sec_merge_hash_entry *) hashp->root.next) in sec_merge_hash_lookup()
278 tab->last->next = entry; in sec_merge_add()
301 for (; entry != NULL && entry->secinfo == secinfo; entry = entry->next) in sec_merge_emit()
383 for (sinfo = (struct sec_merge_info *) *psinfo; sinfo; sinfo = sinfo->next) in _bfd_add_merge_section()
398 sinfo->next = (struct sec_merge_info *) *psinfo; in _bfd_add_merge_section()
421 secinfo->next = sinfo->chain->next; in _bfd_add_merge_section()
[all …]
|
| /toolchain/binutils/binutils-2.25/gas/config/ |
| D | xtensa-relax.c | 122 opname_list *next; member
139 opname_map_e *next; member
164 precond_e *next; member
208 insn_repl_e *next; member
533 tl->next = NULL; in append_transition()
540 for (t_p = &tt->table[opcode]; (*t_p) != NULL; t_p = &(*t_p)->next) in append_transition()
545 tl->next = *t_p; in append_transition()
563 pl->next = NULL; in append_condition()
569 nxt = prev->next; in append_condition()
573 nxt = nxt->next; in append_condition()
[all …]
|
| D | tc-frv.c | 94 struct vliw_insn_list *next; member
108 struct vliw_chain *next; member
530 vliw_chain_entry->next = NULL; in frv_insert_vliw_insn()
537 previous_vliw_chain->next = vliw_chain_entry; in frv_insert_vliw_insn()
546 vliw_insn_list_entry->next = NULL; in frv_insert_vliw_insn()
552 current_vliw_insn->next = vliw_insn_list_entry; in frv_insert_vliw_insn()
600 for (the_insn = this_chain->insn_list; the_insn; the_insn = the_insn->next) in frv_find_in_vliw()
630 for (this_chain = start_chain; this_chain; this_chain = this_chain->next, i++) in frv_debug_tomcat()
634 for (this_insn = this_chain->insn_list; this_insn; this_insn = this_insn->next) in frv_debug_tomcat()
659 this_insn = this_insn->next) in frv_adjust_vliw_count()
[all …]
|
| D | xtensa-relax.h | 50 TransitionList *next; member
56 PreconditionList *next; member
82 ReqOptionList *next; member
89 ReqOrOptionList *next; member
142 BuildOp *next; member
160 BuildInstr *next; member
|
| /toolchain/binutils/binutils-2.25/gprof/ |
| D | cg_print.c | 170 todo = cyc->cg.cyc.next; in sort_members()
171 cyc->cg.cyc.next = 0; in sort_members()
175 todo = doing->cg.cyc.next; in sort_members()
177 for (prev = cyc; prev->cg.cyc.next; prev = prev->cg.cyc.next) in sort_members()
179 if (cmp_member (doing, prev->cg.cyc.next) == GREATERTHAN) in sort_members()
183 doing->cg.cyc.next = prev->cg.cyc.next; in sort_members()
184 prev->cg.cyc.next = doing; in sort_members()
197 for (member = cyc->cg.cyc.next; member; member = member->cg.cyc.next) in print_members()
820 symtab.base[sym_index].next = 0; in cg_print_function_ordering()
1044 if (parent->next && parent->prev && child->next && child->prev)
[all …]
|
| D | cg_dfn.c | 152 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
181 tail->cg.cyc.next = child; in find_cycle()
188 for (tail = child; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
190 tail->cg.cyc.next->cg.cyc.head = head; in find_cycle()
192 print_name (tail->cg.cyc.next); in find_cycle()
252 for (member = parent; member; member = member->cg.cyc.next) in post_visit()
|
| D | sym_ids.c | 42 struct sym_id *next; member
102 id->next = id_list; in sym_id_add()
252 tab->base[tab->len].next = m->first_match; in extend_match()
283 for (id = id_list; id; id = id->next) in sym_id_parse()
289 for (id = id_list; id; id = id->next) in sym_id_parse()
320 for (id = id_list; id; id = id->next) in sym_id_parse()
331 for (id = id_list; id; id = id->next) in sym_id_parse()
335 for (left = id->left.first_match; left; left = left->next) in sym_id_parse()
337 for (right = id->right.first_match; right; right = right->next) in sym_id_parse()
|
| /toolchain/binutils/binutils-2.25/ld/ |
| D | mri.c | 37 struct section_name_struct *next; member
67 *ptr = (*ptr)->next; in lookup()
69 ptr = &((*ptr)->next); in lookup()
89 (*ptr)->next = NULL; in mri_add_to_list()
139 alist = alist->next) in mri_draw_tree()
143 for (olist = order; done == 0 && olist != NULL; olist = olist->next) in mri_draw_tree()
171 for (ptr1 = only_load; ptr1; ptr1 = ptr1->next) in mri_draw_tree()
172 for (ptr2 = order; ptr2; ptr2 = ptr2->next) in mri_draw_tree()
181 for (ptr = order; ptr; ptr = ptr->next) in mri_draw_tree()
199 for (aptr = alignment; aptr; aptr = aptr->next) in mri_draw_tree()
[all …]
|
| D | ldlang.c | 213 for (unam = unique_section_list; unam; unam = unam->next) in unique_section_p()
240 list_tmp = list_tmp->next) in walk_wild_consider_section()
278 for (s = file->the_bfd->sections; s != NULL; s = s->next) in walk_wild_section_general()
298 sec = sec->next; in walk_wild_section_general()
579 for (s = file->the_bfd->sections; s != NULL; s = s->next) in walk_wild_section_specs1_wild1()
609 for (s = file->the_bfd->sections; s != NULL; s = s->next) in walk_wild_section_specs2_wild1()
647 for (s = file->the_bfd->sections; s != NULL; s = s->next) in walk_wild_section_specs3_wild2()
696 for (s = file->the_bfd->sections; s != NULL; s = s->next) in walk_wild_section_specs4_wild2()
785 for (sec = ptr->section_list; sec != NULL; sec = sec->next) in analyze_walk_wild_section_handler()
805 for (sec = ptr->section_list; sec != NULL; sec = sec->next) in analyze_walk_wild_section_handler()
[all …]
|
| D | ldctor.c | 65 for (p = sets; p != NULL; p = p->next) in ldctor_add_set_entry()
72 p->next = sets; in ldctor_add_set_entry()
108 e->next = NULL; in ldctor_add_set_entry()
113 for (epp = &p->elements; *epp != NULL; epp = &(*epp)->next) in ldctor_add_set_entry()
213 for (p = sets; p != NULL; p = p->next) in ldctor_build_sets()
223 for (e = p->elements; e != NULL; e = e->next) in ldctor_build_sets()
229 for (e = p->elements; e != NULL; e = e->next) in ldctor_build_sets()
240 array[i]->next = array[i + 1]; in ldctor_build_sets()
241 array[i]->next = NULL; in ldctor_build_sets()
251 for (p = sets; p != NULL; p = p->next) in ldctor_build_sets()
[all …]
|
| D | ldlang.h | 51 struct memory_region_name_struct * next; member
57 struct memory_region_struct *next; member
89 union lang_statement_union *next; member
126 struct lang_output_section_phdr_list *next; member
135 struct lang_output_section_statement_struct *next; member
304 union lang_statement_union *next; member
322 struct map_symbol_def *next; member
436 struct lang_phdr *next; member
450 struct lang_nocrossref *next; member
458 struct lang_nocrossrefs *next; member
[all …]
|
| D | ldcref.c | 46 struct cref_ref *next; member
178 for (r = h->refs; r != NULL; r = r->next) in add_cref()
187 r->next = h->refs; in add_cref()
226 for (p = cref_table.root.table[i]; p != NULL; p = p->next) in handle_asneeded_cref()
230 for (r = c->refs; r != NULL; r = r->next) in handle_asneeded_cref()
256 for (p = cref_table.root.table[i]; p != NULL; p = p->next) in handle_asneeded_cref()
261 for (r = c->refs; r != NULL; r = r->next) in handle_asneeded_cref()
298 for (p = cref_table.root.table[i]; p != NULL; p = p->next) in handle_asneeded_cref()
303 for (r = c->refs; r != NULL; r = r->next) in handle_asneeded_cref()
426 for (r = h->refs; r != NULL; r = r->next) in output_one_cref()
[all …]
|
| /toolchain/binutils/binutils-2.25/binutils/ |
| D | bfdtest1.c | 35 bfd *last, *next; in main() local
52 last = next) in main()
54 next = bfd_openr_next_archived_file (archive, last); in main()
60 last = next) in main()
62 next = bfd_openr_next_archived_file (archive, last); in main()
|
| D | windint.h | 61 struct bindata *next; member
73 struct coff_res_data *next; member
128 struct rc_res_entry *next; member
299 struct rc_accelerator *next; member
353 struct rc_group_cursor *next; member
632 struct rc_dialog_control *next; member
695 struct rc_fontdir *next; member
717 struct rc_group_icon *next; member
786 struct rc_menuitem *next; member
839 struct rc_rcdata_item *next; member
[all …]
|
| /toolchain/binutils/binutils-2.25/gas/ |
| D | listing.c | 124 struct file_info_struct * next; member
146 struct list_message *next; member
167 struct list_info_struct *next; member
242 lm->next = NULL; in listing_message()
245 listing_tail->last_message->next = lm; in listing_message()
274 p = p->next; in file_info()
279 p->next = file_info_head; in file_info()
408 listing_tail->next = new_i; in listing_newline()
417 new_i->next = (list_info_type *) NULL; in listing_newline()
460 for (l = head; l->next != listing_tail; l = l->next) in listing_prev_line()
[all …]
|
| /toolchain/binutils/binutils-2.25/include/ |
| D | bfdlink.h | 122 struct bfd_link_hash_entry *next; member
128 struct bfd_link_hash_entry *next; member
135 struct bfd_link_hash_entry *next; member
142 struct bfd_link_hash_entry *next; member
216 struct bfd_sym_chain *next; member
241 struct flag_info_list *next; member
689 struct bfd_link_order *next; member
778 struct bfd_elf_version_expr *next; member
811 struct bfd_elf_version_deps *next; member
821 struct bfd_elf_version_tree *next; member
|
| /toolchain/binutils/binutils-2.25/gold/ |
| D | target-select.cc | 105 for (Target_selector* p = target_selectors; p != NULL; p = p->next()) in select_target()
127 for (Target_selector* p = target_selectors; p != NULL; p = p->next()) in select_target_by_bfd_name()
146 for (Target_selector* p = target_selectors; p != NULL; p = p->next()) in select_target_by_emulation()
164 for (Target_selector* p = target_selectors; p != NULL; p = p->next()) in supported_target_names()
173 for (Target_selector* p = target_selectors; p != NULL; p = p->next()) in supported_emulation_names()
206 for (Target_selector* p = target_selectors; p != NULL; p = p->next()) in print_output_format()
|
| /toolchain/binutils/binutils-2.25/intl/ |
| D | bindtextdom.c | 123 for (binding = _nl_domain_bindings; binding != NULL; binding = binding->next)
309 new_binding->next = _nl_domain_bindings;
315 while (binding->next != NULL
316 && strcmp (domainname, binding->next->domainname) > 0)
317 binding = binding->next;
319 new_binding->next = binding->next;
320 binding->next = new_binding;
|