| /external/iptables/extensions/ |
| tos_values.c | 21 {IPTOS_MINCOST, "Minimize-Cost"},
|
| /external/iptables/include/linux/netfilter/ |
| xt_limit.h | 20 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /external/kernel-headers/original/uapi/linux/netfilter/ |
| xt_limit.h | 20 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /external/llvm/test/Analysis/CostModel/ARM/ |
| insertelement.ll | 1 ; RUN: opt -cost-model -analyze -mtriple=thumbv7-apple-ios6.0.0 -mcpu=swift < %s | FileCheck %s
15 ;CHECK: estimated cost of 3 for {{.*}} insertelement <8 x i8>
29 ;CHECK: estimated cost of 3 for {{.*}} insertelement <4 x i16>
42 ;CHECK: estimated cost of 3 for {{.*}} insertelement <2 x i32>
|
| /external/opencv3/3rdparty/libwebp/enc/ |
| cost.h | 10 // Cost tables for level and modes.
23 // approximate cost per level:
27 // Cost of coding one event with probability 'proba'.
32 // Level cost calculations
|
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| vp8_partition_aggregator.h | 37 // Calculate the cost for the node. If the node is a solution node, the cost
38 // will be the actual cost associated with that solution. If not, the cost
39 // will be the cost accumulated so far along the current branch (which is a
41 int Cost(size_t penalty);
102 // Find the aggregation of VP8 partitions that produces the smallest cost.
118 // be larger than max_payload_size. Each fragment comes at an overhead cost
120 // [min_size, max_size], an extra cost is inflicted.
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| omxVCM4P10_MotionEstimationMB.c | 468 * Intra 4x4 Mode decision by calculating cost for all possible modes and
486 * [in] pBestCost - Cost for the Best Intra 4x4 mode
504 OMX_S32 Cost, BestCost;
546 Cost = BestCost = ARM_VCM4P10_MAX_COST;
548 /* Go through each mode for minim cost */
568 &Cost,
572 if (Cost < BestCost)
574 BestCost = Cost;
776 * [in] nLamda - For calculating the cost
777 * [out] pBestCost - Minimum cost for encoding current block
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/netfilter/ |
| xt_limit.h | 20 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/netfilter/ |
| xt_limit.h | 20 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /prebuilts/go/darwin-x86/src/go/constant/ |
| go13.go | 16 // Emulate it, albeit at the cost of
|
| /prebuilts/go/linux-x86/src/go/constant/ |
| go13.go | 16 // Emulate it, albeit at the cost of
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/ |
| regreg.s | 7 ; is less expensive than any other time and still falling in cost.
|
| /external/llvm/include/llvm/Analysis/ |
| TargetTransformInfo.h | 98 /// \brief Underlying constants for 'cost' values in this interface.
100 /// Many APIs in this interface return a cost. This enum defines the
103 /// enumeration because it is expected that the cost of one IR instruction
109 /// not expected that 2^32 is a realistic cost to be modeling at any point.
112 /// cost and execution cost. A free instruction is typically one that folds
118 TCC_Basic = 1, ///< The cost of a typical 'add' instruction.
119 TCC_Expensive = 4 ///< The cost of a 'div' instruction on x86.
122 /// \brief Estimate the cost of a specific operation when lowered.
128 /// analyzing a GEP's cost required more information
[all...] |
| /external/opencv/cv/src/ |
| cvemd.cpp | 87 float **cost; member in struct:CvEMDState
120 const float* cost, int cost_step,
124 static CvStatus icvFindBasicVariables( float **cost, char **is_x,
127 static float icvIsOptimal( float **cost, char **is_x,
175 CvMat cost_stub, *cost = &cost_stub; local
207 cost->data.fl = 0;
208 cost->step = 0;
216 "Only one of cost matrix or distance function should be non-NULL in case of user-defined distance" );
220 "The lower boundary can not be calculated if the cost matrix is used" );
222 CV_CALL( cost = cvGetMat( cost_matrix, &cost_stub ))
918 float **cost = state->cost; local
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_segmentation.c | 82 // Based on set of segment counts and probabilities calculate a cost estimate
91 // Cost the top node of the tree
92 int cost = c0123 * vp9_cost_zero(probs[0]) + local
95 // Cost subsequent levels
97 cost += c01 * vp9_cost_zero(probs[1]) +
101 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
104 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
109 cost += c45 * vp9_cost_zero(probs[2]) +
113 cost += segcounts[4] * vp9_cost_zero(probs[5]) +
116 cost += segcounts[6] * vp9_cost_zero(probs[6])
[all...] |
| /external/webp/src/dsp/ |
| cost_mips32.c | 16 #include "../enc/cost.h"
29 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local
62 "addu %[cost], %[cost], %[temp1] \n\t"
69 "addu %[cost], %[cost], %[temp0] \n\t"
75 : [cost]"+&r"(cost), [t]"+&r"(t), [n]"+&r"(n), [v_reg]"=&r"(v_reg),
88 cost += VP8LevelCost(t, v);
93 cost += VP8BitCost(0, last_p0)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| residual_block.h | 55 // the overall least-squares cost function is:
61 // Storing the cost function and the loss function separately permits optimizing
65 // The residual block stores pointers to but does not own the cost functions,
69 // Construct the residual block with the given cost/loss functions. Loss may
77 // Evaluates the residual term, storing the scalar cost in *cost, the residual
92 // The returned cost and jacobians have had robustification and local
100 double* cost,
|
| /external/libavc/encoder/ |
| ime.h | 94 * @returns mv pair & corresponding distortion and cost
123 * @returns mv pair & corresponding distortion and cost
140 * This is used for cost computations. Further basing on the algo. chosen, it
142 * cost and returns this information.
150 * @returns mv pair & corresponding distortion and cost
167 * around the full pel motion vector. The vector with least cost is chosen as
189 * @brief This function computes cost of skip macroblocks
205 * NOTE: while computing the skip cost, do not enable early exit from compute
|
| ime_structs.h | 86 * cost for the MB partition
91 * Search position for least cost among the list of candidates
96 * Search position for least cost among the list of candidates
101 * Buffer corresponding to best half pel cost
207 * lambda (lagrange multiplier for cost computation)
|
| /external/llvm/test/Transforms/Inline/ |
| inline-cold-callee.ll | 4 ; Cold hint and does not get inlined because the cost exceeds the inlinecold-threshold.
5 ; A callee with identical body does gets inlined because cost fits within the
|
| inline-hot-callee.ll | 4 ; inline hints and gets inlined because the cost is less than inlinehint-threshold.
5 ; A cold callee with identical body does not get inlined because cost exceeds the
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| full-unroll-heuristics-phi-prop.ll | 1 ; RUN: opt < %s -S -loop-unroll -unroll-max-iteration-count-to-analyze=100 -unroll-dynamic-cost-savings-discount=1000 -unroll-threshold=10 -unroll-percent-dynamic-cost-saved-threshold=50 | FileCheck %s
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| tree-inline.h | 132 /* Cost per call. */
135 /* Cost per indirect call. */
138 /* Cost per call to a target specific builtin */
141 /* Cost of "expensive" div and mod operations. */
144 /* Cost for omp construct. */
147 /* Cost for tm transaction. */
150 /* Cost of return. */
154 cost of switch statement is logarithmic rather than linear in number
|
| /external/ceres-solver/include/ceres/ |
| normal_prior.h | 31 // Cost term that implements a prior on a parameter block using a
43 // Implements a cost function of the form
45 // cost(x) = ||A(x - b)||^2
48 // variable. In case the user is interested in implementing a cost
51 // cost(x) = (x - mu)^T S^{-1} (x - mu)
|
| /external/llvm/test/Analysis/CostModel/X86/ |
| loop_v2.ll | 1 ; RUN: opt < %s -cost-model -analyze -mtriple=x86_64-apple-macosx10.8.0 -mcpu=corei7-avx | FileCheck %s
17 ;CHECK: cost of 1 {{.*}} extract
20 ;CHECK: cost of 1 {{.*}} extract
24 ;CHECK: cost of 1 {{.*}} insert
27 ;CHECK: cost of 1 {{.*}} insert
|
