Home
last modified time | relevance | path

Searched refs:complexity (Results 1 – 25 of 55) sorted by relevance

123

/freebsd-14.2/contrib/bc/manuals/
H A Dalgorithms.md50 2. It minimizes algorithmic complexity.
58 a complexity of `O((n*log(n))^log_2(3))` which is favorable to the
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)`.
271 It has a complexity of `O(n)` because of add.
279 It has a complexity of `O(n)` because of add.
361 It has a complexity of `O(n^4)` because of `gcd()`.
369 It has a complexity of `O(n^3)` because of arctangent.
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DDSInstructions.td443 let AddedComplexity = complexity;
988 /* complexity */ 0, /* gds */ 1>;
1011 /* complexity */ 0, /* gds */ 1>;
1014 /* complexity */ 1, /* gds */ 1>;
1023 int complexity = 0, bit gds=0> : GCNPat<
1026 let AddedComplexity = complexity;
1034 /* complexity */ 1>;
1042 /* complexity */ 1>;
1057 int complexity = 0, bit gds=0> : GCNPat<
1060 let AddedComplexity = complexity;
[all …]
H A DVOPInstructions.td94 // Using complex patterns gives VOP3 patterns a very high complexity rating,
96 // priority lower. The goal is to use a high number to reduce complexity to
143 // Using complex patterns gives VOP3 patterns a very high complexity rating,
145 // priority lower. The goal is to use a high number to reduce complexity to
H A DFLATInstructions.td1175 ValueType data_vt = vt, int complexity = 0,
1180 let AddedComplexity = complexity in
1183 let AddedComplexity = !add(complexity, 1) in
1189 defm : FlatSignedAtomicPat<inst, node, vt, data_vt, /* complexity */ 0, /* isIntr */ 1>;
/freebsd-14.2/crypto/openssl/Configurations/
H A Dcommon0.tmpl4 # The reason for the complexity is that the build.info files provide
/freebsd-14.2/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-14.2/sys/contrib/device-tree/Bindings/net/
H A Dadi,adin1110.yaml18 The ADIN2111 is a low power, low complexity, two-Ethernet ports
/freebsd-14.2/crypto/openssl/ssl/statem/
H A DREADME.md25 - Control complexity: only the state machine can change state: keep all
/freebsd-14.2/crypto/openssl/crypto/
H A DREADME-sparse_array.md110 The complexity is hidden and nodes are allocated on an as needed basis.
/freebsd-14.2/contrib/libcbor/doc/source/
H A Ddevelopment.rst32 there is no significant complexity reduction that can be achieved by slightly
/freebsd-14.2/contrib/llvm-project/llvm/utils/TableGen/
H A DFastISelEmitter.cpp587 int complexity = Pattern.getPatternComplexity(CGP); in collectPatterns() local
598 SimplePatterns[Operands][OpcodeName][VT][RetVT].emplace(complexity, in collectPatterns()
H A DCodeGenDAGPatterns.h1080 int complexity, unsigned uid,
1084 HwModeFeatures(hwmodefeatures.str()), AddedComplexity(complexity), in SrcRecord()
/freebsd-14.2/crypto/openssl/doc/man3/
H A DSSL_set_bio.pod95 Because of this complexity, this function should be avoided;
H A DSSL_CTX_set_security_level.pod128 By setting an appropriate security level much of this complexity can be
H A DX509_STORE_CTX_new.pod103 instead of using an B<X509_STORE> where its complexity is not needed
/freebsd-14.2/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/
H A DAnalyzerOptions.def387 ANALYZER_OPTION(unsigned, MaxSymbolComplexity, "max-symbol-complexity",
388 "The maximum complexity of symbolic constraint.", 35)
/freebsd-14.2/contrib/bzip2/
H A DREADME123 ensure that this program works correctly. However, the complexity
/freebsd-14.2/contrib/ncurses/doc/
H A Dhackguide.doc270 environment, but nevertheless have only fairly low complexity. These
294 Most of the algorithmic complexity in the library lives in these
572 To hold down complexity, do make your code data-driven. Especially, if
/freebsd-14.2/sys/dev/isp/
H A DHardware.txt276 E. The next level of complexity is a Switched Fabric. The following topology
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonIntrinsics.td89 // Make sure the patterns with zero immediate value has higher complexity
H A DHexagonPatterns.td1153 // The complexity of the combines involving immediates should be greater
1154 // than the complexity of the combine with two registers.
1162 // The complexity of the combine with two immediates should be greater than
1163 // the complexity of a combine involving a register.
2012 // Add extra complexity to prefer these instructions over bitsset/bitsclr.
2035 // Do not increase complexity of these patterns. In the DAG, "cmp i8" may be
2038 // complexity that would make them preferable, and if they were actually used
/freebsd-14.2/contrib/llvm-project/lld/docs/
H A DNewLLD.rst39 to abstract the differences wouldn't be worth its complexity and run-time
/freebsd-14.2/contrib/atf/
H A DNEWS347 supporting use.fs adds a lot of unnecessary complexity. atf-run will
458 documents. They provided little value and introduced a lot of complexity
/freebsd-14.2/contrib/one-true-awk/testdir/
H A Dfunstack.in758 …keywords = "compilers; computational complexity; context-free grammar; parsing; syntax analysi…
6874 …keywords = "complexity; computational; computational combinatorics; computational combinatorie…
16511 …keywords = "binary comparisons; computational complexity; computing models; data modeling; mer…
16512 …keywords = "computation time; computational complexity; merge sorting; merging; sets of number…
17487 …complexity; context free grammar; context-free grammars; LR(k) grammars; nondeterministic exponent…
18975 … = "comparison problems; computational complexity; computer metatheory; concrete computational…
19722 …keywords = "complexity; computational complexity; computer graphics; computer programming; con…
21209 … "algebraic complexity; algorithmic cost functions; algorithms; automata theory; complexity of…
23374 title = "On the complexity of computing the measure of {$\bigcup[a_i,b_i]$}",
23394 …heory; computational complexity; computational model; computer metatheory; computer programming; c…
[all …]
/freebsd-14.2/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Checkers/
H A DCheckers.td1671 "Ensures that every clone has at least the given complexity. "
1675 "the group in terms of complexity.",

123