Searched refs:plist (Results 1 - 25 of 28) sorted by relevance

12

/haiku-buildtools/gcc/gcc/
H A Dfile-find.h35 struct prefix_list *plist; /* List of prefixes to try */ member in struct:path_prefix
H A Dfile-find.c77 for (pl = pprefix->plist; pl; pl = pl->next)
101 if (debug && pprefix->plist == NULL)
117 if (pprefix->plist && !first)
119 for (pl = pprefix->plist; pl->next; pl = pl->next)
124 prev = &pprefix->plist;
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A D920501-6.c52 int plist (p0, p1, tab) function
85 nprimes = plist (str2llu ("1234111111"), str2llu ("1234111127"), tab);
/haiku-buildtools/binutils/gas/
H A Dhash.c135 struct hash_entry ***plist, unsigned long *phash)
165 if (plist != NULL)
166 *plist = list;
134 hash_lookup(struct hash_control *table, const char *key, size_t len, struct hash_entry ***plist, unsigned long *phash) argument
/haiku-buildtools/legacy/binutils/gas/
H A Dhash.c155 struct hash_entry ***plist, unsigned long *phash)
185 if (plist != NULL)
186 *plist = list;
154 hash_lookup(struct hash_control *table, const char *key, size_t len, struct hash_entry ***plist, unsigned long *phash) argument
/haiku-buildtools/jam/
H A Djamgram.yy62 # define plist( s ) parse_make( compile_list,P0,P0,P0,s,S0,0 )
256 { $$.parse = plist( $1.string ); }
H A Djamgram.y108 # define plist( s ) parse_make( compile_list,P0,P0,P0,s,S0,0 )
302 { $$.parse = plist( $1.string ); }
H A Djamgram.c197 # define plist( s ) parse_make( compile_list,P0,P0,P0,s,S0,0 ) macro
1880 { (yyval).parse = plist( (yyvsp[(1) - (1)]).string ); }
/haiku-buildtools/gcc/gcc/objc/
H A Dobjc-runtime-shared-support.c663 generate_protocol_references (tree plist) argument
668 for (lproto = plist; lproto; lproto = TREE_CHAIN (lproto))
H A Dobjc-gnu-runtime-abi-01.c1136 tree array_type, ptype, refs_decl, lproto, e, plist; local
1145 plist = CLASS_PROTOCOL_LIST (i_or_p);
1148 plist = PROTOCOL_LIST (i_or_p);
1155 for (lproto = plist; lproto; lproto = TREE_CHAIN (lproto))
1165 for (lproto = plist; lproto; lproto = TREE_CHAIN (lproto))
H A Dobjc-next-runtime-abi-02.c2172 tree refs_decl, lproto, e, plist, ptempl_p_t; local
2179 plist = CLASS_PROTOCOL_LIST (i_or_p);
2181 plist = PROTOCOL_LIST (i_or_p);
2186 for (lproto = plist; lproto; lproto = TREE_CHAIN (lproto))
2197 for (lproto = plist; lproto; lproto = TREE_CHAIN (lproto))
H A Dobjc-next-runtime-abi-01.c1379 tree array_type, ptype, refs_decl, lproto, e, plist, attr; local
1388 plist = CLASS_PROTOCOL_LIST (i_or_p);
1391 plist = PROTOCOL_LIST (i_or_p);
1398 for (lproto = plist; lproto; lproto = TREE_CHAIN (lproto))
1408 for (lproto = plist; lproto; lproto = TREE_CHAIN (lproto))
/haiku-buildtools/binutils/bfd/
H A Delf32-ppc.c3685 if (eind->elf.plt.plist != NULL)
3687 if (edir->elf.plt.plist != NULL)
3692 for (entp = &eind->elf.plt.plist; (ent = *entp) != NULL; )
3696 for (dent = edir->elf.plt.plist; dent != NULL; dent = dent->next)
3706 *entp = edir->elf.plt.plist;
3709 edir->elf.plt.plist = eind->elf.plt.plist;
3710 eind->elf.plt.plist = NULL;
3910 update_plt_info (bfd *abfd, struct plt_entry **plist,
3917 for (ent = *plist; en
3903 update_plt_info(bfd *abfd, struct plt_entry **plist, asection *sec, bfd_vma addend) argument
3930 find_plt_ent(struct plt_entry **plist, asection *sec, bfd_vma addend) argument
7036 struct plt_entry **plist; local
[all...]
H A Delfxx-mips.c3000 BFD_ASSERT (hd->root.plt.plist != NULL);
3001 BFD_ASSERT (hd->root.plt.plist->stub_offset != MINUS_ONE);
3011 h->esym.asym.value = (hd->root.plt.plist->stub_offset
3497 BFD_ASSERT (h->plt.plist != NULL);
3498 BFD_ASSERT (h->plt.plist->gotplt_index != MINUS_ONE);
3503 + (h->plt.plist->gotplt_index
4503 && h->root.plt.plist->mips_offset != MINUS_ONE)
5627 && h->root.plt.plist->comp_offset != MINUS_ONE
5628 && h->root.plt.plist->mips_offset != MINUS_ONE)
5637 + h->root.plt.plist
[all...]
H A Delf64-ppc.c4690 if (from->elf.plt.plist != NULL)
4692 if (to->elf.plt.plist != NULL)
4697 for (entp = &from->elf.plt.plist; (ent = *entp) != NULL; )
4701 for (dent = to->elf.plt.plist; dent != NULL; dent = dent->next)
4711 *entp = to->elf.plt.plist;
4714 to->elf.plt.plist = from->elf.plt.plist;
4715 from->elf.plt.plist = NULL;
5311 update_plt_info (bfd *abfd, struct plt_entry **plist, bfd_vma addend)
5315 for (ent = *plist; en
5307 update_plt_info(bfd *abfd, struct plt_entry **plist, bfd_vma addend) argument
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/
H A D920428-2.c340 int (*get_props)(gx_device *dev, gs_prop_item *plist );
342 int (*put_props)(gx_device *dev, gs_prop_item *plist, int count );
357 int gx_default_get_props(gx_device *dev, gs_prop_item *plist );
358 int gx_default_put_props(gx_device *dev, gs_prop_item *plist, int count );
/haiku-buildtools/legacy/binutils/bfd/
H A Delf32-ppc.c2642 if (eind->elf.plt.plist != NULL)
2644 if (edir->elf.plt.plist != NULL)
2649 for (entp = &eind->elf.plt.plist; (ent = *entp) != NULL; )
2653 for (dent = edir->elf.plt.plist; dent != NULL; dent = dent->next)
2663 *entp = edir->elf.plt.plist;
2666 edir->elf.plt.plist = eind->elf.plt.plist;
2667 eind->elf.plt.plist = NULL;
2917 for (ent = h->plt.plist; ent != NULL; ent = ent->next)
2926 ent->next = h->plt.plist;
[all...]
H A Delf64-ppc.c3849 if (from->elf.plt.plist != NULL)
3851 if (to->elf.plt.plist != NULL)
3856 for (entp = &from->elf.plt.plist; (ent = *entp) != NULL; )
3860 for (dent = to->elf.plt.plist; dent != NULL; dent = dent->next)
3870 *entp = to->elf.plt.plist;
3873 to->elf.plt.plist = from->elf.plt.plist;
3874 from->elf.plt.plist = NULL;
4284 for (ent = eh->elf.plt.plist; ent != NULL; ent = ent->next)
4293 ent->next = eh->elf.plt.plist;
[all...]
H A Delf-bfd.h122 struct plt_entry *plist;
121 struct plt_entry *plist; member in union:elf_link_hash_entry::gotplt_union
/haiku-buildtools/legacy/gcc/gcc/
H A Dgcc.c1351 struct prefix_list *plist; /* List of prefixes to try */ member in struct:path_prefix
1937 for (pprefix = paths->plist; pprefix != 0; pprefix = pprefix->next)
2048 for (pl = pprefix->plist; pl; pl = pl->next)
2170 if (! first && pprefix->plist)
2172 for (pl = pprefix->plist; pl->next; pl = pl->next)
2177 prev = &pprefix->plist;
2206 struct prefix_list *pl = pprefix->plist;
3610 struct prefix_list *pl = startfile_prefixes.plist;
3815 struct prefix_list *pl = include_prefixes.plist;
H A Dcollect2.c262 struct prefix_list *plist; /* List of prefixes to try */ member in struct:path_prefix
866 for (pl = pprefix->plist; pl; pl = pl->next)
884 if (debug && pprefix->plist == NULL)
901 if (pprefix->plist)
903 for (pl = pprefix->plist; pl->next; pl = pl->next)
908 prev = &pprefix->plist;
3091 struct prefix_list *list = libpaths[i]->plist;
/haiku-buildtools/legacy/gcc/gcc/f/
H A Dcom.c1409 tree *plist = &list;
1485 *plist
1499 *plist
1504 plist = &TREE_CHAIN (*plist);
1540 *plist
1543 plist = &TREE_CHAIN (*plist);
1546 *plist = trail;
2935 tree *plist
1408 tree *plist = &list; local
2934 tree *plist = &arglist; local
10179 ffebld plist; /* opITEM. */ local
12423 tree *plist = &list; local
12465 tree *plist = &list; local
[all...]
/haiku-buildtools/legacy/gcc/gcc/objc/
H A Dobjc-act.c3107 generate_protocol_references (plist)
3108 tree plist;
3113 for (lproto = plist; lproto; lproto = TREE_CHAIN (lproto))
4169 tree refs_decl, expr_decl, lproto, e, plist;
4174 plist = CLASS_PROTOCOL_LIST (i_or_p);
4176 plist = PROTOCOL_LIST (i_or_p);
4190 for (lproto = plist; lproto; lproto = TREE_CHAIN (lproto))
4202 for (lproto = plist; lproto; lproto = TREE_CHAIN (lproto))
4161 tree refs_decl, expr_decl, lproto, e, plist; local
/haiku-buildtools/legacy/binutils/binutils/
H A Dieee.c4339 struct ieee_range **plist, *r, **pr;
4345 plist = &info->global_ranges;
4347 plist = &info->ranges;
4349 for (r = *plist; r != NULL; r = r->next)
4380 for (pr = plist; *pr != NULL; pr = &(*pr)->next)
4337 struct ieee_range **plist, *r, **pr; local
/haiku-buildtools/binutils/binutils/
H A Dieee.c4349 struct ieee_range **plist, *r, **pr;
4355 plist = &info->global_ranges;
4357 plist = &info->ranges;
4359 for (r = *plist; r != NULL; r = r->next)
4390 for (pr = plist; *pr != NULL; pr = &(*pr)->next)
4347 struct ieee_range **plist, *r, **pr; local

Completed in 690 milliseconds

12