Searched refs:cand (Results 1 - 12 of 12) sorted by relevance

/freebsd-11-stable/contrib/gcc/
H A Dtree-ssa-loop-ivopts.c135 struct iv_cand *cand; /* The candidate. */ member in struct:cost_pair
474 dump_cand (FILE *file, struct iv_cand *cand) argument
476 struct iv *iv = cand->iv;
479 cand->id, cand->important ? " (important)" : "");
481 if (cand->depends_on)
484 dump_bitmap (file, cand->depends_on);
493 switch (cand->pos)
601 stmt_after_ip_original_pos (struct iv_cand *cand, tree stmt) argument
603 basic_block cand_bb = bb_for_stmt (cand
628 stmt_after_increment(struct loop *loop, struct iv_cand *cand, tree stmt) argument
1981 struct iv_cand *cand = NULL; local
2148 struct iv_cand *cand; local
2251 struct iv_cand *cand = iv_cand (data, i); local
2336 set_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, unsigned cost, bitmap depends_on, tree value) argument
2378 get_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
2532 var_at_stmt(struct loop *loop, struct iv_cand *cand, tree stmt) argument
3031 get_computation_aff(struct loop *loop, struct iv_use *use, struct iv_cand *cand, tree at, struct affine_tree_combination *aff) argument
3198 get_computation_at(struct loop *loop, struct iv_use *use, struct iv_cand *cand, tree at) argument
3214 get_computation(struct loop *loop, struct iv_use *use, struct iv_cand *cand) argument
3846 get_computation_cost_at(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, bool address_p, bitmap *depends_on, tree at) argument
4011 get_computation_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, bool address_p, bitmap *depends_on) argument
4023 determine_use_iv_cost_generic(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
4049 determine_use_iv_cost_address(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
4077 cand_value_at(struct loop *loop, struct iv_cand *cand, tree at, tree niter) argument
4132 may_eliminate_iv(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, tree *bound) argument
4191 determine_use_iv_cost_condition(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
4240 determine_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
4266 struct iv_cand *cand; local
4337 determine_iv_cost(struct ivopts_data *data, struct iv_cand *cand) argument
4387 struct iv_cand *cand = iv_cand (data, i); local
4788 iv_ca_cand_used_p(struct iv_ca *ivs, struct iv_cand *cand) argument
4877 iv_ca_extend(struct ivopts_data *data, struct iv_ca *ivs, struct iv_cand *cand, struct iv_ca_delta **delta, unsigned *n_ivs) argument
4921 iv_ca_narrow(struct ivopts_data *data, struct iv_ca *ivs, struct iv_cand *cand, struct iv_ca_delta **delta) argument
5012 struct iv_cand *cand; local
5060 struct iv_cand *cand; local
5176 struct iv_cand *cand; local
5276 create_new_iv(struct ivopts_data *data, struct iv_cand *cand) argument
5323 struct iv_cand *cand; local
5360 rewrite_use_nonlinear_expr(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
5585 rewrite_use_address(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
5604 rewrite_use_compare(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
5652 rewrite_use(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand) argument
5681 struct iv_cand *cand; local
5758 struct iv_cand *cand = iv_cand (data, i); local
[all...]
H A Dtree.c3841 /* Returns true iff cand is equivalent to base with type_quals. */
3844 check_qualified_type (tree cand, tree base, int type_quals)
3846 return (TYPE_QUALS (cand) == type_quals
3847 && TYPE_NAME (cand) == TYPE_NAME (base)
3849 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3850 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3822 check_qualified_type(tree cand, tree base, int type_quals) argument
/freebsd-11-stable/contrib/wpa/src/rsn_supp/
H A Dpreauth.c371 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...]
/freebsd-11-stable/contrib/gcc/cp/
H A Dcall.c112 struct z_candidate *cand; member in struct:conversion
918 struct z_candidate *cand; local
961 cand = NULL;
967 cand = add_template_candidate (&candidates,
977 if (cand)
983 f = cand->fn;
989 cand = NULL;
995 cand = add_function_candidate (&candidates, f, s, arglist,
1000 if (cand)
1008 (TREE_TYPE (cand
1288 struct z_candidate *cand; local
1314 struct z_candidate *cand = (struct z_candidate *) local
2231 struct z_candidate *cand; local
2358 struct z_candidate **cand; local
2543 struct z_candidate *candidates, *cand; local
2710 struct z_candidate *cand local
2764 struct z_candidate *cand; local
2806 struct z_candidate *candidates, *cand; local
2877 struct z_candidate *cand; local
2970 struct z_candidate *candidates = 0, *cand; local
3207 struct z_candidate *cand; local
3677 struct z_candidate *candidates = 0, *cand; local
4313 struct z_candidate *cand = convs->cand; local
4774 build_over_call(struct z_candidate *cand, int flags) argument
5364 struct z_candidate *candidates = 0, *cand; local
[all...]
H A Dcvt.c1153 tree cand = TREE_VALUE (conv);
1155 if (winner && winner == cand)
1158 candidate = non_reference (TREE_TYPE (TREE_TYPE (cand)));
1202 winner, cand);
1207 winner = cand;
1151 tree cand = TREE_VALUE (conv); local
/freebsd-11-stable/stand/common/
H A Dbcache.c443 u_int cand; local
445 cand = BHASH(bc, blkno);
447 DPRINTF("insert blk %llu -> %u # %d", blkno, cand, bcache_bcount);
448 bc->bcache_ctl[cand].bc_blkno = blkno;
449 bc->bcache_ctl[cand].bc_count = bcache_bcount++;
/freebsd-11-stable/sys/x86/x86/
H A Dx86_mem.c160 struct mem_range_desc *cand; local
163 for (i = 0, cand = sc->mr_desc; i < sc->mr_ndesc; i++, cand++)
164 if ((cand->mr_base == mrd->mr_base) &&
165 (cand->mr_len == mrd->mr_len))
166 return (cand);
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_read_support_format_warc.c458 const char *cand;
493 for (cand = hay; hp < eoh; hp++) {
494 hsum ^= *cand++;
501 if (hsum == nsum && memcmp(cand, needle, needlesize - 1U) == 0) {
502 return deconst(cand);
457 const char *cand; local
/freebsd-11-stable/sys/dev/netmap/
H A Dnetmap_bdg.c398 uint32_t cand = NM_BDG_NOPORT, cand2 = NM_BDG_NOPORT; local
446 cand = b->bdg_port_index[b->bdg_active_ports];
449 b->bdg_basename, ifname, b->bdg_active_ports, cand, cand2);
517 vpna->bdg_port = cand;
518 nm_prdis("NIC %p to bridge port %d", vpna, cand);
520 b->bdg_ports[cand] = vpna;
/freebsd-11-stable/contrib/wpa/wpa_supplicant/
H A Dp2p_supplicant.c5966 unsigned int cand; local
6063 cand = wpas_p2p_pick_best_used_freq(wpa_s, freqs, num);
6064 if (wpas_p2p_supported_freq_go(wpa_s, channels, cand)) {
6067 cand);
6068 params->freq = cand;
6152 cand = p2p_get_pref_freq(wpa_s->global->p2p, channels);
6153 if (cand && wpas_p2p_supported_freq_go(wpa_s, channels, cand)) {
6154 params->freq = cand;
6167 cand
9068 u8 curr_chan, cand, chan; local
[all...]
/freebsd-11-stable/usr.bin/diff/
H A Ddiffreg.c166 struct cand { struct
231 static struct cand *clist; /* merely a free storage pot for candidates */
701 struct cand *q;
741 struct cand *q;
/freebsd-11-stable/contrib/wpa/src/drivers/
H A Ddriver_nl80211_event.c1434 struct nlattr *cand[NUM_NL80211_PMKSA_CANDIDATE]; local
1448 nla_parse_nested(cand, MAX_NL80211_PMKSA_CANDIDATE,
1450 !cand[NL80211_PMKSA_CANDIDATE_INDEX] ||
1451 !cand[NL80211_PMKSA_CANDIDATE_BSSID])
1456 nla_data(cand[NL80211_PMKSA_CANDIDATE_BSSID]), ETH_ALEN);
1458 nla_get_u32(cand[NL80211_PMKSA_CANDIDATE_INDEX]);
1460 cand[NL80211_PMKSA_CANDIDATE_PREAUTH] != NULL;

Completed in 277 milliseconds