/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/linux/netfilter/ |
H A D | xt_limit.h | 16 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/external/clang/utils/ |
H A D | CmpDriver | 36 def cost(a, b): function in function:insertMinimumPadding 47 current = cost(a, b) 51 candidate = cost(a_0, b)
|
/external/libvpx/vp8/encoder/ |
H A D | treewriter.c | 14 static void cost( function 32 cost(C, T, P, j, d); 38 cost(c, t, p, 0, 0);
|
H A D | encodemv.c | 104 unsigned int cost; local 108 cost = vp8_cost_zero(p [mvpis_short]) 112 return cost; 117 cost = vp8_cost_one(p [mvpis_short]); 120 cost += vp8_cost_bit(p [MVPbits + i], (x >> i) & 1); 127 cost += vp8_cost_bit(p [MVPbits + i], (x >> i) & 1); 132 cost += vp8_cost_bit(p [MVPbits + 3], (x >> 3) & 1); 135 return cost; // + vp8_cost_bit( p [MVPsign], v < 0); 238 const int cost = 7 + MV_PROB_UPDATE_CORRECTION + ((vp8_cost_one(update_p) - vp8_cost_zero(update_p) + 128) >> 8); local 240 if (cur_b - new_b > cost) [all...] |
H A D | tokenize.c | 70 // initialize the cost for extra bits for all possible coefficient value. 72 int cost = 0; local 81 cost += vp8_treed_cost(p->tree, p->prob, extra >> 1, Length); 83 cost += vp8_cost_bit(vp8_prob_half, extra & 1); /* sign */ 84 dct_value_cost[i + DCT_MAX_VALUE] = cost;
|
/external/clang/test/CodeGenCXX/ |
H A D | array-operator-delete-call.cpp | 25 S *cost; member in struct:COST 36 cost = new S[3]; 43 if (cost) { 44 delete [] 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/srec/srec/ca/ |
H A D | rec_nbes.c | 99 ESR_ReturnCode CA_NBestListGetResultWordIDs(CA_NBestList* nbest, size_t index, wordID* wordIDs, size_t* len, asr_int32_t* cost) argument 106 return srec_nbest_get_resultWordIDs(nbest, index, wordIDs, len, cost);
|
H A D | rec_resu.c | 45 bigcostdata cost; local 47 srec_get_top_choice_score(hRecog->recm, &cost, do_incsil); 49 *score = cost;
|
/external/webp/src/enc/ |
H A D | cost.c | 12 #include "./cost.h" 19 // Boolean-cost cost table 51 // Level cost tables 340 int cost = 0; local 344 cost += VP8BitCost(bits & 1, probas[i]); 349 return cost; 371 // Starting at level 67 and up, the variable part of the cost is 380 // Mode cost tables. 382 // These are the fixed probabilities (in the coding trees) turned into bit-cost [all...] |
/external/webkit/Source/JavaScriptCore/qt/api/ |
H A D | qscriptengine.cpp | 184 Reports an additional memory cost of the given \a size, measured in 189 Reporting the additional cost makes it more likely that the garbage 193 the scripting environment, the cost should not be reported, since 202 void QScriptEngine::reportAdditionalMemoryCost(int cost) argument 204 d_ptr->reportAdditionalMemoryCost(cost);
|
H A D | qscriptengine_p.h | 65 inline void reportAdditionalMemoryCost(int cost); 180 void QScriptEnginePrivate::reportAdditionalMemoryCost(int cost) argument 182 if (cost > 0) 183 JSReportExtraMemoryCost(m_context, cost);
|
/external/bzip2/ |
H A D | 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[ [all...] |
/external/elfutils/libdwfl/ |
H A D | core-file.c | 198 GElf_Off cost, GElf_Off worthwhile, 254 return cost <= MAX_EAGER_COST; 193 core_file_read_eagerly(Dwfl_Module *mod, void **userdata __attribute__ ((unused)), const char *name __attribute__ ((unused)), Dwarf_Addr start __attribute__ ((unused)), void **buffer, size_t *buffer_available, GElf_Off cost, GElf_Off worthwhile, GElf_Off whole, GElf_Off contiguous __attribute__ ((unused)), void *arg, Elf **elfp) argument
|
H A D | dwfl_segment_report_module.c | 570 const GElf_Off cost = (contiguous < file_trimmed_end ? total_filesz local 579 cost, worthwhile, whole, contiguous,
|
/external/jdiff/src/jdiff/ |
H A D | 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/opencv/cvaux/src/ |
H A D | cvcorrespond.cpp | 73 float cost, cost1; local 113 /* Fill upper line in the cost Table */ 128 /* Fill lefter line in the cost Table */ 177 cost = 0; 184 cost = (float) (r_len * r_len - l_len * l_len) * (1 / (r_len * l_len)); 188 cost = (float) (l_len * l_len - r_len * r_len) * (1 / (r_len * l_len)); 200 min1 = costTable[i_1 + j_1 * row_size] + cost + (float) cost1;
|
/external/srec/srec/crec/ |
H A D | srec_results.c | 231 ESR_ReturnCode srec_nbest_get_resultWordIDs(void* rec_void, size_t index, wordID* wordIDs, size_t* len, asr_int32_t* cost) argument 243 *cost = MAXbcostdata; 248 *cost = stack->complete_paths[index]->costsofar; 283 int srec_nbest_get_result(void* rec_void, int n, char* label, int label_len, asr_int32_t* cost, int whether_strip_slot_markers) argument 294 *cost = MAXbcostdata; 300 *cost = stack->complete_paths[n]->costsofar; 380 start_cost = wtoken->cost + rec->accumulated_cost_offset[ start_frame]; 388 end_cost = wtoken->cost + rec->accumulated_cost_offset[ end_frame]; 406 /* this is the best cost, unconstrained by state sequence */ 416 /* this is the best cost, unconstraine [all...] |
/external/srec/srec/include/ |
H A D | search_network.h | 133 costdata cost; member in struct:FSMarc_t
|
/external/valgrind/main/callgrind/ |
H A D | debug.c | 233 jcc->cost ? jcc->cost[fullOffset(EG_IR)]:0, 234 jcc->cost ? jcc->cost[fullOffset(EG_DR)]:0, 235 jcc->cost ? jcc->cost[fullOffset(EG_DW)]:0); 259 CLG_(print_cost)(s+9, CLG_(sets).full, jcc->cost); 361 CLG_(print_cost)(s+5, ii->eventset, bbcc->cost + ii->cost_offset); 451 void CLG_(print_cost)(int s, EventSet* es, ULong* cost) {} argument
|
H A D | events.c | 217 /* Get cost array for an event set */ 224 void CLG_(init_cost)(EventSet* es, ULong* cost) argument 228 if (!cost) return; 231 cost[i] = 0; 235 void CLG_(init_cost_lz)(EventSet* es, ULong** cost) argument 239 CLG_ASSERT(cost != 0); 240 if (!(*cost)) 241 *cost = CLG_(get_eventset_cost)(es); 244 (*cost)[i] = 0; 247 void CLG_(zero_cost)(EventSet* es, ULong* cost) argument 257 is_zero_cost(EventSet* es, ULong* cost) argument [all...] |
/external/webkit/Source/JavaScriptCore/heap/ |
H A D | Heap.cpp | 91 void Heap::reportExtraMemoryCostSlowCase(size_t cost) argument 99 // of this extra cost until the next GC. In garbage collected languages, most values 106 m_extraCost += cost;
|
H A D | Heap.h | 79 void reportExtraMemoryCost(size_t cost); 165 inline void Heap::reportExtraMemoryCost(size_t cost) argument 167 if (cost > minExtraCost) 168 reportExtraMemoryCostSlowCase(cost);
|
/external/webkit/Source/JavaScriptCore/wtf/text/ |
H A D | StringImpl.h | 203 size_t cost() function in class:WTF::StringImpl 205 // For substrings, return the cost of the base string. 207 return m_substringBuffer->cost();
|