Searched refs:overlaps (Results 1 - 25 of 25) sorted by relevance

/external/libvpx/libvpx/vp8/decoder/
H A Dec_types.h18 /* The area (pixel area in Q6) the block pointed to by bmi overlaps
31 OVERLAP_NODE overlaps[MAX_OVERLAPS]; member in struct:__anon9015
34 /* Structure used to hold all the overlaps of a macroblock. The overlaps of a
35 * macroblock is further divided into block overlaps.
39 B_OVERLAP overlaps[16]; member in struct:__anon9016
H A Derror_concealment.c49 if (pbi->overlaps != NULL)
51 vpx_free(pbi->overlaps);
52 pbi->overlaps = NULL;
55 pbi->overlaps = vpx_calloc(pbi->common.mb_rows * pbi->common.mb_cols,
58 if (pbi->overlaps == NULL)
66 vpx_free(pbi->overlaps);
67 pbi->overlaps = NULL;
70 /* Inserts a new overlap area value to the list of overlaps of a block */
71 static void assign_overlap(OVERLAP_NODE* overlaps, argument
78 /* Find and assign to the next empty overlap node in the list of overlaps
249 estimate_mv(const OVERLAP_NODE *overlaps, union b_mode_info *bmi) argument
328 calc_prev_mb_overlaps(MB_OVERLAP *overlaps, MODE_INFO *prev_mi, int mb_row, int mb_col, int mb_rows, int mb_cols) argument
349 estimate_missing_mvs(MB_OVERLAP *overlaps, MODE_INFO *mi, MODE_INFO *prev_mi, int mb_rows, int mb_cols, unsigned int first_corrupt) argument
[all...]
H A Donyxd_int.h92 MB_OVERLAP *overlaps; member in struct:VP8D_COMP
H A Donyxd_if.c83 pbi->overlaps = NULL;
/external/apache-harmony/nio/src/test/java/common/org/apache/harmony/nio/tests/java/nio/channels/
H A DFileLockTest.java146 * @tests java.nio.channels.FileLock#overlaps(long, long)
149 assertTrue(mockLock.overlaps(0, 11));
150 assertFalse(mockLock.overlaps(0, 10));
151 assertTrue(mockLock.overlaps(100, 110));
152 assertTrue(mockLock.overlaps(99, 110));
153 assertFalse(mockLock.overlaps(-1, 10));
155 assertTrue(mockLock.overlaps(1, 120));
156 assertTrue(mockLock.overlaps(20, 50));
/external/webkit/Source/WebCore/platform/graphics/gpu/
H A DPODInterval.h105 bool overlaps(const T& low, const T& high) const function in class:WebCore::PODInterval
114 bool overlaps(const PODInterval& other) const function in class:WebCore::PODInterval
116 return overlaps(other.low(), other.high());
H A DLoopBlinnPathProcessor.cpp544 // Run plane-sweep algorithm to determine overlaps of control point
781 Vector<IntervalType> overlaps = tree.allOverlaps(tree.createInterval(seg->getPoint(0).y(), local
786 if (overlaps.size() != slowOverlaps.size()) {
788 LOG_ERROR(" overlaps:");
789 for (size_t i = 0; i < overlaps.size(); i++)
790 LOG_ERROR(" %d: %s", i+1, overlaps[i].data()->toString().ascii().data());
797 ASSERT(overlaps.size() == slowOverlaps.size());
799 for (Vector<IntervalType>::iterator iter = overlaps.begin(); iter != overlaps.end(); ++iter) {
817 break; // Abort iteration over overlaps
972 Vector<SweepInterval> overlaps; local
[all...]
H A DPODIntervalTree.h112 // Starting from the given node, adds all overlaps with the given
132 if (node->data().overlaps(interval))
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Dutil.rb164 def overlaps?( range )
169 not overlaps?( range )
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/token-rewrite/
H A Dbasic.rb234 error.to_s.should == %q<operation (replace @ 1..2 : "foo") overlaps with previous operation (replace @ 0..3 : "bar")>
245 error.to_s.should == %q<operation (insert-before @ 4 : "y") overlaps with previous operation (replace @ 2..4 : "x")>
256 error.to_s.should == %q<operation (replace @ 3..5 : "foo") overlaps with previous operation (replace @ 2..4 : "xyz")>
267 error.to_s.should == %q<operation (replace @ 1..3 : "foo") overlaps with previous operation (replace @ 2..4 : "xyz")>
/external/webkit/Source/WebKit/android/jni/
H A DPicturePile.cpp213 // Find the overlaps
214 Vector<int> overlaps;
228 overlaps.append(i);
230 overlaps.append(i);
233 if (overlaps.size() >= MAX_OVERLAP_COUNT) {
236 for (int i = (int) overlaps.size() - 1; i >= 0; i--) {
237 overlap.unite(m_pile[overlaps[i]].area);
238 m_pile.remove(overlaps[i]);
/external/webkit/Source/WebKit/chromium/tests/
H A DPODIntervalTreeTest.cpp161 Vector<PODInterval<float, UserData1> > overlaps = tree.allOverlaps(tree.createInterval(3, 5, data1)); local
162 EXPECT_EQ(1U, overlaps.size());
163 EXPECT_EQ(5, overlaps[0].data().a);
164 EXPECT_EQ(6, overlaps[0].data().b);
/external/llvm/include/llvm/CodeGen/
H A DLiveInterval.h349 /// overlaps - Return true if the intersection of the two live intervals is
351 bool overlaps(const LiveInterval& other) const {
357 /// overlaps - Return true if the two intervals have overlapping segments
362 bool overlaps(const LiveInterval &Other, const CoalescerPair &CP,
365 /// overlaps - Return true if the live interval overlaps a range specified
367 bool overlaps(SlotIndex Start, SlotIndex End) const;
H A DScheduleDAG.h131 bool overlaps(const SDep &Other) const { function in class:llvm::SDep
145 return overlaps(Other)
/external/llvm/lib/CodeGen/
H A DLiveRegMatrix.cpp123 if (VirtReg.overlaps(LIS->getRegUnit(*Units), CP, *LIS->getSlotIndexes()))
H A DRegAllocPBQP.cpp217 // Record any overlaps with regmask operands.
234 // vregLI overlaps fixed regunit interference.
237 if (vregLI->overlaps(LIS->getRegUnit(*Units))) {
275 if (l1.overlaps(l2)) {
H A DStackSlotColoring.cpp196 /// OverlapWithAssignments - Return true if LiveInterval overlaps with any
203 if (OtherLI->overlaps(*li))
H A DLiveInterval.cpp80 // overlaps - Return true if the intersection of the two live intervals is
83 // An example for overlaps():
95 // A->overlaps(C) should return false since we want to be able to join
139 bool LiveInterval::overlaps(const LiveInterval &Other, function in class:LiveInterval
168 // Advance the iterator that ends first to check for more overlaps.
181 /// overlaps - Return true if the live interval overlaps a range specified
183 bool LiveInterval::overlaps(SlotIndex Start, SlotIndex End) const { function in class:LiveInterval
H A DScheduleDAG.cpp73 if (I->overlaps(D)) {
H A DStackColoring.cpp762 if (!First->overlaps(*Second)) {
H A DRegisterCoalescer.cpp661 // If ALR and BLR overlaps and end of BLR extends beyond end of ALR, e.g.
1131 if (RHS.overlaps(LIS->getRegUnit(*UI))) {
1178 // and can be merged into the value it overlaps. Like a coalescable copy, it
1196 // The live range of %src overlaps the %dst value defined by FOO, but
1283 // Value in the other live range that overlaps this def, if any.
1454 // Find the value in Other that overlaps VNI->def, if any.
/external/valgrind/main/coregrind/
H A Dm_transtab.c1688 Bool overlaps ( Addr64 start, ULong range, VexGuestExtents* vge ) function
1783 if (overlaps( guest_start, range, &tte->vge )) {
1807 && overlaps( guest_start, range, &sec->tt[i].vge )) {
1929 vg_assert(!overlaps( guest_start, range, &tte->vge ));
2094 && overlaps( guest_start, range, &unredir_tt[i].vge))
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/streams/
H A Drewrite.rb230 elsif location.overlaps?( prior_location )
314 message = 'operation %p overlaps with previous operation %p' % [ current, previous ]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.text_3.5.0.v20100601-1300.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
/external/robolectric/lib/main/
H A Dsqlite-jdbc-3.7.2.jarMETA-INF/ META-INF/MANIFEST.MF META-INF/maven/ META-INF/maven/org. ...

Completed in 1053 milliseconds