| /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/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/perfetto/ui/src/tracks/async_slices/ |
| D | controller.ts | 79 depths: new Uint16Array(numRows),
111 slices.depths[row] = +cols[3].longValues![row];
|
| D | common.ts | 29 depths: Uint16Array; property
|
| /external/perfetto/ui/src/tracks/debug_slices/ |
| D | controller.ts | 62 depths: new Uint16Array(numRows),
90 slices.depths[i] = depthCol.isNulls![i] ? 0 : depthCol.longValues![i];
|
| /external/perfetto/ui/src/tracks/expected_frames/ |
| D | controller.ts | 79 depths: new Uint16Array(numRows),
113 slices.depths[row] = +cols[3].longValues![row];
|
| D | common.ts | 29 depths: Uint16Array; property
|
| /external/perfetto/ui/src/tracks/chrome_slices/ |
| D | controller.ts | 78 depths: new Uint16Array(numRows),
116 slices.depths[row] = +cols[3].longValues![row];
|
| D | common.ts | 31 depths: Uint16Array; property
|
| D | frontend.ts | 81 const depth = data.depths[i];
201 if (depth !== data.depths[i]) {
|
| /external/brotli/c/enc/ |
| D | brotli_bit_stream.c | 242 static void StoreSimpleHuffmanTree(const uint8_t* depths, in StoreSimpleHuffmanTree() argument
257 if (depths[symbols[j]] < depths[symbols[i]]) { in StoreSimpleHuffmanTree()
277 BrotliWriteBits(1, depths[symbols[0]] == 1 ? 1 : 0, storage_ix, storage); in StoreSimpleHuffmanTree()
283 void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num, in BrotliStoreHuffmanTree() argument
301 BrotliWriteHuffmanTree(depths, num, &huffman_tree_size, huffman_tree, in BrotliStoreHuffmanTree()
692 uint8_t depths[BROTLI_MAX_CONTEXT_MAP_SYMBOLS]; in EncodeContextMap() local
719 tree, depths, bits, storage_ix, storage); in EncodeContextMap()
723 BrotliWriteBits(depths[rle_symbol], bits[rle_symbol], storage_ix, storage); in EncodeContextMap()
801 uint8_t depths[BROTLI_MAX_CONTEXT_MAP_SYMBOLS]; in StoreTrivialContextMap() local
814 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/actual_frames/ |
| D | controller.ts | 98 depths: new Uint16Array(numRows),
129 slices.depths[row] = +cols[3].longValues![row];
|
| D | common.ts | 29 depths: Uint16Array; property
|
| /external/llvm-project/mlir/test/Transforms/ |
| D | loop-fusion-slice-computation.mlir | 69 // The load at depth 1 in loop nest %i2 prevents slicing loop nest %i0 at depths
71 // depths 1 and 2 because the dependent store in loop nest %i0 is at depth 2.
97 // depths greater than 1 into loop nest %i0. However, loop nest %i0 can be
98 // sliced into loop nest %i2 at depths 1 and 2 because the dependent load in
|
| /external/mesa3d/src/glx/apple/ |
| D | TODO | 6 Test GLXPixmap support with various pixmap depths.
|
| /external/tensorflow/tensorflow/python/keras/ |
| D | models.py | 274 depths = [depth for depth in model._nodes_by_depth.keys() if depth < 0]
275 depths.sort(reverse=True) # Order topologically from inputs to outputs.
276 for depth in depths:
|
| /external/angle/src/compiler/translator/ |
| D | Compiler.cpp | 1347 std::vector<int> depths(mCallDag.size()); in checkCallDepth() local
1356 depth = std::max(depth, depths[calleeIndex] + 1); in checkCallDepth()
1359 depths[i] = depth; in checkCallDepth()
1381 if (depths[calleeIndex] == currentDepth - 1) in checkCallDepth()
|
| /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/perfetto/test/trace_processor/dynamic/ |
| D | relationship_tables.textproto | 137 # Next we create stacks of various depths for the different tracks.
|
| /external/tensorflow/tensorflow/python/ops/structured/ |
| D | structured_tensor.py | 1410 depths = [_pyval_empty_list_depth(v) for v in pyval]
1411 if any(depth is None for depth in depths):
1414 return max(depths) + 1
|
| /external/gemmlowp/meta/ |
| D | README | 44 possible depths the leftover values (up to 7 elements) needed to be handled.
|
| /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/llvm-project/mlir/include/mlir/Dialect/Affine/ |
| D | Passes.td | 38 "choice depths for copy placement">,
|