| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 476 DiffEntry() : Cost(0) {}
478 unsigned Cost;
508 Cur[I].Cost = I * LeftCost;
516 Next[0].Cost += RightCost;
523 Next[Index].Cost += MatchCost;
526 } else if (Next[Index-1].Cost <= Cur[Index].Cost) {
528 Next[Index].Cost += LeftCost;
532 Next[Index].Cost += RightCost;
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| memory_pool.h | 30 * cost of being unable to explicitly free one of the allocated blocks.
|
| /external/mesa3d/src/mesa/program/ |
| register_allocate.h | 71 void ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost);
|
| /external/tpm2/ |
| LICENSE | 44 cost of procurement of substitute goods or services, lost profits, loss of
|
| /external/v8/src/compiler/arm/ |
| instruction-scheduler-arm.cc | 123 // TODO(all): Add instruction cost modeling.
|
| /external/v8/src/compiler/ia32/ |
| instruction-scheduler-ia32.cc | 129 // TODO(all): Add instruction cost modeling.
|
| /external/v8/src/compiler/ppc/ |
| instruction-scheduler-ppc.cc | 137 // TODO(all): Add instruction cost modeling.
|
| /external/valgrind/docs/internals/ |
| howto_oprofile.txt | 13 # get total cost
|
| /external/valgrind/helgrind/tests/ |
| filter_stderr | 47 -e "/^the cost of reduced accuracy of conflicting-access information$/d" \
|
| /external/webp/src/dsp/ |
| cost.c | 13 #include "../enc/cost.h"
16 // Boolean-cost cost table
48 // Level cost tables
331 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local
339 cost += VP8LevelCost(t, v);
346 cost += VP8LevelCost(t, v);
351 cost += VP8BitCost(0, last_p0);
354 return cost;
|
| /external/webrtc/talk/app/webrtc/java/src/org/webrtc/ |
| VideoSource.java | 34 * where there is no support for multiple open capture devices and the cost of
|
| /external/zopfli/src/zopfli/ |
| blocksplitter.c | 97 Returns estimated cost of a block in bits. It includes the size to encode the
122 Gets the cost which is the sum of the cost of the left and the right section
191 splittable (splitting them increases rather than decreases cost).
|
| zopfli.h | 42 compression cost. Good values: 10, 15 for small files, 5 for files over
|
| /frameworks/base/core/java/android/os/health/ |
| HealthStatsParceler.java | 31 * saves that step at the cost of doing the extra flattening when
|
| /frameworks/base/core/java/com/android/internal/os/ |
| WakelockPowerCalculator.java | 52 // Add cost of holding a wake lock.
|
| /frameworks/base/core/tests/benchmarks/src/android/net/ |
| NetworkStatsBenchmark.java | 72 * we need to measure the cost of the clone() call itself in order to get more
|
| /frameworks/base/docs/html/topic/performance/ |
| optimizing-view-hierarchies.jd | 51 Both of these pipeline stages incur some small cost per view or layout that they
52 process. Most of the time, this cost is minimal and doesn?t noticeably affect
56 cost can also be higher if a {@link android.view.View} object needs to consider
81 a layout cost. When your app processes an object for layout, the app performs
83 layout, sometimes a cost only arises the first time the system computes the
94 object adds cost to the layout stage. The flatter your hierarchy, the less
100 effect, at lower cost, by using nested, unweighted
315 unnecessary cost to the view hierarchy.
387 {@link android.widget.RelativeLayout}, but at a significantly lower cost.
|
| /frameworks/base/location/java/android/location/ |
| Criteria.java | 26 * and bearing, and monetary cost.
98 * cost.
266 * Indicates whether the provider is allowed to incur monetary cost.
273 * Returns whether the provider is allowed to incur monetary cost.
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/ |
| rdopt.c | 317 /* build token cost array for the type of frame we have now */
526 int cost = 0; local
536 cost += mb->token_costs [type] [vp8_coef_bands[c]] [pt] [t];
537 cost += vp8_dct_value_cost_ptr[v];
542 cost += mb->token_costs [type] [vp8_coef_bands[c]] [pt] [DCT_EOB_TOKEN];
547 return cost;
552 int cost = 0; local
566 cost += cost_coeffs(mb, x->block + b, PLANE_TYPE_Y_NO_DC,
569 cost += cost_coeffs(mb, x->block + 24, PLANE_TYPE_Y2,
572 return cost;
710 int cost = mb->mbmode_cost [xd->frame_type] [B_PRED]; local
819 int cost = 0; local
961 int cost = 0; local
1037 int cost = 0; local
[all...] |
| /libcore/benchmarks/src/benchmarks/ |
| FieldAccessBenchmark.java | 20 * What does field access cost?
|
| /ndk/sources/cxx-stl/stlport/src/ |
| complex_trig.cpp | 87 static complex<_Tp> cosT(const complex<_Tp>& z) {
93 { return cosT(z); }
96 { return cosT(z); }
100 { return cosT(z); }
|
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_image_homography.cpp | 181 double cost,best_cost; local
214 cost=db_SquaredReprojectionErrorHomography(y,hyp_point,x3);
216 if(!done || cost<best_cost)
219 best_cost=cost;
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/ |
| suggest.h | 29 // - Cost: delta/diff for Distance -- used both for spatial and language
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| ndattrib.h | 104 __LONG32 cost; member in struct:tagRepairInfo
|
| /prebuilts/go/darwin-x86/src/net/http/ |
| export_test.go | 18 // We only want to pay for this cost during testing.
|
