| /system/core/ |
| H A D | Android.mk | 18 include $(call first-makefiles-under,$(LOCAL_PATH))
|
| /system/core/debuggerd/ |
| H A D | tombstone.c | 301 size_t first, last; local
306 first = i;
318 // Dump a few words before the first frame.
319 uintptr_t sp = backtrace[first].stack_top - STACK_WORDS * sizeof(uint32_t);
323 // Only log the first 3 frames, put the rest in the tombstone.
324 for (size_t i = first; i <= last; i++) {
330 if (i - first == 3) {
492 bool first = true; local
546 if (first) {
549 first
[all...] |
| /system/core/gpttool/ |
| H A D | gpttool.c | 118 int add_ptn(struct ptable *ptbl, u64 first, u64 last, const char *name) argument
124 if (first < 34) {
138 entry->first_lba = first;
|
| /system/core/include/cutils/ |
| H A D | log.h | 520 #define __android_rest(first, ...) , ## __VA_ARGS__
|
| /system/core/include/sysutils/ |
| H A D | List.h | 190 * Return the first element or one past the last element. The
223 void insert(iterator posn, const_iterator first, const_iterator last) { argument
224 for ( ; first != last; ++first)
225 insert(posn, *first);
239 iterator erase(iterator first, iterator last) { argument
240 while (first != last)
241 erase(first++); // don't erase than incr later!
260 * Measure the distance between two iterators. On exist, "first"
275 _ListIterator<U, CL> first, _ListIterato
274 distance( _ListIterator<U, CL> first, _ListIterator<U, CR> last) const argument
[all...] |
| /system/core/libcutils/tests/memset_mips/ |
| H A D | memset_omips.S | 54 SWHI a1, 0(a0) # Yes, handle first unaligned part
|
| /system/core/libsysutils/src/ |
| H A D | NetlinkEvent.cpp | 168 int first = 1; local
178 if (first) {
187 first = 0;
|
| /system/core/sh/ |
| H A D | cd.c | 156 int first; local
174 first = 1;
178 if (! first)
180 first = 0;
343 static int first = 1; local
348 if (first) {
349 first = 0;
|
| H A D | histedit.c | 227 int first, last, direction; local
334 * determine [first] and [last]
356 first = str_to_event(firststr, 0);
361 last = first;
362 first = i;
369 direction = first < last ? H_PREV : H_NEXT;
395 retval = history(hist, &he, H_NEXT_EVENT, first);
507 * the notion of first and last is
|
| H A D | show.c | 127 int first; local
131 first = 1;
133 if (! first)
136 first = 0;
139 if (! first)
159 first = 0;
|
| /system/core/toolbox/grep/ |
| H A D | util.c | 58 static bool first, first_global = true; variable
228 for (first = true, c = 0; c == 0 || !(lflag || qflag); ) {
367 (first || since_printed > Bflag))
377 first = false;
|
| /system/extras/ext4_utils/ |
| H A D | allocate.c | 27 struct region *first; member in struct:region_list
72 alloc->list.first = NULL;
74 alloc->oob_list.first = NULL;
110 if (list->first == reg)
111 list->first = reg->next;
122 if (list->first == NULL) {
123 list->first = reg;
150 dump_starting_from(alloc->list.first);
153 dump_starting_from(alloc->oob_list.first);
206 /* Marks a the first num_block
[all...] |
| H A D | contents.c | 298 * which name comes first. For example, "selinux" would come before "yelinux".
362 struct ext4_xattr_entry *first,
372 size_t available_size = xattr_free_space(first, block_end);
378 struct ext4_xattr_entry *new_entry = xattr_get_last(first);
394 xattr_assert_sane(first);
402 struct ext4_xattr_entry *first = (struct ext4_xattr_entry *) (hdr + 1); local
406 xattr_addto_range(first, block_end, first, name_index, name, value, value_len);
424 struct ext4_xattr_entry *first = (struct ext4_xattr_entry *) (header + 1); local
428 xattr_addto_range(header, block_end, first, name_inde
359 xattr_addto_range( void *block_start, void *block_end, struct ext4_xattr_entry *first, int name_index, const char *name, const void *value, size_t value_len) argument
[all...] |
| /system/extras/tests/bionic/libc/bionic/ |
| H A D | lib_relocs.c | 6 struct foo { int first, second; }; member in struct:foo
9 int* FooPtr[] = { &Foo.first, &Foo.second };
|
| /system/extras/tests/include/ |
| H A D | testUtil.h | 32 struct timespec tsDelta(const struct timespec *first,
34 struct timeval tvDelta(const struct timeval *first,
|
| /system/extras/tests/lib/testUtil/ |
| H A D | testUtil.c | 101 // second, is later than the time pointed to by first.
102 struct timespec tsDelta(const struct timespec *first, argument
107 assert(first != NULL);
109 assert(first->tv_nsec >= 0 && first->tv_nsec < nSecsPerSec);
111 rv.tv_sec = second->tv_sec - first->tv_sec;
112 if (second->tv_nsec >= first->tv_nsec) {
113 rv.tv_nsec = second->tv_nsec - first->tv_nsec;
115 rv.tv_nsec = (second->tv_nsec + nSecsPerSec) - first->tv_nsec;
124 // second, is later than the time pointed to by first
125 tvDelta(const struct timeval *first, const struct timeval *second) argument
[all...] |
| /system/media/camera/docs/ |
| H A D | html.mako | 37 /* hide the first thead, we need it there only to enforce column sizes */
135 </thead> <!-- so that the first occurrence of thead is not
136 above the first occurrence of tr -->
|
| /system/netd/ |
| H A D | List.h | 190 * Return the first element or one past the last element. The
223 void insert(iterator posn, const_iterator first, const_iterator last) { argument
224 for ( ; first != last; ++first)
225 insert(posn, *first);
239 iterator erase(iterator first, iterator last) { argument
240 while (first != last)
241 erase(first++); // don't erase than incr later!
260 * Measure the distance between two iterators. On exist, "first"
275 _ListIterator<U, CL> first, _ListIterato
274 distance( _ListIterator<U, CL> first, _ListIterator<U, CR> last) const argument
[all...] |