HomeSort by relevance Sort by last modified time
    Searched full:costs (Results 26 - 50 of 413) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/libvpx/libvpx/vp8/encoder/
boolhuff.h 39 /* Variables used to track bit costs without outputing to the bitstream */
  /external/libvpx/libvpx/vp9/encoder/
vp9_writer.h 30 // Variables used to track bit costs without outputing to the bitstream
  /external/valgrind/main/callgrind/docs/
cl-format.xml 33 format "key: value". After the header, lines specifying profile costs
159 <function>main</function> is 820, which is the sum of self cost 20 and costs
240 <para>If a Callgrind data file should hold costs for each assembler instruction
313 to specify an additional event type "Sum", which is calculated by adding costs
356 <screen>CostLine := SubPositionList Costs?</screen>
359 <screen>Costs := (Number Space+)+</screen>
474 <para><computeroutput>summary: costs</computeroutput> [Callgrind]</para>
476 equal or larger than a total over all self costs. It may be larger as
481 <para><computeroutput>totals: costs</computeroutput> [Cachegrind]</para>
  /frameworks/base/core/res/res/layout/
app_permission_item_money.xml 18 Defines the layout of a single permission item that costs money.
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/
boolhuff.h 39 /* Variables used to track bit costs without outputing to the bitstream */
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/
vp9_writer.h 30 // Variables used to track bit costs without outputing to the bitstream
  /external/chromium_org/third_party/brotli/src/brotli/enc/
literal_cost.cc 84 // Compute bit costs with sliding window.
144 // Compute bit costs with sliding window.
  /external/chromium_org/third_party/icu/source/common/
dictbe.h 201 * TrieWordDictionary with costs associated with each word and
223 * engine is deleted. The TrieWordDictionary must contain costs for each word
  /external/llvm/test/Transforms/LoopVectorize/X86/
vect.omp.force.ll 25 ; This loop will be vectorized, although the scalar cost is lower than any of vector costs, but vectorization is explicitly forced in metadata.
59 ; This method will not be vectorized, as scalar cost is lower than any of vector costs.
vector-scalar-select-cost.ll 3 ; Make sure we use the right select kind when querying select costs.
  /external/valgrind/main/callgrind/
Makefile.am 20 costs.h \
39 costs.c \
costs.c 46 CostChunk* cc = (CostChunk*) CLG_MALLOC("cl.costs.gc.1",
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
target.h 138 /* Types of costs for vectorizer cost model. */
159 track costs. */
  /external/chromium_org/third_party/libwebp/enc/
histogram.c 26 // costs.
28 // The size of the bin-hash corresponding to the three dominant costs.
254 // Aggregated costs
359 // representing the entropy costs.
462 // red and blue) symbol costs and compute the histogram aggregate bit_cost.
472 // Analyze the dominant (literal, red and blue) entropy costs.
479 // symbol costs.
cost.h 72 // Mode costs
histogram.h 43 double literal_cost_; // Cached values of dominant entropy costs:
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 356 llvm::dbgs() << "Reading node costs for node " << node << "\n";
369 PBQP::Matrix costs(allowed1->size() + 1, allowed2->size() + 1, 0);
370 addVirtRegCoalesce(costs, *allowed1, *allowed2, cBenefit);
371 g.addEdge(node1, node2, costs);
377 PBQP::Matrix costs(g.getEdgeCosts(edge));
378 addVirtRegCoalesce(costs, *allowed1, *allowed2, cBenefit);
379 g.setEdgeCosts(edge, costs);
  /external/webp/src/enc/
histogram.c 26 // costs.
28 // The size of the bin-hash corresponding to the three dominant costs.
254 // Aggregated costs
359 // representing the entropy costs.
462 // red and blue) symbol costs and compute the histogram aggregate bit_cost.
472 // Analyze the dominant (literal, red and blue) entropy costs.
479 // symbol costs.
  /external/llvm/include/llvm/CodeGen/PBQP/
RegAllocSolver.h 92 void setup(const Vector& Costs) {
93 NumOpts = Costs.getLength() - 1;
304 // register costs first (since early nodes are the most
  /bionic/libm/upstream-freebsd/lib/msun/src/
e_log10.c 82 * x = 1/sqrt(2), but we do it anyway since it costs little on CPUs
k_tanf.c 47 * micro-optimized for Athlons (XP, X64). It costs 2 multiplications
  /development/perftests/panorama/feature_stab/db_vlvm/
db_utilities_constants.h 89 * Group size is the number of observation costs multiplied together
  /external/chromium_org/chrome/browser/media_galleries/fileapi/
readahead_file_stream_reader.cc 19 const int kBufferSize = 1024*1024; // 1MB to minimize transaction costs.
  /external/chromium_org/remoting/webapp/
stats_accumulator.js 9 * bandwidth and storage costs down. This class bridges that gap, by
  /external/chromium_org/third_party/webrtc/
common.h 77 // Own implementation of rtti-subset to avoid depending on rtti and its costs.

Completed in 681 milliseconds

12 3 4 5 6 7 8 91011>>