| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | isl_farkas.c | 356 isl_basic_set *coeff; member 434 data->factors[data->pos].coeff = coeff; in isl_basic_set_coefficients_factor() 435 if (!coeff) in isl_basic_set_coefficients_factor() 618 isl_basic_set *coeff = factor->coeff; in add_vertex() local 627 isl_basic_set *coeff = factor->coeff; in add_vertex() local 744 coeff = NULL; in isl_basic_set_coefficients_product() 747 return coeff; in isl_basic_set_coefficients_product() 789 coeff = isl_basic_set_preimage_multi_aff(coeff, ma); in isl_basic_set_coefficients_morphed_product() 791 return coeff; in isl_basic_set_coefficients_morphed_product() 912 coeff = isl_basic_set_intersect(coeff, coeff_i); in isl_set_coefficients() [all …]
|
| /llvm-project-15.0.7/llvm/test/Analysis/ScalarEvolution/ |
| H A D | solve-quadratic.ll | 45 ; CHECK: {{.*}}GetQuadraticEquation{{.*}}: addrec coeff bw: 4 46 ; CHECK: {{.*}}GetQuadraticEquation{{.*}}: equation -2x^2 + -2x + -4, coeff bw: 5, multiplied by 2 77 ; CHECK: {{.*}}GetQuadraticEquation{{.*}}: addrec coeff bw: 32 121 ; CHECK: {{.*}}GetQuadraticEquation{{.*}}: addrec coeff bw: 4 122 ; CHECK: {{.*}}GetQuadraticEquation{{.*}}: equation 2x^2 + -4x + 2, coeff bw: 5, multiplied by 2 178 ; CHECK: {{.*}}GetQuadraticEquation{{.*}}: addrec coeff bw: 16 197 ; CHECK: {{.*}}GetQuadraticEquation{{.*}}: addrec coeff bw: 16 228 ; CHECK: {{.*}}GetQuadraticEquation{{.*}}: addrec coeff bw: 32 272 ; CHECK: {{.*}}GetQuadraticEquation{{.*}}: addrec coeff bw: 32 319 ; CHECK: {{.*}}GetQuadraticEquation{{.*}}: addrec coeff bw: 32 [all …]
|
| /llvm-project-15.0.7/libc/AOR_v20.02/math/tools/ |
| H A D | cos.sollya | 20 // first coeff is fixed, iteratively find optimal double prec coeffs 24 poly = poly + x^(2*i)*coeff(p,0); 32 for i from 0 to deg do coeff(poly,i);
|
| H A D | v_sin.sollya | 26 // first coeff is fixed, iteratively find optimal double prec coeffs 30 poly = poly + x^(2*i)*coeff(p,0); 37 for i from 0 to deg do coeff(poly,i);
|
| H A D | log.sollya | 25 // first coeff is fixed, iteratively find optimal double prec coeffs 29 poly = poly + x^i*coeff(p,0); 36 for i from 0 to deg do coeff(poly,i);
|
| H A D | sin.sollya | 26 // first coeff is fixed, iteratively find optimal double prec coeffs 30 poly = poly + x^(2*i)*coeff(p,0); 38 for i from 0 to deg do coeff(poly,i);
|
| H A D | v_log.sollya | 24 // first coeff is fixed, iteratively find optimal double prec coeffs 28 poly = poly + x^i*coeff(p,0); 35 for i from 0 to deg do coeff(poly,i);
|
| H A D | log_abs.sollya | 20 // first coeff is fixed, iteratively find optimal double prec coeffs 24 poly = poly + x^i*coeff(p,0); 36 for i from 0 to deg do coeff(poly,i);
|
| H A D | log2_abs.sollya | 24 // first coeff is fixed, iteratively find optimal double prec coeffs 28 poly = poly + x^i*coeff(p,0); 42 for i from 0 to deg do coeff(poly,i);
|
| H A D | log2.sollya | 30 // first coeff is fixed, iteratively find optimal double prec coeffs 34 poly = poly + x^i*coeff(p,0); 43 for i from 0 to deg do coeff(poly,i);
|
| H A D | exp2.sollya | 32 // first coeff is fixed, iteratively find optimal double prec coeffs 37 poly = poly + x^i*coeff(p,0); 49 for i from 0 to deg do coeff(poly,i);
|
| H A D | v_exp.sollya | 23 poly = poly + x^i*coeff(p,0); 31 for i from 0 to deg do coeff(poly,i);
|
| H A D | exp.sollya | 24 poly = poly + x^i*coeff(p,0); 36 for i from 0 to deg do coeff(poly,i);
|
| H A D | remez.jl | 906 coeff = abs(coeffs[i]) 908 if coeff != 0 909 thisval = so_far / coeff 911 so_far += coeff
|
| /llvm-project-15.0.7/flang/lib/Decimal/ |
| H A D | big-radix-floating-point.h | 228 auto coeff{radix >> twoPow}; in RemoveLeastOrderZeroDigits() 231 digit_[j] = (digit_[j] >> twoPow) + coeff * remainder; in RemoveLeastOrderZeroDigits() 255 auto coeff{radix >> chunk}; // precise; radix is (5*2)**log10Radix in RemoveLeastOrderZeroDigits() 258 digit_[j] = (digit_[j - 1] >> chunk) + coeff * remainder; in RemoveLeastOrderZeroDigits() 261 digit_[0] = coeff * remainder; in RemoveLeastOrderZeroDigits()
|
| /llvm-project-15.0.7/mlir/lib/Analysis/Presburger/ |
| H A D | Utils.cpp | 338 for (int64_t &coeff : num) in normalizeDiv() 339 coeff /= gcd; in normalizeDiv() 346 for (int64_t coeff : coeffs) in getNegatedCoeffs() local 347 negatedCoeffs.emplace_back(-coeff); in getNegatedCoeffs() 354 for (int64_t coeff : ineq) in getComplementIneq() local 355 coeffs.emplace_back(-coeff); in getComplementIneq()
|
| H A D | Simplex.cpp | 1095 for (int64_t coeff : coeffs) in addEquality() local 1096 negatedCoeffs.emplace_back(-coeff); in addEquality() 1281 for (int64_t &coeff : ineq) in addDivisionVariable() 1282 coeff = -coeff; in addDivisionVariable() 1721 for (int64_t coeff : dir) in getCoeffsForDirection() local 1722 coeffs.push_back(-coeff); in getCoeffsForDirection()
|
| H A D | IntegerRelation.cpp | 844 int64_t coeff = cone.atIneq(i, j); in findIntegerSample() local 845 if (coeff < 0) in findIntegerSample() 846 cone.atIneq(i, cone.getNumVars()) += coeff; in findIntegerSample() 1408 [](int64_t coeff) { return coeff == 0; })) in getConstantBoundOnDimSize() argument
|
| /llvm-project-15.0.7/polly/lib/External/isl/imath/examples/ |
| H A D | pi.c | 129 mp_small rem, sign = 1, coeff = 1; in arctan() local 150 if ((res = mp_int_div_value(&t, coeff, &v, &rem)) != MP_OK) goto CLEANUP; in arctan() 160 coeff += 2; in arctan()
|
| /llvm-project-15.0.7/llvm/test/Analysis/BasicAA/ |
| H A D | phi-speculation.ll | 10 define i32 @test_noalias_1(i32* %ptr2, i32 %count, i32* %coeff) { 23 %1 = load i32, i32* %coeff, align 4 43 define i32 @test_noalias_2(i32* %ptr2, i32 %count, i32* %coeff) { 64 %1 = load i32, i32* %coeff, align 4
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/ |
| H A D | gcc-examples.ll | 435 define void @example14(i32** nocapture %in, i32** nocapture %coeff, i32* nocapture %out) nounwind u… 451 %5 = getelementptr inbounds i32*, i32** %coeff, i64 %indvars.iv 485 %18 = getelementptr inbounds i32*, i32** %coeff, i64 %indvars.iv.1 519 %32 = getelementptr inbounds i32*, i32** %coeff, i64 %indvars.iv.2 554 %46 = getelementptr inbounds i32*, i32** %coeff, i64 %indvars.iv.3
|
| H A D | reduction.ll | 132 define i32 @start_at_non_zero(i32* nocapture %in, i32* nocapture %coeff, i32* nocapture %out, i32 %… 142 %arrayidx2 = getelementptr inbounds i32, i32* %coeff, i64 %indvars.iv
|
| H A D | reduction-inloop.ll | 333 define i32 @start_at_non_zero(i32* nocapture %in, i32* nocapture %coeff, i32* nocapture %out) { 372 %arrayidx2 = getelementptr inbounds i32, i32* %coeff, i64 %indvars.iv
|
| /llvm-project-15.0.7/llvm/test/Instrumentation/AddressSanitizer/X86/ |
| H A D | bug_11395.ll | 46 define internal void @mlp_filter_channel_x86(i32* %state, i32* %coeff, i32 %firorder, i32 %iirorder… 63 …*) %iirjump, i32* elementtype(i32) %filter_shift.addr, i32* %state, i32* %coeff, i32* %sample_buff…
|
| /llvm-project-15.0.7/mlir/lib/Conversion/ComplexToStandard/ |
| H A D | ComplexToStandard.cpp | 932 Value coeff = builder.create<arith::MulFOp>(aaPbbTohalfC, eToNegDArgX); in powOpConversionImpl() local 958 type, builder.create<arith::MulFOp>(coeff, cosQ), in powOpConversionImpl() 959 builder.create<arith::MulFOp>(coeff, sinQ)); in powOpConversionImpl()
|