| /external/libese/libese/tests/ |
| D | bitspec_unittests.cpp | 32 } adjacent; member
53 .adjacent = {
119 EXPECT_EQ(0, bs_get(kTestSpec.adjacent.high, byte)); in TEST_F()
120 EXPECT_EQ(0, bs_get(kTestSpec.adjacent.mid, byte)); in TEST_F()
121 EXPECT_EQ(0, bs_get(kTestSpec.adjacent.low, byte)); in TEST_F()
123 EXPECT_EQ(0x3, bs_get(kTestSpec.adjacent.high, byte)); in TEST_F()
124 EXPECT_EQ(0xf, bs_get(kTestSpec.adjacent.mid, byte)); in TEST_F()
125 EXPECT_EQ(0x3, bs_get(kTestSpec.adjacent.low, byte)); in TEST_F()
127 bs_assign(&byte, kTestSpec.adjacent.mid, i); in TEST_F()
128 EXPECT_EQ(0x3, bs_get(kTestSpec.adjacent.high, byte)); in TEST_F()
[all …]
|
| /external/u-boot/arch/nios2/cpu/ |
| D | u-boot.lds | 41 * adjacent to simplify the startup code -- and provide
76 * adjacent to sdata and can be referenced via gp. The normal
77 * bss follows. We keep it adjacent to simplify init code.
|
| /external/u-boot/lib/ |
| D | lmb.c | 111 long adjacent, i; in lmb_add_region() local
128 adjacent = lmb_addrs_adjacent(base,size,rgnbase,rgnsize); in lmb_add_region()
129 if ( adjacent > 0 ) { in lmb_add_region()
135 else if ( adjacent < 0 ) { in lmb_add_region()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| D | IntervalMap.h | 152 static inline bool adjacent(const T &a, const T &b) { in adjacent() function
176 static inline bool adjacent(const T &a, const T &b) { in adjacent() function
638 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) { in insertFrom()
641 if (i != Size && value(i) == y && Traits::adjacent(b, start(i))) { in insertFrom()
663 if (value(i) == y && Traits::adjacent(b, start(i))) { in insertFrom()
1611 Traits::adjacent(Node.stop(i-1), Start); in canCoalesceLeft()
1616 return Node.value(i-1) == Value && Traits::adjacent(Node.stop(i-1), Start); in canCoalesceLeft()
1620 return Node.value(i) == Value && Traits::adjacent(Node.stop(i), Start); in canCoalesceLeft()
1640 return Node.value(i) == Value && Traits::adjacent(Stop, Node.start(i)); in canCoalesceRight()
1645 return Node.value(i) == Value && Traits::adjacent(Stop, Node.start(i)); in canCoalesceRight()
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | IntervalMap.h | 149 static inline bool adjacent(const T &a, const T &b) { in adjacent() function
169 static inline bool adjacent(const T &a, const T &b) { in adjacent() function
635 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) { in insertFrom()
638 if (i != Size && value(i) == y && Traits::adjacent(b, start(i))) { in insertFrom()
660 if (value(i) == y && Traits::adjacent(b, start(i))) { in insertFrom()
1609 Traits::adjacent(Node.stop(i-1), Start); in canCoalesceLeft()
1614 return Node.value(i-1) == Value && Traits::adjacent(Node.stop(i-1), Start); in canCoalesceLeft()
1618 return Node.value(i) == Value && Traits::adjacent(Node.stop(i), Start); in canCoalesceLeft()
1638 return Node.value(i) == Value && Traits::adjacent(Stop, Node.start(i)); in canCoalesceRight()
1643 return Node.value(i) == Value && Traits::adjacent(Stop, Node.start(i)); in canCoalesceRight()
[all …]
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_AudioSpectrogram.pbtxt | 25 How widely apart the center of adjacent sample windows should be.
57 and adjacent windows are concatenated in the next dimension.
|
| D | api_def_FractionalMaxPoolGrad.pbtxt | 47 of adjacent pooling cells are used by both cells. For example:
|
| D | api_def_FractionalAvgPoolGrad.pbtxt | 41 of adjacent pooling cells are used by both cells. For example:
|
| /external/lz4/examples/ |
| D | streaming_api_basics.md | 24 Streaming API does same thing but (de)compress multiple adjacent contiguous memory block.
86 Usually, "Dependent memory" is previous adjacent contiguous memory up to 64KiBytes.
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | IntervalMap.h | 148 static inline bool adjacent(const T &a, const T &b) { in adjacent() function
614 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) { in insertFrom()
617 if (i != Size && value(i) == y && Traits::adjacent(b, start(i))) { in insertFrom()
639 if (value(i) == y && Traits::adjacent(b, start(i))) { in insertFrom()
1599 Traits::adjacent(Node.stop(i-1), Start); in canCoalesceLeft()
1604 return Node.value(i-1) == Value && Traits::adjacent(Node.stop(i-1), Start); in canCoalesceLeft()
1608 return Node.value(i) == Value && Traits::adjacent(Node.stop(i), Start); in canCoalesceLeft()
1628 return Node.value(i) == Value && Traits::adjacent(Stop, Node.start(i)); in canCoalesceRight()
1633 return Node.value(i) == Value && Traits::adjacent(Stop, Node.start(i)); in canCoalesceRight()
1636 return Node.value(0) == Value && Traits::adjacent(Stop, Node.start(0)); in canCoalesceRight()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/ARM/ |
| D | noopt-dmb-v7.ll | 1 ; Ensure that adjacent duplicated barriers are not removed at -O0.
|
| /external/llvm/test/CodeGen/ARM/ |
| D | noopt-dmb-v7.ll | 1 ; Ensure that adjacent duplicated barriers are not removed at -O0.
|
| /external/markdown/tests/misc/ |
| D | benchmark.dat | 3 adjacent-headers:0.020000:0.000000
|
| /external/owasp/sanitizer/empiricism/ |
| D | html-containment.js | 300 function breadthFirstSearch(start, isEnd, eq, adjacent) { argument
312 var adjacentNodes = adjacent(candidate.node);
|
| /external/llvm/test/CodeGen/X86/ |
| D | win64_call_epi.ll | 55 ; Check nop is not emitted when call is not adjacent to epilogue.
|
| /external/antlr/tool/src/main/java/org/antlr/misc/ |
| D | Interval.java | 102 public boolean adjacent(Interval other) { in adjacent() method in Interval
|
| D | IntervalSet.java | 113 if ( addition.adjacent(r) || !addition.disjoint(r) ) { in add()
121 if ( !bigger.adjacent(next) && bigger.disjoint(next) ) { in add()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/ |
| D | win64_call_epi.ll | 55 ; Check nop is not emitted when call is not adjacent to epilogue.
|
| /external/libvpx/libvpx/vp8/common/x86/ |
| D | mfqe_sse2.asm | 224 ; phaddd only operates on adjacent double words.
243 ; phaddw could be used to sum adjacent values but we want
|
| /external/libvpx/libvpx/vp9/common/x86/ |
| D | vp9_mfqe_sse2.asm | 225 ; phaddd only operates on adjacent double words.
244 ; phaddw could be used to sum adjacent values but we want
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/Thumb2/ |
| D | frame-pointer.ll | 39 ; must use two push/pop instructions to ensure that fp and sp are adjacent on
109 ; push into two, to ensure that r7 and sp are adjacent on the stack.
|
| /external/tensorflow/tensorflow/examples/wav_to_spectrogram/ |
| D | README.md | 32 frequencies is, and how widely adjacent windows are spaced.
|
| /external/python/setuptools/pkg_resources/_vendor/packaging/ |
| D | requirements.py | 52 joinString=",", adjacent=False)("_raw_spec")
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/MC/X86/AlignedBundling/ |
| D | labeloffset.s | 40 # and for 2 adjacent labels that both point to the correct instruction
|
| /external/python/setuptools/setuptools/_vendor/packaging/ |
| D | requirements.py | 52 joinString=",", adjacent=False)("_raw_spec")
|