| /external/turbine/java/com/google/turbine/types/ |
| Canonicalize.java | 186 ClassTy curr = base; local
188 while (curr != null) {
189 for (ClassTy.SimpleClassTy s : curr.classes) {
192 if (curr.sym().equals(owner)) {
193 for (ClassTy.SimpleClassTy s : curr.classes) {
198 curr = canon(env, curr.sym(), env.get(curr.sym()).superClassType());
|
| /frameworks/ex/framesequence/jni/ |
| FrameSequence_webp.cpp | 57 WebPIterator curr; local
60 int ok = WebPDemuxGetFrame(mDemux, 1, &curr);
64 prev = curr;
65 ok = WebPDemuxGetFrame(mDemux, i + 1, &curr); // Get ith frame.
68 if ((!curr.has_alpha || curr.blend_method == WEBP_MUX_NO_BLEND) &&
69 isFullFrame(curr, canvasWidth, canvasHeight)) {
77 WebPDemuxReleaseIterator(&curr);
335 // We swap the prev/curr buffers as we go.
345 ALOGD(" prev = %p, curr = %p, out = %p, tmp = %p"
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/ruby/ |
| rubyiterators.swg | 322 ConstIterator_T(const_iter curr, VALUE seq = Qnil)
323 : ConstIterator(seq), current(curr)
412 Iterator_T(nonconst_iter curr, VALUE seq = Qnil)
413 : Iterator(seq), current(curr)
518 ConstIteratorOpen_T(const_iter curr, VALUE seq = Qnil)
519 : ConstIterator_T<OutConstIterator>(curr, seq)
552 IteratorOpen_T(nonconst_iter curr, VALUE seq = Qnil)
553 : Iterator_T<InOutIterator>(curr, seq)
600 ConstIteratorClosed_T(const_iter curr, const_iter first,
602 : ConstIterator_T<OutConstIterator>(curr, seq), begin(first), end(last
[all...] |
| std_set.i | 53 SetIteratorOpen_T(nonconst_iter curr, VALUE seq = Qnil)
54 : Iterator_T<InOutIterator>(curr, seq)
100 SetIteratorClosed_T(nonconst_iter curr, nonconst_iter first,
102 : Iterator_T<InOutIterator>(curr, seq), begin(first), end(last)
|
| /tools/apkzlib/src/main/java/com/android/tools/build/apkzlib/zip/ |
| FileUseMap.java | 403 for (FileUseMapEntry<?> curr : matches) {
407 if (!curr.isFree()) {
419 extraSize = (align - ((curr.getStart() + alignOffset) % align)) % align;
437 if (curr.getSize() < (size + extraSize)) {
446 long emptySpaceLeft = curr.getSize() - (size + extraSize);
448 FileUseMapEntry<?> next = map.higher(curr);
458 if (best != null && best.getSize() < curr.getSize()) {
462 best = curr;
|
| /external/opencv/cvaux/src/ |
| cvscanlines.cpp | 184 int curr; local
186 curr = 0;
191 x1 = scanlines[curr++];
192 y1 = scanlines[curr++];
193 x2 = scanlines[curr++];
194 y2 = scanlines[curr++];
214 int curr; local
218 curr = 0;
223 x1 = (int) (scanlines_1[curr] * alpha + scanlines_2[curr] * (1.0 - alpha))
338 int curr; local
[all...] |
| /system/bt/service/ |
| gatt_server.cc | 303 const btgatt_db_element_t& curr = svc[i]; local
305 << " handle: " << curr.attribute_handle;
306 if (curr.type == BTGATT_DB_CHARACTERISTIC) {
307 service.characteristics().push_back({curr.attribute_handle,
308 Uuid(curr.uuid),
309 curr.properties,
310 curr.permissions,
312 } else if (curr.type == BTGATT_DB_DESCRIPTOR) {
314 {curr.attribute_handle, Uuid(curr.uuid), curr.permissions})
[all...] |
| /external/mksh/src/ |
| jobs.c | 1831 Job **prev, *curr; local
1873 Job **prev, *curr; local
[all...] |
| /external/e2fsprogs/resize/ |
| extent.c | 86 __u64 curr; local
98 curr = extent->num;
99 ent = extent->list + curr;
100 if (curr) {
|
| /external/selinux/libsepol/cil/src/ |
| cil_list.h | 58 struct cil_list_item *cil_list_insert(struct cil_list *list, struct cil_list_item *curr, enum cil_flavor flavor, void *data);
|
| cil_verify.c | 349 struct cil_list_item *curr; local
356 cil_list_for_each(curr, list) {
358 if (curr->flavor == CIL_LIST) {
359 range = ((struct cil_list*)curr->data)->head;
508 struct cil_list_item *curr; local
512 cil_list_for_each(curr, db->sensitivityorder) {
513 if (curr->data == low) {
517 if ((found == CIL_TRUE) && (curr->data == high)) {
522 if (found != CIL_TRUE || curr == NULL) {
743 struct cil_list_item *curr; local
1548 struct cil_list_item *curr; local
[all...] |
| /hardware/ril/libril/ |
| RilSapSocket.h | 49 MsgHeader* curr; member in struct:RilSapSocket::SapSocketRequest
|
| /external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
| pb_bufmgr_debug.c | 344 struct list_head *curr, *next; local
347 curr = mgr->list.next;
348 next = curr->next;
349 while(curr != &mgr->list) {
350 buf = LIST_ENTRY(struct pb_debug_buffer, curr, head);
356 curr = next;
357 next = curr->next;
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| collections.py | 77 curr = root[NEXT]
78 while curr is not root:
79 yield curr[KEY]
80 curr = curr[NEXT]
87 curr = root[PREV]
88 while curr is not root:
89 yield curr[KEY]
90 curr = curr[PREV]
[all...] |
| /external/valgrind/memcheck/tests/ |
| unit_oset.c | 199 UWord curr = *pv; local
200 assert(prev < curr);
201 prev = curr;
371 UWord curr = v; local
373 assert(prev == curr);
375 assert(prev < curr);
376 prev = curr;
543 Block curr = *pv; local
544 assert(prev.last < curr.first);
545 prev = curr;
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| collections.py | 77 curr = root[1] # start at the first node
78 while curr is not root:
79 yield curr[2] # yield the curr[KEY]
80 curr = curr[1] # move to next node
86 curr = root[0] # start at the last node
87 while curr is not root:
88 yield curr[2] # yield the curr[KEY
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| collections.py | 77 curr = root[1] # start at the first node
78 while curr is not root:
79 yield curr[2] # yield the curr[KEY]
80 curr = curr[1] # move to next node
86 curr = root[0] # start at the last node
87 while curr is not root:
88 yield curr[2] # yield the curr[KEY
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| collections.py | 77 curr = root[1] # start at the first node
78 while curr is not root:
79 yield curr[2] # yield the curr[KEY]
80 curr = curr[1] # move to next node
86 curr = root[0] # start at the last node
87 while curr is not root:
88 yield curr[2] # yield the curr[KEY
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| collections.py | 77 curr = root[1] # start at the first node
78 while curr is not root:
79 yield curr[2] # yield the curr[KEY]
80 curr = curr[1] # move to next node
86 curr = root[0] # start at the last node
87 while curr is not root:
88 yield curr[2] # yield the curr[KEY
[all...] |
| /system/core/libutils/ |
| VectorImpl.cpp | 184 void* curr = reinterpret_cast<char*>(array) + mItemSize*(i-1); local
185 if (cmp(curr, item, state) > 0) {
194 curr = reinterpret_cast<char*>(array) + mItemSize*(i-1);
205 _do_copy(next, curr, 1);
206 next = curr;
208 curr = NULL;
210 curr = reinterpret_cast<char*>(array) + mItemSize*(j);
212 } while (j>=0 && (cmp(curr, temp, state) > 0));
607 const void* const curr = reinterpret_cast<const char *>(a) + (mid*s);
608 const int c = do_compare(curr, item)
[all...] |
| /external/skia/include/private/ |
| SkTDArray.h | 339 for (T* curr = this->begin(); curr < stop; curr++) {
340 if (*curr) {
341 visitor(*curr);
|
| /external/skia/src/views/ |
| SkTouchGesture.cpp | 197 const float curr = SkScalarToFloat(fGlobalM[0]); local
199 if (scale > 1 && curr * scale > MAX_ZOOM_SCALE) {
200 scale = MAX_ZOOM_SCALE / curr;
201 } else if (scale < 1 && curr * scale < MIN_ZOOM_SCALE) {
202 scale = MIN_ZOOM_SCALE / curr;
|
| /external/skqp/include/private/ |
| SkTDArray.h | 339 for (T* curr = this->begin(); curr < stop; curr++) {
340 if (*curr) {
341 visitor(*curr);
|
| /external/skqp/src/views/ |
| SkTouchGesture.cpp | 197 const float curr = SkScalarToFloat(fGlobalM[0]); local
199 if (scale > 1 && curr * scale > MAX_ZOOM_SCALE) {
200 scale = MAX_ZOOM_SCALE / curr;
201 } else if (scale < 1 && curr * scale < MIN_ZOOM_SCALE) {
202 scale = MIN_ZOOM_SCALE / curr;
|
| /frameworks/av/media/libnblog/ |
| PerformanceAnalysis.cpp | 356 PerformanceAnalysis& curr = hash.second; local
358 curr.reportPerformance(&body, thread.first, hash.first);
364 writeToFile(curr.mHists, curr.mOutlierData, curr.mPeakTimestamps,
|
