| /system/core/logd/ |
| LogReader.cpp | 128 uint64_t last; member in class:LogFindStart
138 last(sequence),
153 me->sequence = me->last;
157 me->last = element->getSequence();
159 me->last = element->getSequence();
|
| /system/extras/ext4_utils/ |
| allocate.h | 34 struct region *last; member in struct:region_list
|
| /toolchain/binutils/binutils-2.25/bfd/ |
| elf-nacl.c | 218 /* Now swap the first and last PT_LOAD segments'
221 struct elf_segment_map *last = *last_load; local
223 first->next = last->next;
224 last->next = first;
|
| /toolchain/binutils/binutils-2.25/gas/ |
| dw2gencfi.h | 32 the last CFI wasn't properly closed by .cfi_endproc. */
109 struct cfi_insn_data **last; member in struct:fde_entry
|
| /art/runtime/base/ |
| arena_allocator.cc | 276 Arena* last = first; local
277 while (last->next_ != nullptr) {
278 last = last->next_;
282 last->next_ = free_arenas_;
|
| /art/runtime/jdwp/ |
| jdwp_main.cc | 601 * Return the time, in milliseconds, since the last debugger activity.
612 int64_t last = last_activity_time_ms_.LoadSequentiallyConsistent(); local
615 if (last == 0) {
616 VLOG(jdwp) << "+++ last=busy";
622 CHECK_GE(now, last);
624 VLOG(jdwp) << "+++ debugger interval=" << (now - last);
625 return now - last;
|
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| DalvInsnList.java | 114 DalvInsn last = get(sz - 1); local
115 return last.getNextAddress();
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| DalvInsnList.java | 114 DalvInsn last = get(sz - 1); local
115 return last.getNextAddress();
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| Dominators.java | 228 SsaBasicBlock last = wParentBucket.remove(lastItem); local
229 SsaBasicBlock U = eval(last);
231 < info[last.getIndex()].semidom) {
232 domInfos[last.getIndex()].idom = U.getIndex();
234 domInfos[last.getIndex()].idom = wInfo.parent.getIndex();
|
| /development/perftests/panorama/feature_stab/src/dbreg/ |
| dbreg.cpp | 473 ///// IF BAD, then update reference to the last correctly aligned inspection frame;
482 ///// IF GOOD, then update the last correctly aligned inspection frame to be this;
659 int i = 0, last=0; local
662 if ( last > m_cost_histogram[i] )
664 last = m_cost_histogram[i];
674 //if ( last < m_cost_histogram[i] )
676 last = m_cost_histogram[i];
|
| /development/samples/Support7Demos/src/com/example/android/supportv7/widget/ |
| RecyclerViewActivity.java | 252 int last = 0; local
263 last = i;
266 for (int i = childCount - 1; i > last; i--) {
|
| /device/google/dragon/audio/hal/ |
| iniparser.c | 77 char * last ; local
84 last = l + strlen(l);
85 while (last > l) {
86 if (!isspace((int)*(last-1)))
88 last -- ;
90 *last = (char)0;
639 int last=0 ; local
661 last=0 ;
663 while (fgets(line+last, ASCIILINESZ-last, in)!=NULL)
[all...] |
| /external/autotest/client/tests/monotonic_time/src/ |
| time_test.c | 141 uint64_t last; /* last time value */ member in struct:test_info
165 t0 = test->last; \
166 test->last = rd##_name(); \
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_addrhashmap.h | 306 uptr last = --add->size; local
307 Cell *c1 = &add->cells[last];
315 uptr last = --add->size; local
316 Cell *c1 = &add->cells[last];
|
| sanitizer_symbolizer_libcdep.cc | 245 // Parse the last :<int>, which must be there.
249 // Truncate the string at the last colon and find the next-to-last colon.
253 // If the second-to-last colon is followed by a digit, it must be the line
275 SymbolizedStack *last = res; local
292 last->next = cur;
293 last = cur;
|
| /external/curl/src/ |
| tool_paramhlp.c | 38 #include "memdebug.h" /* keep this as LAST include */
43 struct getout *last = config->url_last; local
45 /* append this new node last in the list */
46 if(last)
47 last->next = node;
51 /* move the last pointer */
373 const bool last, /* TRUE if last operation */
400 if(!i && last)
498 bool last = (config->next ? FALSE : TRUE) local
[all...] |
| /external/dbus/dbus/ |
| dbus-marshal-validate.c | 57 int last; local
92 last = DBUS_TYPE_INVALID;
148 if (last == DBUS_STRUCT_BEGIN_CHAR)
160 if (last != DBUS_TYPE_ARRAY)
251 if (last == DBUS_DICT_ENTRY_BEGIN_CHAR)
260 last = *p;
283 _dbus_assert (last != DBUS_TYPE_ARRAY);
284 _dbus_assert (last != DBUS_STRUCT_BEGIN_CHAR);
285 _dbus_assert (last != DBUS_DICT_ENTRY_BEGIN_CHAR);
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| DalvInsnList.java | 115 DalvInsn last = get(sz - 1); local
116 return last.getNextAddress();
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| Dominators.java | 228 SsaBasicBlock last = wParentBucket.remove(lastItem); local
229 SsaBasicBlock U = eval(last);
231 < info[last.getIndex()].semidom) {
232 domInfos[last.getIndex()].idom = U.getIndex();
234 domInfos[last.getIndex()].idom = wInfo.parent.getIndex();
|
| /external/e2fsprogs/lib/blkid/ |
| devname.c | 404 int which = 0, last = 0; local
428 last = which;
466 * If last was a whole disk and we just found a partition
470 if (lens[last] && !strncmp(ptnames[last], ptname, lens[last])) {
477 if (tmp->bid_devno == devs[last]) {
486 lens[last] = 0;
489 * If last was not checked because it looked like a whole-disk
491 * check last as well
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| dblist.c | 396 struct ext2_db_entry2 *last; local
406 last = dblist->list + dblist->count -1;
408 ret_entry.ino = last->ino;
409 ret_entry.blk = last->blk;
410 ret_entry.blockcnt = last->blockcnt;
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 35 Index first, last ; local
39 last = n-1;
40 if (ncut < first || ncut > last ) return 0;
45 for (Index j = first + 1; j <= last; j++) {
56 if (mid > ncut) last = mid - 1;
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 118 Index* last = perm.indices().data(); /* use P as workspace for last */ local
131 last[i] = -1;
173 if(head[d] != -1) last[head[d]] = i;
187 if(next[k] != -1) last[next[k]] = -1;
243 if(next[i] != -1) last[next[i]] = last[i];
244 if(last[i] != -1) /* remove i from degree list */
246 next[last[i]] = next[i];
344 last[i] = h; /* save hash of i in last[i] *
[all...] |
| /external/freetype/src/base/ |
| ftoutln.c | 88 FT_Int last; /* index of last point in contour */ local
93 last = outline->contours[n];
94 if ( last < 0 )
96 limit = outline->points + last;
102 v_last = outline->points[last];
120 if ( FT_CURVE_TAG( outline->tags[last] ) == FT_CURVE_TAG_ON )
122 /* start at last point if it is on the curve */
128 /* if both first and last points are conic, */
282 first = (FT_UInt)last + 1
552 FT_Int first, last; local
939 int last = outline->contours[c]; local
1066 FT_Int last = outline->contours[c]; local
[all...] |
| /external/freetype/src/gzip/ |
| infutil.h | 23 DONE, /* finished last block, done */
48 uInt last; /* true if this block is the last block */ member in struct:inflate_blocks_state
|
