| /src/sys/external/bsd/acpica/dist/utilities/ |
| utcksum.c | 184 /* Sum the entire table as-is */
217 UINT8 Sum = 0;
223 Sum = (UINT8) (Sum + *(Buffer++));
226 return (Sum);
|
| utstrsuppt.c | 441 /* Add in the new digit, and store the sum to the accumulated value */
518 * OutSum - Where sum is returned (Accumulator)
520 * RETURN: Status and 64-bit sum
534 UINT64 Sum;
544 Sum = Addend1 + Digit;
548 if ((AcpiGbl_IntegerBitWidth == 32) && (Sum > ACPI_UINT32_MAX))
553 *OutSum = Sum;
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| IntervalMap.cpp | 132 unsigned Sum = 0;
134 Sum += NewSize[n] = PerNode + (n < Extra);
135 if (PosPair.first == Nodes && Sum > Position)
136 PosPair = IdxPair(n, Position - (Sum - NewSize[n]));
138 assert(Sum == Elements + Grow && "Bad distribution sum");
148 Sum = 0;
151 Sum += NewSize[n];
153 assert(Sum == Elements && "Bad distribution sum");
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/ |
| xray-graph.h | 39 enum class StatType { NONE, COUNT, MIN, MED, PCT90, PCT99, MAX, SUM };
49 double Sum;
165 /// Vector Sum of TimeStats
170 A.Sum + B.Sum};
179 A.Sum - B.Sum};
192 A.Sum / B};
204 A.Sum * B};
218 A.Sum * B.Sum}
[all...] |
| xray-account.cpp | 73 SUM,
87 clEnumValN(SortField::SUM, "sum", "sum of call durations"),
267 double Sum;
275 R.Sum = std::accumulate(Timings.begin(), Timings.end(), 0.0);
325 Row.Sum /= CycleFrequency;
355 case SortField::SUM:
356 sortByKey(Results, [](const TupleType &X) { return std::get<2>(X).Sum; });
399 "99p", "max", "sum")
[all...] |
| xray-graph.cpp | 77 clEnumValN(GraphRenderer::StatType::SUM, "sum",
78 "sum of call durations")));
101 clEnumValN(GraphRenderer::StatType::SUM, "sum",
102 "sum of call durations")));
125 clEnumValN(GraphRenderer::StatType::SUM, "sum",
126 "sum of call durations")));
149 clEnumValN(GraphRenderer::StatType::SUM, "sum"
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| BranchProbability.h | 59 // Normalize given probabilties so that the sum of them becomes approximate
211 uint64_t Sum = std::accumulate(Begin, End, uint64_t(0),
221 // If the sum of all known probabilities is less than one, evenly distribute
222 // the complement of sum to unknown probabilities. Otherwise, set unknown
224 if (Sum < BranchProbability::getDenominator())
226 (BranchProbability::getDenominator() - Sum) / UnknownProbCount);
232 if (Sum <= BranchProbability::getDenominator())
236 if (Sum == 0) {
243 I->N = (I->N * uint64_t(D) + Sum / 2) / Sum;
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/OrcV2Examples/OrcV2CBindingsBasicUsage/ |
| OrcV2CBindingsBasicUsage.c | 35 // Add a "sum" function":
40 LLVMValueRef SumFunction = LLVMAddFunction(M, "sum", SumFunctionType);
112 if ((Err = LLVMOrcLLJITLookup(J, &SumAddr, "sum"))) {
119 int32_t (*Sum)(int32_t, int32_t) = (int32_t(*)(int32_t, int32_t))SumAddr;
120 int32_t Result = Sum(1, 2);
|
| /src/sys/external/bsd/acpica/dist/compiler/ |
| aslcodegen.c | 582 signed char Sum;
591 Sum = 0;
604 Sum = (signed char) (Sum + FileByte);
607 Checksum = (UINT8) (0 - Sum);
643 signed char Sum;
652 Sum = 0;
665 Sum = (signed char) (Sum + FileByte);
668 Checksum = (UINT8) (0 - Sum);
[all...] |
| dtutils.c | 729 UINT8 *Sum = ReturnValue;
733 *Sum = (UINT8) (*Sum + Checksum);
|
| /src/external/apache2/llvm/dist/llvm/examples/Fibonacci/ |
| fibonacci.cpp | 93 Value *Sum = BinaryOperator::CreateAdd(CallFibX1, CallFibX2,
97 ReturnInst::Create(Context, Sum, RecurseBB);
|
| /src/external/apache2/llvm/dist/llvm/examples/OrcV2Examples/OrcV2CBindingsAddObjectFile/ |
| OrcV2CBindingsAddObjectFile.c | 30 // Add a "sum" function":
35 LLVMValueRef SumFunction = LLVMAddFunction(M, "sum", SumFunctionType);
126 if ((Err = LLVMOrcLLJITLookup(J, &SumAddr, "sum"))) {
133 int32_t (*Sum)(int32_t, int32_t) = (int32_t(*)(int32_t, int32_t))SumAddr;
134 int32_t Result = Sum(1, 2);
|
| /src/external/apache2/llvm/dist/llvm/examples/OrcV2Examples/OrcV2CBindingsRemovableCode/ |
| OrcV2CBindingsRemovableCode.c | 35 // Add a "sum" function":
40 LLVMValueRef SumFunction = LLVMAddFunction(M, "sum", SumFunctionType);
115 if ((Err = LLVMOrcLLJITLookup(J, &SumAddr, "sum"))) {
122 int32_t (*Sum)(int32_t, int32_t) = (int32_t(*)(int32_t, int32_t))SumAddr;
123 int32_t Result = Sum(1, 2);
142 LLVMErrorRef Err = LLVMOrcLLJITLookup(J, &ThrowAwayAddress, "sum");
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| SampleProfile.cpp | 373 findIndirectCallFunctionSamples(const Instruction &I, uint64_t &Sum) const;
381 uint64_t &Sum, SmallVector<CallBase *, 8> *InlinedCallSites = nullptr);
436 /// This is the sum of all the samples collected in all the functions executed
650 /// the total call count of the indirect call in \p Sum.
653 const Instruction &Inst, uint64_t &Sum) const {
677 Sum = 0;
679 Sum += FS->getEntrySamples();
692 Sum = 0;
695 Sum += T_C.second;
700 Sum += NameFS.second.getEntrySamples()
[all...] |
| SampleProfileProbe.cpp | 423 // Collect the sum of execution weight for each probe.
449 float Sum = ProbeFactors[{Probe->Id, Hash}];
450 if (Sum != 0)
451 setProbeDistributionFactor(I, BBProfileCount(&Block) / Sum);
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/ |
| LatencyBenchmarkRunner.cpp | 36 double Sum = std::accumulate(Values.begin(), Values.end(), 0.0);
38 const double Mean = Sum / Values.size();
|
| /src/sys/external/bsd/acpica/dist/tools/acpibin/ |
| abcompare.c | 123 UINT8 Sum = 0;
134 Sum = (UINT8) (Sum + *Rover);
138 return (Sum);
|
| /src/external/apache2/llvm/dist/llvm/lib/ProfileData/ |
| InstrProf.cpp | 503 void InstrProfRecord::accumulateCounts(CountSumOrPercent &Sum) const {
505 Sum.NumEntries += Counts.size();
508 Sum.CountSum += FuncSum;
519 Sum.ValueCounts[VK] += KindSum;
962 uint64_t Sum = 0;
964 InstrProfR.getValueForSite(ValueKind, SiteIdx, &Sum);
967 annotateValueSite(M, Inst, VDs, Sum, ValueKind, MaxMDCount);
972 uint64_t Sum, InstrProfValueKind ValueKind,
984 MDHelper.createConstant(ConstantInt::get(Type::getInt64Ty(Ctx), Sum)));
1180 CountSumOrPercent &Sum) -> Error
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/ParallelJIT/ |
| ParallelJIT.cpp | 122 Value *Sum =
126 ReturnInst::Create(Context, Sum, RecurseBB);
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/X86/ |
| X86Counter.cpp | 162 int Sum = 0;
172 Sum += *P;
|
| /src/sys/external/bsd/drm2/dist/drm/amd/powerplay/hwmgr/ |
| ppevvmath.h | 61 static fInt fAdd (fInt, fInt); /* Returns the sum of two fInt numbers */
301 fInt Sum;
303 Sum.full = X.full + Y.full;
305 return Sum;
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| AliasAnalysisEvaluator.cpp | 330 static void PrintPercent(int64_t Num, int64_t Sum) {
331 errs() << "(" << Num * 100LL / Sum << "." << ((Num * 1000LL / Sum) % 10)
|
| DependenceAnalysis.cpp | 571 const SCEV *Sum = SE->getAddExpr(A1X1, B1Y1);
572 if (isKnownPredicate(CmpInst::ICMP_EQ, Sum, Y->getC()))
574 if (isKnownPredicate(CmpInst::ICMP_NE, Sum, Y->getC())) {
2366 if (const SCEVAddExpr *Sum = dyn_cast<SCEVAddExpr>(Delta)) {
2367 // If Delta is a sum of products, we may be able to make further progress.
2368 for (unsigned Op = 0, Ops = Sum->getNumOperands(); Op < Ops; Op++) {
2369 const SCEV *Operand = Sum->getOperand(Op);
2947 const SCEV *Sum = Bound[1].Lower[Bound[1].Direction];
2948 for (unsigned K = 2; Sum && K <= MaxLevels; ++K) {
2950 Sum = SE->getAddExpr(Sum, Bound[K].Lower[Bound[K].Direction])
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| ScalarEvolutionExpander.cpp | 369 const SCEV *Sum = NoAddRecs.empty() ?
373 // the sum into a single value, so just use that.
375 if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(Sum))
377 else if (!Sum->isZero())
378 Ops.push_back(Sum);
750 Value *Sum = nullptr;
754 if (!Sum) {
756 Sum = expand(Op);
758 } else if (PointerType *PTy = dyn_cast<PointerType>(Sum->getType())) {
759 // The running sum expression is a pointer. Try to form a getelementpt
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LowerMatrixIntrinsics.cpp | 970 Value *createMulAdd(Value *Sum, Value *A, Value *B, bool UseFPOp,
974 if (!Sum)
983 return Builder.CreateCall(FMulAdd, {A, B, Sum});
987 return Builder.CreateFAdd(Sum, Mul);
992 return Builder.CreateAdd(Sum, Mul);
1054 Value *Sum = IsTiled ? Result.extractVector(I, J, BlockSize, Builder)
1062 Sum = createMulAdd(isSumZero && K == 0 ? nullptr : Sum, L, Splat,
1067 insertVector(Result.getVector(J), I, Sum, Builder));
1082 Value *Sum = nullptr
[all...] |
