Home
last modified time | relevance | path

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

12

/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dtree-ssa-loop-ivopts.c160 unsigned complexity; /* The estimate of the complexity of the code for member
2617 new_cost (unsigned runtime, unsigned complexity) in new_cost() argument
2622 cost.complexity = complexity; in new_cost()
2633 cost1.complexity += cost2.complexity; in add_costs()
2643 cost1.complexity -= cost2.complexity; in sub_costs()
2655 return cost1.complexity - cost2.complexity; in compare_costs()
3246 unsigned cost, acost, complexity; in get_address_cost() local
3500 complexity = (symbol_present != 0) + (var_present != 0) + offset_p + ratio_p; in get_address_cost()
3501 return new_cost (cost + acost, complexity); in get_address_cost()
4207 cost.complexity++; in get_computation_cost_at()
[all …]
H A Dparams.def489 "scev-max-expr-complexity",
490 "Bound on the complexity of the expressions in the scalar evolutions analyzer",
/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dtree-ssa-loop-ivopts.c180 comp_cost (): cost (0), complexity (0), scratch (0) in comp_cost()
183 comp_cost (int cost, unsigned complexity, int scratch = 0)
184 : cost (cost), complexity (complexity), scratch (scratch) in cost()
224 unsigned complexity; /* The estimate of the complexity of the code for member
247 cost1.complexity += cost2.complexity;
261 cost1.complexity -= cost2.complexity;
328 return cost1.complexity < cost2.complexity;
337 && cost1.complexity == cost2.complexity;
4526 cost.complexity += 1; in get_address_cost()
4530 cost.complexity += 1; in get_address_cost()
[all …]
H A Dvar-tracking.c301 int complexity; member
8128 VAR_LOC_DEPTH (var).complexity = 0; in loc_exp_dep_alloc()
8301 if (!best_depth.complexity) in update_depth()
8308 if (!saved_depth.complexity) in update_depth()
8316 if (saved_depth.complexity < best_depth.complexity) in update_depth()
8383 elcd->depth.complexity = elcd->depth.entryvals = 0; in vt_expand_var_loc_chain()
8392 gcc_checking_assert (depth.complexity in vt_expand_var_loc_chain()
8397 if (!depth.complexity && GET_CODE (result) == ENTRY_VALUE) in vt_expand_var_loc_chain()
8399 depth.complexity++; in vt_expand_var_loc_chain()
8402 if (depth.complexity <= EXPR_USE_DEPTH) in vt_expand_var_loc_chain()
[all …]
H A Dparams.def556 "scev-max-expr-complexity",
557 "Bound on the complexity of the expressions in the scalar evolutions analyzer.",
/dflybsd-src/share/examples/diskless/
H A DME48 softlink. The advantage is that for all the complexity of your /conf
H A DREADME.TEMPLATING169 added complexity actually makes it easier to manage multiple
/dflybsd-src/contrib/bzip2/
H A DREADME123 ensure that this program works correctly. However, the complexity
/dflybsd-src/contrib/tre/
H A DREADME10 the time complexity of the algorithm is O(M^2N), where M is the
/dflybsd-src/usr.bin/window/
H A DREADME188 The result of all this complexity is faster response time,
/dflybsd-src/sys/dev/disk/isp/
H A DHardware.txt277 E. The next level of complexity is a Switched Fabric. The following topology
/dflybsd-src/sys/vfs/hammer2/
H A DDESIGN151 complexity of the dependencies, occur asynchronously and can make very
384 low cost without too much added complexity.
429 operations of any complexity, even on boxes with very small amounts
615 complexity of having to deal with mixed block sizes in the buffer cache,
H A DFREEMAP134 blockref. The algorithmic complexity of determining locality is not
/dflybsd-src/
H A DUPDATING456 building Objective-C compiler is so small, the complexity added by NO_OBJC
/dflybsd-src/contrib/wpa_supplicant/wpa_supplicant/
H A DREADME974 without having to handle the complexity of separate wpa_priv. While that
/dflybsd-src/contrib/gcc-4.7/gcc/doc/
H A Dcppinternals.texi159 before processing them. This complexity is therefore unnecessary and
H A Dgimple.texi33 does not require the full structural complexity provided by the
H A Dmd.texi1519 classes are defined. Then none of this complexity is relevant.
8164 complexity@footnote{However, the size of the automaton depends on
8165 processor complexity. To limit this effect, machine descriptions
H A Dcpp.texi535 from the full complexity of numeric constants. It does not have to
/dflybsd-src/contrib/flex/src/
H A Dflex.skl109 %# The complexity here is necessary so that m4 preserves
/dflybsd-src/contrib/gcc-4.7/libstdc++-v3/include/tr1/
H A Dregex388 * The complexity of an attempted match against a regular expression
/dflybsd-src/contrib/gcc-8.0/libstdc++-v3/include/tr1/
H A Dregex388 * The complexity of an attempted match against a regular expression
/dflybsd-src/games/fortune/datfiles/
H A Dmurphy1331 Program complexity grows until it exceeds the capability
/dflybsd-src/share/zoneinfo/
H A Dnorthamerica898 # Fortunately, most of the complexity occurred before our cutoff date of 1970.
/dflybsd-src/sys/contrib/dev/acpica/
H A Dchanges.txt6003 methods that had any reasonable complexity. This fix brings the command
13019 reduces overall subsystem code size and code complexity. Affects the
14326 rewritten to eliminate unnecessary complexity, bugs, and boundary
14616 size and complexity.

12