HomeSort by: relevance | last modified time | path
    Searched refs:cbase (Results 1 - 12 of 12) sorted by relevancy

  /src/external/gpl2/dtc/dist/
convert-dtsv0-lexer.l 35 static int cbase = 16;
87 cbase = 2;
89 cbase = 8;
91 cbase = 10;
93 cbase = 16;
101 val = strtoull(yytext, NULL, cbase);
118 if (cbase != 16)
119 obase = cbase;
134 cbase = 16;
  /src/external/bsd/byacc/dist/
output.c 460 find_conflict_base(int cbase)
464 for (i = 0; i < cbase; i++)
466 for (j = 0; j + cbase < nconflicts; j++)
468 if (conflicts[i + j] != conflicts[cbase + j])
471 if (j + cbase >= nconflicts)
486 Value_t cbase = 0; local
507 cbase = nconflicts;
519 j = find_conflict_base(cbase);
521 if (j == cbase)
523 cbase = nconflicts
    [all...]
  /src/external/lgpl3/mpfr/dist/tests/
tset_str.c 756 int cbase, climb, crnd; local
766 for (cbase = 0; cbase < 3; cbase++)
776 mpfr_get_str (str + 2, &exp, base[cbase],
786 mpfr_set_str (y, str, base[cbase], rnd[2 - crnd]);
791 "rnd=%s:\n", (unsigned int) nb_digit, base[cbase],
  /src/external/bsd/openldap/dist/tests/progs/
slapd-watcher.c 154 struct berval base, cbase; variable in typeref:struct:
520 if ( cbase.bv_val ) {
522 rc = ldap_search_ext_s( ld, cbase.bv_val, LDAP_SCOPE_BASE, "(objectClass=*)",
588 if ( !cbase.bv_val )
589 cbase = base;
593 ber_str2bv( optarg, 0, 0, &cbase );
705 rc = ldap_search_ext( ld, cbase.bv_val,
  /src/usr.sbin/makefs/ffs/
mkfs.c 611 daddr_t cbase, dmax; local
622 cbase = cgbase(&sblock, cylno);
623 dmax = cbase + sblock.fs_fpg;
626 dlower = cgsblock(&sblock, cylno) - cbase;
627 dupper = cgdmin(&sblock, cylno) - cbase;
637 acg.cg_ndblk = dmax - cbase;
  /src/sbin/newfs/
mkfs.c 780 daddr_t cbase, dmax; local
791 cbase = cgbase(&sblock, cylno);
792 dmax = cbase + sblock.fs_fpg;
795 dlower = cgsblock(&sblock, cylno) - cbase;
796 dupper = cgdmin(&sblock, cylno) - cbase;
808 acg.cg_ndblk = dmax - cbase;
  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-loop-ivopts.cc 4038 tree cbase = cand->iv->base, cstep = cand->iv->step; local
4040 tree utype = TREE_TYPE (ubase), ctype = TREE_TYPE (cbase);
4054 if (cand->orig_iv != NULL && CONVERT_EXPR_P (cbase)
4058 inner_base = TREE_OPERAND (cbase, 0);
4072 cbase = inner_base;
4076 cbase = fold_convert (uutype, cbase);
4099 /* In case both UBASE and CBASE are shortened to UUTYPE from some common
4104 common_type = determine_common_wider_type (&ubase, &cbase);
4106 /* use = ubase - ratio * cbase + ratio * var. *
4200 tree cbase = cand->iv->base, cstep = cand->iv->step; local
4916 tree ubase = use->iv->base, cbase = cand->iv->base; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-loop-ivopts.cc 3997 tree cbase = cand->iv->base, cstep = cand->iv->step; local
3999 tree utype = TREE_TYPE (ubase), ctype = TREE_TYPE (cbase);
4013 if (cand->orig_iv != NULL && CONVERT_EXPR_P (cbase)
4017 inner_base = TREE_OPERAND (cbase, 0);
4031 cbase = inner_base;
4035 cbase = fold_convert (uutype, cbase);
4058 /* In case both UBASE and CBASE are shortened to UUTYPE from some common
4063 common_type = determine_common_wider_type (&ubase, &cbase);
4065 /* use = ubase - ratio * cbase + ratio * var. *
4159 tree cbase = cand->iv->base, cstep = cand->iv->step; local
4867 tree ubase = use->iv->base, cbase = cand->iv->base; local
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++17/
fs_ops.cc 1267 fs::path cbase;
1269 cbase = weakly_canonical(base, ec);
1271 result = result.lexically_relative(cbase);
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++17/
fs_ops.cc 1236 fs::path cbase;
1238 cbase = weakly_canonical(base, ec);
1240 result = result.lexically_relative(cbase);
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/filesystem/
std-ops.cc 1294 fs::path cbase;
1296 cbase = weakly_canonical(base, ec);
1298 result = result.lexically_relative(cbase);
  /src/external/gpl3/gcc.old/dist/gcc/d/dmd/
typesem.d 4238 if (auto cbase = mt.sym.searchBase(ident))
4244 if (auto ifbase = cbase.isInterfaceDeclaration())
4247 e = new DotTypeExp(e.loc, e, cbase);

Completed in 60 milliseconds