Home
last modified time | relevance | path

Searched full:complexity (Results 1 – 25 of 355) sorted by relevance

12345678910>>...15

/freebsd/contrib/bc/manuals/
H A Dalgorithms.md50 2. It minimizes algorithmic complexity.
53 complexity of `O(n^(2*log_2(3)))` (best case) and `O(n^3)` (worst case).
58 a complexity of `O((n*log(n))^log_2(3))` which is favorable to the
67 Its complexity is `O(log(n)*n^2)` as it requires one division per iteration, and
84 to calculate `cos(x)`. It has a complexity of `O(n^3)`.
110 It has a complexity of `O(n^3)`.
133 It has a complexity of `O(n^3)`.
153 to reduce `x` to small enough. It has a complexity of `O(n^3)`.
175 to calculate the bessel when `x < 0`, It has a complexity of `O(n^3)`.
184 exponentiation. The complexity is `O(e*n^2)`, which may initially seem
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DRangedConstraintManager.h128 /// Complexity: O(N + M)
134 /// Complexity: O(N)
140 /// Complexity: O(N)
146 /// Complexity: O(N + M)
152 /// Complexity: O(N)
158 /// Complexity: O(N)
164 /// Complexity: O(N)
183 /// Complexity: O(N + M)
195 /// Complexity: O(N)
203 /// Complexity: O(logN)
[all …]
H A DSymbolManager.h298 if (Complexity == 0) in computeComplexity()
299 Complexity = 1 + Operand->computeComplexity(); in computeComplexity()
300 return Complexity; in computeComplexity()
348 if (Complexity == 0) in computeComplexity()
349 Complexity = 1 + Operand->computeComplexity(); in computeComplexity()
350 return Complexity; in computeComplexity()
447 if (Complexity == 0) in computeComplexity()
448 Complexity = in computeComplexity()
450 return Complexity; in computeComplexity()
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DCloneDetection.cpp424 size_t Complexity = 1; in calculateStmtComplexity() local
435 // statement, we reduce the initial complexity of this statement to zero. in calculateStmtComplexity()
437 // macro expansion will only increase the total complexity by one. in calculateStmtComplexity()
438 // Note: This is not the final complexity of this statement as we still in calculateStmtComplexity()
439 // add the complexity of the child statements to the complexity value. in calculateStmtComplexity()
441 Complexity = 0; in calculateStmtComplexity()
444 // Iterate over the Stmts in the StmtSequence and add their complexity values in calculateStmtComplexity()
445 // to the current complexity value. in calculateStmtComplexity()
448 Complexity += calculateStmtComplexity( in calculateStmtComplexity()
450 if (Complexity >= Limit) in calculateStmtComplexity()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DDSInstructions.td429 class DSAtomicRetPat<DS_Pseudo inst, ValueType vt, PatFrag frag, int complexity = 0,
432 let AddedComplexity = complexity;
743 !cast<PatFrag>(frag#"_noret_local_addrspace"), /* complexity */ 1>;
978 /* complexity */ 0, /* gds */ 1>;
988 !cast<PatFrag>(frag#"_local_m0_noret_"#vt), /* complexity */ 1>;
995 !cast<PatFrag>(frag#"_local_noret_"#vt), /* complexity */ 1>;
1001 /* complexity */ 0, /* gds */ 1>;
1004 /* complexity */ 1, /* gds */ 1>;
1013 int complexity = 0, bit gds=0> : GCNPat<
1016 let AddedComplexity = complexity;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dset_intersection.h69 // reduce best-case complexity to log(N). Understanding how we can use binary search and still resp…
78 // elements, or position 5 if the set has 7 or 8 elements, but we'll never exceed the complexity gu…
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/
H A DCloneDetection.h270 /// Ensures that every clone has at least the given complexity.
272 /// Complexity is here defined as the total amount of children of a statement.
274 /// for all other statements in the group in terms of complexity.
282 /// Calculates the complexity of the given StmtSequence.
283 /// \param Limit The limit of complexity we probe for. After reaching
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDependenceGraphBuilder.h54 /// The algorithmic complexity of this implementation is O(V^2 * I^2), where V
57 /// therefore the worst-case time complexity is O(N^2). The average time
58 /// complexity is O((N^2)/2).
/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DDAGISelEmitter.cpp82 // a particular complexity first.
99 // Otherwise, if the patterns might both match, sort based on complexity, in operator ()()
109 // If the patterns have equal complexity, compare generated instruction cost in operator ()()
H A DFastISelEmitter.cpp386 // the instruction's complexity (an int) and they are not unique.
595 int complexity = Pattern.getPatternComplexity(CGP); in collectPatterns() local
604 // Note: Instructions with the same complexity will appear in the order in collectPatterns()
606 SimplePatterns[Operands][OpcodeName][VT][RetVT].emplace(complexity, in collectPatterns()
639 // is used to produce the ones with highest complexity first. in emitInstructionCode()
/freebsd/share/doc/papers/jail/
H A Dpaper.ms34 and implementation complexity.
76 applications, which means an increase in the size and complexity
191 complexity of the administration process, in turn increasing both the
193 administrator time and resources. In many cases, the increased complexity
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSmallString.h172 /// Complexity: O(size() + Chars.size())
186 /// Complexity: O(size() + Chars.size())
202 /// Complexity: O(size() + Chars.size())
H A DSmallSet.h263 /// For small-set mode amortized complexity is O(N^2)
264 /// For large-set mode amortized complexity is linear, worst case is O(N^2) (if
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenTarget.cpp413 // possible pattern match we'll need to dynamically calculate the complexity in ComplexPattern()
415 int64_t RawComplexity = R->getValueAsInt("Complexity"); in ComplexPattern()
417 Complexity = NumOperands * 3; in ComplexPattern()
419 Complexity = RawComplexity; in ComplexPattern()
H A DCodeGenTarget.h240 unsigned Complexity; variable
250 unsigned getComplexity() const { return Complexity; } in getComplexity()
/freebsd/crypto/openssl/Configurations/
H A Dcommon0.tmpl4 # The reason for the complexity is that the build.info files provide
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/
H A DAnalyzerOptions.def407 ANALYZER_OPTION(unsigned, MaxSymbolComplexity, "max-symbol-complexity",
408 "The maximum complexity of symbolic constraint.", 35)
412 ANALYZER_OPTION(unsigned, MaxTaintedSymbolComplexity, "max-tainted-symbol-complexity",
413 "[DEPRECATED] The maximum complexity of a symbol to carry taint", 9)
/freebsd/sys/contrib/device-tree/Bindings/net/
H A Dadi,adin1110.yaml18 The ADIN2111 is a low power, low complexity, two-Ethernet ports
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFRelocMap.h32 /// dwarf where we expect relocated values. This adds a bit of complexity to the
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DUnreachableBlockElim.h18 // complexity.
/freebsd/crypto/openssl/ssl/statem/
H A DREADME.md25 - Control complexity: only the state machine can change state: keep all
/freebsd/usr.bin/getopt/
H A Dgetopt.1132 would move much of the complexity into the tool and keep the client
/freebsd/contrib/libcbor/doc/source/api/
H A Dtype_2.rst17 …en before they are fully generated, but on the other hand it adds more complexity to the client co…
/freebsd/lib/libsys/
H A Dgetpgrp.2105 suffices, and the added complexity of the
/freebsd/share/man/man4/
H A Dgbde.4

12345678910>>...15