/external/deqp/framework/common/ |
D | tcuTexCompareVerifier.cpp | 194 const Vec2& depths, in isLinearCompareValid() argument 202 const float d0 = depths[0]; in isLinearCompareValid() 203 const float d1 = depths[1]; in isLinearCompareValid() 259 const Vec4& depths, in isBilinearAnyCompareValid() argument 266 const float d0 = depths[0]; in isBilinearAnyCompareValid() 267 const float d1 = depths[1]; in isBilinearAnyCompareValid() 268 const float d2 = depths[2]; in isBilinearAnyCompareValid() 269 const float d3 = depths[3]; in isBilinearAnyCompareValid() 289 const Vec4& depths, in isBilinearPCFCompareValid() argument 300 const float d0 = depths[0]; in isBilinearPCFCompareValid() [all …]
|
/external/antlr/tool/src/main/java/org/antlr/tool/ |
D | GrammarReport.java | 130 List<Integer> depths = new ArrayList<Integer>(); in getReportData() local 176 depths.add( maxk ); in getReportData() 192 data.numberOfFixedKDecisions = depths.size(); in getReportData() 193 data.mink = Stats.min(depths); in getReportData() 194 data.maxk = Stats.max(depths); in getReportData() 195 data.avgk = Stats.avg(depths); in getReportData()
|
/external/perfetto/src/trace_processor/ |
D | slice_tracker_unittest.cc | 70 EXPECT_EQ(slices.depths()[0], 0); in TEST() 94 EXPECT_EQ(slices.depths()[idx++], 0); in TEST() 102 EXPECT_EQ(slices.depths()[idx], 1); in TEST()
|
D | slice_table.cc | 41 .AddNumericColumn("depth", &slices.depths()) in CreateStorageSchema()
|
D | trace_storage.h | 322 const std::deque<uint8_t>& depths() const { return depths_; } in depths() function
|
/external/brotli/c/enc/ |
D | brotli_bit_stream.c | 257 static void StoreSimpleHuffmanTree(const uint8_t* depths, in StoreSimpleHuffmanTree() argument 272 if (depths[symbols[j]] < depths[symbols[i]]) { in StoreSimpleHuffmanTree() 292 BrotliWriteBits(1, depths[symbols[0]] == 1 ? 1 : 0, storage_ix, storage); in StoreSimpleHuffmanTree() 298 void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num, in BrotliStoreHuffmanTree() argument 316 BrotliWriteHuffmanTree(depths, num, &huffman_tree_size, huffman_tree, in BrotliStoreHuffmanTree() 707 uint8_t depths[BROTLI_MAX_CONTEXT_MAP_SYMBOLS]; in EncodeContextMap() local 734 tree, depths, bits, storage_ix, storage); in EncodeContextMap() 738 BrotliWriteBits(depths[rle_symbol], bits[rle_symbol], storage_ix, storage); in EncodeContextMap() 816 uint8_t depths[BROTLI_MAX_CONTEXT_MAP_SYMBOLS]; in StoreTrivialContextMap() local 829 tree, depths, bits, storage_ix, storage); in StoreTrivialContextMap() [all …]
|
D | compress_fragment.c | 75 uint8_t depths[256], in BuildAndStoreLiteralPrefixCode() 113 depths, bits, storage_ix, storage); in BuildAndStoreLiteralPrefixCode() 118 if (histogram[i]) literal_ratio += histogram[i] * depths[i]; in BuildAndStoreLiteralPrefixCode() 373 const uint8_t* data, size_t len, const uint8_t* depths) { in ShouldMergeBlock() argument 384 r -= (double)histo[i] * (depths[i] + FastLog2(histo[i])); in ShouldMergeBlock()
|
D | brotli_bit_stream.h | 34 BROTLI_INTERNAL void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num,
|
/external/perfetto/ui/src/tracks/chrome_slices/ |
D | controller.ts | 122 depths: new Uint16Array(numRows), 142 slices.depths[row] = +cols[2].longValues![row];
|
D | frontend.ts | 84 const depth = data.depths[i]; 122 if (tStart <= t && t <= tEnd && depth === data.depths[i]) {
|
D | common.ts | 32 depths: Uint16Array; property
|
/external/mesa3d/src/glx/apple/ |
D | TODO | 6 Test GLXPixmap support with various pixmap depths.
|
/external/protobuf/objectivec/Tests/ |
D | unittest_objc.proto | 37 // extensions at various depths. 42 // Recursive message to for testing autocreators at different depths. 52 // depths.
|
/external/gemmlowp/doc/ |
D | less-than-8-bit.md | 91 as specified in [low-precision.md](low-precision.md). With lower bit depths, 100 data to less-than-8-bit depths by scaling them, thus shrinking the range of the 276 Thus, for fixed input values and bit depths, we expect that probabilistic 277 rounding will give more accurate results for large enough GEMM depths, while 278 rounding-to-nearest will be more accurate for smaller GEMM depths.
|
/external/deqp/external/openglcts/modules/gl/ |
D | gl4cCopyImageTests.cpp | 3102 GLuint depths[FUNCTIONAL_TEST_N_LEVELS]; in prepareDstPxls() local 3104 …lateDimmensions(desc.m_target, desc.m_level, desc.m_width, desc.m_height, widths, heights, depths); in prepareDstPxls() 3110 const GLuint req_memory_for_level = req_memory_per_layer * depths[i]; in prepareDstPxls() 3125 const GLuint n_layers = depths[i]; in prepareDstPxls() 3162 GLuint depths[FUNCTIONAL_TEST_N_LEVELS]; in prepareSrcPxls() local 3164 …lateDimmensions(desc.m_target, desc.m_level, desc.m_width, desc.m_height, widths, heights, depths); in prepareSrcPxls() 3170 const GLuint req_memory_for_level = req_memory_per_layer * depths[i]; in prepareSrcPxls() 3184 const GLuint n_layers = depths[lvl]; in prepareSrcPxls() 3412 GLuint depths[FUNCTIONAL_TEST_N_LEVELS]; in prepareTexture() local 3414 …lateDimmensions(desc.m_target, desc.m_level, desc.m_width, desc.m_height, widths, heights, depths); in prepareTexture() [all …]
|
/external/gemmlowp/meta/ |
D | README | 44 possible depths the leftover values (up to 7 elements) needed to be handled.
|
/external/antlr/runtime/ActionScript/project/src/org/antlr/runtime/ |
D | IntStream.as | 84 * you have to release resources for depths 2..5.
|
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/AArch64/ |
D | machine-combiner.ll | 3 ; Incremental updates of the instruction depths should be enough for this test
|
/external/libpng/ |
D | libpng-manual.txt | 1275 (bit depths 1, 2, 4, 8, 16) 1277 (bit depths 8, 16) 1279 (bit depths 1, 2, 4, 8) 1707 certain color types and bit depths. 1741 grayscale images with bit depths of 2 or 4 or if there is a multiple-image 1858 PNG files pack pixels of bit depths 1, 2, and 4 into bytes as small as 1866 PNG files have possible bit depths of 1, 2, 4, 8, and 16. All pixels 2974 (bit depths 1, 2, 4, 8, 16) 2976 (bit depths 8, 16) 2978 (bit depths 1, 2, 4, 8) [all …]
|
/external/mesa3d/src/gallium/docs/source/drivers/freedreno/ |
D | ir3-notes.rst | 414 TODO: we should probably calculate both hard and soft depths (?) to
|
/external/u-boot/doc/ |
D | README.scrapyard | 7 in the imperishable depths of the git history. This document tries to
|
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/ |
D | machine-combiner.ll | 4 ; Incremental updates of the instruction depths should be enough for this test
|
/external/u-boot/drivers/video/ |
D | Kconfig | 12 a bitmap display of various sizes and depths which can be drawn on
|
/external/swiftshader/third_party/LLVM/lib/Support/ |
D | regengine.inc | 583 case OBACK_: /* the vilest depths */
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/ |
D | regengine.inc | 583 case OBACK_: /* the vilest depths */
|