Home
last modified time | relevance | path

Searched refs:prec (Results 1 – 25 of 51) sorted by relevance

123

/llvm-project-15.0.7/clang/lib/Basic/
H A DOperatorPrecedence.cpp26 return prec::Relational; in getBinOpPrecedence()
27 return prec::Unknown; in getBinOpPrecedence()
37 return prec::Shift; in getBinOpPrecedence()
38 return prec::Unknown; in getBinOpPrecedence()
40 default: return prec::Unknown; in getBinOpPrecedence()
41 case tok::comma: return prec::Comma; in getBinOpPrecedence()
54 case tok::pipepipe: return prec::LogicalOr; in getBinOpPrecedence()
59 case tok::amp: return prec::And; in getBinOpPrecedence()
61 case tok::equalequal: return prec::Equality; in getBinOpPrecedence()
66 case tok::lessless: return prec::Shift; in getBinOpPrecedence()
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/imath/
H A Dimtimer.c39 double get_multiply_time(int nt, int prec);
40 double get_exptmod_time(int nt, int prec);
41 mp_int alloc_values(int nt, int prec);
44 void mp_int_random(mp_int z, int prec);
134 mp_int alloc_values(int nt, int prec) { in alloc_values() argument
170 randomize_values(values, 2, prec); in get_multiply_time()
187 randomize_values(values, 3, prec); in get_exptmod_time()
199 void mp_int_random(mp_int z, int prec) { in mp_int_random() argument
202 if (prec > (int)MP_ALLOC(z)) prec = (int)MP_ALLOC(z); in mp_int_random()
204 for (i = 0; i < prec; ++i) { in mp_int_random()
[all …]
H A Dimrat.c494 mp_result mp_rat_to_decimal(mp_rat r, mp_size radix, mp_size prec, in mp_rat_to_decimal() argument
515 int zprec = (int)prec; in mp_rat_to_decimal()
549 if (prec == 0) { in mp_rat_to_decimal()
568 if (prec == 0) { in mp_rat_to_decimal()
605 if (prec == 0) goto CLEANUP; in mp_rat_to_decimal()
643 mp_result mp_rat_decimal_len(mp_rat r, mp_size radix, mp_size prec) { in mp_rat_decimal_len() argument
647 if (prec == 0) { in mp_rat_decimal_len()
650 f_len = 1 + prec + 1; /* decimal point, digits, terminator */ in mp_rat_decimal_len()
H A Dimrat.h215 mp_result mp_rat_to_decimal(mp_rat r, mp_size radix, mp_size prec,
226 mp_result mp_rat_decimal_len(mp_rat r, mp_size radix, mp_size prec);
/llvm-project-15.0.7/polly/lib/External/isl/imath/tools/
H A Dfindthreshold.py46 count, prec, bits, thresh, status = line.strip().split('\t')
67 for prec in (32, 40, 64, 80, 128, 150, 256, 384, 512, 600, 768, 1024):
68 sys.stderr.write('%-4d ' % prec)
69 stats[prec] = (None, 1000000., 0.)
72 s, b, t = get_timing_stats(1000, prec, thresh, seed)
73 sp, bp, tp = get_timing_stats(1000, prec, prec + 1, seed)
75 if t < stats[prec][1]:
76 stats[prec] = (thresh, t, tp)
88 for prec, thresh, trec, tnorm in stats:
89 print "%d\t%d\t%.3f\t%.3f\t%.4f" % (prec, thresh, trec, tnorm,
/llvm-project-15.0.7/polly/lib/External/isl/imath/examples/
H A Drounding.c38 mp_size prec, radix; in main() local
53 prec = atoi(argv[2]); in main()
61 mode, prec, radix, argv[4]); in main()
68 len = mp_rat_decimal_len(&value, radix, prec); in main()
71 if ((res = mp_rat_to_decimal(&value, radix, prec, mode, buf, len)) != MP_OK) { in main()
H A Dpi.c39 mp_result arctan(mp_small radix, mp_small mul, mp_small x, mp_small prec,
125 mp_result arctan(mp_small radix, mp_small mul, mp_small x, mp_small prec, in arctan() argument
133 ++prec; in arctan()
139 if ((res = mp_int_expt_value(radix, prec, &t)) != MP_OK || in arctan()
/llvm-project-15.0.7/libc/AOR_v20.02/math/test/
H A Dmathbench.c219 int prec; member
541 if (f->vec && f->prec == 'd') in bench1()
543 else if (f->vec && f->prec == 'f') in bench1()
546 if (f->prec == 'd' && type == 't' && f->vec == 0) in bench1()
593 if (f->prec == 'd' && gen == 'r') in bench()
595 else if (f->prec == 'd' && gen == 'l') in bench()
597 else if (f->prec == 'd' && gen == 't') in bench()
599 else if (f->prec == 'f' && gen == 'r') in bench()
601 else if (f->prec == 'f' && gen == 'l') in bench()
603 else if (f->prec == 'f' && gen == 't') in bench()
[all …]
H A Dulp.h22 mpfr_exp_t e = mpfr_get_exp (x) - RT(prec); in RT()
25 if (e > RT(emax) - RT(prec)) in RT()
26 e = RT(emax) - RT(prec); in RT()
32 return RT(emax) - RT(prec); in RT()
190 MPFR_DECL_INIT(mr, RT(prec)); in T()
/llvm-project-15.0.7/clang/include/clang/Basic/
H A DOperatorPrecedence.h25 namespace prec {
47 prec::Level getBinOpPrecedence(tok::TokenKind Kind, bool GreaterThanIsOperator,
/llvm-project-15.0.7/llvm/test/CodeGen/NVPTX/
H A Ddiv-ri.ll1 ; RUN: llc < %s -march=nvptx -mcpu=sm_20 -nvptx-prec-divf32=0 | FileCheck %s
2 ; RUN: %if ptxas %{ llc < %s -march=nvptx -mcpu=sm_20 -nvptx-prec-divf32=0 | %ptxas-verify %}
H A Dsqrt-approx.ll1 ; RUN: llc < %s -march=nvptx -mcpu=sm_20 -nvptx-prec-divf32=0 -nvptx-prec-sqrtf32=0 \
4 ; RUN: llc < %s -march=nvptx -mcpu=sm_20 -nvptx-prec-divf32=0 -nvptx-prec-sqrtf32=0 \
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Di16lshr8pat.ll17 define i16 @foo4(i32 %prec, ptr%dst, ptr%src) {
19 %cnd = icmp ne i32 %prec, 0
/llvm-project-15.0.7/clang/lib/Format/
H A DContinuationIndenter.cpp471 if (PreviousPrecedence != prec::Assignment && in mustBreak()
487 (PreviousPrecedence == prec::Relational || in mustBreak()
488 PreviousPrecedence == prec::Equality || in mustBreak()
489 PreviousPrecedence == prec::Spaceship) && in mustBreak()
720 Current.FakeLParens.back() > prec::Unknown) { in addTokenOnCurrentLine()
763 P->getPrecedence() != prec::Assignment && in addTokenOnCurrentLine()
764 P->getPrecedence() != prec::Relational && in addTokenOnCurrentLine()
765 P->getPrecedence() != prec::Spaceship) { in addTokenOnCurrentLine()
1500 if (PrecedenceLevel > prec::Comma) in moveStatePastFakeLParens()
1508 PrecedenceLevel < prec::Assignment) && in moveStatePastFakeLParens()
[all …]
H A DTokenAnnotator.cpp608 prec::Unknown)); in parseSquare()
2543 return prec::Assignment; in getCurrentPrecedence()
2546 return prec::Assignment; in getCurrentPrecedence()
2548 return prec::Comma; in getCurrentPrecedence()
2557 return prec::Comma; in getCurrentPrecedence()
2612 parse(prec::LogicalOr); in parseConditionalExpr()
2616 parse(prec::Assignment); in parseConditionalExpr()
2620 parse(prec::Assignment); in parseConditionalExpr()
3232 return prec::Conditional; in splitPenalty()
3234 if (Level == prec::Unknown) in splitPenalty()
[all …]
/llvm-project-15.0.7/clang/lib/Parse/
H A DParseExpr.cpp125 return ParseRHSOfBinaryExpression(LHS, prec::Comma); in ParseExpression()
136 return ParseRHSOfBinaryExpression(LHS, prec::Comma); in ParseExpressionWithLeadingAt()
156 return ParseRHSOfBinaryExpression(LHS, prec::Comma); in ParseExpressionWithLeadingExtension()
197 return ParseRHSOfBinaryExpression(R, prec::Assignment); in ParseAssignmentExprWithObjCMessageExprStart()
384 bool Parser::isFoldOperator(prec::Level Level) const { in isFoldOperator()
385 return Level > prec::Unknown && Level != prec::Conditional && in isFoldOperator()
386 Level != prec::Spaceship; in isFoldOperator()
463 if (NextTokPrec == prec::Conditional) { in ParseRHSOfBinaryExpression()
559 prec::Level ThisPrec = NextTokPrec; in ParseRHSOfBinaryExpression()
565 ThisPrec == prec::Assignment; in ParseRHSOfBinaryExpression()
[all …]
/llvm-project-15.0.7/mlir/utils/tree-sitter-mlir/
H A Dgrammar.js40 repeat(token.immediate(prec(1, /[^\\"\n\f\v\r]+/))),
/llvm-project-15.0.7/llvm/test/CodeGen/Thumb2/
H A D2009-11-13-STRDBug.ll4 define void @lshift_double(i64 %l1, i64 %h1, i64 %count, i32 %prec, i64* nocapture %lv, i64* nocapt…
/llvm-project-15.0.7/clang/test/CodeGen/
H A D2008-03-24-BitField-And-Alloca.c47 unsigned int prec : 1; member
/llvm-project-15.0.7/libc/AOR_v20.02/math/tools/
H A Dcos.sollya20 // first coeff is fixed, iteratively find optimal double prec coeffs
H A Dv_exp.sollya19 // first 2 coeffs are fixed, iteratively find optimal double prec coeffs
H A Dv_sin.sollya26 // first coeff is fixed, iteratively find optimal double prec coeffs
H A Dlog.sollya25 // first coeff is fixed, iteratively find optimal double prec coeffs
H A Dsin.sollya26 // first coeff is fixed, iteratively find optimal double prec coeffs
H A Dv_log.sollya24 // first coeff is fixed, iteratively find optimal double prec coeffs

123