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

1 2 3

  /src/external/gpl3/gcc/dist/gcc/
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...]
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...]
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
850 /* Dumps information about induction variable candidate CAND to FILE. */
853 dump_cand (FILE *file, struct iv_cand *cand)
855 struct iv *iv = cand->iv;
857 fprintf (file, "Candidate %d:\n", cand->id);
858 if (cand->inv_vars
3146 struct iv_cand *cand = NULL; local
3393 struct iv_cand *cand; local
3667 struct iv_cand *cand = data->vcands[i]; local
5725 struct iv_cand *cand = data->vcands[i]; local
5934 struct iv_cand *cand; local
6110 struct iv_cand *cand = data->vcands[i]; local
6410 struct iv_cand *cand; local
6831 struct iv_cand *cand; local
6878 struct iv_cand *cand; local
6906 struct iv_cand *cand; local
6982 struct iv_cand *cand; local
7115 struct iv_cand *cand; local
7332 struct iv_cand *cand; local
7754 struct iv_cand *cand = group->selected; local
7843 struct iv_cand *best_cand = NULL, *cand; local
7987 struct iv_cand *cand = data->vcands[i]; local
    [all...]
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/
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...]
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...]
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
850 /* Dumps information about induction variable candidate CAND to FILE. */
853 dump_cand (FILE *file, struct iv_cand *cand)
855 struct iv *iv = cand->iv;
857 fprintf (file, "Candidate %d:\n", cand->id);
858 if (cand->inv_vars
3106 struct iv_cand *cand = NULL; local
3353 struct iv_cand *cand; local
3626 struct iv_cand *cand = data->vcands[i]; local
5675 struct iv_cand *cand = data->vcands[i]; local
5884 struct iv_cand *cand; local
6060 struct iv_cand *cand = data->vcands[i]; local
6360 struct iv_cand *cand; local
6781 struct iv_cand *cand; local
6828 struct iv_cand *cand; local
6856 struct iv_cand *cand; local
6932 struct iv_cand *cand; local
7065 struct iv_cand *cand; local
7282 struct iv_cand *cand; local
7700 struct iv_cand *cand = group->selected; local
7789 struct iv_cand *best_cand = NULL, *cand; local
7929 struct iv_cand *cand = data->vcands[i]; local
    [all...]
  /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/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/gpl3/gcc/dist/gcc/cp/
call.cc 146 struct z_candidate *cand; member in struct:conversion
810 /* Note that the caller is responsible for filling in t->cand for
1939 z_candidate *cand = build_user_type_conversion_1 (rto, rexpr, flags, local
1941 if (cand)
1943 if (!cand->second_conv->bad_p)
1944 return cand->second_conv;
1951 bad_direct_conv = cand->second_conv;
2042 from, rto, t->cand->fn);
2047 && DECL_CONV_FN_P (t->cand->fn))
2049 tree ftype = TREE_TYPE (TREE_TYPE (t->cand->fn))
2174 struct z_candidate *cand; local
2241 struct z_candidate *cand = (struct z_candidate *) local
2275 struct z_candidate *cand = (struct z_candidate *) local
3511 struct z_candidate *cand; local
4423 struct z_candidate *candidates, *cand; local
4730 struct z_candidate *cand; local
4987 struct z_candidate *cand; local
5073 z_candidate *cand = perform_overload_resolution (dguides, args, &candidates, local
5095 struct z_candidate *candidates, *cand; local
5171 struct z_candidate *cand = NULL; local
5314 struct z_candidate *candidates = 0, *cand; local
5665 struct z_candidate *cand; local
6752 z_candidate *cand = *candidates; local
6985 z_candidate *cand = *candp; local
7089 struct z_candidate *candidates = 0, *cand; local
7574 struct z_candidate *candidates = 0, *cand; local
8562 struct z_candidate *cand = convs->cand; local
11534 struct z_candidate *candidates = 0, *cand; local
    [all...]
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/common/config/arm/
arm-common.cc 852 for (const cpu_arch_extension *cand = selected_arch->common.extensions;
853 cand->name != NULL;
854 cand++)
856 if (cand->remove || cand->alias)
862 arm_initialize_isa (isa_bits, cand->isa_bits);
865 extensions.push_back (new candidate_extension (cand, isa_bits));
889 for (const cpu_arch_extension *cand = selected_arch->common.extensions;
890 cand->name != NULL;
891 cand++
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/common/config/arm/
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...]
  /src/external/gpl3/gcc.old/dist/gcc/cp/
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
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
10853 struct z_candidate *candidates = 0, *cand; local
    [all...]
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/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/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/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/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...]
  /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/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/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;

Completed in 101 milliseconds

1 2 3