| /external/llvm/include/llvm/CodeGen/ |
| RegisterClassInfo.h | 116 /// Get the minimum register cost in RC's allocation order.
123 /// Get the position of the last cost change in getOrder(RC).
126 /// same cost according to TRI->getCostPerUse().
|
| /external/mdnsresponder/mDNSPosix/ |
| libnss_mdns.8 | 135 the payment of the cost of replacing the goods or of acquiring
138 the payment of the cost of having the goods repaired; or
146 the payment of the cost of having the services supplied again.
|
| nss_ReadMe.txt | 106 iii. the payment of the cost of replacing the goods or of acquiring
108 iv. the payment of the cost of having the goods repaired; or
111 ii. the payment of the cost of having the services supplied
|
| nss_mdns.conf.5 | 122 the payment of the cost of replacing the goods or of acquiring
125 the payment of the cost of having the goods repaired; or
133 the payment of the cost of having the services supplied again.
|
| /external/opencv3/3rdparty/libwebp/enc/ |
| frame.c | 20 #include "./cost.h"
39 CostArray* cost; member in struct:__anon21054
57 // Reset the statistics about: number of skips, token proba, level cost,...
74 // Returns the bit-cost for coding the skip probability.
86 size += 8 * 256; // cost of signaling the skip_proba_ itself.
169 // Return the total bit-cost for coding the probability updates.
175 // Cost of coding 'nb' 1's and 'total-nb' 0's using 'proba' probability.
265 res->cost = enc->proba_.level_cost_[coeff_type];
289 const uint16_t* t = res->cost[n][ctx0];
290 int cost; local
[all...] |
| cost.c | 10 // Cost tables for level and modes
14 #include "./cost.h"
21 // Boolean-cost cost table
53 // Level cost tables
342 int cost = 0; local
346 cost += VP8BitCost(bits & 1, probas[i]);
351 return cost;
373 // Starting at level 67 and up, the variable part of the cost is
382 // Mode cost tables
[all...] |
| /external/opencv3/modules/calib3d/src/ |
| stereosgbm.cpp | 115 computes the cost (cost[(x-minX)*(maxD - minD) + (d - minD)]), depending on the difference between
123 int minD, int maxD, CostType* cost,
178 memset( cost, 0, width1*D*sizeof(cost[0]) );
181 cost -= minX1*D + minD; // simplify the cost indices inside the loop
230 c0 = _mm_load_si128((__m128i*)(cost + x*D + d));
231 c1 = _mm_load_si128((__m128i*)(cost + x*D + d + 8));
233 _mm_store_si128((__m128i*)(cost + x*D + d), _mm_adds_epi16(c0, _mm_srl_epi16(_mm_unpacklo_epi8(diff,z), ds)))
[all...] |
| /external/libavc/encoder/ |
| ih264e_globals.c | 56 * compute the RD cost while deciding on the MB modes.
60 * for computing distortion (Bit rate estimation for cost function of H.264/
81 * compute the RD cost while deciding on the MB modes.
100 * @brief unsigned exp. goulumb codelengths to assign cost to a coefficient of
118 * @brief Look up table to assign cost to a coefficient of a residual block
|
| ih264e_process.h | 265 * (intra (i16, i4, i8)/inter (mv, skip)) for best cost. The mode with least cost
291 * Number of bits consumed by the current frame, frame distortion, frame cost,
|
| /external/llvm/lib/Transforms/Scalar/ |
| SpeculativeExecution.cpp | 71 "spec-exec-max-speculation-cost", cl::init(7), cl::Hidden,
73 "the cost of the instructions to speculatively execute "
209 const unsigned Cost = ComputeSpeculationCost(&I, *TTI);
210 if (Cost != UINT_MAX && isSafeToSpeculativelyExecute(&I) &&
212 TotalSpeculationCost += Cost;
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_tokenize.c | 139 // initialize the cost for extra bits for all possible coefficient value.
141 int cost = 0; local
149 cost += treed_cost(p->tree, p->prob, extra >> 1, length);
151 cost += vp9_cost_bit(vp9_prob_half, extra & 1); /* sign */
152 dct_value_cost[i + DCT_MAX_VALUE] = cost;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/config/i386/ |
| i386.h | 122 const int add; /* cost of an add instruction */
123 const int lea; /* cost of a lea instruction */
126 const int mult_init[5]; /* cost of starting a multiply
128 const int mult_bit; /* cost of multiply per each bit set */
129 const int divide[5]; /* cost of a divide/mod
131 int movsx; /* The cost of movsx operation. */
132 int movzx; /* The cost of movzx operation. */
133 const int large_insn; /* insns larger than this cost more */
136 const int movzbl_load; /* cost of loading using movzbl */
137 const int int_load[3]; /* cost of loading integer register
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| SLPVectorizer.cpp | 110 /// avoids spending time checking the cost model and realizing that they will
377 /// \returns the cost incurred by unwanted spills and fills, caused by
381 /// \returns the vectorization cost of the subtree that starts at \p VL.
418 /// \returns the cost of the vectorizable entry.
442 /// \returns the scalarization cost for this type. Scalarization in this
446 /// \returns the scalarization cost for this list of values. Assuming that
448 /// roots. This method calculates the cost of extracting the values.
[all...] |
| LoopVectorize.cpp | 185 "force-target-instruction-cost", cl::init(0), cl::Hidden,
186 cl::desc("A flag that overrides the target's expected cost for "
191 "small-loop-cost", cl::init(20), cl::Hidden,
193 "The cost of a loop that is considered 'small' by the interleaver."));
326 // can be validly truncated to. The cost model has assumed this truncation
[all...] |
| /frameworks/av/media/libstagefright/codecs/avc/enc/src/ |
| avcenc_lib.h | 45 \param "coef_cost" "Pointer to the coefficient cost to be filled in and returned."
295 \param "min_cost" "Best inter cost."
323 This function calculate the cost of all I16 modes and compare them to get the minimum.
326 \param "min_cost" "Pointer to the minimal cost so-far."
332 This function calculates the cost of each I16 mode.
336 \param "min_cost" "Minimal cost so-far."
337 \return "Cost"
347 \param "min_cost" "Pointer to the minimal cost so-far."
368 \return "Minimal cost, also set currMB->i4Mode"
373 This function calculates the cost of a given I4 prediction mode
[all...] |
| /external/slf4j/slf4j-api/src/main/java/org/slf4j/ |
| Logger.java | 129 * (and relatively small) cost of creating an <code>Object[]</code> before invoking the method,
131 * {@link #trace(String, Object, Object) two} arguments exist solely in order to avoid this hidden cost.</p>
263 * (and relatively small) cost of creating an <code>Object[]</code> before invoking the method,
266 * arguments exist solely in order to avoid this hidden cost.</p>
389 * (and relatively small) cost of creating an <code>Object[]</code> before invoking the method,
392 * arguments exist solely in order to avoid this hidden cost.</p>
501 * (and relatively small) cost of creating an <code>Object[]</code> before invoking the method,
504 * arguments exist solely in order to avoid this hidden cost.</p>
640 * (and relatively small) cost of creating an <code>Object[]</code> before invoking the method,
643 * arguments exist solely in order to avoid this hidden cost.</p
[all...] |
| /external/webp/src/enc/ |
| cost.c | 10 // Cost tables for level and modes
14 #include "./cost.h"
17 // Level cost tables
45 int cost = 0; local
49 cost += VP8BitCost(bits & 1, probas[i]);
54 return cost;
78 // Starting at level 67 and up, the variable part of the cost is
93 // Mode cost tables.
95 // These are the fixed probabilities (in the coding trees) turned into bit-cost
98 // note: these values include the fixed VP8BitCost(1, 145) mode selection cost
[all...] |
| /external/valgrind/callgrind/ |
| bbcc.c | 100 bbcc->cost[i] = 0;
104 CLG_(init_cost)( CLG_(sets).full, jcc->cost );
140 * The hash is used in setup_bb(), i.e. to find the cost
282 bbcc->cost = CLG_(get_costarray)(bb->cost_count);
284 bbcc->cost[i] = 0;
439 /* Get a pointer to the cost centre structure for given basic block
609 /* update Ir cost */
611 CLG_(current_state).cost[ fullOffset(EG_IR) ] += instr_count;
618 /* update Ir cost */
620 CLG_(current_state).cost[ fullOffset(EG_IR) ] += instr_count
[all...] |
| callstack.c | 215 CLG_(current_state).cost );
346 /* add cost difference to sum */
347 if ( CLG_(add_diff_cost_lz)( CLG_(sets).full, &(jcc->cost),
349 CLG_(current_state).cost) ) {
351 /* only count this call if it attributed some cost.
383 CLG_(print_cost)(10, CLG_(sets).full, jcc->cost);
|
| /external/llvm/include/llvm/Analysis/ |
| TargetTransformInfoImpl.h | 62 // Otherwise, the default basic cost is used.
136 // Model them as having a basic instruction cost.
385 return TTI::TCC_Basic; // Give a basic cost if it will be lowered
419 // We assume that the cost of Scalar GEP with constant index and the
420 // cost of Vector GEP with splat constant index are the same.
458 // opportunity for targets to (for example) special case the cost of
|
| /external/bzip2/ |
| compress.c | 256 UInt16 cost[BZ_N_GROUPS]; local
353 Calculate the cost of this group as coded
356 for (t = 0; t < nGroups; t++) cost[t] = 0;
383 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16;
384 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16;
385 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
391 for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv]
[all...] |
| /external/clang/utils/ |
| CmpDriver | 41 def cost(a, b): function in function:insertMinimumPadding
52 current = cost(a, b)
56 candidate = cost(a_0, b)
|
| /external/llvm/lib/Analysis/ |
| CodeMetrics.cpp | 1 //===- CodeMetrics.cpp - Code cost measurements ---------------------------===//
10 // This file implements code cost measurement utilities.
138 // unrolling. The argument setup cost is still real, though.
|
| /development/perftests/panorama/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;
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
| Preconditioner.java | 46 * @exception FunctionEvaluationException if no cost can be computed for the parameters
|
