| /hardware/libhardware/include/hardware/ |
| camera_common.h | 244 * The total resource "cost" of using this camera, represented as an integer
253 * the resource costs of these cameras is <= 100. For determining cost,
260 * of camera devices with a total resource cost > 100. This may succeed or
263 * should fail during the configure calls. If the total resource cost is
[all...] |
| /libcore/benchmarks/src/benchmarks/regression/ |
| StrictMathBenchmark.java | 20 * Many of these tests are bogus in that the cost will vary wildly depending on inputs.
|
| /libcore/luni/src/main/java/libcore/io/ |
| IoUtils.java | 205 // at the cost of copying some code from IoBridge.open.
|
| /libcore/luni/src/test/java/libcore/java/net/ |
| InetSocketAddressTest.java | 148 // When we have a hostname, we'll get it back because that doesn't cost a DNS lookup...
|
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_utilities_indexing.h | 234 The total quickselect cost of splitting 500 hypotheses recursively
|
| /packages/apps/TvSettings/Settings/src/com/android/tv/settings/dialog/old/ |
| Action.java | 285 * e.g. Play balance, or cost of an app.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/profile/impl/ |
| profiler_vector_to_list.h | 198 // Collect cost of operations.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/profile/impl/ |
| profiler_vector_to_list.h | 198 // Collect cost of operations.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/profile/impl/ |
| profiler_vector_to_list.h | 198 // Collect cost of operations.
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| malloc.go | 35 // Moving a bunch amortizes the cost of acquiring the MCentral lock.
40 // Allocating many objects amortizes the cost of locking
46 // amortizes the cost of talking to the operating system.
77 // 2. the cost of zeroing when reusing a small object is
|
| memmove_amd64.s | 37 // REP instructions have a high startup cost, so we handle small sizes
|
| /prebuilts/go/linux-x86/src/runtime/ |
| malloc.go | 35 // Moving a bunch amortizes the cost of acquiring the MCentral lock.
40 // Allocating many objects amortizes the cost of locking
46 // amortizes the cost of talking to the operating system.
77 // 2. the cost of zeroing when reusing a small object is
|
| memmove_amd64.s | 37 // REP instructions have a high startup cost, so we handle small sizes
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/impl/ |
| profiler_vector_to_list.h | 198 // Collect cost of operations.
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/sdb/ |
| connection.py | 238 cost = self.box_usage * 0.14
239 print('Approximate Cost: $%f' % cost)
|
| /external/eigen/unsupported/Eigen/ |
| MatrixFunctions | 128 The cost of the computation is approximately \f$ 20 n^3 \f$ for
401 cost is approximately \f$ 25 n^3 \f$ real flops for the real Schur
422 triangular matrix. The theoretical cost is the same. Details are in:
|
| /external/iptables/extensions/ |
| libxt_hashlimit.c | 153 static uint32_t cost_to_bytes(uint32_t cost)
157 r = cost ? UINT32_MAX / cost : UINT32_MAX;
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_aq_cyclicrefresh.c | 66 // larger than bit cost of segmentation. Segment map bit cost should scale
556 // based on the coding cost of each method. For error_resilient mode on the
|
| /external/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 397 // by removing the old cost.
402 // And update now the metadata with the new cost.
488 // node exists then the node with the lowest spill-cost:degree ratio is
|
| /external/llvm/include/llvm/Target/ |
| TargetSchedule.td | 14 // 1. Basic properties for coarse grained instruction cost model.
15 // 2. Scheduler Read/Write resources for simple per-opcode cost model.
68 // coarse grained instruction cost model. Default values for the
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 466 // heuristic components for cost computation.
472 /// Single point to compute overall scheduling cost.
566 // Best cost.
|
| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 279 /// getJumpThreadDuplicationCost - Return the cost of duplicating this block to
287 // branch, so they shouldn't count against the duplication cost.
289 // Sum up the cost of each instruction until we get to the terminator. Don't
314 // as having cost of 4. If they are a non-vector intrinsic, we model them
315 // as having cost of 2 total, and if they are a vector intrinsic, we model
316 // them as having cost 1.
319 // Blocks with NoDuplicate are modelled as having infinite cost, so they
330 // block ends in a switch, decrease its cost to make it more likely to happen.
[all...] |
| /external/slf4j/slf4j-site/src/site/pages/ |
| faq.html | [all...] |
| /external/valgrind/include/ |
| pub_tool_oset.h | 57 // the cost of calling a function for every comparison can be high during
97 // - cc Cost centre string used by 'alloc'.
174 // - cc Cost centre string used by 'alloc'.
|
| /external/webp/src/dsp/ |
| dsp.h | 196 // cost functions (encoding)
199 // approximate cost per level:
208 // Cost calculation function.
|
