HomeSort by: relevance | last modified time | path
    Searched defs:cand (Results 1 - 25 of 42) sorted by relevancy

1 2

  /src/sys/arch/ia64/stand/common/
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++;
  /src/external/bsd/wpa/dist/src/rsn_supp/
preauth.c 381 struct rsn_pmksa_candidate *cand, *pos; local
395 cand = NULL;
399 cand = pos;
404 if (cand) {
405 dl_list_del(&cand->list);
407 cand->priority = prio;
409 cand = os_zalloc(sizeof(*cand));
410 if (cand == NULL)
412 os_memcpy(cand->bssid, bssid, ETH_ALEN)
    [all...]
  /src/external/gpl3/gcc/dist/gcc/fortran/
misc.cc 416 char **cand = candidates; local
420 while (cand && *cand)
422 edit_distance_t dist = get_edit_distance (typo, tl, *cand,
423 strlen (*cand));
427 best = *cand;
429 cand++;
  /src/external/gpl3/gcc.old/dist/gcc/fortran/
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++;
  /src/external/bsd/libarchive/dist/libarchive/
archive_read_support_format_warc.c 468 const char *cand;
503 for (cand = hay; hp < eoh; hp++) {
504 hsum ^= *cand++;
510 * also CAND is by design < HP, so no need for range checks */
511 if (hsum == nsum && memcmp(cand, needle, needlesize - 1U) == 0) {
512 return deconst(cand);
467 const char *cand; local
  /src/lib/libpuffs/
framebuf.c 623 struct puffs_framebuf *cand; local
626 TAILQ_FOREACH(cand, &fio->res_qing, pfb_entries)
627 if (fctrl->cmpfb(pu, findme, cand, &notresp) == 0 || notresp)
630 assert(!(notresp && cand == NULL));
631 if (notresp || cand == NULL)
634 TAILQ_REMOVE(&fio->res_qing, cand, pfb_entries);
635 return cand;
  /src/sys/arch/arm/altera/
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;
  /src/external/gpl3/gcc/dist/gcc/cp/
cvt.cc 1882 tree cand = TREE_VALUE (conv);
1883 cand = OVL_FIRST (cand);
1885 if (winner && winner == cand)
1888 if (DECL_NONCONVERTING_P (cand))
1891 candidate = non_reference (TREE_TYPE (TREE_TYPE (cand)));
1933 if (TREE_CODE (cand) == TEMPLATE_DECL)
1937 " argument for %qD", cand);
1955 winner, cand);
1961 winner = cand;
1880 tree cand = TREE_VALUE (conv); local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
ree.cc 300 /* Given a insn (CURR_INSN), an extension candidate for removal (CAND)
318 combine_set_extension (ext_cand *cand, rtx_insn *curr_insn, rtx *orig_set)
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))
1114 ext_cand *cand; local
    [all...]
lra-remat.cc 79 typedef struct cand *cand_t;
80 typedef const struct cand *const_cand_t;
88 struct cand struct
173 /* Hash function for candidate CAND. */
175 cand_hash (const void *cand)
177 const_cand_t c = (const_cand_t) cand;
216 /* Insert candidate CAND into the table if it is not there yet.
219 insert_cand (cand_t cand)
223 entry_ptr = htab_find_slot (cand_table, cand, INSERT);
225 *entry_ptr = (void *) cand;
405 cand_t cand = XNEW (struct cand); local
534 cand_t cand; local
736 cand_t cand = all_cands[i]; local
769 cand_t cand; local
862 cand_t cand = all_cands[cid]; local
1090 cand_t cand; local
    [all...]
early-remat.cc 526 remat_candidate_hasher::hash (const remat_candidate *cand)
528 return cand->hash;
630 remat_candidate *cand; local
631 FOR_EACH_VEC_ELT (m_candidates, cand_index, cand)
633 fprintf (dump_file, ";; %5d %5d %8s ", cand_index, cand->regno,
634 GET_MODE_NAME (GET_MODE (regno_reg_rtx[cand->regno])));
635 dump_insn_id (cand->insn);
636 if (!cand->can_copy_p)
793 remat_candidate cand; local
794 memset (&cand, 0, sizeof (cand))
836 remat_candidate *cand = add_candidate (insn, regno, true); local
1041 remat_candidate *cand; local
1077 remat_candidate *cand; local
1177 remat_candidate *cand; local
1345 remat_candidate *cand = &m_candidates[cand_index]; local
1387 remat_candidate *cand = &m_candidates[cand_index]; local
1411 remat_candidate *cand = &m_candidates[cand_index]; local
1535 remat_candidate *cand = &m_candidates[cand_index]; local
1583 remat_candidate *cand = &m_candidates[cand_index]; local
1601 remat_candidate *cand = &m_candidates[cand_index]; local
1706 remat_candidate *cand = &m_candidates[cand_index]; local
1735 remat_candidate *cand = &m_candidates[cand_index]; local
1816 remat_candidate *cand = &m_candidates[cand_index]; local
2306 remat_candidate *cand = &m_candidates[cand_index]; local
2352 remat_candidate *cand = &m_candidates[cand_index]; local
    [all...]
gimple-ssa-strength-reduction.cc 313 slsr_cand_t cand;
559 slsr_cand_t one_basis = chain->cand;
657 node->cand = c;
1930 fprintf (dump_file, " -> %d", chain->cand->cand_num);
1933 fprintf (dump_file, " -> %d", p->cand->cand_num);
312 slsr_cand_t cand; member in struct:cand_chain_d
targhooks.cc 552 opt_scalar_float_mode cand; local
561 cand = HFmode;
567 cand = SFmode;
573 cand = DFmode;
579 cand = TFmode;
586 if (cand.exists (&mode)
590 return cand;
  /src/external/gpl3/gcc.old/dist/gcc/cp/
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...]
  /src/external/gpl3/gcc.old/dist/gcc/
ree.cc 300 /* Given a insn (CURR_INSN), an extension candidate for removal (CAND)
318 combine_set_extension (ext_cand *cand, rtx_insn *curr_insn, rtx *orig_set)
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))
1114 ext_cand *cand; local
    [all...]
lra-remat.cc 79 typedef struct cand *cand_t;
80 typedef const struct cand *const_cand_t;
88 struct cand struct
173 /* Hash function for candidate CAND. */
175 cand_hash (const void *cand)
177 const_cand_t c = (const_cand_t) cand;
216 /* Insert candidate CAND into the table if it is not there yet.
219 insert_cand (cand_t cand)
223 entry_ptr = htab_find_slot (cand_table, cand, INSERT);
225 *entry_ptr = (void *) cand;
405 cand_t cand = XNEW (struct cand); local
534 cand_t cand; local
736 cand_t cand = all_cands[i]; local
769 cand_t cand; local
862 cand_t cand = all_cands[cid]; local
1090 cand_t cand; local
    [all...]
early-remat.cc 526 remat_candidate_hasher::hash (const remat_candidate *cand)
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, 0, sizeof (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...]
gimple-ssa-strength-reduction.cc 313 slsr_cand_t cand;
559 slsr_cand_t one_basis = chain->cand;
657 node->cand = c;
1930 fprintf (dump_file, " -> %d", chain->cand->cand_num);
1933 fprintf (dump_file, " -> %d", p->cand->cand_num);
312 slsr_cand_t cand; member in struct:cand_chain_d
  /src/usr.bin/diff/
diffreg.c 147 struct cand { struct
217 static struct cand *clist; /* merely a free storage pot for candidates */
630 struct cand *q;
670 struct cand *q;
  /src/usr.bin/make/
suff.c 926 CandidateSearcher_Add(CandidateSearcher *cs, Candidate *cand)
929 Lst_Append(&cs->list, cand);
933 CandidateSearcher_AddIfNew(CandidateSearcher *cs, Candidate *cand)
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
986 Candidate *cand = Candidate_New(srcName, targ->prefix, suff, targ, local
    [all...]
  /src/external/bsd/wpa/dist/src/drivers/
driver_wext.c 323 const struct iw_pmkid_cand *cand; local
327 if (len < sizeof(*cand))
330 cand = (const struct iw_pmkid_cand *) ev;
331 addr = (const u8 *) cand->bssid.sa_data;
334 "flags=0x%x index=%d bssid=" MACSTR, cand->flags,
335 cand->index, MAC2STR(addr));
339 data.pmkid_candidate.index = cand->index;
340 data.pmkid_candidate.preauth = cand->flags & IW_PMKID_CAND_PREAUTH;
driver_nl80211_event.c 2315 struct nlattr *cand[NUM_NL80211_PMKSA_CANDIDATE]; local
2329 nla_parse_nested(cand, MAX_NL80211_PMKSA_CANDIDATE,
2331 !cand[NL80211_PMKSA_CANDIDATE_INDEX] ||
2332 !cand[NL80211_PMKSA_CANDIDATE_BSSID])
2337 nla_data(cand[NL80211_PMKSA_CANDIDATE_BSSID]), ETH_ALEN);
2339 nla_get_u32(cand[NL80211_PMKSA_CANDIDATE_INDEX]);
2341 cand[NL80211_PMKSA_CANDIDATE_PREAUTH] != NULL;
  /src/external/mpl/dhcp/dist/server/
mdb.c 2090 * 'cand' and 'lease' names are retained to read more clearly against
2103 client_lease_preferred(struct lease *cand, struct lease *lease)
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->binding_state == FTS_ABANDONED) */
2141 struct lease *cand = NULL; local
2258 struct lease *cand = NULL; local
    [all...]
  /src/external/mpl/dhcp/dist/client/
dhc6.c 3430 struct dhc6_lease **rpos, *rval, **candp, *cand; local
3440 cand = *candp;
3448 for (; cand != NULL ; candp = &cand->next, cand = *candp) {
3449 cscore = dhc6_score_lease(client, cand);
3452 print_hex_1(cand->server_id.len,
3453 cand->server_id.data, 48),
3454 cscore, (unsigned)cand->pref);
3480 } else if (cand->pref < rval->pref)
    [all...]
  /src/external/gpl3/gcc/dist/gcc/config/aarch64/
aarch64-ldp-fusion.cc 1247 insn_info *cand = def->insn ();
1248 gcc_assert (*cand > *pair_dst);
1252 // If CAND doesn't also use our base register,
1254 if (!find_access (cand->uses (), base_regno))
1257 auto rti = cand->rtl ();
1301 insn_info *hazard = latest_hazard_before (cand, nullptr, insns[1]);
1309 cand->uid ());
1314 return cand;
1322 cand->uid (), hazard->uid ());
2230 "assuming aliasing of cand i%d and i%d:\n
2648 base_cand &cand = base_cands[i]; local
2794 base_cand &cand = base_cands[i]; local
    [all...]

Completed in 85 milliseconds

1 2