/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | lra-remat.c | 79 typedef struct cand *cand_t; 80 typedef const struct cand *const_cand_t; 88 struct cand struct 175 cand_hash (const void *cand) 177 const_cand_t c = (const_cand_t) cand; 219 insert_cand (cand_t cand) 223 entry_ptr = htab_find_slot (cand_table, cand, INSERT); 225 *entry_ptr = (void *) cand; 231 free_cand (void *cand) 233 free (cand); 174 cand_hash(const void *cand) argument 218 insert_cand(cand_t cand) argument 230 free_cand(void *cand) argument 405 cand_t cand = XNEW (struct cand); local 532 cand_t cand; local 734 cand_t cand = all_cands[i]; local 767 cand_t cand; local 860 cand_t cand = all_cands[cid]; local 1088 cand_t cand; local [all...] |
H A D | early-remat.c | 526 remat_candidate_hasher::hash (const remat_candidate *cand) argument 528 return cand->hash; 632 remat_candidate *cand; local 633 FOR_EACH_VEC_ELT (m_candidates, cand_index, cand) 635 fprintf (dump_file, ";; %5d %5d %8s ", cand_index, cand->regno, 636 GET_MODE_NAME (GET_MODE (regno_reg_rtx[cand->regno]))); 637 dump_insn_id (cand->insn); 638 if (!cand->can_copy_p) 795 remat_candidate cand; local 796 memset (&cand, 838 remat_candidate *cand = add_candidate (insn, regno, true); local 1043 remat_candidate *cand; local 1079 remat_candidate *cand; local 1179 remat_candidate *cand; local 1347 remat_candidate *cand = &m_candidates[cand_index]; local 1389 remat_candidate *cand = &m_candidates[cand_index]; local 1413 remat_candidate *cand = &m_candidates[cand_index]; local 1537 remat_candidate *cand = &m_candidates[cand_index]; local 1585 remat_candidate *cand = &m_candidates[cand_index]; local 1603 remat_candidate *cand = &m_candidates[cand_index]; local 1708 remat_candidate *cand = &m_candidates[cand_index]; local 1737 remat_candidate *cand = &m_candidates[cand_index]; local 1818 remat_candidate *cand = &m_candidates[cand_index]; local 2308 remat_candidate *cand = &m_candidates[cand_index]; local 2354 remat_candidate *cand = &m_candidates[cand_index]; local [all...] |
H A D | ree.c | 318 combine_set_extension (ext_cand *cand, rtx_insn *curr_insn, rtx *orig_set) argument 323 rtx cand_pat = single_set (cand->insn); 333 new_reg = gen_rtx_REG (cand->mode, REGNO (SET_DEST (cand_pat))); 335 new_reg = gen_rtx_REG (cand->mode, REGNO (SET_DEST (*orig_set))); 340 && HWI_COMPUTABLE_MODE_P (cand->mode)) 342 if (INTVAL (orig_src) >= 0 || cand->code == SIGN_EXTEND) 359 else if (GET_CODE (orig_src) == cand->code) 363 = gen_rtx_fmt_e (cand->code, cand->mode, XEXP (orig_src, 0)); 379 = gen_rtx_fmt_e (cand 414 transform_ifelse(ext_cand *cand, rtx_insn *def_insn) argument 704 merge_def_and_ext(ext_cand *cand, rtx_insn *def_insn, ext_state *state) argument 763 combine_reaching_defs(ext_cand *cand, const_rtx set_pat, ext_state *state) argument 1116 ext_cand *cand; local [all...] |
H A D | tree-ssa-loop-ivopts.c | 80 2) Add one doloop dedicated IV cand {(may_be_zero ? 1 : (niter + 1)), +, -1}, 82 like biv. For cost determination between doloop IV cand and IV use, the 85 Zero cost is assigned to the pair between doloop IV cand and doloop IV 389 struct iv_cand *cand; /* The candidate. */ variable in typeref:struct:iv_cand 474 struct iv *orig_iv; /* The original iv if this cand is added from biv with 852 dump_cand (FILE *file, struct iv_cand *cand) argument 854 struct iv *iv = cand->iv; 856 fprintf (file, "Candidate %d:\n", cand->id); 857 if (cand->inv_vars) 860 dump_bitmap (file, cand 947 stmt_after_inc_pos(struct iv_cand *cand, gimple *stmt, bool true_if_equal) argument 968 stmt_after_increment(class loop *loop, struct iv_cand *cand, gimple *stmt) argument 3086 struct iv_cand *cand = NULL; local 3321 struct iv_cand *cand; local 3594 struct iv_cand *cand = data->vcands[i]; local 3644 set_group_iv_cost(struct ivopts_data *data, struct iv_group *group, struct iv_cand *cand, comp_cost cost, bitmap inv_vars, tree value, enum tree_code comp, bitmap inv_exprs) argument 3692 get_group_iv_cost(struct ivopts_data *data, struct iv_group *group, struct iv_cand *cand) argument 3909 var_at_stmt(class loop *loop, struct iv_cand *cand, gimple *stmt) argument 3960 get_computation_aff_1(class loop *loop, gimple *at, struct iv_use *use, struct iv_cand *cand, class aff_tree *aff_inv, class aff_tree *aff_var, widest_int *prat = NULL) argument 4066 get_computation_aff(class loop *loop, gimple *at, struct iv_use *use, struct iv_cand *cand, class aff_tree *aff) argument 4104 get_computation_at(class loop *loop, gimple *at, struct iv_use *use, struct iv_cand *cand) argument 4120 get_debug_computation_at(class loop *loop, gimple *at, struct iv_use *use, struct iv_cand *cand) argument 4646 get_address_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, aff_tree *aff_inv, aff_tree *aff_var, HOST_WIDE_INT ratio, bitmap *inv_vars, iv_inv_expr_ent **inv_expr, bool *can_autoinc, bool speed) argument 4830 get_computation_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, bool address_p, bitmap *inv_vars, bool *can_autoinc, iv_inv_expr_ent **inv_expr) argument 4948 determine_group_iv_cost_generic(struct ivopts_data *data, struct iv_group *group, struct iv_cand *cand) argument 4979 determine_group_iv_cost_address(struct ivopts_data *data, struct iv_group *group, struct iv_cand *cand) argument 5040 cand_value_at(class loop *loop, struct iv_cand *cand, gimple *at, tree niter, aff_tree *val) argument 5221 iv_elimination_compare_lt(struct ivopts_data *data, struct iv_cand *cand, enum tree_code *comp_p, class tree_niter_desc *niter) argument 5318 may_eliminate_iv(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, tree *bound, enum tree_code *comp) argument 5453 determine_group_iv_cost_cond(struct ivopts_data *data, struct iv_group *group, struct iv_cand *cand) argument 5564 determine_group_iv_cost(struct ivopts_data *data, struct iv_group *group, struct iv_cand *cand) argument 5588 autoinc_possible_for_pair(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 5609 struct iv_cand *cand = data->vcands[i]; local 5753 struct iv_cand *cand; local 5868 determine_iv_cost(struct ivopts_data *data, struct iv_cand *cand) argument 5929 struct iv_cand *cand = data->vcands[i]; local 6229 struct iv_cand *cand; local 6373 iv_ca_cand_used_p(class iv_ca *ivs, struct iv_cand *cand) argument 6496 iv_ca_extend(struct ivopts_data *data, class iv_ca *ivs, struct iv_cand *cand, struct iv_ca_delta **delta, unsigned *n_ivs, bool min_ncand) argument 6549 iv_ca_narrow(struct ivopts_data *data, class iv_ca *ivs, struct iv_cand *cand, struct iv_cand *start, struct iv_ca_delta **delta) argument 6650 struct iv_cand *cand; local 6697 struct iv_cand *cand; local 6725 struct iv_cand *cand; local 6801 struct iv_cand *cand; local 6934 struct iv_cand *cand; local 7090 create_new_iv(struct ivopts_data *data, struct iv_cand *cand) argument 7151 struct iv_cand *cand; local 7183 rewrite_use_nonlinear_expr(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 7356 adjust_iv_update_pos(struct iv_cand *cand, struct iv_use *use) argument 7438 rewrite_use_address(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 7495 rewrite_use_compare(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 7551 struct iv_cand *cand = group->selected; local 7640 struct iv_cand *best_cand = NULL, *cand; local 7781 struct iv_cand *cand = data->vcands[i]; local [all...] |
H A D | hsa-regalloc.c | 390 hsa_op_reg *cand = active[cl][0]; local 391 if (cand->m_lr_end > reg->m_lr_end) 393 reg->m_reg_class = cand->m_reg_class; 394 reg->m_hard_num = cand->m_hard_num; 400 cand = reg; 402 gcc_assert (!cand->m_spill_sym); 403 BrigType16_t type = cand->m_type; 406 cand->m_reg_class = 0; 407 cand->m_spill_sym = hsa_get_spill_symbol (type); 408 cand [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | lra-remat.cc | 79 typedef struct cand *cand_t; 80 typedef const struct cand *const_cand_t; 88 struct cand struct 175 cand_hash (const void *cand) 177 const_cand_t c = (const_cand_t) cand; 219 insert_cand (cand_t cand) 223 entry_ptr = htab_find_slot (cand_table, cand, INSERT); 225 *entry_ptr = (void *) cand; 231 free_cand (void *cand) 233 free (cand); 174 cand_hash(const void *cand) argument 218 insert_cand(cand_t cand) argument 230 free_cand(void *cand) argument 405 cand_t cand = XNEW (struct cand); local 532 cand_t cand; local 734 cand_t cand = all_cands[i]; local 767 cand_t cand; local 860 cand_t cand = all_cands[cid]; local 1088 cand_t cand; local [all...] |
H A D | early-remat.cc | 526 remat_candidate_hasher::hash (const remat_candidate *cand) argument 528 return cand->hash; 632 remat_candidate *cand; local 633 FOR_EACH_VEC_ELT (m_candidates, cand_index, cand) 635 fprintf (dump_file, ";; %5d %5d %8s ", cand_index, cand->regno, 636 GET_MODE_NAME (GET_MODE (regno_reg_rtx[cand->regno]))); 637 dump_insn_id (cand->insn); 638 if (!cand->can_copy_p) 795 remat_candidate cand; local 796 memset (&cand, 838 remat_candidate *cand = add_candidate (insn, regno, true); local 1043 remat_candidate *cand; local 1079 remat_candidate *cand; local 1179 remat_candidate *cand; local 1347 remat_candidate *cand = &m_candidates[cand_index]; local 1389 remat_candidate *cand = &m_candidates[cand_index]; local 1413 remat_candidate *cand = &m_candidates[cand_index]; local 1537 remat_candidate *cand = &m_candidates[cand_index]; local 1585 remat_candidate *cand = &m_candidates[cand_index]; local 1603 remat_candidate *cand = &m_candidates[cand_index]; local 1708 remat_candidate *cand = &m_candidates[cand_index]; local 1737 remat_candidate *cand = &m_candidates[cand_index]; local 1818 remat_candidate *cand = &m_candidates[cand_index]; local 2308 remat_candidate *cand = &m_candidates[cand_index]; local 2354 remat_candidate *cand = &m_candidates[cand_index]; local [all...] |
H A D | ree.cc | 318 combine_set_extension (ext_cand *cand, rtx_insn *curr_insn, rtx *orig_set) argument 323 rtx cand_pat = single_set (cand->insn); 333 new_reg = gen_rtx_REG (cand->mode, REGNO (SET_DEST (cand_pat))); 335 new_reg = gen_rtx_REG (cand->mode, REGNO (SET_DEST (*orig_set))); 340 && HWI_COMPUTABLE_MODE_P (cand->mode)) 342 if (INTVAL (orig_src) >= 0 || cand->code == SIGN_EXTEND) 359 else if (GET_CODE (orig_src) == cand->code) 363 = gen_rtx_fmt_e (cand->code, cand->mode, XEXP (orig_src, 0)); 379 = gen_rtx_fmt_e (cand 414 transform_ifelse(ext_cand *cand, rtx_insn *def_insn) argument 705 merge_def_and_ext(ext_cand *cand, rtx_insn *def_insn, ext_state *state) argument 763 combine_reaching_defs(ext_cand *cand, const_rtx set_pat, ext_state *state) argument 1114 ext_cand *cand; local [all...] |
H A D | tree-ssa-loop-ivopts.cc | 80 2) Add one doloop dedicated IV cand {(may_be_zero ? 1 : (niter + 1)), +, -1}, 82 like biv. For cost determination between doloop IV cand and IV use, the 85 Zero cost is assigned to the pair between doloop IV cand and doloop IV 389 struct iv_cand *cand; /* The candidate. */ member in class:cost_pair 475 struct iv *orig_iv; /* The original iv if this cand is added from biv with 853 dump_cand (FILE *file, struct iv_cand *cand) argument 855 struct iv *iv = cand->iv; 857 fprintf (file, "Candidate %d:\n", cand->id); 858 if (cand->inv_vars) 861 dump_bitmap (file, cand 948 stmt_after_inc_pos(struct iv_cand *cand, gimple *stmt, bool true_if_equal) argument 969 stmt_after_increment(class loop *loop, struct iv_cand *cand, gimple *stmt) argument 3105 struct iv_cand *cand = NULL; local 3352 struct iv_cand *cand; local 3625 struct iv_cand *cand = data->vcands[i]; local 3675 set_group_iv_cost(struct ivopts_data *data, struct iv_group *group, struct iv_cand *cand, comp_cost cost, bitmap inv_vars, tree value, enum tree_code comp, bitmap inv_exprs) argument 3723 get_group_iv_cost(struct ivopts_data *data, struct iv_group *group, struct iv_cand *cand) argument 3940 var_at_stmt(class loop *loop, struct iv_cand *cand, gimple *stmt) argument 3991 get_computation_aff_1(class loop *loop, gimple *at, struct iv_use *use, struct iv_cand *cand, class aff_tree *aff_inv, class aff_tree *aff_var, widest_int *prat = NULL) argument 4097 get_computation_aff(class loop *loop, gimple *at, struct iv_use *use, struct iv_cand *cand, class aff_tree *aff) argument 4135 get_computation_at(class loop *loop, gimple *at, struct iv_use *use, struct iv_cand *cand) argument 4151 get_debug_computation_at(class loop *loop, gimple *at, struct iv_use *use, struct iv_cand *cand) argument 4677 get_address_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, aff_tree *aff_inv, aff_tree *aff_var, HOST_WIDE_INT ratio, bitmap *inv_vars, iv_inv_expr_ent **inv_expr, bool *can_autoinc, bool speed) argument 4861 get_computation_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, bool address_p, bitmap *inv_vars, bool *can_autoinc, iv_inv_expr_ent **inv_expr) argument 4979 determine_group_iv_cost_generic(struct ivopts_data *data, struct iv_group *group, struct iv_cand *cand) argument 5015 determine_group_iv_cost_address(struct ivopts_data *data, struct iv_group *group, struct iv_cand *cand) argument 5076 cand_value_at(class loop *loop, struct iv_cand *cand, gimple *at, class tree_niter_desc *desc, aff_tree *val) argument 5286 iv_elimination_compare_lt(struct ivopts_data *data, struct iv_cand *cand, enum tree_code *comp_p, class tree_niter_desc *niter) argument 5518 determine_group_iv_cost_cond(struct ivopts_data *data, struct iv_group *group, struct iv_cand *cand) argument 5629 determine_group_iv_cost(struct ivopts_data *data, struct iv_group *group, struct iv_cand *cand) argument 5653 autoinc_possible_for_pair(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 5674 struct iv_cand *cand = data->vcands[i]; local 5883 struct iv_cand *cand; local 5998 determine_iv_cost(struct ivopts_data *data, struct iv_cand *cand) argument 6059 struct iv_cand *cand = data->vcands[i]; local 6359 struct iv_cand *cand; local 6503 iv_ca_cand_used_p(class iv_ca *ivs, struct iv_cand *cand) argument 6626 iv_ca_extend(struct ivopts_data *data, class iv_ca *ivs, struct iv_cand *cand, struct iv_ca_delta **delta, unsigned *n_ivs, bool min_ncand) argument 6679 iv_ca_narrow(struct ivopts_data *data, class iv_ca *ivs, struct iv_cand *cand, struct iv_cand *start, struct iv_ca_delta **delta) argument 6780 struct iv_cand *cand; local 6827 struct iv_cand *cand; local 6855 struct iv_cand *cand; local 6931 struct iv_cand *cand; local 7064 struct iv_cand *cand; local 7220 create_new_iv(struct ivopts_data *data, struct iv_cand *cand) argument 7281 struct iv_cand *cand; local 7313 rewrite_use_nonlinear_expr(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 7487 adjust_iv_update_pos(struct iv_cand *cand, struct iv_use *use) argument 7571 rewrite_use_address(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 7628 rewrite_use_compare(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument 7684 struct iv_cand *cand = group->selected; local 7773 struct iv_cand *best_cand = NULL, *cand; local 7913 struct iv_cand *cand = data->vcands[i]; local [all...] |
/netbsd-current/external/bsd/wpa/dist/src/rsn_supp/ |
H A D | preauth.c | 371 struct rsn_pmksa_candidate *cand, *pos; local 385 cand = NULL; 389 cand = pos; 394 if (cand) { 395 dl_list_del(&cand->list); 397 cand->priority = prio; 399 cand = os_zalloc(sizeof(*cand)); 400 if (cand == NULL) 402 os_memcpy(cand [all...] |
/netbsd-current/sys/arch/ia64/stand/common/ |
H A D | bcache.c | 267 int cand, ocount; local 271 cand = 0; /* assume the first block */ 278 cand = i; 283 cand = i; 287 DEBUG("insert blk %d -> %d @ %d # %d", blkno, cand, now, bcache_bcount); 288 memcpy(bcache_data + (bcache_blksize * cand), buf, bcache_blksize); 289 bcache_ctl[cand].bc_blkno = blkno; 290 bcache_ctl[cand].bc_stamp = now; 291 bcache_ctl[cand].bc_count = bcache_bcount++;
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/fortran/ |
H A D | misc.c | 409 char **cand = candidates; local 413 while (cand && *cand) 415 edit_distance_t dist = get_edit_distance (typo, tl, *cand, 416 strlen (*cand)); 420 best = *cand; 422 cand++;
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/common/config/arm/ |
H A D | arm-common.c | 802 for (const cpu_arch_extension *cand = selected_arch->common.extensions; 803 cand->name != NULL; 804 cand++) 806 if (cand->remove || cand->alias) 812 arm_initialize_isa (isa_bits, cand->isa_bits); 815 extensions.push_back (new candidate_extension (cand, isa_bits)); 839 for (const cpu_arch_extension *cand = selected_arch->common.extensions; 840 cand->name != NULL; 841 cand [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/common/config/arm/ |
H A D | arm-common.cc | 849 for (const cpu_arch_extension *cand = selected_arch->common.extensions; 850 cand->name != NULL; 851 cand++) 853 if (cand->remove || cand->alias) 859 arm_initialize_isa (isa_bits, cand->isa_bits); 862 extensions.push_back (new candidate_extension (cand, isa_bits)); 886 for (const cpu_arch_extension *cand = selected_arch->common.extensions; 887 cand->name != NULL; 888 cand [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/cp/ |
H A D | call.cc | 138 struct z_candidate *cand; member in struct:conversion 790 /* Note that the caller is responsible for filling in t->cand for 1893 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags, local 1895 if (cand) 1896 return cand->second_conv; 1958 && DECL_CONV_FN_P (t->cand->fn)) 1960 tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn)); 2095 struct z_candidate *cand; local 2102 cand = build_user_type_conversion_1 (to, expr, flags, complain); 2103 if (cand) 2182 struct z_candidate *cand = (struct z_candidate *) local 3410 struct z_candidate *cand; local 3689 struct z_candidate **cand; local 4138 struct z_candidate *candidates, *cand; local 4443 struct z_candidate *cand; local 4702 struct z_candidate *cand; local 4789 z_candidate *cand = perform_overload_resolution (dguides, args, &candidates, local 4814 struct z_candidate *candidates, *cand; local 4890 struct z_candidate *cand = NULL; local 5004 struct z_candidate *candidates = 0, *cand; local 5343 struct z_candidate *cand; local 6022 perfect_candidate_p(z_candidate *cand) argument 6044 missing_conversion_p(const z_candidate *cand) argument 6223 z_candidate *cand = *candidates; local 6405 z_candidate *cand = *candp; local 6502 struct z_candidate *candidates = 0, *cand; local 6979 struct z_candidate *candidates = 0, *cand; local 7939 struct z_candidate *cand = convs->cand; local 9211 build_over_call(struct z_candidate *cand, int flags, tsubst_flags_t complain) argument 10858 struct z_candidate *candidates = 0, *cand; local 11963 joust_maybe_elide_copy(z_candidate *&cand) argument [all...] |
H A D | cvt.cc | 1836 tree cand = TREE_VALUE (conv); 1837 cand = OVL_FIRST (cand); 1839 if (winner && winner == cand) 1842 if (DECL_NONCONVERTING_P (cand)) 1845 candidate = non_reference (TREE_TYPE (TREE_TYPE (cand))); 1887 if (TREE_CODE (cand) == TEMPLATE_DECL) 1891 " argument for %qD", cand); 1909 winner, cand); 1915 winner = cand; 1834 tree cand = TREE_VALUE (conv); local [all...] |
/netbsd-current/usr.bin/make/ |
H A D | suff.c | 926 CandidateSearcher_Add(CandidateSearcher *cs, Candidate *cand) argument 929 Lst_Append(&cs->list, cand); 933 CandidateSearcher_AddIfNew(CandidateSearcher *cs, Candidate *cand) argument 936 if (Lst_FindDatum(&cs->list, cand) == NULL) 937 Lst_Append(&cs->list, cand); 955 Candidate *cand = ln->datum; local 956 debug_printf(" %p:%s", cand, cand->file); 966 Candidate *cand = bmake_malloc(sizeof *cand); local 987 Candidate *cand = Candidate_New(srcName, targ->prefix, suff, targ, local 1005 CandidateList_AddCandidatesFor(CandidateList *list, Candidate *cand) argument [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/fortran/ |
H A D | misc.cc | 411 char **cand = candidates; local 415 while (cand && *cand) 417 edit_distance_t dist = get_edit_distance (typo, tl, *cand, 418 strlen (*cand)); 422 best = *cand; 424 cand++;
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/cp/ |
H A D | call.c | 138 struct z_candidate *cand; member in struct:conversion 778 /* Note that the caller is responsible for filling in t->cand for 1866 z_candidate *cand = build_user_type_conversion_1 (rto, expr, flags, local 1868 if (cand) 1869 return cand->second_conv; 1931 && DECL_CONV_FN_P (t->cand->fn)) 1933 tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn)); 2070 struct z_candidate *cand; local 2077 cand = build_user_type_conversion_1 (to, expr, flags, complain); 2078 if (cand) 2136 struct z_candidate *cand = (struct z_candidate *) local 3338 struct z_candidate *cand; local 3549 struct z_candidate **cand; local 3982 struct z_candidate *candidates, *cand; local 4268 struct z_candidate *cand; local 4495 struct z_candidate *cand; local 4574 struct z_candidate *candidates, *cand; local 4658 struct z_candidate *cand = NULL; local 4763 struct z_candidate *candidates = 0, *cand; local 5114 struct z_candidate *cand; local 6007 z_candidate *cand = *candp; local 6104 struct z_candidate *candidates = 0, *cand; local 7481 struct z_candidate *cand = convs->cand; local 8491 build_over_call(struct z_candidate *cand, int flags, tsubst_flags_t complain) argument 10120 struct z_candidate *candidates = 0, *cand; local 11217 joust_maybe_elide_copy(z_candidate *&cand) argument [all...] |
H A D | cvt.c | 1817 tree cand = TREE_VALUE (conv); 1818 cand = OVL_FIRST (cand); 1820 if (winner && winner == cand) 1823 if (DECL_NONCONVERTING_P (cand)) 1826 candidate = non_reference (TREE_TYPE (TREE_TYPE (cand))); 1868 if (TREE_CODE (cand) == TEMPLATE_DECL) 1872 " argument for %qD", cand); 1890 winner, cand); 1896 winner = cand; 1815 tree cand = TREE_VALUE (conv); local [all...] |
/netbsd-current/sys/arch/arm/altera/ |
H A D | cycv_clkmgr.c | 333 struct cycv_clk_mux_info *cand = &cycv_clk_mux_tree[i]; local 334 if (strncmp(name, cand->name, strlen(cand->name)) == 0) 335 return cand; 360 struct cycv_clk *cand = &sc->sc_clocks[i]; local 361 if (strncmp(cand->base.name, name, strlen(name)) == 0) 362 return cand;
|
/netbsd-current/external/bsd/libarchive/dist/libarchive/ |
H A D | archive_read_support_format_warc.c | 465 const char *cand; 500 for (cand = hay; hp < eoh; hp++) { 501 hsum ^= *cand++; 508 if (hsum == nsum && memcmp(cand, needle, needlesize - 1U) == 0) { 509 return deconst(cand); 464 const char *cand; local
|
/netbsd-current/external/mpl/dhcp/dist/server/ |
H A D | mdb.c | 2090 * 'cand' and 'lease' names are retained to read more clearly against 2103 client_lease_preferred(struct lease *cand, struct lease *lease) argument 2105 if (cand->binding_state == FTS_ACTIVE) { 2107 lease->ends >= cand->ends) 2109 } else if (cand->binding_state == FTS_EXPIRED || 2110 cand->binding_state == FTS_RELEASED) { 2116 lease->cltt >= cand->cltt) 2118 } else if (cand->binding_state != FTS_ABANDONED) { 2125 lease->cltt >= cand->cltt) 2127 } else /* (cand 2141 struct lease *cand = NULL; local 2258 struct lease *cand = NULL; local [all...] |
/netbsd-current/lib/libpuffs/ |
H A D | framebuf.c | 623 struct puffs_framebuf *cand; local 626 TAILQ_FOREACH(cand, &fio->res_qing, pfb_entries) 627 if (fctrl->cmpfb(pu, findme, cand, ¬resp) == 0 || notresp) 630 assert(!(notresp && cand == NULL)); 631 if (notresp || cand == NULL) 634 TAILQ_REMOVE(&fio->res_qing, cand, pfb_entries); 635 return cand;
|
/netbsd-current/external/apache2/llvm/dist/libcxx/utils/ |
H A D | generate_feature_test_macro_components.py | 719 for cand in candidates: 720 if cand in d.keys(): 721 return cand
|