| /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/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 | show.c | 127 int first; local
131 first = 1;
133 if (! first)
136 first = 0;
139 if (! first)
159 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
|
| /system/core/libsysutils/src/ |
| H A D | NetlinkEvent.cpp | 168 int first = 1; local
178 if (first) {
187 first = 0;
|
| /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/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/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/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...] |
| /system/core/debuggerd/ |
| H A D | tombstone.c | 256 size_t first, last; local
261 first = i;
272 // Dump a few words before the first frame.
274 uintptr_t sp = backtrace[first].stack_top - STACK_WORDS * sizeof(uint32_t);
278 // Only log the first 3 frames, put the rest in the tombstone.
279 for (size_t i = first; i <= last; i++) {
285 if (i - first == 3) {
449 bool first = true; local
503 if (first) {
506 first
[all...] |
| /system/extras/ext4_utils/ |
| H A D | allocate.c | 26 struct region *first; member in struct:region_list
64 alloc->list.first = NULL;
66 alloc->oob_list.first = NULL;
83 if (list->first == reg)
84 list->first = reg->next;
95 if (list->first == NULL) {
96 list->first = reg;
123 dump_starting_from(alloc->list.first);
126 dump_starting_from(alloc->oob_list.first);
194 /* Marks a the first num_block
[all...] |