| /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/llvm-project/llvm/test/Transforms/LoopVectorize/ |
| D | interleaved-accesses-masked-group.ll | 48 ; We therefore create a separate interleave-group with gaps for each of the
50 ; invalidated because interleave-groups of stores with gaps are not supported.
53 ; due to gaps.
70 ; STRIDED_UNMASKED-NEXT: LV: Invalidate candidate interleaved store group due to gaps.
77 ; STRIDED_MASKED-NEXT: LV: Invalidate candidate interleaved store group due to gaps.
78 ; STRIDED_MASKED-NEXT: LV: Invalidate candidate interleaved store group due to gaps.
83 ; We therefore create a separate interleave-group with gaps for each of the accesses,
84 ; (which are later invalidated because interleave-groups of stores with gaps are
112 ; STRIDED_MASKED-NEXT: LV: Invalidate candidate interleaved store group due to gaps.
113 ; STRIDED_MASKED-NEXT: LV: Invalidate candidate interleaved store group due to gaps.
|
| D | interleaved-accesses-pred-stores.ll | 8 ; contains a conditional store. The store group contains gaps and is not
57 ; groups are separately vectorized. The store group contains gaps and is not
117 ; 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/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/brotli/c/enc/ |
| 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/llvm-project/lldb/test/Shell/SymbolFile/Breakpad/ |
| D | line-table-discontinuous-file-ids.test | 1 # Test that we handle files which has gaps in the FILE record IDs.
|
| /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/llvm-project/lldb/source/Plugins/SymbolFile/NativePDB/ |
| D | PdbUtil.cpp | 32 llvm::ArrayRef<LocalVariableAddrGap> gaps) { in MakeRangeList() argument
38 while (!gaps.empty()) { in MakeRangeList()
39 const LocalVariableAddrGap &gap = gaps.front(); in MakeRangeList()
44 gaps = gaps.drop_front(); in MakeRangeList()
|
| /external/llvm-project/llvm/test/Transforms/LoopVectorize/X86/ |
| D | interleaved-accesses-large-gap.ll | 5 ; The gaps between the memory access in this function are too large for
|
| D | interleaved-accesses-waw-dependency.ll | 18 ; storeaddr22, we create interleaved groups with gaps and
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | TreeRangeMap.java | 282 ImmutableMap.Builder<Cut<K>, RangeMapEntry<K, V>> gaps = ImmutableMap.builder(); in merge() local
291 gaps.put(lowerBound, new RangeMapEntry<K, V>(lowerBound, upperBound, value)); in merge()
296 gaps.put(lowerBound, new RangeMapEntry<K, V>(lowerBound, range.upperBound, value)); in merge()
314 entriesByLowerBound.putAll(gaps.build()); in merge()
|
| /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/llvm-project/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/llvm-project/llvm/test/Transforms/LoopVectorize/Hexagon/ |
| D | invalidate-cm-after-invalidating-interleavegroups.ll | 59 ; The loop below only requires tail folding due to interleave groups with gaps.
|
| /external/perfetto/test/stress_test/ |
| D | README.md | 20 corruptions, out-of-order events or gaps.
|
| /external/crosvm/hypervisor/src/kvm/ |
| D | mod.rs | 469 let mut gaps = self.mem_slot_gaps.lock(); in add_memory_region() localVariable
470 let slot = match gaps.pop() { in add_memory_region()
492 gaps.push(Reverse(slot)); in add_memory_region()
|
| /external/rust/crates/textwrap/ |
| D | README.md | 59 chooses line breaks which minimize the gaps left at ends of lines.
|
| /external/swiftshader/third_party/llvm-10.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
|