| /llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/modernize/ |
| H A D | loop-convert-negative.cpp | 13 int Sum = 0; variable 18 Sum += Arr[I]; in IndexStartAndEnd() 21 Sum += Arr[I]; in IndexStartAndEnd() 24 Sum += Arr[I]; in IndexStartAndEnd() 27 Sum += Arr[I]; in IndexStartAndEnd() 36 Sum += Arr[I]; in increment() 39 Sum += Arr[I]; in increment() 45 Sum++; in increment() 57 Sum += I; in noArray() 266 int Sum = 0; variable [all …]
|
| H A D | loop-convert-basic.cpp | 14 int Sum = 0; in f() local 17 Sum += Arr[I]; in f() 27 Sum += Arr[I] + 2; in f() 76 Sum += Arr[I]; in f() 84 Sum += Arr[I] + 2; in f() 101 Sum += Arr[I] + 2; in f() 110 Sum += Arr[I] + 2; in f() 119 Sum += Arr[I] + 2; in f() 580 int Sum = 0; in f() local 583 Sum += V[I] + 2; in f() [all …]
|
| /llvm-project-15.0.7/pstl/test/std/numerics/numeric.ops/ |
| H A D | reduce.pass.cpp | 60 …operator()(pstl::execution::parallel_policy, Iterator first, Iterator last, Sum init, Sum expected) in operator ()() 65 …stl::execution::parallel_unsequenced_policy, Iterator first, Iterator last, Sum init, Sum expected) in operator ()() 72 operator()(Policy&& exec, Iterator first, Iterator last, Sum init, Sum expected) in operator ()() 76 Sum r0 = init + reduce(exec, first, last); in operator ()() 79 Sum r1 = reduce(exec, first, last, init); in operator ()() 90 Sum init(42, OddTag()); in test_short_forms() 91 Sum expected(init); in test_short_forms() 92 Sequence<Sum> in(n, [n](size_t k) { return Sum((int32_t(k ^ n) % 1000 - 500), OddTag()); }); in test_short_forms()
|
| /llvm-project-15.0.7/compiler-rt/lib/scudo/standalone/ |
| H A D | checksum.h | 45 inline u16 computeBSDChecksum(u16 Sum, uptr Data) { in computeBSDChecksum() argument 47 Sum = static_cast<u16>((Sum >> 1) | ((Sum & 1) << 15)); in computeBSDChecksum() 48 Sum = static_cast<u16>(Sum + (Data & 0xff)); in computeBSDChecksum() 51 return Sum; in computeBSDChecksum()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/ |
| H A D | loop-hoist-toc-save.ll | 25 %Sum.0.lcssa = phi i32 [ 0, %entry ], [ %add, %for.body ] 26 ret i32 %Sum.0.lcssa 32 %add = add nsw i32 %call, %Sum.07 60 ret i32 %Sum.0.lcssa 74 %Sum.118 = phi i32 [ %Sum.021, %for.body4.lr.ph ], [ %add, %for.body4 ] 76 %add = add nsw i32 %call, %Sum.118 106 %Sum.0.lcssa = phi i32 [ 0, %entry ], [ %add3, %if.end ] 107 ret i32 %Sum.0.lcssa 117 %add = add nsw i32 %call, %Sum.014 121 %Sum.1 = phi i32 [ %add, %if.then ], [ %Sum.014, %for.body ] [all …]
|
| H A D | remove-redundant-toc-saves.ll | 49 %Sum.0 = phi i32 [ %add4, %if.then ], [ %call, %entry ] 51 %add6 = add nsw i32 %call5, %Sum.0 79 %Sum.0 = phi i32 [ %call, %if.then ], [ %call1, %if.else ] 81 %add4 = add nsw i32 %call3, %Sum.0 112 %Sum.0 = add nsw i32 %call1.pn, %call 113 ret i32 %Sum.0 135 %Sum.0 = phi i32 [ %call, %if.then ], [ 0, %entry ] 137 %add2 = add nsw i32 %call1, %Sum.0
|
| H A D | ctrloop-shortLoops.ll | 29 %Sum.05 = phi i32 [ 0, %entry ], [ %add, %for.body ] 32 %add = add nsw i32 %0, %Sum.05 53 %Sum.05 = phi i32 [ 0, %entry ], [ %add, %for.body ] 56 %add = add nsw i32 %0, %Sum.05 78 %Sum.05 = phi i32 [ 0, %entry ], [ %add, %for.body ] 81 %add = add nsw i32 %0, %Sum.05
|
| /llvm-project-15.0.7/llvm/tools/llvm-xray/ |
| H A D | xray-graph.h | 49 double Sum; member 170 A.Sum + B.Sum}; 179 A.Sum - B.Sum}; 192 A.Sum / B}; 204 A.Sum * B}; 218 A.Sum * B.Sum}; 226 A.Sum / B.Sum};
|
| /llvm-project-15.0.7/llvm/lib/Support/ |
| H A D | IntervalMap.cpp | 132 unsigned Sum = 0; in distribute() local 134 Sum += NewSize[n] = PerNode + (n < Extra); in distribute() 135 if (PosPair.first == Nodes && Sum > Position) in distribute() 136 PosPair = IdxPair(n, Position - (Sum - NewSize[n])); in distribute() 138 assert(Sum == Elements + Grow && "Bad distribution sum"); in distribute() 148 Sum = 0; in distribute() 151 Sum += NewSize[n]; in distribute() 153 assert(Sum == Elements && "Bad distribution sum"); in distribute()
|
| /llvm-project-15.0.7/openmp/libomptarget/test/offloading/ |
| H A D | target_depend_nowait.cpp | 50 int Sum = 0; in main() local 52 Sum += A[i] + B[i]; in main() 55 printf("Sum = %d.\n", Sum); in main() 57 return Sum != 2 * N * (2 + N - 1 + 2) / 2; in main()
|
| /llvm-project-15.0.7/llvm/include/llvm/Support/ |
| H A D | BranchProbability.h | 211 uint64_t Sum = std::accumulate(Begin, End, uint64_t(0), in normalizeProbabilities() local 224 if (Sum < BranchProbability::getDenominator()) in normalizeProbabilities() 226 (BranchProbability::getDenominator() - Sum) / UnknownProbCount); in normalizeProbabilities() 232 if (Sum <= BranchProbability::getDenominator()) in normalizeProbabilities() 236 if (Sum == 0) { in normalizeProbabilities() 243 I->N = (I->N * uint64_t(D) + Sum / 2) / Sum; in normalizeProbabilities()
|
| /llvm-project-15.0.7/llvm/unittests/FuzzMutate/ |
| H A D | ReservoirSamplerTest.cpp | 50 double Sum = 0.0; in TEST() local 52 Sum += Ys * Ys / Ps; in TEST() 53 double V = (Sum / N) - N; in TEST()
|
| /llvm-project-15.0.7/llvm/test/TableGen/ |
| H A D | foldl.td | 38 class Sum<list<int> lst> { 46 def A1 : Sum<[]>; 47 def A2 : Sum<[5]>; 48 def A3 : Sum<[1, 2, 3, 4]>;
|
| H A D | defset.td | 6 // CHECK: def Sum { 52 def Sum {
|
| /llvm-project-15.0.7/llvm/lib/Transforms/IPO/ |
| H A D | SampleProfile.cpp | 704 Sum = 0; in findIndirectCallFunctionSamples() 719 Sum = 0; in findIndirectCallFunctionSamples() 722 Sum += T_C.second; in findIndirectCallFunctionSamples() 822 if (Sum == 0) { in updateIDTMetaData() 840 Sum = OldSum; in updateIDTMetaData() 859 Sum -= Data.Count; in updateIDTMetaData() 1157 uint64_t Sum; in inlineHotFunctions() local 1425 uint64_t Sum = 0; in inlineHotFunctionsWithPriority() local 1610 uint64_t Sum = 0; in generateMDProfMetadata() local 1612 Sum += C.second; in generateMDProfMetadata() [all …]
|
| /llvm-project-15.0.7/lldb/test/API/commands/frame/diagnose/virtual-method-call/ |
| H A D | main.cpp | 5 virtual int Sum() { return a + b; } in Sum() function in Foo 14 return foo->Sum(); in main()
|
| /llvm-project-15.0.7/lldb/test/API/commands/frame/diagnose/dereference-this/ |
| H A D | main.cpp | 4 int Sum() { return a + b; } in Sum() function 13 return foo->Sum(); in main()
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-profdata/ |
| H A D | cutoff.test | 15 BELOW1: bar: (Max = 0 Sum = 0) 17 BELOW1000: bar: (Max = 0 Sum = 0) 18 BELOW1000: foo: (Max = 999 Sum = 1000)
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-xray/X86/ |
| H A D | stack-multithread.yaml | 36 # PER-THREAD: Sum: 100 49 # AGGREGATE: Sum: 200 56 # AGGREGATE: Sum: 10 61 # AGGREGATE: Sum: 1
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/PowerPC/ |
| H A D | widened-massv-call.ll | 32 %Sum.0 = phi double [ 0.000000e+00, %entry ], [ %add, %for.inc ] 46 %add = fadd fast double %Sum.0, %1 54 ret double %Sum.0
|
| H A D | widened-massv-vfabi-attr.ll | 30 %Sum.0 = phi double [ 0.000000e+00, %entry ], [ %add, %for.inc ] 44 %add = fadd fast double %Sum.0, %1 52 ret double %Sum.0
|
| /llvm-project-15.0.7/compiler-rt/lib/orc/unittests/ |
| H A D | wrapper_function_utils_test.cpp | 136 int8_t Sum = 0; in sumArrayWrapper() local 138 Sum += C; in sumArrayWrapper() 139 return Sum; in sumArrayWrapper()
|
| /llvm-project-15.0.7/llvm/examples/OrcV2Examples/OrcV2CBindingsBasicUsage/ |
| H A D | OrcV2CBindingsBasicUsage.c | 119 int32_t (*Sum)(int32_t, int32_t) = (int32_t(*)(int32_t, int32_t))SumAddr; in main() local 120 int32_t Result = Sum(1, 2); in main()
|
| /llvm-project-15.0.7/llvm/unittests/Support/ |
| H A D | ErrorTest.cpp | 330 int Sum = 0; in TEST() local 337 Sum += CE.getInfo(); in TEST() 339 EXPECT_EQ(Sum, 21) << "Failed to correctly append error to error list."; in TEST() 344 int Sum = 0; in TEST() local 351 Sum += CE.getInfo(); in TEST() 353 EXPECT_EQ(Sum, 21) << "Failed to correctly prepend error to error list."; in TEST() 358 int Sum = 0; in TEST() local 368 Sum += CE.getInfo(); in TEST() 370 EXPECT_EQ(Sum, 28) << "Failed to correctly concatenate error lists."; in TEST()
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopStrengthReduce/ |
| H A D | share_code_in_preheader.ll | 11 %Sum.0.0 = phi i8 [ 0, %entry ], [ %tmp.21, %no_exit ] ; <i8> [#uses=1] 20 %tmp.21 = add i8 %tmp.19, %Sum.0.0 ; <i8> [#uses=2]
|