| /external/v8/src/ |
| liveobjectlist-inl.h | 64 if (last()) DoProcessNonLive(obj);
96 LiveObjectList* lol = last();
|
| /external/valgrind/main/include/ |
| pub_tool_xarray.h | 80 index of the first, and *last to be the index of the last matching
82 False, and don't change *first or *last. first and/or last may be
85 /*OUT*/Word* first, /*OUT*/Word* last );
96 /*OUT*/Word* first, /*OUT*/Word* last,
111 /* Drop the last n elements of an XArray. Bombs if there are less
|
| /external/webkit/Source/JavaScriptCore/docs/ |
| make-bytecode-docs.pl | 27 last;
|
| /external/webkit/Source/JavaScriptCore/parser/ |
| ParserArena.cpp | 74 ParserArenaRefCounted* ParserArena::last() const function in class:JSC::ParserArena
76 return m_refCountedObjects.last().get();
|
| /external/webkit/Source/WebCore/platform/graphics/cairo/ |
| PlatformContextCairo.cpp | 40 const ImageMaskInformation& maskInformation = m_maskImageStack.last();
63 m_maskImageStack.last().update(surface, rect);
|
| /external/webkit/Source/WebCore/platform/text/ |
| TextBoundaries.cpp | 54 int last = i; local
58 return last;
|
| BidiResolver.h | 61 , last(WTF::Unicode::OtherNeutral)
68 , last(lastDir)
75 WTF::Unicode::Direction last; member in struct:WebCore::BidiStatus
96 return status1.eor == status2.eor && status1.last == status2.last && status1.lastStrong == status2.lastStrong && *(status1.context) == *(status2.context);
171 void setLastDir(WTF::Unicode::Direction lastDir) { m_status.last = lastDir; }
267 ASSERT(m_status.last != NonSpacingMark
268 && m_status.last != BoundaryNeutral
269 && m_status.last != RightToLeftEmbedding
270 && m_status.last != LeftToRightEmbeddin
[all...] |
| /frameworks/base/core/tests/coretests/src/android/widget/listview/ |
| ListScrollListener.java | 66 int last = firstCell + cellCount - 1; local
67 mText.setText("Showing " + firstCell + "-" + last + "/" + itemCount);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| binary_search.pass.cpp | 16 // binary_search(Iter first, Iter last, const T& value);
26 test(Iter first, Iter last, const T& value, bool x)
28 assert(std::binary_search(first, last, value) == x);
|
| binary_search_comp.pass.cpp | 16 // binary_search(Iter first, Iter last, const T& value, Compare comp);
27 test(Iter first, Iter last, const T& value, bool x)
29 assert(std::binary_search(first, last, value, std::greater<int>()) == x);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/numerics/numeric.ops/accumulate/ |
| accumulate_op.pass.cpp | 17 // accumulate(Iter first, Iter last, T init, BinaryOperation binary_op);
27 test(Iter first, Iter last, T init, T x)
29 assert(std::accumulate(first, last, init, std::multiplies<T>()) == x);
|
| /packages/apps/Music/src/com/android/music/ |
| IMediaPlaybackService.aidl | 49 int removeTracks(int first, int last);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/ |
| assoc_container.hpp | 253 cc_hash_table(It first, It last)
254 { base_type::copy_from_range(first, last); }
260 cc_hash_table(It first, It last, const hash_fn& h)
262 { this->copy_from_range(first, last); }
271 cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e)
273 { this->copy_from_range(first, last); }
283 cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e,
286 { this->copy_from_range(first, last); }
297 cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e,
300 { this->copy_from_range(first, last); }
[all...] |
| /bionic/libc/upstream-netbsd/libc/gen/ |
| popen.c | 193 struct pid *cur, *last; local
202 for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next)
213 if (last == NULL)
216 last->next = cur->next;
|
| /external/llvm/lib/CodeGen/ |
| ScoreboardHazardRecognizer.cpp | 96 unsigned last = Depth - 1; local
97 while ((last > 0) && ((*this)[last] == 0))
98 last--;
100 for (unsigned i = 0; i <= last; i++) {
|
| /external/skia/legacy/src/core/ |
| SkTSearch.cpp | 139 static void SkQSort_Partition(char* first, char* last, size_t elemSize, SkQSortCompareProc compare)
142 char* rite = last;
147 while (left < last && compare(left, pivot) < 0)
164 if (left < last)
165 SkQSort_Partition(left, last, elemSize, compare);
|
| /external/zlib/src/contrib/masmx64/ |
| inffas8664.c | 87 /* 24 12 */ unsigned char FAR *last; /* r9 while in < last */
member in struct:inffast_ar
128 ar.last = ar.in + (strm->avail_in - PAD_AVAIL_IN);
175 strm->avail_in = (unsigned)(ar.in < ar.last ?
176 PAD_AVAIL_IN + (ar.last - ar.in) :
177 PAD_AVAIL_IN - (ar.in - ar.last));
|
| /external/libsepol/src/ |
| hashtab.c | 108 hashtab_ptr_t cur, last; local
114 last = NULL;
117 last = cur;
124 if (last == NULL)
127 last->next = cur->next;
254 hashtab_ptr_t last, cur, temp; local
260 last = NULL;
265 if (last) {
266 last->next = cur->next;
278 last = cur
[all...] |
| sidtab.c | 90 sidtab_node_t *cur, *last; local
96 last = NULL;
99 last = cur;
106 if (last == NULL)
109 last->next = cur->next;
174 sidtab_node_t *last, *cur, *temp; local
180 last = NULL;
185 if (last) {
186 last->next = cur->next;
197 last = cur
[all...] |
| /external/webkit/Tools/android/flex-2.5.4a/ |
| nfa.c | 153 int last = lastst[mach]; local
155 for ( i = firstst[mach]; i <= last; ++i )
281 * new = link_machines( first, last );
283 * new - a machine constructed by connecting first to last
284 * first - the machine whose successor is to be last
285 * last - the machine whose predecessor is to be first
288 * last to produce a machine new which will pattern-match first first
289 * and then last, and will fail if either of the sub-patterns fails.
290 * FIRST is set to new by the operation. last is unmolested.
293 int link_machines( first, last )
[all...] |
| /libcore/support/src/test/java/tests/support/ |
| Support_Configuration.java | 202 int last = 0; local
205 int dot = InetTestIP.indexOf('.', last);
207 last, dot));
208 last = dot + 1;
210 addr[3] = (byte) Integer.parseInt(InetTestIP.substring(last));
223 int last = 0; local
226 int dot = nonLocalAddressBytesString.indexOf('.', last);
229 last, dot));
230 last = dot + 1;
233 .substring(last));
[all...] |
| /sdk/find_java/ |
| utils.h | 178 const char *last = NULL;
local
181 if (*s == sep && s != mStr && (last == NULL || s > last+1)) {
183 last = s;
188 last = NULL;
192 if (s != mStr && (last == NULL || s > last+1)) {
193 const char *start = last ? last : mStr;
196 last = s+1;
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/android/context/ |
| PlatformGraphicsContextRecording.cpp | 211 // Careful, ordering matters here. Ordering is first constructed == last destroyed,
213 // the last thing destroyed.
253 if (m_canvasStates.last() == state)
510 mCurrentMatrix = &(mMatrixStack.last());
538 CanvasState* parent = mRecordingStateStack.last().mCanvasState;
540 mRecordingStateStack.last().disableOpaqueTracking();
551 CanvasState* parent = mRecordingStateStack.last().mCanvasState;
705 mRecordingStateStack.last().disableOpaqueTracking();
711 mRecordingStateStack.last().disableOpaqueTracking();
724 mRecordingStateStack.last().disableOpaqueTracking()
[all...] |
| /external/bison/data/ |
| location.cc | 283 position last = loc.end - 1;
285 if (last.filename
287 || *loc.begin.filename != *last.filename))
288 ostr << '-' << last;
289 else if (loc.begin.line != last.line)
290 ostr << '-' << last.line << '.' << last.column;
291 else if (loc.begin.column != last.column)
292 ostr << '-' << last.column;
|
| /external/llvm/include/llvm/ADT/ |
| ilist.h | 119 ilist_iterator<NodeTy> /*last*/) {}
308 /// of the first node in the list always points to the last node in the list,
482 // [first, last) into position.
484 void transfer(iterator position, iplist &L2, iterator first, iterator last) {
485 assert(first != last && "Should be checked by callers");
491 if (position != last) {
499 // Remove [first, last) from its old position.
501 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next);
508 // Splice [first, last) into its new position
573 iterator last = first; ++last; local
[all...] |
