/haiku-buildtools/gcc/gcc/testsuite/g++.dg/debug/ |
H A D | pr56294.C | 6 struct cost_pair { struct iv_cand *cand; }; member in struct:cost_pair 18 foo (iv_use *use, iv_cand *cand) argument 20 unsigned i, s = cand->id & (use->n_map_members - 1); 22 if (use->cost_map[i].cand) 25 use->cost_map[i].cand = cand;
|
/haiku-buildtools/gcc/gcc/ |
H A D | lra-remat.c | 118 typedef struct cand *cand_t; 119 typedef const struct cand *const_cand_t; 127 struct cand struct 300 cand_hash (const void *cand) 302 const_cand_t c = (const_cand_t) cand; 344 insert_cand (cand_t cand) 348 entry_ptr = htab_find_slot (cand_table, cand, INSERT); 350 *entry_ptr = (void *) cand; 356 free_cand (void *cand) 358 free (cand); 298 cand_hash(const void *cand) argument 342 insert_cand(cand_t cand) argument 354 free_cand(void *cand) argument 510 cand_t cand = XNEW (struct cand); local 639 cand_t cand; local 807 cand_t cand = all_cands[i]; local 842 cand_t cand; local 933 cand_t cand = all_cands[cid]; local 1153 cand_t cand; local [all...] |
H A D | tree-ssa-loop-ivopts.c | 214 struct iv_cand *cand; /* The candidate. */ member in struct:cost_pair 616 dump_cand (FILE *file, struct iv_cand *cand) argument 618 struct iv *iv = cand->iv; 621 cand->id, cand->important ? " (important)" : ""); 623 if (cand->depends_on) 626 dump_bitmap (file, cand->depends_on); 635 if (cand->var_before) 638 print_generic_expr (file, cand->var_before, TDF_SLIM); 641 if (cand 714 stmt_after_inc_pos(struct iv_cand *cand, gimple stmt, bool true_if_equal) argument 735 stmt_after_increment(struct loop *loop, struct iv_cand *cand, gimple stmt) argument 2371 struct iv_cand *cand = NULL; local 2599 struct iv_cand *cand; local 2718 struct iv_cand *cand = iv_cand (data, i); local 2834 set_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, comp_cost cost, bitmap depends_on, tree value, enum tree_code comp, int inv_expr_id) argument 2881 get_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 3041 var_at_stmt(struct loop *loop, struct iv_cand *cand, gimple stmt) argument 3090 get_computation_aff(struct loop *loop, struct iv_use *use, struct iv_cand *cand, gimple at, struct aff_tree *aff) argument 3187 get_computation_at(struct loop *loop, struct iv_use *use, struct iv_cand *cand, gimple at) argument 3203 get_computation(struct loop *loop, struct iv_use *use, struct iv_cand *cand) argument 4155 get_computation_cost_at(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, bool address_p, bitmap *depends_on, gimple at, bool *can_autoinc, int *inv_expr_id) argument 4381 get_computation_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, bool address_p, bitmap *depends_on, bool *can_autoinc, int *inv_expr_id) argument 4395 determine_use_iv_cost_generic(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 4426 determine_use_iv_cost_address(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 4455 cand_value_at(struct loop *loop, struct iv_cand *cand, gimple at, tree niter, aff_tree *val) argument 4635 iv_elimination_compare_lt(struct ivopts_data *data, struct iv_cand *cand, enum tree_code *comp_p, struct tree_niter_desc *niter) argument 4732 may_eliminate_iv(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, tree *bound, enum tree_code *comp) argument 4857 determine_use_iv_cost_condition(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 4967 determine_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 4990 autoinc_possible_for_pair(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 5018 struct iv_cand *cand = iv_cand (data, i); local 5079 struct iv_cand *cand; local 5153 determine_iv_cost(struct ivopts_data *data, struct iv_cand *cand) argument 5213 struct iv_cand *cand = iv_cand (data, i); local 5484 struct iv_cand *cand; local 5633 iv_ca_cand_used_p(struct iv_ca *ivs, struct iv_cand *cand) argument 5740 iv_ca_extend(struct ivopts_data *data, struct iv_ca *ivs, struct iv_cand *cand, struct iv_ca_delta **delta, unsigned *n_ivs, bool min_ncand) argument 5786 iv_ca_narrow(struct ivopts_data *data, struct iv_ca *ivs, struct iv_cand *cand, struct iv_cand *start, struct iv_ca_delta **delta) argument 5887 struct iv_cand *cand; local 5934 struct iv_cand *cand; local 5963 struct iv_cand *cand; local 6039 struct iv_cand *cand; local 6171 struct iv_cand *cand; local 6321 create_new_iv(struct ivopts_data *data, struct iv_cand *cand) argument 6373 struct iv_cand *cand; local 6403 rewrite_use_nonlinear_expr(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 6532 adjust_iv_update_pos(struct iv_cand *cand, struct iv_use *use) argument 6591 rewrite_use_address(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 6631 rewrite_use_compare(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 6682 rewrite_use(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 6711 struct iv_cand *cand; local 6781 struct iv_cand *best_cand = NULL, *cand; local 6915 struct iv_cand *cand = iv_cand (data, i); local [all...] |
H A D | ree.c | 354 combine_set_extension (ext_cand *cand, rtx_insn *curr_insn, rtx *orig_set) argument 359 rtx cand_pat = PATTERN (cand->insn); 369 new_reg = gen_rtx_REG (cand->mode, REGNO (SET_DEST (cand_pat))); 371 new_reg = gen_rtx_REG (cand->mode, REGNO (SET_DEST (*orig_set))); 377 if (HARD_REGNO_NREGS (REGNO (new_reg), cand->mode) 386 && HOST_BITS_PER_WIDE_INT >= GET_MODE_BITSIZE (cand->mode)) 388 if (INTVAL (orig_src) >= 0 || cand->code == SIGN_EXTEND) 405 else if (GET_CODE (orig_src) == cand->code) 409 = gen_rtx_fmt_e (cand->code, cand 460 transform_ifelse(ext_cand *cand, rtx_insn *def_insn) argument 711 merge_def_and_ext(ext_cand *cand, rtx_insn *def_insn, ext_state *state) argument 770 combine_reaching_defs(ext_cand *cand, const_rtx set_pat, ext_state *state) argument 1025 ext_cand *cand; local [all...] |
H A D | ipa-prop.c | 4149 struct ipa_parm_adjustment *cand local 4151 if (!cand) 4155 if (cand->by_ref) 4156 src = build_simple_mem_ref (cand->new_decl); 4158 src = cand->new_decl; 4169 if (convert && !useless_type_conversion_p (TREE_TYPE (*expr), cand->type)) 4237 struct ipa_parm_adjustment *cand = NULL; local 4246 cand = adj; 4251 if (!cand || cand [all...] |
H A D | tree.c | 6366 check_base_type (const_tree cand, const_tree base) 6368 return (TYPE_NAME (cand) == TYPE_NAME (base) 6370 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base) 6372 && TYPE_ALIGN (cand) == TYPE_ALIGN (base) 6373 && attribute_list_equal (TYPE_ATTRIBUTES (cand), 6380 check_qualified_type (const_tree cand, const_tree base, int type_quals) 6382 return (TYPE_QUALS (cand) == type_quals 6383 && check_base_type (cand, base)); 6389 check_aligned_type (const_tree cand, const_tree base, unsigned int align) 6391 return (TYPE_QUALS (cand) 6344 check_base_type(const_tree cand, const_tree base) argument 6358 check_qualified_type(const_tree cand, const_tree base, int type_quals) argument 6367 check_aligned_type(const_tree cand, const_tree base, unsigned int align) argument 10373 tree cand; local [all...] |
H A D | gimple-ssa-strength-reduction.c | 330 slsr_cand_t cand; 541 slsr_cand_t one_basis = chain->cand; 632 node->cand = c; 1865 fprintf (dump_file, " -> %d", chain->cand->cand_num); 1868 fprintf (dump_file, " -> %d", p->cand->cand_num); 329 slsr_cand_t cand; member in struct:cand_chain_d
|
H A D | omp-low.c | 13112 struct ipa_parm_adjustment *cand = NULL; 13114 cand = ipa_get_adjustment_candidate (&tp, NULL, info->adjustments, true); 13122 if (cand) 13123 repl = unshare_expr (cand->new_decl); 13107 struct ipa_parm_adjustment *cand = NULL; local
|
H A D | tree.h | 3993 extern bool check_base_type (const_tree cand, const_tree base);
|
/haiku-buildtools/legacy/gcc/gcc/cp/ |
H A D | call.c | 865 struct z_candidate *cand; local 879 cand = build_user_type_conversion_1 881 if (cand) 882 conv = cand->second_conv; 887 cand = build_user_type_conversion_1 889 if (cand) 892 ICS_BAD_FLAG (cand->second_conv) = 1; 894 > ICS_BAD_FLAG (cand->second_conv))) 895 conv = build_conv (REF_BIND, to, cand->second_conv); 912 struct z_candidate *cand local 1793 struct z_candidate *cand; local 1945 struct z_candidate *candidates, *cand; local 2125 struct z_candidate *cand local 2163 struct z_candidate *candidates = 0, *cand; local 2245 struct z_candidate *candidates = 0, *cand; local 2388 struct z_candidate *candidates = 0, *cand; local 2933 struct z_candidate *cand local 3430 struct z_candidate *candidates = 0, *cand; local [all...] |
H A D | cvt.c | 1022 tree cand = TREE_VALUE (conv); 1024 if (winner && winner == cand) 1027 candidate = TREE_TYPE (TREE_TYPE (cand)); 1056 winner, cand); 1061 winner = cand; 1019 tree cand = TREE_VALUE (conv); local
|
/haiku-buildtools/gcc/gcc/cp/ |
H A D | call.c | 145 struct z_candidate *cand; member in struct:conversion 775 /* Note that the caller is responsible for filling in t->cand for 1675 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags, local 1677 if (cand) 1678 return cand->second_conv; 1736 && DECL_CONV_FN_P (t->cand->fn)) 1738 tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn)); 1871 struct z_candidate *cand; local 1878 cand = build_user_type_conversion_1 (to, expr, flags, complain); 1879 if (cand) 1903 struct z_candidate *cand = (struct z_candidate *) local 3018 struct z_candidate *cand; local 3197 struct z_candidate **cand; local 3597 struct z_candidate *candidates, *cand; local 3848 struct z_candidate *cand; local 3984 struct z_candidate *cand; local 4057 struct z_candidate *candidates, *cand; local 4146 struct z_candidate *cand; local 4235 struct z_candidate *candidates = 0, *cand; local 4565 struct z_candidate *cand; local 5315 struct z_candidate *candidates = 0, *cand; local 6246 struct z_candidate *cand = convs->cand; local 7051 build_over_call(struct z_candidate *cand, int flags, tsubst_flags_t complain) argument 7940 struct z_candidate *candidates = 0, *cand; local [all...] |
H A D | cvt.c | 1611 tree cand = TREE_VALUE (conv); 1612 cand = OVL_CURRENT (cand); 1614 if (winner && winner == cand) 1617 if (DECL_NONCONVERTING_P (cand)) 1620 candidate = non_reference (TREE_TYPE (TREE_TYPE (cand))); 1662 if (TREE_CODE (cand) == TEMPLATE_DECL) 1666 " argument for %qD", cand); 1684 winner, cand); 1690 winner = cand; 1609 tree cand = TREE_VALUE (conv); local [all...] |
H A D | tree.c | 1825 cp_check_qualified_type (const_tree cand, const_tree base, int type_quals, 1828 return (check_qualified_type (cand, base, type_quals) 1829 && comp_except_specs (raises, TYPE_RAISES_EXCEPTIONS (cand), 1831 && type_memfn_rqual (cand) == rqual); 1821 cp_check_qualified_type(const_tree cand, const_tree base, int type_quals, cp_ref_qualifier rqual, tree raises) argument
|
H A D | pt.c | 1798 tree cand = OVL_CURRENT (fn); local 1804 inform (DECL_SOURCE_LOCATION (cand), 1805 "candidate is: %#D", cand); local 1812 inform (DECL_SOURCE_LOCATION (cand), "%s %#D", *str, cand); local
|
/haiku-buildtools/binutils/gas/testsuite/gas/frv/ |
H A D | allinsn.s | 82 .global cand 83 cand: label 84 cand sp,sp,sp,cc0,0
|
H A D | allinsn.d | 66 0000004c <cand>: 67 4c: 83 68 10 01 cand sp,sp,sp,cc0,0x0
|
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/frv/ |
H A D | allinsn.s | 82 .global cand 83 cand: label 84 cand sp,sp,sp,cc0,0
|
H A D | allinsn.d | 66 0000004c <cand>: 67 4c: 83 68 10 01 cand sp,sp,sp,cc0,0x0
|