| /netbsd/src/external/gpl3/gcc/dist/gcc/ |
| D | tree-ssa-loop-ivopts.cc | 208 comp_cost (): cost (0), complexity (0), scratch (0) in comp_cost()
211 comp_cost (int64_t cost, unsigned complexity, int64_t scratch = 0) in comp_cost() argument
212 : cost (cost), complexity (complexity), scratch (scratch) in comp_cost()
252 unsigned complexity; /* The estimate of the complexity of the code for member in comp_cost
276 cost1.complexity += cost2.complexity; in operator +()
291 cost1.complexity -= cost2.complexity; in operator -()
365 return cost1.complexity < cost2.complexity; in operator <()
374 && cost1.complexity == cost2.complexity; in operator ==()
4809 cost.complexity += 1; in get_address_cost()
4813 cost.complexity += 1; in get_address_cost()
[all …]
|
| D | var-tracking.cc | 301 int complexity; member
8164 VAR_LOC_DEPTH (var).complexity = 0; in loc_exp_dep_alloc()
8337 if (!best_depth.complexity) in update_depth()
8344 if (!saved_depth.complexity) in update_depth()
8352 if (saved_depth.complexity < best_depth.complexity) in update_depth()
8419 elcd->depth.complexity = elcd->depth.entryvals = 0; in vt_expand_var_loc_chain()
8428 gcc_checking_assert (depth.complexity in vt_expand_var_loc_chain()
8433 if (!depth.complexity && GET_CODE (result) == ENTRY_VALUE) in vt_expand_var_loc_chain()
8435 depth.complexity++; in vt_expand_var_loc_chain()
8438 if (depth.complexity <= EXPR_USE_DEPTH) in vt_expand_var_loc_chain()
[all …]
|
| D | params.opt | 934 -param=scev-max-expr-complexity=
936 Bound on the complexity of the expressions in the scalar evolutions analyzer.
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/config/sparc/ |
| D | niagara4.md | 81 ;; the HW chaps didn't feel it necessary to document the complexity in
|
| /netbsd/src/external/lgpl3/gmp/dist/mpn/x86/ |
| D | divrem_1.asm | 87 C loops. But it's considered easier not to introduce complexity just for
|
| /netbsd/src/crypto/external/bsd/openssl/dist/crypto/ |
| D | README-sparse_array.md | 110 The complexity is hidden and nodes are allocated on an as needed basis.
|
| /netbsd/src/external/ibm-public/postfix/dist/ |
| D | RELEASE_NOTES-3.8 | 127 databases was added, and that code suffered from complexity.
|
| /netbsd/src/external/bsd/bzip2/dist/ |
| D | README | 123 ensure that this program works correctly. However, the complexity
|
| /netbsd/src/external/bsd/openldap/dist/doc/rfc/ |
| D | rfc4525.txt | 136 introduction of this extension should reduce application complexity
|
| D | rfc3909.txt | 191 Start TLS extended operation so as to avoid adding complexity to
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/config/mips/ |
| D | sr71k.md | 83 ;; reduce the complexity of cpu+fpu, reducing space.
|
| /netbsd/src/external/bsd/tre/dist/ |
| D | README.md | 12 In other words, the time complexity of the algorithm is O(M^2N), where
|
| /netbsd/src/doc/roadmaps/ |
| D | mess | 62 once those are done a lot of the complexity currently in namei and in
|
| /netbsd/src/external/bsd/atf/dist/ |
| D | NEWS | 270 supporting use.fs adds a lot of unnecessary complexity. atf-run will
381 documents. They provided little value and introduced a lot of complexity
|
| /netbsd/src/sys/arch/m68k/fpsp/ |
| D | setox.sa | 288 * two independent pieces of roughly equal complexity
347 * two independent pieces of roughly equal complexity
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/config/sh/ |
| D | sh4.md | 34 ;; processor complexity.
|
| /netbsd/src/doc/ |
| D | TODO.npf | 184 are: 1) what kind of complexity of rule chains do we want to support,
|
| /netbsd/src/external/bsd/openldap/dist/doc/drafts/ |
| D | draft-ietf-ldapext-ldapv3-dupent-xx.txt | 157 attribute. Because of the potential complexity involved in servicing
|
| /netbsd/src/external/bsd/mdocml/dist/ |
| D | NEWS | 279 than to bother with the complexity of manpath(1).
964 and complexity.
1066 * Backed out -fno-ign-chars (pointless complexity).
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/config/rs6000/ |
| D | rs6000-overload.def | 572 ; We skip generating a #define because of the C-versus-C++ complexity
681 ; We skip generating a #define because of the C-versus-C++ complexity
782 ; We skip generating a #define because of the C-versus-C++ complexity
871 ; We skip generating a #define because of the C-versus-C++ complexity
962 ; We skip generating a #define because of the C-versus-C++ complexity
1047 ; We skip generating a #define because of the C-versus-C++ complexity
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/doc/ |
| D | analyzer.texi | 362 hopefully keeps the complexity manageable.
|
| /netbsd/src/external/gpl2/xcvs/dist/ |
| D | HACKING | 363 CVS. Is it worth the cost (in terms of complexity or any other
|
| /netbsd/src/external/ibm-public/postfix/dist/README_FILES/ |
| D | LDAP_README | 175 increasing complexity, but owing to the number of independent variables, we can
|
| /netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/ |
| D | ChangeLog-2014 | 1248 * testsuite/25_algorithms/make_heap/complexity.cc: Add missing test
1250 * testsuite/25_algorithms/sort_heap/complexity.cc: Likewise and use
1252 * testsuite/25_algorithms/pop_heap/complexity.cc: Likewise and require
1254 * testsuite/25_algorithms/push_heap/complexity.cc: Likewise.
4761 * testsuite/25_algorithms/make_heap/complexity.cc: New.
4762 * testsuite/25_algorithms/pop_heap/complexity.cc: New.
4763 * testsuite/25_algorithms/push_heap/complexity.cc: New.
4764 * testsuite/25_algorithms/sort_heap/complexity.cc: New.
|
| /netbsd/src/crypto/dist/ipsec-tools/src/racoon/rfc/ |
| D | rfc3706.txt | 297 degree of complexity. Similarly, the need to send periodic messages
|