| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| complexity.h | 1 /* Measuring the complexity of svalues/regions.
26 /* A measurement of the complexity of an svalue or region, so that
30 struct complexity struct in namespace:ana
32 complexity (unsigned num_nodes, unsigned max_depth) function in struct:ana::complexity
36 complexity (const region *reg);
37 complexity (const svalue *sval);
38 static complexity from_pair (const complexity &c1, const complexity &c);
39 static complexity from_vec_svalue (const vec<const svalue *> &vec)
[all...] |
| complexity.cc | 1 /* Measuring the complexity of svalues/regions.
52 #include "analyzer/complexity.h"
60 /* struct complexity. */
62 /* Get complexity for a new node that references REG
63 (the complexity of REG, plus one for the new node). */
65 complexity::complexity (const region *reg) function in class:ana::complexity
71 /* Get complexity for a new node that references SVAL.
72 (the complexity of SVAL, plus one for the new node). */
74 complexity::complexity (const svalue *sval function in class:ana::complexity
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| complexity.h | 1 /* Measuring the complexity of svalues/regions.
26 /* A measurement of the complexity of an svalue or region, so that
30 struct complexity struct in namespace:ana
32 complexity (unsigned num_nodes, unsigned max_depth) function in struct:ana::complexity
36 complexity (const region *reg);
37 complexity (const svalue *sval);
38 static complexity from_pair (const complexity &c1, const complexity &c);
39 static complexity from_vec_svalue (const vec<const svalue *> &vec)
[all...] |
| complexity.cc | 1 /* Measuring the complexity of svalues/regions.
55 #include "analyzer/complexity.h"
63 /* struct complexity. */
65 /* Get complexity for a new node that references REG
66 (the complexity of REG, plus one for the new node). */
68 complexity::complexity (const region *reg) function in class:ana::complexity
74 /* Get complexity for a new node that references SVAL.
75 (the complexity of SVAL, plus one for the new node). */
77 complexity::complexity (const svalue *sval function in class:ana::complexity
[all...] |
| /src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/src/ |
| complexity.h | 37 // - complexity : Scalability form (e.g. oN, oNLogN). In case a scalability
43 LeastSq() : coef(0.0), rms(0.0), complexity(oNone) {}
47 BigO complexity; member in struct:benchmark::LeastSq
50 // Function to return an string for the calculated complexity
51 std::string GetBigOString(BigO complexity);
|
| benchmark_api_internal.h | 27 BigO complexity; member in struct:benchmark::internal::BenchmarkInstance
|
| /src/external/apache2/llvm/dist/llvm/utils/benchmark/src/ |
| complexity.h | 37 // - complexity : Scalability form (e.g. oN, oNLogN). In case a scalability
43 LeastSq() : coef(0.0), rms(0.0), complexity(oNone) {}
47 BigO complexity; member in struct:benchmark::LeastSq
50 // Function to return an string for the calculated complexity
51 std::string GetBigOString(BigO complexity);
|
| benchmark_api_internal.h | 25 BigO complexity; member in struct:benchmark::internal::Benchmark::Instance
|
| /src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/include/benchmark/ |
| benchmark.h | 412 // complexity for the benchmark. In case oAuto is selected, complexity will be
417 // computational complexity for the benchmark.
568 // If this routine is called with complexity_n > 0 and complexity report is
893 // Set the asymptotic computational complexity for the benchmark. If called
894 // the asymptotic computational complexity will be shown on the output.
895 Benchmark* Complexity(BigO complexity = benchmark::oAuto);
897 // Set the asymptotic computational complexity for the benchmark. If called
898 // the asymptotic computational complexity will be shown on the output
1371 BigO complexity; member in struct:benchmark::BenchmarkReporter::Run
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-loop-ivopts.cc | 208 comp_cost (): cost (0), complexity (0), scratch (0)
211 comp_cost (int64_t cost, unsigned complexity, int64_t scratch = 0)
212 : cost (cost), complexity (complexity), scratch (scratch)
252 unsigned complexity; /* The estimate of the complexity of the code for member in class:comp_cost
254 complexity field should be larger for more
276 cost1.complexity += cost2.complexity;
291 cost1.complexity -= cost2.complexity
[all...] |
| var-tracking.cc | 294 /* This measures the complexity of the expanded expression. It
297 int complexity; member in struct:expand_depth
5830 don't unshare RTL, so excess complexity is not a problem. */
8147 VAR_LOC_DEPTH (var).complexity = 0;
8320 if (!best_depth.complexity)
8327 if (!saved_depth.complexity)
8335 if (saved_depth.complexity < best_depth.complexity)
8402 elcd->depth.complexity = elcd->depth.entryvals = 0;
8411 gcc_checking_assert (depth.complexity
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-loop-ivopts.cc | 208 comp_cost (): cost (0), complexity (0), scratch (0)
211 comp_cost (int64_t cost, unsigned complexity, int64_t scratch = 0)
212 : cost (cost), complexity (complexity), scratch (scratch)
252 unsigned complexity; /* The estimate of the complexity of the code for member in class:comp_cost
254 complexity field should be larger for more
276 cost1.complexity += cost2.complexity;
291 cost1.complexity -= cost2.complexity
[all...] |
| var-tracking.cc | 298 /* This measures the complexity of the expanded expression. It
301 int complexity; member in struct:expand_depth
5845 don't unshare RTL, so excess complexity is not a problem. */
8164 VAR_LOC_DEPTH (var).complexity = 0;
8337 if (!best_depth.complexity)
8344 if (!saved_depth.complexity)
8352 if (saved_depth.complexity < best_depth.complexity)
8419 elcd->depth.complexity = elcd->depth.entryvals = 0;
8428 gcc_checking_assert (depth.complexity
[all...] |
