Home
last modified time | relevance | path

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

123

/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/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 …]
H A DVOPInstructions.td81 // Using complex patterns gives VOP3 patterns a very high complexity rating,
83 // priority lower. The goal is to use a high number to reduce complexity to
130 // Using complex patterns gives VOP3 patterns a very high complexity rating,
132 // priority lower. The goal is to use a high number to reduce complexity to
H A DFLATInstructions.td1165 ValueType data_vt = vt, int complexity = 0,
1170 let AddedComplexity = complexity in
1173 let AddedComplexity = !add(complexity, 1) in
/freebsd/crypto/openssl/Configurations/
H A Dcommon0.tmpl4 # The reason for the complexity is that the build.info files provide
/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/crypto/openssl/ssl/statem/
H A DREADME.md25 - Control complexity: only the state machine can change state: keep all
/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/crypto/openssl/crypto/
H A DREADME-sparse_array.md110 The complexity is hidden and nodes are allocated on an as needed basis.
/freebsd/contrib/libcbor/doc/source/
H A Ddevelopment.rst32 there is no significant complexity reduction that can be achieved by slightly
/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DFastISelEmitter.cpp595 int complexity = Pattern.getPatternComplexity(CGP); in collectPatterns() local
606 SimplePatterns[Operands][OpcodeName][VT][RetVT].emplace(complexity, in collectPatterns()
/freebsd/crypto/openssl/doc/man3/
H A DSSL_set_bio.pod86 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.pod97 instead of using an B<X509_STORE> where its complexity is not needed
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenDAGPatterns.h1069 int complexity, unsigned uid, bool ignore,
1073 HwModeFeatures(hwmodefeatures.str()), AddedComplexity(complexity), in SrcRecord()
/freebsd/contrib/bzip2/
H A DREADME123 ensure that this program works correctly. However, the complexity
/freebsd/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/sys/dev/isp/
H A DHardware.txt276 E. The next level of complexity is a Switched Fabric. The following topology
/freebsd/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/contrib/llvm-project/lld/docs/
H A DNewLLD.rst39 to abstract the differences wouldn't be worth its complexity and run-time
/freebsd/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/contrib/one-true-awk/testdir/
H A Dfunstack.in758 …keywords = "compilers; computational complexity; context-free grammar; parsing; syntax analysi…
3184 …e number of circuits in the graph to give a relation between speed and complexity. Extensions to u…
5619 …ocess, and the possibility of shrinking any pattern, regardless of the complexity of its configura…
6874 …keywords = "complexity; computational; computational combinatorics; computational combinatorie…
8784 …s with known methods are given, in terms of efficiency and computation complexity. In particular, …
12988 …keywords = "algorithms; bounded workspace; complexity; computer programming; copying list stru…
13247 …keywords = "compilation costs; compiler design; computational complexity; computer programming…
15691 …keywords = "algorithm theory; bound; computational complexity; computer programming; mathemati…
16086 …malizing the interaction of data base content characteristics, logical complexity of queries, and …
16438 …tomata theory --- Finite Automata; bibliographic search; computational complexity.; efficient; fin…
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Checkers/
H A DCheckers.td1681 "Ensures that every clone has at least the given complexity. "
1685 "the group in terms of complexity.",
/freebsd/contrib/mandoc/
H A DNEWS478 than to bother with the complexity of manpath(1).
1163 and complexity.
1265 * Backed out -fno-ign-chars (pointless complexity).

123