Searched refs:chain (Results 1 - 25 of 160) sorted by last modified time

1234567

/haiku-buildtools/legacy/gcc/gcc/
H A Dcccp.c451 If it is 0, use the entire chain for such includes. */
453 /* This is the first element in the chain that corresponds to
456 static struct file_name_list *last_include = 0; /* Last in chain */
458 /* Chain of include directories to put at the end of the other chain. */
460 static struct file_name_list *last_after_include = 0; /* Last in chain */
464 static struct file_name_list *last_before_system = 0; /* Last in chain */
655 chain is kept, in case the node is the head
656 of the chain and gets deleted. */
738 chain is kept, in case the node is the head
739 of the chain an
[all...]
/haiku-buildtools/binutils/gold/
H A Dincremental.cc1616 // input section index, linked list chain pointer, relocation
1644 unsigned int chain = 0; local
1653 chain = global_syms[symtab_index - first_global_index];
1659 Swap32::writeval(pov + 8, chain);
H A Ddynobj.h138 const std::vector<uint32_t>& chain,
H A Ddynobj.cc939 std::vector<uint32_t> chain(local_dynsym_count + dynsym_count);
945 chain[dynsym_index] = bucket[bucketpos];
963 Dynobj::sized_create_elf_hash_table<32, true>(bucket, chain, phash,
972 Dynobj::sized_create_elf_hash_table<32, false>(bucket, chain, phash,
984 Dynobj::sized_create_elf_hash_table<64, true>(bucket, chain, phash,
993 Dynobj::sized_create_elf_hash_table<64, false>(bucket, chain, phash,
1012 const std::vector<uint32_t>& chain,
1019 const unsigned int chaincount = chain.size();
1034 elfcpp::Swap<size, big_endian>::writeval(p, chain[i]);
1292 // Last element terminates the chain
1011 sized_create_elf_hash_table(const std::vector<uint32_t>& bucket, const std::vector<uint32_t>& chain, unsigned char* phash, unsigned int hashlen) argument
[all...]
/haiku-buildtools/binutils/gas/
H A Dsubsegs.c78 frchainS *frcP; /* crawl frchain chain */
279 frchainS *chain;
285 for (chain = seginfo->frchainP; chain; chain = chain->frch_next)
287 for (frag = chain->frch_root; frag; frag = frag->fr_next)
290 if (obstack_next_free (&chain->frch_obstack)
291 != chain->frch_last->fr_literal)
276 frchainS *chain; local
/haiku-buildtools/binutils/gas/config/
H A Dobj-macho.c1631 frchainS *chain; local
1638 for (chain = seginfo->frchainP; chain != NULL; chain = chain->frch_next)
1639 for (frag = chain->frch_root; frag != NULL; frag = frag->fr_next)
/haiku-buildtools/binutils/bfd/
H A Driscix.c442 arelent_chain *chain = section->constructor_chain; local
446 *relptr++ = &chain->relent;
447 chain = chain->next;
H A DpeXXigen.c3327 rsrc_dir_chain * chain,
3339 if (chain->num_entries == 0)
3341 chain->first_entry = chain->last_entry = NULL;
3349 chain->first_entry = entry;
3351 for (i = chain->num_entries; i--;)
3373 chain->last_entry = entry;
3901 rsrc_sort_entries (rsrc_dir_chain * chain,
3910 if (chain->num_entries < 2)
3916 points_to_entry = & chain
3322 rsrc_parse_entries(bfd * abfd, rsrc_dir_chain * chain, bfd_boolean is_name, bfd_byte * highest_data, bfd_byte * datastart, bfd_byte * data, bfd_byte * dataend, bfd_vma rva_bias, rsrc_directory * parent) argument
3897 rsrc_sort_entries(rsrc_dir_chain * chain, bfd_boolean is_name, rsrc_directory * dir) argument
[all...]
H A Dpdp11.c1987 arelent_chain *chain = section->constructor_chain;
1991 *relptr ++ = &chain->relent;
1992 chain = chain->next;
1981 arelent_chain *chain = section->constructor_chain; local
H A Dmipsbsd.c349 arelent_chain *chain = section->constructor_chain; local
353 *relptr++ = &chain->relent;
354 chain = chain->next;
H A Dmerge.c80 struct sec_merge_sec_info *chain; member in struct:sec_merge_info
400 if ((secinfo = sinfo->chain)
415 sinfo->chain = NULL;
435 if (sinfo->chain)
437 secinfo->next = sinfo->chain->next;
438 sinfo->chain->next = secinfo;
442 sinfo->chain = secinfo;
541 for (secinfo = sinfo->chain; secinfo; secinfo = secinfo->next)
702 /* And now adjust the rest, removing them from the chain (but not hashtable)
734 if (! sinfo->chain)
[all...]
H A Dieee.c3223 bfd_chain_type *chain = ieee->chain_root;
3233 if (chain == (bfd_chain_type *) NULL)
3252 while (chain != (bfd_chain_type *) NULL)
3254 bfd *entry = chain->this;
3265 chain = chain->next;
3220 bfd_chain_type *chain = ieee->chain_root; local
H A Di386lynx.c526 arelent_chain *chain = section->constructor_chain;
529 *relptr++ = &chain->relent;
530 chain = chain->next;
525 arelent_chain *chain = section->constructor_chain; local
H A Dhp300hpux.c834 arelent_chain *chain = section->constructor_chain; local
837 *relptr++ = &chain->relent;
838 chain = chain->next;
H A Dhash.c546 struct bfd_hash_entry *chain = table->table[hi]; local
547 struct bfd_hash_entry *chain_end = chain;
549 while (chain_end->next && chain_end->next->hash == chain->hash)
553 _index = chain->hash % newsize;
555 newtable[_index] = chain;
H A Delflink.c5631 /* Last element terminates the chain. */
5672 (= short chain lengths) and table size. */
5722 minimal chain length. The minor criteria is (of course) the size
5755 of all the chain lengths (which favors many small chain
6471 the chain, otherwise Verdef construction breaks. */
9705 bfd_vma chain;
9716 chain = bfd_get (8 * hash_entry_size, flinfo->output_bfd, bucketpos);
9719 bfd_put (8 * hash_entry_size, flinfo->output_bfd, chain,
9693 bfd_vma chain; local
H A Decoff.c1706 arelent_chain *chain;
1709 them out of their chain and place them into the data area
1711 for (count = 0, chain = section->constructor_chain;
1713 count++, chain = chain->next)
1714 *relptr++ = &chain->relent;
1702 arelent_chain *chain; local
H A Dcoffcode.h5411 file, so take them out of their chain and place them into
5413 arelent_chain *chain = section->constructor_chain;
5417 *relptr++ = &chain->relent;
5418 chain = chain->next;
5412 arelent_chain *chain = section->constructor_chain; local
H A Dbout.c893 arelent_chain *chain = section->constructor_chain;
897 *relptr++ = &chain->relent;
898 chain = chain->next;
892 arelent_chain *chain = section->constructor_chain; local
H A Daoutx.h2470 arelent_chain *chain = section->constructor_chain;
2473 *relptr ++ = &chain->relent;
2474 chain = chain->next;
2464 arelent_chain *chain = section->constructor_chain; local
/haiku-buildtools/gcc/gcc/
H A Domp-low.c199 /* A chain of variables to add to the top-level block surrounding the
3367 parent chain. This is not a problem in general because nested
5140 tree chain = NULL_TREE, t;
5145 DECL_CHAIN (t) = chain;
5146 chain = t;
5149 return chain;
5508 rather than in containing function's local_decls chain,
8910 rather than in containing function's local_decls chain,
5139 tree chain = NULL_TREE, t; local
H A Dgimple-ssa-strength-reduction.c325 /* Base expression for the chain of candidates: often, but not
421 /* For a chain of candidates with unknown stride, indicates whether or not
439 /* Helper for hashing a candidate chain header. */
529 cand_chain_t chain;
537 chain = base_cand_map->find (&mapping_key);
539 for (; chain && iters < max_iters; chain = chain->next, ++iters)
541 slsr_cand_t one_basis = chain->cand;
1861 const_cand_chain_t chain
526 cand_chain_t chain; local
1855 const_cand_chain_t chain = *slot; local
[all...]
H A Dtree-cfg.c1190 a chain of CASE_LABEL_EXPRs from T which reference E.
1221 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
1222 a new chain. */
1344 /* label_to_block possibly inserted undefined label into the chain. */
3368 error ("invalid static chain in gimple call");
3373 /* If there is a static chain argument, the call should either be
3379 error ("static chain with function that doesn%'t use one");
7251 tree chain; local
7366 chain = DECL_SAVED_TREE (fndecl);
7367 if (chain
[all...]
H A Dtree-inline.c3301 /* Initialize the static chain. */
3306 /* No static chain? Seems like a bug in tree-nested.c. */
5051 /* Because the chain gets clobbered when we make a copy, we save it
5053 tree chain = NULL_TREE, new_tree;
5056 chain = TREE_CHAIN (*tp);
5063 /* Now, restore the chain, if appropriate. That will cause
5064 walk_tree to walk into the chain as well. */
5068 TREE_CHAIN (*tp) = chain;
5495 /* Return a copy of the function's static chain. */
5731 /* Copy the function's static chain
5052 tree chain = NULL_TREE, new_tree; local
[all...]
/haiku-buildtools/gcc/gcc/fortran/
H A Dtrans.c1573 add_expr_to_chain (tree* chain, tree expr, bool front) argument
1578 if (*chain)
1580 if (TREE_CODE (*chain) != STATEMENT_LIST)
1584 tmp = *chain;
1585 *chain = NULL_TREE;
1586 append_to_statement_list (tmp, chain);
1593 i = tsi_start (*chain);
1597 append_to_statement_list (expr, chain);
1600 *chain = expr;

Completed in 676 milliseconds

1234567