/frameworks/av/media/libstagefright/codecs/avc/enc/src/ |
findhalfpel.cpp | 71 // find cost for the current full-pel position 595 int cost; local 599 cost = AVCSAD_Macroblock_C(cand, cur, dmin, NULL); 601 return cost;
|
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
vp9_encodemv.c | 104 int z, c, o, d, e, f, cost = 0; local 107 cost += class_cost[c]; 112 cost += class0_cost[d]; 117 cost += bits_cost[i][((d >> i) & 1)]; 120 cost += class0_fp_cost[d][f]; 122 cost += fp_cost[f]; 126 cost += class0_hp_cost[e]; 128 cost += hp_cost[e]; 131 mvcost[v] = cost + sign_cost[0]; 132 mvcost[-v] = cost + sign_cost[1] [all...] |
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...] |
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;
|
/packages/apps/QuickSearchBox/src/com/android/quicksearchbox/util/ |
LevenshteinDistance.java | 75 int cost = sourceToken.prefixOf(targetToken) ? 0 : 1; local 87 if (d + cost < distance) { 88 distance = d + cost; 89 type = cost == 0 ? EDIT_UNCHANGED : EDIT_REPLACE;
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/ |
typing_weighting.h | 42 float cost = 0.0f; local 44 cost += ScoringParams::HAS_MULTI_WORD_TERMINAL_COST; 47 cost += ScoringParams::HAS_PROXIMITY_TERMINAL_COST; 50 cost += ScoringParams::HAS_EDIT_CORRECTION_TERMINAL_COST; 52 return cost; 61 float cost = 0.0f; local 63 cost = 0.0f; 65 cost = ScoringParams::INTENTIONAL_OMISSION_COST; 67 cost = ScoringParams::OMISSION_COST_FIRST_CHAR; 69 cost = sameCodePoint ? ScoringParams::OMISSION_COST_SAME_CHA 87 float cost = isProximity ? (isFirstChar ? ScoringParams::FIRST_CHAR_PROXIMITY_COST local 142 float cost = (singleChar ? ScoringParams::INSERTION_COST_FIRST_CHAR : 0.0f); local 155 const float cost = ScoringParams::SPACE_OMISSION_COST; local 173 const float cost = firstCompletion ? ScoringParams::COST_FIRST_COMPLETION local 209 const float cost = ScoringParams::SPACE_SUBSTITUTION_COST * distanceToSpaceKey; local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
ndhelper.h | 17 __LONG32 cost; member in struct:tagDiagnosticsInfo
|
/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;
|
db_rob_image_homography.cpp | 97 stat->cost=db_RobImageHomography_Cost(H,point_count,x_i,xp_i,one_over_scale2); 104 stat->gric=stat->cost+stat->lambda1*stat->model_dimension*((double)stat->nr_points)+stat->lambda2*((double)stat->nr_parameters); 111 /*Compute min_Jtf and upper right of JtJ. Return cost.*/ 185 /*Add square-sum to cost*/ 192 /*Compute min_Jtf and upper right of JtJ. Return cost*/ 219 /*Add square-sum to cost*/ 230 double lambda,cost,current_cost; local 244 /*std::cout << "Cost:" << current_cost << " ";*/ 251 /*Compute Cost(x+dx)*/ 253 cost=db_RobImageHomography_Cost(H_p_dx,point_count,x_i,xp_i,one_over_scale2) 572 double lambda,cost,current_cost; local [all...] |
/external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
b2DynamicTree.cpp | 204 // Cost of creating a new parent for this node and the new leaf 205 float32 cost = 2.0f * combinedArea; local 207 // Minimum cost of pushing the leaf further down the tree 210 // Cost of descending into child1 227 // Cost of descending into child2 244 // Descend according to the minimum cost. 245 if (cost < cost1 && cost < cost2) 736 float32 cost = b.GetPerimeter(); local 737 if (cost < minCost [all...] |
/external/mesa3d/src/mesa/program/ |
register_allocate.c | 68 * up front and stored in a 2-dimensional array, so that the cost of 140 * approximate cost of spilling this node. 528 * Returns a node number to be spilled according to the cost/benefit using 539 float cost = g->nodes[n].spill_cost; local 542 if (cost <= 0.0) 547 if (benefit / cost > best_benefit) { 548 best_benefit = benefit / cost; 557 * Only nodes with a spill cost set (cost != 0.0) will be considered 561 ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost) [all...] |
/external/opencv3/3rdparty/libwebp/enc/ |
histogram.c | 152 // Returns the cost encode the rle-encoded entropy code. 197 double cost = 0.; local 198 for (i = 2; i < length - 2; ++i) cost += (i >> 1) * population[i + 2]; 199 return cost; 202 // Estimates the Entropy + Huffman + other block overhead size cost. 224 // Various histogram combine/cost-eval functions 243 // Performs out = a + b, computing the cost C(a+b) - C(a) - C(b) while comparing 247 // the partial cost against 'cost_threshold + C(a) + C(b)' to possibly bail-out 253 double cost = 0; local 259 // palette_code_bits_ is part of the cost evaluation for literal_ 301 double cost = -a->bit_cost_; local [all...] |
/external/opencv3/modules/calib3d/include/opencv2/calib3d/ |
calib3d_c.h | 350 CvMat* cost; member in struct:CvStereoBMState 369 CVAPI(void) cvValidateDisparity( CvArr* disparity, const CvArr* cost,
|
/external/opencv3/modules/calib3d/src/ |
dls.cpp | 110 std::vector<double> cost; local 148 // cost(i) = CbarVec' * D * CbarVec; 150 cost.push_back( cost_mat.at<double>(0) ); 197 double cost_valid = cost[k]; [all...] |
/external/opencv3/modules/flann/include/opencv2/flann/ |
autotuned_index.h | 222 void evaluate_kmeans(CostData& cost) 229 get_param<int>(cost.params,"iterations"), 230 get_param<int>(cost.params,"branching")); 231 KMeansIndex<Distance> kmeans(sampledDataset_, cost.params, distance_); 242 cost.memoryCost = (kmeans.usedMemory() + datasetMemory) / datasetMemory; 243 cost.searchTimeCost = searchTime; 244 cost.buildTimeCost = buildTime; 249 void evaluate_kdtree(CostData& cost) 255 Logger::info("KDTree using params: trees=%d\n", get_param<int>(cost.params,"trees")); 256 KDTreeIndex<Distance> kdtree(sampledDataset_, cost.params, distance_) 336 CostData cost; local 379 CostData cost; local [all...] |
hierarchical_clustering_index.h | 652 void computeLabels(int* dsindices, int indices_length, int* centers, int centers_length, int* labels, DistanceType& cost) 654 cost = 0; 666 cost += dist; 708 DistanceType cost; local 709 computeLabels(dsindices, indices_length, ¢ers[0], centers_length, &labels[0], cost);
|
/external/opencv3/modules/ml/src/ |
lr.cpp | 312 double cost = 0; local 350 cost = (-1.0/m) * (sum(d_a)[0] + sum(d_b)[0]); 351 cost = cost + rparameter; 353 return cost;
|
/external/zopfli/src/zopfli/ |
squeeze.c | 111 Function that calculates a cost based on a model for the given LZ77 symbol. 117 Cost model which should exactly match fixed tree. 129 double cost = 0; local 130 if (lsym <= 279) cost += 7; 131 else cost += 8; 132 cost += 5; /* Every dist symbol has length 5. */ 133 return cost + dbits + lbits; 138 Cost model based on symbol statistics. 155 Finds the minimum possible cost this cost model can return for valid length an 436 double cost = GetBestLengths( local 459 double cost; local [all...] |
/frameworks/av/services/camera/libcameraservice/utils/ |
ClientManager.h | 38 * resource, and the corresponding cost, priority, owner ID, and conflicting keys list used 47 ClientDescriptor(const KEY& key, const VALUE& value, int32_t cost, 49 ClientDescriptor(KEY&& key, VALUE&& value, int32_t cost, std::set<KEY>&& conflictingKeys, 65 * Return the cost for this descriptor. 113 ClientDescriptor<KEY, VALUE>::ClientDescriptor(const KEY& key, const VALUE& value, int32_t cost, 115 mValue{value}, mCost{cost}, mConflicting{conflictingKeys}, mPriority{priority}, 119 ClientDescriptor<KEY, VALUE>::ClientDescriptor(KEY&& key, VALUE&& value, int32_t cost, 121 mKey{std::forward<KEY>(key)}, mValue{std::forward<VALUE>(value)}, mCost{cost}, 206 * the max cost allowed for this ClientManager, descriptors with non-zero cost, equal or lowe 385 int32_t cost = client->getCost(); local [all...] |
/packages/apps/LegacyCamera/jni/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/ceres-solver/internal/ceres/ |
problem_test.cc | 56 // Trivial cost function that accepts a single argument. 75 // Trivial cost function that accepts two arguments. 96 // Trivial cost function that accepts three arguments. 177 // The cost function expects the size of the second parameter, z, to be 4 327 // Add a cost function multiple times and check to make sure that 328 // the destructor on the cost function is only called once. 334 CostFunction* cost = new DestructorCountingCostFunction(&num_destructions); local 335 problem.AddResidualBlock(cost, NULL, y, z); 336 problem.AddResidualBlock(cost, NULL, y, z); 337 problem.AddResidualBlock(cost, NULL, y, z) 1094 double cost; local [all...] |
/external/elfutils/libdwfl/ |
dwfl_segment_report_module.c | 862 const GElf_Off cost = (contiguous < file_trimmed_end ? total_filesz local 871 cost, worthwhile, whole, contiguous,
|
/external/jdiff/src/jdiff/ |
DiffMyers.java | 83 private int cost; field in class:DiffMyers 96 The edit cost is stored into COST; this is the total number of 160 cost = 2 * c - 1; 192 cost = 2 * c; 238 cost = 2 * c - 1; 270 cost = 2 * c - 1; 310 int c = cost;
|
/external/libavc/encoder/x86/ |
ih264e_intra_modes_eval_ssse3.c | 458 * Pointer to the variable in which minimum cost is returned 464 * Lamda value for computing cost from SAD 467 * Predicted mode for cost computation 488 WORD32 cost[MAX_I4x4] = { INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX, local 533 cost[VERT_I4x4] = sad[VERT_I4x4] + ((u4_predictd_mode == VERT_I4x4) ? u4_lambda: lambda4); 544 cost[HORZ_I4x4] = sad[HORZ_I4x4] + ((u4_predictd_mode == HORZ_I4x4) ? u4_lambda: lambda4); 582 cost[DC_I4x4] = sad[DC_I4x4] + ((u4_predictd_mode == DC_I4x4) ? u4_lambda: lambda4); 637 cost[DIAG_DL_I4x4] = sad[DIAG_DL_I4x4] + ((u4_predictd_mode == DIAG_DL_I4x4) ? u4_lambda: lambda4); 650 cost[DIAG_DR_I4x4] = sad[DIAG_DR_I4x4] + ((u4_predictd_mode == DIAG_DR_I4x4) ? u4_lambda: lambda4); 665 cost[VERT_R_I4x4] = sad[VERT_R_I4x4] + ((u4_predictd_mode == VERT_R_I4x4) ? u4_lambda: lambda4) [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...] |