| /external/icu/icu4c/source/tools/toolutil/ |
| D | denseranges.cpp | 123 LargestGaps gaps(capacity-1); in uprv_makeDenseRanges() local
130 gaps.add(expectedValue, (int64_t)actualValue-(int64_t)expectedValue); in uprv_makeDenseRanges()
139 if(i>=gaps.count()) { in uprv_makeDenseRanges()
144 maxLength-=gaps.gapLength(i); in uprv_makeDenseRanges()
150 gaps.truncate(num-1); in uprv_makeDenseRanges()
153 int32_t gapIndex=gaps.firstAfter(minValue); in uprv_makeDenseRanges()
154 int32_t gapStart=gaps.gapStart(gapIndex); in uprv_makeDenseRanges()
156 ranges[i+1][0]=minValue=(int32_t)(gapStart+gaps.gapLength(gapIndex)); in uprv_makeDenseRanges()
|
| /external/libsrtp2/crypto/math/ |
| D | stat.c | 119 uint16_t gaps[6] = { 0, 0, 0, 0, 0, 0 }; in stat_test_runs() local
156 gaps[-1 - state]++; /* increment gap count */ in stat_test_runs()
203 debug_print(srtp_mod_stat, " gaps[]: %d", gaps[i]); in stat_test_runs()
209 (gaps[i] < lo_value[i]) || (gaps[i] > hi_value[i])) in stat_test_runs()
|
| /external/brotli/c/enc/ |
| D | entropy_encode.h | 84 static const size_t gaps[] = {132, 57, 23, 10, 4, 1}; in SortHuffmanTreeItems() local
104 size_t gap = gaps[g]; in SortHuffmanTreeItems()
|
| D | memory.c | 70 static const size_t gaps[] = {23, 10, 4, 1}; in SortPointers() local
73 size_t gap = gaps[g]; in SortPointers()
|
| /external/elfutils/src/ |
| D | elfcmp.c | 97 gaps; variable
291 if (gaps != gaps_ignore && (shdr1->sh_flags & SHF_ALLOC) != 0) in main()
571 if (gaps != gaps_ignore) in main()
591 if (gaps != gaps_ignore) in main()
636 if (gaps != gaps_ignore && phdr1->p_type == PT_LOAD) in main()
649 assert (gaps == gaps_match); in main()
700 gaps = gaps_ignore; in parse_opt()
702 gaps = gaps_match; in parse_opt()
|
| /external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/ |
| D | ClassProto.java | 697 PriorityQueue<FieldGap> gaps = new PriorityQueue<FieldGap>();
727 addFieldGap(oldOffset, fieldOffset, gaps);
730 FieldGap gap = gaps.peek();
732 gaps.poll();
735 addFieldGap(gap.offset + fieldSize, gap.offset + gap.size, gaps);
746 … private void addFieldGap(int gapStart, int gapEnd, @Nonnull PriorityQueue<FieldGap> gaps) {
753 gaps.add(FieldGap.newFieldGap(offset, 4, classPath.oatVersion));
756 gaps.add(FieldGap.newFieldGap(offset, 2, classPath.oatVersion));
759 gaps.add(FieldGap.newFieldGap(offset, 1, classPath.oatVersion));
|
| /external/dtc/tests/ |
| D | mangle-layout.supp | 2 uninitialized alignment gaps can be dumped to output
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopVectorize/ |
| D | interleaved-accesses-pred-stores.ll | 7 ; contains a conditional store. The store group contains gaps and is not
56 ; groups are separately vectorized. The store group contains gaps and is not
116 ; gaps and are not vectorized.
|
| D | interleaved-accesses-2.ll | 9 ; In this test the interleave-group of the loads is not full (has gaps), so
|
| D | interleaved-accesses-3.ll | 10 ; the interleave-group of the loads is not full (has gaps), we also need to check
|
| D | interleaved-accesses-1.ll | 9 ; In this test the interleave-groups are full (have no gaps), so no wrapping
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| D | interleaved-accesses-pred-stores.ll | 7 ; contains a conditional store. The store group contains gaps and is not
56 ; groups are separately vectorized. The store group contains gaps and is not
116 ; gaps and are not vectorized.
|
| /external/deqp/doc/testspecs/VK/ |
| D | sparse_resources.txt | 63 …gnment parameter of buffer's memory requirements. Memory is bound to the buffer object leaving gaps
76 against expected output from compute shader. For parts that correspond to gaps, the data is random …
83 Memory is bound to the image leaving gaps between bound blocks with the size equal to alignment.
95 against expected output from compute shader. For parts that correspond to gaps, the data is random …
|
| /external/autotest/client/site_tests/firmware_TouchMTB/ |
| D | mtb.py | 926 gaps = self.get_distances(target_slot)
929 for index in range(1, len(gaps) - 1):
930 prev_gap = max(gaps[index - 1], 1)
931 curr_gap = gaps[index]
932 next_gap = max(gaps[index + 1], 1)
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopVectorize/SystemZ/ |
| D | mem-interleaving-costs.ll | 11 ; would have gaps.
|
| /external/deqp/doc/testspecs/GLES31/ |
| D | functional.tessellation.txt | 40 - Check for no obvious gaps or overlaps in tessellation triangulation for
118 types of cases: cases testing that there are no obvious gaps in the
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | README.txt | 169 2. Reorder objects to fill in gaps between objects.
|
| /external/perfetto/docs/concepts/ |
| D | service-model.md | 115 packets in a sequence are guaranteed to be read back in order, without gaps
|
| D | buffers.md | 288 fragments have been committed without gaps.
299 clear the gaps, allowing the sequence to restart.
|
| /external/llvm/lib/CodeGen/ |
| D | README.txt | 169 2. Reorder objects to fill in gaps between objects.
|
| /external/curl/docs/ |
| D | KNOWN_BUGS | 53 5.6 cmake support gaps
54 5.7 Visual Studio project gaps
372 5.6 cmake support gaps
388 5.7 Visual Studio project gaps
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/DebugInfo/COFF/ |
| D | local-variable-gap.ll | 4 ; This test attempts to exercise gaps in local variables. The local variable 'p'
|
| /external/perfetto/protos/perfetto/trace/ |
| D | trace_packet.proto | 66 // TraceWriter are seen in-order, without gaps or duplicates. If, for any
|
| /external/angle/third_party/VulkanMemoryAllocator/ |
| D | README.md | 58 …ON format with detailed map of internal state, including list of allocations and gaps between them.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopVectorize/AArch64/ |
| D | interleaved_cost.ll | 168 ; gaps.
|