/haiku-buildtools/gcc/gcc/testsuite/g++.dg/template/ |
H A D | array14.C | 9 int candidate = data[1][k]; local
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/opt/ |
H A D | pr30590.C | 27 struct test candidate = reset (); local 29 result = candidate;
|
/haiku-buildtools/gcc/gcc/java/ |
H A D | jcf-io.c | 290 static inline hashval_t hash (const value_type *candidate); 292 const compare_type *candidate); 296 charstar_hash::hash (const value_type *candidate) argument 298 return htab_hash_string (candidate); 302 charstar_hash::equal (const value_type *existing, const compare_type *candidate) argument 304 return strcmp (existing, candidate) == 0;
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/shootout/ |
H A D | meteor-contest.go | 622 candidate := &solutions[i] 624 c := candidate[j] 629 smallest = candidate 634 c := candidate[j] 639 largest = candidate
|
/haiku-buildtools/gcc/gcc/ |
H A D | tree-ssa-ifcombine.c | 198 get_name_for_bit_test (tree candidate) argument 202 if (TREE_CODE (candidate) == SSA_NAME 203 && has_single_use (candidate)) 205 gimple def_stmt = SSA_NAME_DEF_STMT (candidate); 209 if (TYPE_PRECISION (TREE_TYPE (candidate)) 215 return candidate;
|
H A D | hash-table.h | 286 const compare_type &candidate); 291 pointer_hash <Type>::hash (const value_type &candidate) argument 295 return (hashval_t) ((intptr_t)candidate >> 3); 301 const compare_type &candidate) 303 return existing == candidate; 300 equal(const value_type &existing, const compare_type &candidate) argument
|
H A D | reorg.c | 1523 is called when INSN is a candidate for a delay slot of TARGET. 1709 rtx candidate = seq->element (i); 1713 if (rtx_equal_p (PATTERN (candidate), ipat) 1714 && ! (annul_p && INSN_FROM_TARGET_P (candidate))) 1717 INSN_FROM_TARGET_P (candidate) = 0; 1718 return candidate; 1723 if ((!annul_p || !INSN_FROM_TARGET_P (candidate)) 1724 && insn_sets_resource_p (candidate, &needed, true)) 2080 delay-slot candidate. Stop searching when a label or jump is hit. 2082 For each candidate, i 1692 rtx candidate = seq->element (i); local [all...] |
H A D | sched-rgn.c | 135 Lists of split and update blocks for each candidate of the current 151 target are called "source" blocks. The candidate structure holds info 168 candidate; 170 static candidate *candidate_table; 1502 /* Find the valid candidate-source-blocks for the target block TRG, compute 1509 candidate *sp; 1517 candidate_table = XNEWVEC (candidate, current_nr_blocks); 1669 fprintf (sched_dump, "----------- candidate table: target: b=%d bb=%d ---\n", 1978 candidate *candp = candidate_table + bb_src; 2041 /* Insn is a candidate t 167 candidate; typedef in typeref:struct:__anon814 [all...] |
H A D | sel-sched-ir.c | 706 edge candidate; 712 candidate = find_fallthru_edge_from (BLOCK_FOR_INSN (insn)->prev_bb); 714 if (!candidate 715 || (candidate->src != BLOCK_FOR_INSN (last_scheduled_insn) 716 && candidate->src != BLOCK_FOR_INSN (last_scheduled_insn_old))) 729 if (candidate->src == BLOCK_FOR_INSN (last_scheduled_insn)) 699 edge candidate; local
|
H A D | cfg.c | 1054 const compare_type * candidate);
|
H A D | tree-sra.c | 41 candidate bitmap. More importantly, for every access into an aggregate, 48 statement between candidate aggregates and attached to the related 356 /* For a candidate UID return the candidates decl. */ 359 candidate (unsigned uid) function 1791 /* Return true if VAR is a candidate for SRA. */ 2559 tree var = candidate (i); 2587 tree var = candidate (i); 2601 tree var = candidate (i); 3799 such candidate has been found. */ 4315 /* Identify representatives of all accesses to all candidate parameter [all...] |
/haiku-buildtools/legacy/gcc/gcc/cp/ |
H A D | cvt.c | 1021 tree candidate; 1027 candidate = TREE_TYPE (TREE_TYPE (cand)); 1028 if (TREE_CODE (candidate) == REFERENCE_TYPE) 1029 candidate = TREE_TYPE (candidate); 1031 switch (TREE_CODE (candidate)) 1055 cp_error (" candidate conversions include `%D' and `%D'", 1018 tree candidate; local
|
H A D | pt.c | 916 /* Print the list of candidate FNS in an error message. */ 1061 determine which of the candidate templates is most 2921 parameter becomes invalid and the template candidate is 8329 resolution will subsequently invalidate the candidate, so 8826 tree candidate = TREE_VALUE (fn); 8828 args = get_bindings (candidate, decl, explicit_args); 8830 candidates = scratch_tree_cons (NULL_TREE, candidate, 8824 tree candidate = TREE_VALUE (fn); local
|
/haiku-buildtools/gcc/gcc/cp/ |
H A D | cvt.c | 1610 tree candidate; 1620 candidate = non_reference (TREE_TYPE (TREE_TYPE (cand))); 1622 switch (TREE_CODE (candidate)) 1638 switch (TREE_CODE (TREE_TYPE (candidate))) 1655 if (WILDCARD_TYPE_P (candidate)) 1676 candidate)) 1683 " candidate conversions include %qD and %qD", 1608 tree candidate; local
|
H A D | mangle.c | 391 /* Add NODE as a substitution candidate. NODE must not already be on 403 /* Get the canonicalized substitution candidate for NODE. */ 406 fprintf (stderr, " ++ using candidate (%s at %10p)\n", 411 /* Make sure NODE isn't already a candidate. */ 414 tree candidate; local 416 FOR_EACH_VEC_SAFE_ELT (G.substitutions, i, candidate) 418 gcc_assert (!(DECL_P (node) && node == candidate)); 419 gcc_assert (!(TYPE_P (node) && TYPE_P (candidate) 420 && same_type_p (node, candidate))); 623 tree candidate local [all...] |
H A D | call.c | 143 /* The function candidate corresponding to this conversion 522 /* The FUNCTION_DECL that will be called if this candidate is 1892 functions. ARGS will not be changed until a single candidate is 1937 /* Create an overload candidate for the function or method FN called 1986 First, to be a viable function, a candidate function shall have enough 2159 /* Create an overload candidate for the conversion function FN which will 2168 choose the best one; so when we create our candidate, we record the type 2297 /* We need something for printing the candidate. */ 2390 and VQ is either volatile or empty, there exist candidate operator 2396 candidate operato 3348 print_z_candidate(location_t loc, const char *msgstr, struct z_candidate *candidate) argument [all...] |
H A D | class.c | 1914 /* Remember the first candidate. */ 2404 /* The candidate overriders. */ 2433 tree *candidate = &ffod->candidates; 2436 while (*candidate) 2440 if (base_derived_from (TREE_VALUE (*candidate), binfo)) 2443 if (base_derived_from (binfo, TREE_VALUE (*candidate))) 2444 *candidate = TREE_CHAIN (*candidate); 2446 candidate = &TREE_CHAIN (*candidate); 2429 tree *candidate = &ffod->candidates; local [all...] |
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | reorg.c | 1599 is called when INSN is a candidate for a delay slot of TARGET. 1772 rtx candidate = XVECEXP (pat, 0, i); 1776 if (rtx_equal_p (PATTERN (candidate), ipat) 1778 && INSN_FROM_TARGET_P (candidate))) 1781 INSN_FROM_TARGET_P (candidate) = 0; 1782 return candidate; 1788 || ! INSN_FROM_TARGET_P (candidate)) 1789 && insn_sets_resource_p (candidate, &needed, 1)) 2115 delay-slot candidate. Stop searching when a label or jump is hit. 2117 For each candidate, i 1759 rtx candidate = XVECEXP (pat, 0, i); local [all...] |
H A D | protoize.c | 3066 const char *candidate; 3068 if ((candidate = substr (p, varargs_style_indicator)) == 0) 3071 if (!is_id_char (candidate[-1]) && !is_id_char (candidate[len])) 3074 p = candidate + 1;
|
H A D | haifa-sched.c | 582 target are called "source" blocks. The candidate structure holds info 593 candidate; 595 static candidate *candidate_table; 602 Lists of split and update blocks for each candidate of the current 1974 /* Find the valid candidate-source-blocks for the target block TRG, compute 1982 register candidate *sp; 2102 fprintf (dump, "----------- candidate table: target: b=%d bb=%d ---\n", 2510 register candidate *candp = candidate_table + bb_src; 2728 /* Insn is a candidate to be moved speculatively from bb_src to bb_trg. 2762 /* don't 'break' here: PFREE-candidate i 592 candidate; typedef in typeref:struct:__anon3412 [all...] |
/haiku-buildtools/legacy/gcc/gcc/ch/ |
H A D | decl.c | 2709 tree candidate; 2713 candidate = outer_decls; 2715 candidate = current_scope->enclosing->decls; 2716 for ( ; candidate; candidate = TREE_CHAIN (candidate)) 2718 tree seizename = DECL_NAME (candidate); 2727 /* Check if candidate is seizable. */ 2735 DECL_ABSTRACT_ORIGIN (new_alias) = candidate; 2677 tree candidate; local
|
/haiku-buildtools/gcc/libcpp/ |
H A D | directives.c | 2228 find_answer (cpp_hashnode *node, const struct answer *candidate) argument 2237 if (answer->count == candidate->count) 2240 if (! _cpp_equiv_tokens (&answer->first[i], &candidate->first[i]))
|
/haiku-buildtools/binutils/gold/ |
H A D | layout.cc | 624 // as well -- just whether this section is a candidate for compression. 5249 Kept_section candidate; 5251 this->signatures_.insert(std::make_pair(name, candidate));
|
/haiku-buildtools/binutils/bfd/ |
H A D | elflink.c | 7889 const char *candidate = NULL; 7902 candidate = bfd_elf_string_from_elf_section (input_bfd, 7907 name, candidate, (unsigned long) sym->st_value); 7909 if (candidate && strcmp (candidate, name) == 0) 7877 const char *candidate = NULL; local
|
/haiku-buildtools/gcc/gcc/config/i386/ |
H A D | i386.c | 24741 enum stringop_alg candidate = algs->size[i].alg; 24742 bool usable = alg_usable_p (candidate, memset); 24745 if (candidate != libcall && candidate && usable) 24789 enum stringop_alg candidate = algs->size[i].alg; 24791 if (candidate != libcall && alg_usable_p (candidate, memset)) 24793 alg = candidate; 24811 else if (alg_usable_p (candidate, memset)) 24814 return candidate; 24710 enum stringop_alg candidate = algs->size[i].alg; local 24758 enum stringop_alg candidate = algs->size[i].alg; local [all...] |