/external/oprofile/daemon/ |
opd_mangling.h | 30 int opd_open_sample_file(odb_t *file, struct sfile *last,
|
/external/qemu/distrib/sdl-1.2.15/docs/man3/ |
SDL_GetRelativeMouseState.3 | 11 The current button state is returned as a button bitmask, which can be tested using the \fBSDL_BUTTON(X)\fP macros, and \fBx\fR and \fBy\fR are set to the change in the mouse position since the last call to \fBSDL_GetRelativeMouseState\fP or since event initialization\&. You can pass \fBNULL\fP for either \fBx\fR or \fBy\fR\&.
|
/external/quake/quake/src/QW/client/ |
gl_mesh.c | 62 mtriangle_t *last, *check;
local 67 last = &triangles[starttri];
69 stripverts[0] = last->vertindex[(startv)%3];
70 stripverts[1] = last->vertindex[(startv+1)%3];
71 stripverts[2] = last->vertindex[(startv+2)%3];
76 m1 = last->vertindex[(startv+2)%3];
77 m2 = last->vertindex[(startv+1)%3];
83 if (check->facesfront != last->facesfront)
131 mtriangle_t *last, *check;
local 136 last = &triangles[starttri]; [all...] |
/external/valgrind/main/drd/tests/ |
filter_annotate_barrier_xml | 4 # "<dir>...</dir>" since these last three lines are not generated on all
|
/external/webkit/LayoutTests/fast/xpath/py-dom-xpath/ |
abbreviations-expected.txt | 7 PASS para[last()]
|
/external/webkit/LayoutTests/http/tests/appcache/resources/ |
uncacheable-resource.php | 3 header("Last-Modified: Thu, 01 Dec 2003 16:00:00 GMT");
|
/external/webkit/Source/JavaScriptCore/wtf/ |
BlockStack.h | 81 ASSERT(newEnd != m_blocks.last() + blockLength); 82 m_spareBlock = m_blocks.last(); 85 while (m_blocks.last() + blockLength != newEnd) { 86 free(m_blocks.last());
|
/external/webkit/Source/WebCore/bindings/v8/ |
IntrusiveDOMWrapperMap.h | 79 Chunk* last = m_chunks; local 81 Chunk* previous = last->m_previous; 84 delete last; 86 last = previous; 89 m_chunks = last; 111 static void clearEntries(T* first, T* last) 113 for (T* entry = first; entry < last; entry++) 117 static void visitEntries(DOMDataStore* store, T* first, T* last, typename Traits::Visitor* visitor) 119 for (T* entry = first; entry < last; entry++)
|
/frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/ |
omxVCM4P2_DecodeVLCZigzag_IntraDCVLC_s.s | 73 IMPORT armVCM4P2_IntraVlcL0L1 ;// Contains optimized and packed VLC Tables for both Last =1 and last=0 74 ;// Packed in Run:Level:Last format 75 IMPORT armVCM4P2_IntraL0L1LMAX ;// Contains LMAX table entries with both Last=0 and Last=1 76 IMPORT armVCM4P2_IntraL0L1RMAX ;// Contains RMAX table entries with both Last=0 and Last=1 195 LDR pVlcTableL0L1, =armVCM4P2_IntraVlcL0L1 ;// Load Optimized VLC Table With both Last=0 and Last=1 Entries
|
/frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/ |
omxVCM4P2_DecodeVLCZigzag_IntraDCVLC_s.s | 73 IMPORT armVCM4P2_IntraVlcL0L1 ;// Contains optimized and packed VLC Tables for both Last =1 and last=0 74 ;// Packed in Run:Level:Last format 75 IMPORT armVCM4P2_IntraL0L1LMAX ;// Contains LMAX table entries with both Last=0 and Last=1 76 IMPORT armVCM4P2_IntraL0L1RMAX ;// Contains RMAX table entries with both Last=0 and Last=1 195 LDR pVlcTableL0L1, =armVCM4P2_IntraVlcL0L1 ;// Load Optimized VLC Table With both Last=0 and Last=1 Entries
|
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
lower_bound.pass.cpp | 15 // lower_bound(Iter first, Iter last, const T& value); 25 test(Iter first, Iter last, const T& value) 27 Iter i = std::lower_bound(first, last, value); 30 for (Iter j = i; j != last; ++j)
|
lower_bound_comp.pass.cpp | 15 // lower_bound(Iter first, Iter last, const T& value); 26 test(Iter first, Iter last, const T& value) 28 Iter i = std::lower_bound(first, last, value, std::greater<int>()); 31 for (Iter j = i; j != last; ++j)
|
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
upper_bound.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value); 25 test(Iter first, Iter last, const T& value) 27 Iter i = std::upper_bound(first, last, value); 30 for (Iter j = i; j != last; ++j)
|
upper_bound_comp.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value, Compare comp); 26 test(Iter first, Iter last, const T& value) 28 Iter i = std::upper_bound(first, last, value, std::greater<int>()); 31 for (Iter j = i; j != last; ++j)
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector/vector.cons/ |
construct_iter_iter.pass.cpp | 12 // template <class InputIter> vector(InputIter first, InputIter last); 22 test(Iterator first, Iterator last) 24 C c(first, last); 26 assert(c.size() == std::distance(first, last));
|
construct_iter_iter_alloc.pass.cpp | 12 // template <class InputIter> vector(InputIter first, InputIter last, 23 test(Iterator first, Iterator last, const typename C::allocator_type& a) 25 C c(first, last, a); 27 assert(c.size() == std::distance(first, last));
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector.bool/ |
construct_iter_iter.pass.cpp | 13 // template <class InputIter> vector(InputIter first, InputIter last); 22 test(Iterator first, Iterator last) 24 C c(first, last); 26 assert(c.size() == std::distance(first, last));
|
construct_iter_iter_alloc.pass.cpp | 13 // template <class InputIter> vector(InputIter first, InputIter last, 23 test(Iterator first, Iterator last, const typename C::allocator_type& a) 25 C c(first, last, a); 27 assert(c.size() == std::distance(first, last));
|
/external/srec/portable/src/ |
pmemory.c | 84 * Pointer to last memory allocation associated with the same tag. 86 struct MemoryData_t* last; member in struct:MemoryData_t 107 * Last memory allocation associated with this tag. 110 MemoryData* last; member in struct:MemMapEntry_t 191 gMemoryMap[idx].last = NULL; 418 if (e->last != NULL && e->last == data) 419 e->last = data->last; 420 if (data->last != NULL [all...] |
/external/stlport/test/eh/ |
test_insert.h | 96 key_iterator last = EH_STD::unique( keys.begin(), keys.end() ); local 99 for ( key_iterator tmp = keys.begin(); tmp != last; ++tmp ) 452 Iter first, Iter last, sequence_container_tag ) 457 c_inst.insert( pos, first, last ); 462 Iter first, Iter last, associative_container_tag ) 464 c.insert( first, last ); 468 void do_insert_range( C& c, Position, Iter first, Iter last, multiset_tag ) 470 c.insert( first, last ); 474 void do_insert_range( C& c, Position, Iter first, Iter last, multimap_tag ) 476 c.insert( first, last ); [all...] |
/external/webkit/Source/WebCore/rendering/ |
CounterNode.cpp | 80 CounterNode* last = m_lastChild; local 81 if (!last) 84 while (CounterNode* lastChild = last->m_lastChild) 85 last = lastChild; 87 return last; 237 CounterNode* last = newChild->m_lastChild; local 246 // counter node being created, it will be inserted as the last child so next is null. 251 last->m_nextSibling = next; 253 next->m_previousSibling = last; 255 m_lastChild = last; [all...] |
/external/e2fsprogs/lib/uuid/ |
gen_uuid.c | 309 THREAD_LOCAL struct timeval last = {0, 0}; local 354 last.tv_sec = tv1; 355 last.tv_usec = tv2; 360 if ((last.tv_sec == 0) && (last.tv_usec == 0)) { 363 gettimeofday(&last, 0); 364 last.tv_sec--; 369 if ((tv.tv_sec < last.tv_sec) || 370 ((tv.tv_sec == last.tv_sec) && 371 (tv.tv_usec < last.tv_usec))) [all...] |
/external/llvm/bindings/python/llvm/ |
object.py | 129 last = None 134 last = Section(sections) 136 last.cache() 138 yield last 141 last.expire() 143 if last is not None: 144 last.expire() 157 last = None 162 last = Symbol(symbols, self) 164 last.cache( [all...] |
/development/samples/Support13Demos/res/values/ |
strings.xml | 34 <string name="last">Last</string>
|
/external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
AttributedCharacterIteratorTest.java | 38 assertEquals("Wrong last", 'g', it.current()); 94 assertEquals("Wrong last", 10, it.getIndex()); 100 * @tests java.text.AttributedCharacterIterator#last() 106 assertEquals("Wrong last1", 'g', it.last()); 108 assertEquals("Wrong last2", 's', it.last()); 110 assertEquals("Wrong last3", 'r', it.last()); 112 assertTrue("Wrong last4", it.last() == CharacterIterator.DONE); 125 assertEquals("Wrong last", 'g', it.next());
|