| /external/libavc/encoder/arm/ |
| ih264e_evaluate_intra4x4_modes_a9q.s | 71 @* Pointer to the variable in which minimum cost is returned
77 @* Lamda value for computing cost from SAD
80 @* Predicted mode for cost computation
|
| /external/libavc/encoder/ |
| ih264e_rate_control.c | 419 /* cost */
498 * intra cost ,mb type and other
689 (WORD32)i4_intra_frm_cost, /* Intra cost for frame */
|
| /external/llvm/lib/CodeGen/ |
| MachineCombiner.cpp | 259 // For a transform such as reassociation, the cost equation is
267 // A more flexible cost calculation for the critical path includes the slack
387 // based on an internal cost heuristic.
|
| /external/tcpdump/ |
| print-stp.c | 145 * 4 - bytes CIST External Path Cost
158 * 4 - bytes CIST Internal Root Path Cost
191 * 4 - bytes MSTI Regional Path Cost
|
| /external/webrtc/webrtc/modules/video_coding/ |
| media_optimization.cc | 226 // Rate cost of the protection methods.
236 // protection method and the overhead cost
244 // Get the bit cost of protection method, based on the amount of
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_aq_cyclicrefresh.c | 73 // larger than bit cost of segmentation. Segment map bit cost should scale
233 // based on the coding cost of each method. For error_resilient mode on the
|
| vp9_rdopt.c | 542 * decide whether to include cost of a trailing EOB node or not (i.e. we
570 int c, cost; local
577 cost = token_costs[0][0][pt][EOB_TOKEN];
585 cost = (*token_costs)[0][pt][prev_t] + vp9_dct_value_cost_ptr[v];
597 cost += (*token_costs)[!prev_t][!prev_t][t] + vp9_dct_value_cost_ptr[v];
600 cost += (*token_costs)[!prev_t][pt][t] + vp9_dct_value_cost_ptr[v];
613 cost += (*token_costs)[0][!prev_t][EOB_TOKEN];
616 cost += (*token_costs)[0][pt][EOB_TOKEN];
624 return cost;
1182 int cost = 0; local
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/ |
| pickinter.c | 190 int cost = mb->mbmode_cost [xd->frame_type] [B_PRED]; local
219 cost += r;
230 *Rate = cost;
235 error = RDCOST(mb->rdmult, mb->rddiv, cost, distortion);
786 /* Work out the cost assosciated with selecting the reference frame */
[all...] |
| /external/deqp/modules/gles3/performance/ |
| es3pBufferDataUploadTests.cpp | [all...] |
| /cts/tests/tests/content/res/values/ |
| strings.xml | 180 <string name="permlab_costMoney">Cost money</string>
181 <string name="permdesc_costMoney">Do things that can cost you money.</string>
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
| DormandPrince853Integrator.java | 36 * <i>fsal</i>. Hence, despite we have 13 stages here, the cost is
128 // here at no cost by specifying this is an fsal method
|
| /external/clang/docs/ |
| SafeStack.rst | 30 stack and, hence, do not need unsafe stack frames to be created. The cost of
31 creating unsafe stack frames for large functions is amortized by the cost of
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexEigenSolver.h | 204 * The cost of the computation is dominated by the cost of the
|
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpander.h | 118 /// \brief Return true for expressions that may incur non-trivial cost to
123 /// more accurate cost estimation.
|
| /external/llvm/include/llvm/MC/ |
| MCSchedule.h | 11 // for scheduling and other instruction cost heuristics.
131 /// tables. Scheduler resource tables model the latency and cost for each
|
| /external/okhttp/okhttp/src/main/java/com/squareup/okhttp/ |
| ConnectionSpec.java | 209 * is not worth the CPU cost of sorting or the memory cost of hashing.
|
| /external/opencv3/3rdparty/include/ffmpeg_/libavutil/ |
| mem.h | 233 * Therefore, the amortized cost of adding an element is constant.
252 * Therefore, the amortized cost of adding an element is constant.
|
| /external/opencv3/3rdparty/libpng/ |
| pngstruct.h | 246 png_uint_16p filter_costs; /* relative filter calculation cost */
247 png_uint_16p inv_filter_costs; /* 1/relative filter calculation cost */
|
| /external/opencv3/doc/py_tutorials/py_imgproc/py_grabcut/ |
| py_grabcut.markdown | 55 source node and sink node with minimum cost function. The cost function is the sum of all
|
| /external/skia/gyp/ |
| libwebp.gyp | 154 '../third_party/externals/libwebp/src/dsp/cost.c',
186 '../third_party/externals/libwebp/src/enc/cost.c',
|
| /external/slf4j/jul-to-slf4j/src/main/java/org/slf4j/bridge/ |
| SLF4JBridgeHandler.java | 77 * cost of constructing {@link LogRecord} instance regardless of whether the
79 * SLF4J translation can seriously increase the cost of disabled logging
|
| /external/webrtc/webrtc/modules/audio_device/android/ |
| audio_device_template.h | 175 // Avoid using audio manger (JNI/Java cost) if playout was inactive.
194 // Avoid using audio manger (JNI/Java cost) if recording was inactive.
|
| /frameworks/base/docs/html/distribute/users/ |
| build-buzz.jd | 103 Cross promoting, or house ads, is a great cost effective way to get users to
217 to drive installs of your app at a target cost-per-acquisition (CPA). You
|
| /frameworks/base/docs/html/training/performance/battery/network/ |
| analyze-data.jd | 32 On mobile devices, there is a significant cost associated with starting up the radio
189 Allow System to Check for Connectivity</a> - Avoid the battery cost of running your app just
|
| /ndk/tests/build/issue20862-libpng-O0/jni/ |
| pngstruct.h | 246 png_uint_16p filter_costs; /* relative filter calculation cost */
247 png_uint_16p inv_filter_costs; /* 1/relative filter calculation cost */
|
