| /external/bouncycastle/src/main/java/org/bouncycastle/math/ec/ |
| IntArray.java | 141 int last = intLen - 1; local
142 int highest = m_ints[last];
143 int bits = (last << 5) + 1;
|
| /external/chromium/base/memory/ |
| linked_ptr.h | 6 // particular object is kept on a circular linked list. When the last pointer
9 // Used properly, this deletes the object when the last reference goes away.
64 // last member of the circle. Once this is done, you can join() another.
121 bool last = link_.depart(); local
122 CHECK(last);
|
| /external/chromium/base/ |
| string_piece.cc | 62 const char* last = ptr_ + std::min(length_ - s.length_, pos) + s.length_; local
63 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_);
64 return result != last ? static_cast<size_t>(result - ptr_) : npos;
|
| string_split.cc | 19 size_t last = 0; local
24 size_t len = i - last;
25 STR tmp = str.substr(last, len);
33 last = i + 1;
|
| /external/chromium/chrome/browser/autocomplete/ |
| autocomplete_result_unittest.cc | 42 // Creates an AutocompleteResult from |last| and |current|. The two are
44 void RunCopyOldMatchesTest(const TestData* last, size_t last_size,
92 const TestData* last, size_t last_size,
99 PopulateAutocompleteMatches(last, last_size, &last_matches);
143 // Tests that if the new results have a lower max relevance score than last,
146 TestData last[] = { local
159 RunCopyOldMatchesTest(last, ARRAYSIZE_UNSAFE(last),
166 TestData last[] = { local
184 RunCopyOldMatchesTest(last, ARRAYSIZE_UNSAFE(last)
[all...] |
| /external/chromium/third_party/libevent/ |
| min_heap.h | 89 struct event *last = s->p[--s->n]; local
91 /* we replace e with the last element in the heap. We might need to
96 if (e->min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], last))
97 min_heap_shift_up_(s, e->min_heap_idx, last);
99 min_heap_shift_down_(s, e->min_heap_idx, last);
|
| /external/chromium/third_party/libjingle/source/talk/xmllite/ |
| xmlnsstack.cc | 158 size_t last = len; local
159 while (last > 0) {
160 last -= 1;
161 if (IsAsciiLetter(ns[last])) {
162 size_t first = last;
163 last += 1;
169 if (last - first > 4)
170 last = first + 3;
171 std::string candidate(AsciiLower(ns.substr(first, last - first)));
|
| /external/dhcpcd/ |
| control.c | 55 struct fd_list *l, *last = NULL; local
61 if (last == NULL)
64 last->next = l->next;
68 last = l;
|
| /external/e2fsprogs/lib/blkid/ |
| list.h | 134 struct list_head *last = list->prev; local
140 last->next = at;
141 at->prev = last;
|
| /external/e2fsprogs/lib/ext2fs/ |
| res_gdt.c | 126 unsigned int grp, last = 0; local
170 if (!gdt_buf[last]) {
173 expect, grp, gdt_blk, last);
175 gdt_buf[last] = expect;
178 } else if (gdt_buf[last] != expect) {
181 gdt_buf[last], expect, gdt_blk, last);
186 last++;
|
| /external/e2fsprogs/misc/ |
| findsuper.c | 80 * has the last time e2fsck or tune2fs wrote to the filesystem.
119 time_t tm, last = time(0); local
198 diff = now - last;
211 last = now;
|
| /external/gtest/include/gtest/internal/ |
| gtest-linked_ptr.h | 33 // particular object is kept on a circular linked list. When the last pointer
36 // Used properly, this deletes the object when the last reference goes away.
119 // last member of the circle. Once this is done, you can join() another.
178 bool last = link_.depart(); local
179 assert(last);
|
| /external/guava/src/com/google/common/collect/ |
| EmptyImmutableSortedSet.java | 93 public E last() { method in class:EmptyImmutableSortedSet
|
| /external/iptables/extensions/ |
| libxt_NFQUEUE.c | 33 " --queue-balance first:last Balance flows between queues <value> to <value>.\n");
107 unsigned int last = tinfo->queues_total; local
109 if (last > 1) {
110 last += tinfo->queuenum - 1;
111 printf(" NFQUEUE balance %u:%u", tinfo->queuenum, last);
138 unsigned int last = tinfo->queues_total; local
140 if (last > 1) {
141 last += tinfo->queuenum - 1;
142 printf(" --queue-balance %u:%u", tinfo->queuenum, last);
|
| /external/llvm/lib/CodeGen/ |
| ScoreboardHazardRecognizer.cpp | 87 unsigned last = Depth - 1; local
88 while ((last > 0) && ((*this)[last] == 0))
89 last--;
91 for (unsigned i = 0; i <= last; i++) {
|
| /external/oprofile/daemon/ |
| opd_trans.h | 44 struct sfile * last; member in struct:transient
67 trans->last = trans->current;
|
| /external/oprofile/libpp/ |
| profile.cpp | 172 ordered_samples_t::const_iterator last = local
176 const_iterator(last, start_offset));
183 ordered_samples_t::const_iterator last = ordered_samples.end(); local
186 const_iterator(last, start_offset));
|
| /external/oprofile/libutil/ |
| op_list.h | 135 struct list_head * last = list->prev; local
141 last->next = at;
142 at->prev = last;
|
| /external/protobuf/gtest/include/gtest/internal/ |
| gtest-linked_ptr.h | 33 // particular object is kept on a circular linked list. When the last pointer
36 // Used properly, this deletes the object when the last reference goes away.
119 // last member of the circle. Once this is done, you can join() another.
178 bool last = link_.depart(); local
179 assert(last);
|
| /external/qemu/distrib/zlib-1.2.3/ |
| inffast.c | 73 unsigned char FAR *last; /* while in < last, enough input available */ local
100 last = in + (strm->avail_in - 5);
285 } while (in < last && out < end);
296 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
|
| /external/quake/quake/src/QW/qwfwd/ |
| qwfwd.c | 68 time_t last;
member in struct:peer
220 time(&p->last);
231 time(&p->last);
240 time(&p->last);
251 if (time(NULL) - p->last > 300) {
|
| /external/skia/src/animator/ |
| SkDisplayTypes.cpp | 26 SkDisplayable** last = fDependents.end(); local
27 for (SkDisplayable** depPtr = fDependents.begin(); depPtr < last; depPtr++) {
|
| /external/webkit/Source/WebCore/bindings/gobject/ |
| DOMObjectCache.cpp | 83 Vector<DOMObjectCacheData*>::iterator last = toUnref.end(); local
84 for (Vector<DOMObjectCacheData*>::iterator it = toUnref.begin(); it != last; ++it) {
97 // If this is the last unref we are going to do,
|
| /external/webkit/Source/WebCore/editing/ |
| SpellChecker.cpp | 126 int last = length - iterator.offsetInLeafNode(); local
127 if (remaining < last) {
132 remaining -= last;
133 iterator.setOffsetInLeafNode(iterator.offsetInLeafNode() + last);
|
| /external/webkit/Source/WebCore/rendering/ |
| RenderObjectChildList.cpp | 301 RenderObject* last = const_cast<RenderObject*>(owner); local
303 last = last->lastChild();
304 } while (last && last->isAnonymous() && last->style()->styleType() == NOPSEUDO && !last->isListMarker());
305 if (last && last->style()->styleType() != AFTER)
307 return last;
[all...] |
