| /external/llvm/include/llvm/Analysis/ |
| CodeMetrics.h | 1 //===- CodeMetrics.h - Code cost measurements -------------------*- C++ -*-===//
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64RegisterInfo.h | 44 // The cost will be compared against BlockFrequency where entry has the
|
| /external/llvm/lib/Transforms/IPO/ |
| InlineSimple.cpp | 37 /// inliner pass and the always inliner pass. The two passes use different cost
|
| /external/llvm/test/CodeGen/X86/ |
| avoid_complex_am.ll | 4 ; On X86, reg1 + 1*reg2 has the same cost as reg1 + 8*reg2.
|
| code_placement_loop_rotation2.ll | 2 ; RUN: llc -mcpu=corei7 -mtriple=x86_64-linux -precise-rotation-cost < %s | FileCheck %s -check-prefix=CHECK-PROFILE
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| exit_value_test2.ll | 5 ; udiv will be introduced by expand and the cost will be high.
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| scaling_factor_cost_crash.ll | 5 ; <rdar://problem/14199725> Assertion failed: (CurScaleCost >= 0 && "Legal addressing mode has an illegal cost!")
|
| /external/mesa3d/src/gallium/drivers/r300/ |
| r300_cb.h | 61 * that they neatly hide away, and don't have the cost of function setup, so
|
| r300_cs.h | 34 * that they neatly hide away, and don't have the cost of function setup,so
|
| /external/opencv3/3rdparty/libwebp/enc/ |
| histogram.h | 81 // This function estimates the cost in bits excluding the bits needed to
|
| /external/opencv3/modules/calib3d/src/ |
| stereobm.cpp | 320 Mat& disp, Mat& cost, StereoBMParams& state,
349 int coststep = cost.data ? (int)(cost.step/sizeof(costbuf)) : 0;
404 short* costptr = cost.data ? cost.ptr<short>() + lofs + x : &costbuf;
569 Mat& disp, Mat& cost, const StereoBMParams& state,
607 int coststep = cost.data ? (int)(cost.step/sizeof(costbuf)) : 0;
670 int* costptr = cost.data ? cost.ptr<int>() + lofs + x : &costbuf
[all...] |
| /external/opencv3/modules/shape/src/ |
| hist_cost.cpp | 149 // Compute the Cost Matrix //
275 // Compute the Cost Matrix //
396 // Compute the Cost Matrix //
512 // Compute the Cost Matrix //
|
| /external/selinux/libselinux/man/man3/ |
| selinux_status_open.3 | 32 unignorable cost to communicate with kernel space to check invalidation
|
| /external/v8/src/compiler/x64/ |
| instruction-scheduler-x64.cc | 176 // TODO(all): Add instruction cost modeling.
|
| /external/wpa_supplicant_8/src/crypto/ |
| aes-internal-enc.c | 8 * cost of reduced throughput (quite small difference on Pentium 4,
|
| /frameworks/av/media/libstagefright/codecs/avc/enc/src/ |
| avcenc_int.h | 89 // associated with the above cost model
147 variables such as, RD cost, statistics, motion search stuffs, etc.
422 int *min_cost; /* Minimum cost for the all MBs */
426 uint8 *mvbits_array; /* Table for bits spent in the cost funciton */
|
| /frameworks/base/docs/html/distribute/stories/games/ |
| g4a-indian-rummy.jd | 60 G4A found that the cost per translation was much lower with the App Translation Service compared to local companies. The process was much easier too, G4A simply had to provide texts in the strings.xml format.
|
| /frameworks/base/libs/hwui/utils/ |
| FatVector.h | 85 * Useful for avoiding the cost of malloc in cases where only SIZE or
|
| /frameworks/base/location/java/android/location/ |
| FusedBatchOptions.java | 31 // the default value is set to request fixes at no cost
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_mcomp.h | 39 // Utility to compute variance + MV rate cost for a given MV
|
| /hardware/qcom/gps/msm8909/utils/ |
| LocHeap.h | 57 // help beter balance the tree with lower cost. When a node is pushed to the tree,
|
| /hardware/qcom/gps/msm8996/utils/ |
| LocHeap.h | 57 // help beter balance the tree with lower cost. When a node is pushed to the tree,
|
| /libcore/benchmarks/src/benchmarks/regression/ |
| PriorityQueueBenchmark.java | 76 // queueSizes, but since a copy is linear, it will also cost proportionally
|
| /libcore/ojluni/src/main/java/java/util/stream/ |
| AbstractSpinedBuffer.java | 30 * no copying cost associated with growing the data structure.
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/iterator/ |
| iterator_categories.hpp | 72 // the cost of instantiating iterator_category_to_traversal, below,
|
