| /development/tools/idegen/src/ |
| Stopwatch.java | 22 long last = System.currentTimeMillis(); field in class:Stopwatch
26 Log.info(label + ": " + (now - last) + "ms");
27 last = now;
|
| /bionic/libc/string/ |
| strtok.c | 35 static char *last; local
37 return strtok_r(s, delim, &last);
41 strtok_r(char *s, const char *delim, char **last)
48 if (s == NULL && (s = *last) == NULL)
62 *last = NULL;
80 *last = s;
|
| /external/elfcopy/ |
| debug.c | 11 int i, last; local
14 for (i = last = 0; i < len; i++) {
23 while (last < i) {
24 if (isprint(pchr[last]))
25 fputc(pchr[last], s);
28 if(pchr[last])
31 last++;
|
| /build/tools/apriori/ |
| debug.c | 9 int i, last; local
13 for (i = last = 0; i < len; i++) {
22 while (last < i) {
23 if (isprint(pchr[last]))
24 fputc(pchr[last], s);
29 last++;
|
| /build/tools/isprelinked/ |
| debug.c | 9 int i, last; local
12 for (i = last = 0; i < len; i++) {
21 while (last < i) {
22 if (isprint(pchr[last]))
23 fputc(pchr[last], s);
28 last++;
|
| /build/tools/lsd/ |
| debug.c | 10 int i, last; local
13 for (i = last = 0; i < len; i++) {
23 while (last < i) {
24 if (isprint(pchr[last]))
25 fputc(pchr[last], s);
30 last++;
|
| /development/tools/yuv420sp2rgb/ |
| debug.c | 9 int i, last; local
13 for (i = last = 0; i < len; i++) {
22 while (last < i) {
23 if (isprint(pchr[last]))
24 fputc(pchr[last], s);
29 last++;
|
| /build/tools/soslim/ |
| debug.c | 11 int i, last;
14 for (i = last = 0; i < len; i++) {
23 while (last < i) {
24 if (isprint(pchr[last]))
25 fputc(pchr[last], s);
30 last++;
|
| /external/icu4c/tools/genprops/misc/ |
| ucdmerge.c | 75 long first, last, c; local
78 first=last=-1;
96 if(last>=0 && (c!=(last+1) || !sameData(firstLine, line))) {
98 if(first==last) {
107 first, last, /* code point range */
112 first, last, /* code point range */
118 first, last, /* code point range */
123 first=last=-1;
135 if(last<0)
[all...] |
| /frameworks/base/core/java/android/content/ |
| ContentUris.java | 28 * Converts the last path segment to a long.
31 * stored in the last segment.
34 * @throws NumberFormatException if the last segment isn't a number
36 * @return the long conversion of the last segment or -1 if the path is
40 String last = contentUri.getLastPathSegment(); local
41 return last == null ? -1 : Long.parseLong(last);
|
| /external/oprofile/daemon/ |
| opd_mangling.h | 30 int opd_open_sample_file(odb_t *file, struct sfile *last,
|
| opd_mangling.c | 69 mangle_filename(struct sfile * last, struct sfile const * sf, int counter, int cg)
109 if (last->kernel) {
110 values.cg_image_name = last->kernel->name;
111 } else if (last->anon) {
113 values.cg_image_name = mangle_anon(last->anon);
114 values.anon_name = last->anon->name;
116 values.cg_image_name = find_cookie(last->cookie);
141 int opd_open_sample_file(odb_t *file, struct sfile *last,
150 mangled = mangle_filename(last, sf, counter, cg);
161 if (sf != last)
[all...] |
| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| ualgo.h | 27 /// Swaps corresponding elements of [first, last) and [result,)
31 inline ForwardIterator2 swap_ranges (ForwardIterator1 first, ForwardIterator2 last, ForwardIterator2 result)
33 for (; first != last; ++first, ++result)
38 /// Returns the first iterator i in the range [first, last) such that
39 /// *i == value. Returns last if no such iterator exists.
43 inline InputIterator find (InputIterator first, InputIterator last, const EqualityComparable& value)
45 while (first != last && !(*first == value))
54 ForwardIterator adjacent_find (ForwardIterator first, ForwardIterator last)
56 if (first != last)
57 for (ForwardIterator prev = first; ++first != last; ++ prev
[all...] |
| uheap.h | 30 bool is_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
33 for (; ++iChild < last; ++first)
34 if (comp (*first, *iChild) || (++iChild < last && comp (*first, *iChild)))
39 /// \brief make_heap turns the range [first, last) into a heap
40 /// At completion, is_heap (first, last, comp) is true.
46 void make_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
50 uoff_t iChild, iHole = 0, iEnd (distance (first, last));
63 /// \brief Inserts the *--last into the preceeding range assumed to be a heap.
67 void push_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
69 if (last <= first
[all...] |
| upredalgo.h | 20 /// Copy_if copies elements from the range [first, last) to the range
21 /// [result, result + (last - first)) if pred(*i) returns true.
26 inline OutputIterator copy_if (InputIterator first, InputIterator last, OutputIterator result, Predicate pred)
28 for (; first != last; ++first) {
37 /// Returns the first iterator i in the range [first, last) such that
38 /// pred(*i) is true. Returns last if no such iterator exists.
43 inline InputIterator find_if (InputIterator first, InputIterator last, Predicate pred)
45 while (first != last && !pred (*first))
55 inline ForwardIterator adjacent_find (ForwardIterator first, ForwardIterator last, BinaryPredicate p)
57 if (first != last)
[all...] |
| unumeric.h | 16 /// Returns the sum of all elements in [first, last) added to \p init.
20 inline T accumulate (InputIterator first, InputIterator last, T init)
22 while (first < last)
27 /// Returns the sum of all elements in [first, last) via \p op, added to \p init.
31 inline T accumulate (InputIterator first, InputIterator last, T init, BinaryFunction binary_op)
33 while (first < last)
38 /// Assigns range [value, value + (last - first)) to [first, last)
42 inline void iota (ForwardIterator first, ForwardIterator last, T value)
44 while (first < last)
[all...] |
| /external/qemu/distrib/sdl-1.2.12/src/stdlib/ |
| SDL_qsort.c | 92 typedef struct { char * first; char * last; } stack_entry; member in struct:__anon4321
93 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;}
94 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;}
95 #define doLeft {first=ffirst;llast=last;continue;}
96 #define doRight {ffirst=first;last=llast;continue;}
99 last=llast=stack[stacktop].last;\
115 * 3. We choose a pivot by looking at the first, last
169 { size_t l=last-ffirst,r=llast-first;
307 char *first,*last; local
338 char *first,*last; local
369 char *first,*last; local
[all...] |
| /external/skia/src/core/ |
| SkDeque.cpp | 148 Head* last = fBack; local
151 if (NULL == last->fBegin) {
153 last->fBegin = last->start();
154 end = last->fBegin + fElemSize;
156 end = last->fEnd + fElemSize;
157 if (end > last->fStop) { // no more room in this chunk
161 last = (Head*)sk_malloc_throw(size);
162 last->init(size);
163 last->fPrev = fBack
204 Head* last = fBack; local
[all...] |
| /dalvik/libcore/text/src/main/java/java/text/ |
| CharacterIterator.java | 68 * @return the index one past the last character of the iteration.
85 public char last(); method in interface:CharacterIterator
|
| /external/webkit/SunSpider/tests/sunspider-0.9/ |
| string-fasta.js | 6 var last = 42, A = 3877, C = 29573, M = 139968; variable
9 last = (last * A + C) % M;
10 return max * last / M;
37 var last = null;
39 if (last) table[c] += table[last];
40 last = c;
|
| /external/webkit/SunSpider/tests/sunspider-0.9.1/ |
| string-fasta.js | 6 var last = 42, A = 3877, C = 29573, M = 139968; variable
9 last = (last * A + C) % M;
10 return max * last / M;
37 var last = null;
39 if (last) table[c] += table[last];
40 last = c;
|
| /external/webkit/WebCore/rendering/style/ |
| ContentData.cpp | 39 ContentData* last = 0; local
43 c->m_next = last;
44 last = c;
46 for (c = last; c; c = n) {
|
| /external/wpa_supplicant/tests/ |
| test_x509v3.c | 28 struct x509_certificate *certs = NULL, *last = NULL, *cert; local
57 last->next = cert;
58 last = cert;
62 if (x509_certificate_chain_validate(last, certs, &reason) < 0) {
|
| /external/wpa_supplicant_6/wpa_supplicant/tests/ |
| test_x509v3.c | 28 struct x509_certificate *certs = NULL, *last = NULL, *cert; local
57 last->next = cert;
58 last = cert;
62 if (x509_certificate_chain_validate(last, certs, &reason) < 0) {
|
| /development/samples/ApiDemos/src/com/example/android/apis/graphics/kube/ |
| GLFace.java | 51 int last = mVertexList.size() - 1; local
52 if (last < 2) {
55 GLVertex vertex = mVertexList.get(last);
61 mVertexList.remove(last + 1);
62 vertex = mVertexList.get(last);
77 int last = mVertexList.size() - 1; local
80 GLVertex vn = mVertexList.get(last);
83 for (int i = 1; i < last; i++) {
|
