HomeSort by relevance Sort by last modified time
    Searched full:bestcost (Results 1 - 11 of 11) sorted by null

  /external/llvm/test/CodeGen/ARM/
commute-movcc.ll 32 %BestCost.011 = phi i32 [ -1, %entry ], [ %BestCost.1, %if.end8 ]
42 %cmp3 = icmp ult i32 %mul, %BestCost.011
44 %mul.BestCost.0 = select i1 %cmp3, i32 %mul, i32 %BestCost.011
48 %cmp5 = icmp ugt i32 %mul, %BestCost.011
50 %BestCost.0.mul = select i1 %cmp5, i32 %BestCost.011, i32 %mul
55 %BestCost.1 = phi i32 [ %mul.BestCost.0, %if.then ], [ %BestCost.0.mul, %if.else
    [all...]
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/
omxVCM4P10_MotionEstimationMB.c 504 OMX_S32 Cost, BestCost;
546 Cost = BestCost = ARM_VCM4P10_MAX_COST;
572 if (Cost < BestCost)
574 BestCost = Cost;
592 *pBestCost = BestCost;
962 OMX_S32 BlockCost, PartitionCost, BestCost;
969 BestCost = ARM_VCM4P10_MAX_COST;
1040 if (PartitionCost <= BestCost)
1042 BestCost = PartitionCost;
1093 *pCost = BestCost;
    [all...]
  /external/srec/srec/include/
srec_results.h 36 void* srec_nbest_prepare_list(multi_srec* rec, int n, asr_int32_t* bestcost);
  /external/srec/srec/crec/
srec_results.c 108 void* srec_nbest_prepare_list(multi_srec* recm, int n, asr_int32_t* bestcost)
122 *bestcost = MAXbcostdata;
131 *bestcost = stack->complete_paths[0]->costsofar;
135 *bestcost = MAXbcostdata;
  /external/llvm/lib/CodeGen/
RegAllocGreedy.cpp 356 BlockFrequency &BestCost,
805 EvictionCost BestCost;
806 BestCost.setMax();
813 BestCost.BrokenHints = 0;
814 BestCost.MaxWeight = VirtReg.weight;
847 if (!canEvictInterference(VirtReg, PhysReg, false, BestCost))
    [all...]
RegAllocFast.cpp 550 unsigned BestReg = 0, BestCost = spillImpossible;
555 DEBUG(dbgs() << "\tBestCost: " << BestCost << "\n");
561 if (Cost < BestCost)
562 BestReg = *I, BestCost = Cost;
    [all...]
  /external/zopfli/src/zopfli/
squeeze.c 460 double bestcost = ZOPFLI_LARGE_FLOAT; local
489 if (s->options->verbose_more || (s->options->verbose && cost < bestcost)) {
492 if (cost < bestcost) {
496 bestcost = cost;
  /external/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.h 128 BestCost};
HexagonMachineScheduler.cpp 567 FoundCandidate = BestCost;
  /external/llvm/lib/CodeGen/SelectionDAG/
ResourcePriorityQueue.cpp 606 signed BestCost = SUSchedulingCost(*Best);
610 if (SUSchedulingCost(*I) > BestCost) {
611 BestCost = SUSchedulingCost(*I);
  /external/elfutils/0.153/src/
ldgeneric.c 3508 uint64_t bestcost; local
    [all...]

Completed in 3450 milliseconds