/external/clang/test/CodeGenCXX/ |
H A D | array-operator-delete-call.cpp | 24 S *cost; member in struct:COST 35 cost = new S[3]; 42 if (cost) { 43 delete [] cost;
|
/external/libvpx/libvpx/vp8/encoder/ |
H A D | treewriter.c | 13 static void cost(int *const C, vp8_tree T, const vp8_prob *const P, int i, function 24 cost(C, T, P, j, d); 29 cost(c, t, p, 0, 0); 32 cost(c, t, p, start, 0);
|
H A D | encodemv.c | 95 unsigned int cost; local 98 cost = vp8_cost_zero(p[mvpis_short]) + 101 if (!x) return cost; 104 cost = vp8_cost_one(p[mvpis_short]); 107 cost += vp8_cost_bit(p[MVPbits + i], (x >> i) & 1); 114 cost += vp8_cost_bit(p[MVPbits + i], (x >> i) & 1); 118 if (x & 0xFFF0) cost += vp8_cost_bit(p[MVPbits + 3], (x >> 3) & 1); 121 return cost; /* + vp8_cost_bit( p [MVPsign], v < 0); */ 179 const int cost = local 183 if (cur_b - new_b > cost) { [all...] |
/external/iptables/include/linux/netfilter/ |
H A D | xt_limit.h | 20 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
/external/kernel-headers/original/uapi/linux/netfilter/ |
H A D | xt_limit.h | 20 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
/external/kernel-headers/original/uapi/linux/netfilter_bridge/ |
H A D | ebt_limit.h | 21 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, function 52 cost(costs, tree, probs, ii, cc); 57 cost(costs, tree, probs, 0, 0); 64 cost(costs, tree, probs, 2, 0);
|
H A D | vp9_cost.h | 23 // The factor to scale from cost in bits to cost in vp9_prob_cost units. 39 int cost = 0; local 44 cost += vp9_cost_bit(probs[i >> 1], bit); 48 return cost;
|
H A D | vp9_encodemv.c | 102 int cost = class_cost[MV_CLASS_0]; local 106 cost += class0_cost[d]; 107 cost += class0_fp_cost[d][f]; 110 cost += class0_hp_cost[e]; 112 mvcost[v] = cost + sign_cost[0]; 113 mvcost[-v] = cost + sign_cost[1]; 123 int cost = whole_cost + fp_cost[f]; local 126 mvcost[v] = cost + hp_cost[0] + sign_cost[0]; 127 mvcost[-v] = cost + hp_cost[0] + sign_cost[1]; 129 mvcost[v + 1] = cost [all...] |
/external/webp/src/dsp/ |
H A D | cost_mips_dsp_r2.c | 29 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local 59 "addu %[cost], %[cost], %[temp1] \n\t" 65 "addu %[cost], %[cost], %[temp0] \n\t" 70 : [cost]"+&r"(cost), [t]"+&r"(t), [n]"+&r"(n), [v_reg]"=&r"(v_reg), 83 cost += VP8LevelCost(t, v); 88 cost += VP8BitCost(0, last_p0); 91 return cost; [all...] |
H A D | cost_mips32.c | 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); 96 return cost; [all...] |
H A D | cost.c | 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;
|
H A D | cost_sse2.c | 10 // SSE2 version of cost functions 56 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local 86 cost += VP8LevelFixedCosts[flevel] + t[level]; // simplified VP8LevelCost() 94 cost += VP8LevelFixedCosts[flevel] + t[level]; 99 cost += VP8BitCost(0, last_p0); 102 return cost;
|
/external/proguard/src/proguard/shrink/ |
H A D | ShortestUsageMark.java | 65 int cost, 68 this(previousUsageMark, reason, cost, clazz, null); 78 * @param cost the added cost of following this path. 82 int cost, 88 this.depth = previousUsageMark.depth + cost; 63 ShortestUsageMark(ShortestUsageMark previousUsageMark, String reason, int cost, Clazz clazz) argument 80 ShortestUsageMark(ShortestUsageMark previousUsageMark, String reason, int cost, Clazz clazz, Member member) argument
|
/external/toolchain-utils/bestflags/ |
H A D | mock_task.py | 22 def __init__(self, stage, identifier, cost=0): 28 cost: the mock cost of this task. 30 The _cost field stored the cost. Once this task is performed, i.e., by 32 _cost field will have this cost. The stage field verifies that the module 34 not care about cost of this task, the cost parameter should be leaved 39 self._cost = cost 55 def SetResult(self, stage, cost): 57 self._cost = cost [all...] |
H A D | pipeline_worker_test.py | 34 Given the same identifier, the cost should result the same from the 42 the same, i.e., the cost should be the same. 105 for flag, cost in mock_work_tasks.iteritems(): 106 mock_tasks.append(MockTask(TEST_STAGE, flag, cost)) 122 for flag, cost in mock_work_tasks.iteritems(): 124 self.assertEqual(helper_input, (flag, cost))
|
H A D | task.py | 50 flag set, the image, the check sum of the image and the cost. 244 the internal cost (fitness) for this set of flags. 268 # performance cost of the build, the compilation image, the length 270 (checksum, cost, image, file_length, text_length) = out.split() 275 cost = ERROR_STRING 277 # If there is exception getting the cost information of the build, the 279 cost = ERROR_STRING 281 # Convert the build cost from String to integer. The build cost is used to 282 # compare a task with another task. Set the build cost o [all...] |
/external/libnl/python/netlink/route/links/ |
H A D | bridge.py | 66 def cost(self): member in class:BRIDGELink 72 @cost.setter 73 def cost(self, cost): member in class:BRIDGELink 75 if cost < 0 or cost >= 2**32: 77 capi.rtnl_link_bridge_set_cost(self._link, int(cost))
|
/external/webrtc/webrtc/test/ |
H A D | common_unittest.cc | 64 virtual int cost(int x) const { function in struct:webrtc::__anon24940::Algo1_CostFunction 72 virtual int cost(int x) const { function in struct:webrtc::__anon24940::SqrCost 80 EXPECT_EQ(25, config.Get<Algo1_CostFunction>().cost(5));
|
/external/webrtc/webrtc/modules/rtp_rtcp/source/ |
H A D | vp8_partition_aggregator.cc | 52 int cost = 0; local 55 cost = std::max(max_parent_size_, this_size_int()) - 58 cost = std::max(max_parent_size_, this_size_int()) - min_parent_size_; 60 return cost + NumPackets() * penalty; 135 // Compare cost estimate for "second" with actual cost for "first". 249 size_t cost = 0; local 251 cost = min_size - fragment_size + n * penalty; 253 cost = fragment_size - max_size + n * penalty; 255 cost [all...] |
/external/opencv/cv/src/ |
H A D | 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 334 icvInitEMD( const float* signature1, int size1, const float* signature2, int size2, int dims, CvDistanceFunction dist_func, void* user_param, const float* cost, int cost_step, CvEMDState* state, float* lower_bound, char* local_buffer, int local_buffer_size ) argument 586 icvFindBasicVariables( float **cost, char **is_x, CvNode1D * u, CvNode1D * v, int ssize, int dsize ) argument 711 icvIsOptimal( float **cost, char **is_x, CvNode1D * u, CvNode1D * v, int ssize, int dsize, CvNode2D * enter_x ) argument 918 float **cost = state->cost; local [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
H A D | AbstractLeastSquaresOptimizer.java | 75 * Weight for the least squares cost computation. 96 protected double cost; field in class:AbstractLeastSquaresOptimizer 208 * Update the residuals array and cost function value. 225 cost = 0; 231 cost += residualsWeights[i] * residual * residual; 234 cost = FastMath.sqrt(cost); 259 return cost*cost; 357 cost [all...] |
/external/valgrind/callgrind/ |
H A D | threads.c | 214 CLG_(zero_cost)( CLG_(sets).full, es->cost ); 215 CLG_(current_state).cost = es->cost; 282 CLG_ASSERT(CLG_(current_state).cost == es->cost); 285 CLG_(current_state).cost ); 331 /* allocate real cost space: needed as incremented by 333 es->cost = CLG_(get_eventset_cost)(CLG_(sets).full); 334 CLG_(zero_cost)( CLG_(sets).full, es->cost ); 421 CLG_ASSERT(es->cost [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/ |
H A D | GaussNewtonEstimator.java | 50 /** Default threshold for cost steady state detection. */ 53 /** Default threshold for cost convergence. */ 56 /** Threshold for cost steady state detection. */ 59 /** Threshold for cost convergence. */ 96 * @param maxCostEval maximal number of cost evaluations allowed 222 previous = cost; 226 (FastMath.abs(previous - cost) > (cost * steadyStateThreshold) && 227 (FastMath.abs(cost) > convergence)));
|
/external/eigen/bench/ |
H A D | benchCholesky.cpp | 34 double cost = 0; local 38 cost += 2*(r*j+r+j); 82 << "(" << 1e-9 * cost*repeats/timerNoSqrt.best() << " GFLOPS)\t" 84 << "(" << 1e-9 * cost*repeats/timerSqrt.best() << " GFLOPS)\n";
|