/external/libvpx/libvpx/vp8/decoder/ |
D | error_concealment.c | 49 if (pbi->overlaps != NULL) in vp8_alloc_overlap_lists() 51 vpx_free(pbi->overlaps); in vp8_alloc_overlap_lists() 52 pbi->overlaps = NULL; in vp8_alloc_overlap_lists() 55 pbi->overlaps = vpx_calloc(pbi->common.mb_rows * pbi->common.mb_cols, in vp8_alloc_overlap_lists() 58 if (pbi->overlaps == NULL) in vp8_alloc_overlap_lists() 66 vpx_free(pbi->overlaps); in vp8_de_alloc_overlap_lists() 67 pbi->overlaps = NULL; in vp8_de_alloc_overlap_lists() 71 static void assign_overlap(OVERLAP_NODE* overlaps, in assign_overlap() argument 82 if (overlaps[i].bmi == NULL) in assign_overlap() 84 overlaps[i].bmi = bmi; in assign_overlap() [all …]
|
D | ec_types.h | 31 OVERLAP_NODE overlaps[MAX_OVERLAPS]; member 39 B_OVERLAP overlaps[16]; member
|
D | onyxd_int.h | 92 MB_OVERLAP *overlaps; member
|
D | onyxd_if.c | 83 pbi->overlaps = NULL; in vp8dx_create_decompressor()
|
/external/apache-harmony/nio/src/test/java/common/org/apache/harmony/nio/tests/java/nio/channels/ |
D | FileLockTest.java | 149 assertTrue(mockLock.overlaps(0, 11)); in test_overlaps_JJ() 150 assertFalse(mockLock.overlaps(0, 10)); in test_overlaps_JJ() 151 assertTrue(mockLock.overlaps(100, 110)); in test_overlaps_JJ() 152 assertTrue(mockLock.overlaps(99, 110)); in test_overlaps_JJ() 153 assertFalse(mockLock.overlaps(-1, 10)); in test_overlaps_JJ() 155 assertTrue(mockLock.overlaps(1, 120)); in test_overlaps_JJ() 156 assertTrue(mockLock.overlaps(20, 50)); in test_overlaps_JJ()
|
/external/webkit/Source/WebCore/platform/graphics/gpu/ |
D | PODInterval.h | 105 bool overlaps(const T& low, const T& high) const in overlaps() function 114 bool overlaps(const PODInterval& other) const in overlaps() function 116 return overlaps(other.low(), other.high()); in overlaps()
|
D | LoopBlinnPathProcessor.cpp | 781 … Vector<IntervalType> overlaps = tree.allOverlaps(tree.createInterval(seg->getPoint(0).y(), in determineSidesToFill() local 786 if (overlaps.size() != slowOverlaps.size()) { in determineSidesToFill() 789 for (size_t i = 0; i < overlaps.size(); i++) in determineSidesToFill() 790 LOG_ERROR(" %d: %s", i+1, overlaps[i].data()->toString().ascii().data()); in determineSidesToFill() 797 ASSERT(overlaps.size() == slowOverlaps.size()); in determineSidesToFill() 799 … for (Vector<IntervalType>::iterator iter = overlaps.begin(); iter != overlaps.end(); ++iter) { in determineSidesToFill() 972 Vector<SweepInterval> overlaps; in subdivideCurves() local 1021 overlaps.clear(); in subdivideCurves() 1022 tree.allOverlaps(event.interval(), overlaps); in subdivideCurves() 1024 … for (Vector<SweepInterval>::iterator iter = overlaps.begin(); iter != overlaps.end(); ++iter) { in subdivideCurves()
|
D | PODIntervalTree.h | 132 if (node->data().overlaps(interval)) in searchForOverlapsFrom()
|
/external/webkit/Source/WebKit/android/jni/ |
D | PicturePile.cpp | 214 Vector<int> overlaps; in applyWebkitInvals() local 228 overlaps.append(i); in applyWebkitInvals() 230 overlaps.append(i); in applyWebkitInvals() 233 if (overlaps.size() >= MAX_OVERLAP_COUNT) { in applyWebkitInvals() 236 for (int i = (int) overlaps.size() - 1; i >= 0; i--) { in applyWebkitInvals() 237 overlap.unite(m_pile[overlaps[i]].area); in applyWebkitInvals() 238 m_pile.remove(overlaps[i]); in applyWebkitInvals()
|
/external/webkit/Source/WebKit/chromium/tests/ |
D | PODIntervalTreeTest.cpp | 161 …Vector<PODInterval<float, UserData1> > overlaps = tree.allOverlaps(tree.createInterval(3, 5, data1… in TEST() local 162 EXPECT_EQ(1U, overlaps.size()); in TEST() 163 EXPECT_EQ(5, overlaps[0].data().a); in TEST() 164 EXPECT_EQ(6, overlaps[0].data().b); in TEST()
|
/external/llvm/include/llvm/CodeGen/ |
D | LiveInterval.h | 351 bool overlaps(const LiveInterval& other) const { 362 bool overlaps(const LiveInterval &Other, const CoalescerPair &CP, 367 bool overlaps(SlotIndex Start, SlotIndex End) const;
|
D | ScheduleDAG.h | 131 bool overlaps(const SDep &Other) const { in overlaps() function 145 return overlaps(Other)
|
/external/llvm/lib/CodeGen/ |
D | LiveRegMatrix.cpp | 123 if (VirtReg.overlaps(LIS->getRegUnit(*Units), CP, *LIS->getSlotIndexes())) in checkRegUnitInterference()
|
D | RegAllocPBQP.cpp | 237 if (vregLI->overlaps(LIS->getRegUnit(*Units))) { in build() 275 if (l1.overlaps(l2)) { in build()
|
D | StackSlotColoring.cpp | 203 if (OtherLI->overlaps(*li)) in OverlapWithAssignments()
|
D | LiveInterval.cpp | 139 bool LiveInterval::overlaps(const LiveInterval &Other, in overlaps() function in LiveInterval 183 bool LiveInterval::overlaps(SlotIndex Start, SlotIndex End) const { in overlaps() function in LiveInterval
|
D | ScheduleDAG.cpp | 73 if (I->overlaps(D)) { in addPred()
|
D | StackColoring.cpp | 762 if (!First->overlaps(*Second)) { in runOnMachineFunction()
|
D | RegisterCoalescer.cpp | 1131 if (RHS.overlaps(LIS->getRegUnit(*UI))) { in joinReservedPhysReg()
|
/external/chromium/chrome/browser/ui/cocoa/infobars/ |
D | infobar_gradient_view.mm | 93 // This view is intentionally not opaque because it overlaps with the findbar.
|
/external/chromium/chrome/browser/ui/cocoa/ |
D | hover_button.mm | 67 // If you have a separate window that overlaps the close button, and you
|
/external/valgrind/main/coregrind/ |
D | m_transtab.c | 1688 Bool overlaps ( Addr64 start, ULong range, VexGuestExtents* vge ) in overlaps() function 1783 if (overlaps( guest_start, range, &tte->vge )) { in delete_translations_in_sector_eclass() 1807 && overlaps( guest_start, range, &sec->tt[i].vge )) { in delete_translations_in_sector() 1929 vg_assert(!overlaps( guest_start, range, &tte->vge )); in VG_() 2094 && overlaps( guest_start, range, &unredir_tt[i].vge)) in unredir_discard_translations()
|
/external/valgrind/main/ |
D | glibc-2.34567-NPTL-helgrind.supp | 2 # FIXME 22 Jan 09: helgrind-glibc2X-005 overlaps with a lot of
|
/external/antlr/antlr-3.4/runtime/C/ |
D | ChangeLog | 228 fact that the string factory can be in a situation where overlaps occur. We now 538 fact that the string factory can be in a situation where overlaps occur. We now
|
/external/grub/docs/ |
D | internals.texi | 32 mutual-exclusively, sometimes a memory area overlaps with another
|