Searched defs:neighbor (Results 1 - 7 of 7) sorted by relevance

/external/oprofile/opjitconv/
H A Dopjitconv.h82 struct list_head neighbor; member in struct:pathname
/external/javassist/src/main/javassist/bytecode/stackmap/
H A DTypeData.java33 public abstract void merge(TypeData neighbor); argument
85 public void merge(TypeData neighbor) {} argument
137 public void merge(TypeData neighbor) { argument
138 if (this == neighbor)
141 if (!(neighbor instanceof TypeName))
142 return; // neighbor might be UninitData
144 TypeName neighbor2 = (TypeName)neighbor;
453 public void merge(TypeData neighbor) {} argument
/external/tcpdump/
H A Dprint-olsr.c160 u_int8_t neighbor[4]; member in struct:olsr_lq_neighbor4
167 u_int8_t neighbor[16]; member in struct:olsr_lq_neighbor6
182 * print a neighbor list with LQ extensions.
193 printf("\n\t neighbor %s, link-quality %.2lf%%"
194 ", neighbor-link-quality %.2lf%%",
195 ipaddr_string(lq_neighbor->neighbor),
214 printf("\n\t neighbor %s, link-quality %.2lf%%"
215 ", neighbor-link-quality %.2lf%%",
216 ip6addr_string(lq_neighbor->neighbor),
227 * print a neighbor lis
232 int neighbor; local
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/decoder/
H A Derror_concealment.c416 static void assign_neighbor(EC_BLOCK *neighbor, MODE_INFO *mi, int block_idx) argument
419 neighbor->ref_frame = mi->mbmi.ref_frame;
420 neighbor->mv = mi->bmi[block_idx].mv.as_mv;
426 * The neighbors are enumerated with the upper-left neighbor as the first
427 * element, the second element refers to the neighbor to right of the previous
428 * neighbor, and so on. The last element refers to the neighbor below the first
429 * neighbor.
503 * neighbor and going to the right.
/external/libvpx/libvpx/vp8/decoder/
H A Derror_concealment.c418 static void assign_neighbor(EC_BLOCK *neighbor, MODE_INFO *mi, int block_idx) argument
421 neighbor->ref_frame = mi->mbmi.ref_frame;
422 neighbor->mv = mi->bmi[block_idx].mv.as_mv;
428 * The neighbors are enumerated with the upper-left neighbor as the first
429 * element, the second element refers to the neighbor to right of the previous
430 * neighbor, and so on. The last element refers to the neighbor below the first
431 * neighbor.
505 * neighbor and going to the right.
/external/opencv/cv/src/
H A Dcvcalibinit.cpp103 int count; // Number of neighbor corners
118 // neighbors and corners are synced, i.e., neighbor 0 shares corner 0
490 // of the neighbor corners in the same row/column.
597 CvCBQuad *neighbor = q->neighbors[i]; local
611 if (neighbor && neighbor->ordered == false && neighbor->count == 4)
614 icvOrderQuad(neighbor, q->corners[i], (i+2)%4); // set in order
615 neighbor->ordered = true;
616 neighbor
707 CvCBQuad *neighbor = quads[i]->neighbors[j]; local
1166 CvCBQuad *neighbor = q->neighbors[i]; local
[all...]
/external/robolectric/lib/main/
H A Djavassist-3.14.0-GA.jarMETA-INF/ META-INF/MANIFEST.MF javassist/ javassist/bytecode/ javassist/bytecode/analysis/ javassist/bytecode/annotation/ javassist/ ...

Completed in 256 milliseconds