/cts/tools/vm-tests/src/dot/junit/opcodes/const_wide_high16/ |
Test_const_wide_high16.java | 48 * pair, but not touching the other half, the old register pair gets broken up, and the
|
/cts/tools/vm-tests/src/dot/junit/opcodes/opc_const/ |
Test_opc_const.java | 62 * pair, but not touching the other half, the old register pair gets broken up, and the
|
/dalvik/docs/opcodes/ |
opcode-0d-move-exception.html | 63 If register v(A-1) is the lower half of a register pair, register v(A-1)' 67 If register v(A+1) is the upper half of a register pair, register v(A+1)'
|
opcode-1a-const-string.html | 71 If v(A-1) is the lower half of a register pair, v(A-1)' becomes undefined. 74 If v(A+1) is the upper half of a register pair, v(A+1)' becomes undefined.
|
opcode-21-array-length.html | 60 If register v(A-1) is the lower half of a register pair, register v(A-1)' 64 If register v(A+1) is the upper half of a register pair, register v(A+1)'
|
opcode-b0-binop-2addr.html | 68 <td><code>A:</code> destination and first source register or pair 70 <code>B:</code> second source register or pair (4 bits)</td> 107 part of a register pair originally.
|
/external/icu4c/test/testdata/ |
test3.ucm | 52 # toUnicode result is surrogate pair: test real pair, single unit, unassigned
|
test4.ucm | 45 # toUnicode result is surrogate pair: test real pair, single unit, unassigned
|
/external/opencore/fileformats/mp4/parser/include/ |
itunesmetadataatom.h | 22 /** Shared pointer of a key-value pair */ 25 /** Vector of shared pointer of a key-value pair */
|
/external/webkit/JavaScriptCore/runtime/ |
Identifier.cpp | 46 std::pair<HashSet<UString::Rep*>::iterator, bool> add(UString::Rep* value) 48 std::pair<HashSet<UString::Rep*>::iterator, bool> result = m_table.add(value); 54 std::pair<HashSet<UString::Rep*>::iterator, bool> add(U value) 56 std::pair<HashSet<UString::Rep*>::iterator, bool> result = m_table.add<U, V>(value); 142 pair<HashSet<UString::Rep*>::iterator, bool> addResult = identifierTable.add<const char*, CStringTranslator>(c); 145 // The boolean in the pair tells us if that is so. 197 pair<HashSet<UString::Rep*>::iterator, bool> addResult = globalData->identifierTable->add<UCharBuffer, UCharBufferTranslator>(buf); 200 // The boolean in the pair tells us if that is so.
|
/external/webkit/WebCore/accessibility/ |
AccessibilityARIAGridCell.h | 45 virtual void rowIndexRange(pair<int, int>& rowRange); 47 virtual void columnIndexRange(pair<int, int>& columnRange);
|
/frameworks/base/core/jni/android/graphics/ |
Region.cpp | 196 static void RegionIter_destructor(JNIEnv* env, jobject, RgnIterPair* pair) 198 SkASSERT(pair); 199 delete pair; 202 static jboolean RegionIter_next(JNIEnv* env, jobject, RgnIterPair* pair, jobject rectObject) 205 SkASSERT(pair); 208 if (!pair->fIter.done()) { 209 GraphicsJNI::irect_to_jrect(pair->fIter.rect(), env, rectObject); 210 pair->fIter.next();
|
/external/icu4c/layout/ |
KernTable.cpp | 22 le_uint16 left; // left glyph of kern pair 23 le_uint16 right; // right glyph of kern pair 124 // dump part of the pair list 168 * glyph, plus a trailing pair to mark the end of the last glyph. 181 // argh, to do a binary search, we need to have the pair list in sorted order 211 fprintf(stdout, "binary found kerning pair %x:%x at %d, value: 0x%x (%g)\n",
|
/external/v8/test/mjsunit/ |
indexed-accessors.js | 44 function Pair(x, y) { 48 Pair.prototype.__defineGetter__('0', function() { return this.x; }); 49 Pair.prototype.__defineGetter__('1', function() { return this.y; }); 50 Pair.prototype.__defineSetter__('0', function(x) { this.x = x; }); 51 Pair.prototype.__defineSetter__('1', function(y) { this.y = y; }); 53 var p = new Pair(2, 3);
|
/external/stlport/stlport/stl/pointers/ |
_set.h | 228 pair<iterator,bool> insert(const value_type& __x) { 229 pair<base_iterator, bool> ret = _M_t.insert_unique(cast_traits::to_storage_type_cref(__x)); 230 return pair<iterator, bool>(_S_to_value_ite(ret.first), ret.second); 284 pair<iterator, iterator> equal_range(const _KT& __x) { 285 pair<base_iterator, base_iterator> __ret; 287 return pair<iterator, iterator>(_S_to_value_ite(__ret.first), 291 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { 292 pair<const_base_iterator, const_base_iterator> __ret; 294 return pair<const_iterator, const_iterator>(_S_to_value_ite(__ret.first), 539 pair<iterator, iterator> equal_range(const _KT& __x) [all...] |
/external/stlport/test/unit/ |
map_test.cpp | 64 pair<maptype::iterator, bool> p = m.insert(pair<const char, int>('c', 100)); 70 p = m.insert(pair<const char, int>('c', 100)); 71 CPPUNIT_ASSERT( !p.second ); // already existing pair 83 m.insert(pair<const char, int>('X', 10)); // Standard way. 86 m.insert(pair<const char, int>('X', 20)); // jbuck: standard way 89 m.insert(pair<const char, int>('Y', 32)); // jbuck: standard way 94 pair<_STLP_CONST char, int> p('X', 10); 112 typedef pair<const int, char> pair_type; 234 pair<maptype::iterator, maptype::iterator> ret [all...] |
/external/bluetooth/glib/glib/ |
gkeyfile.c | 145 static void g_key_file_key_value_pair_free (GKeyFileKeyValuePair *pair); 762 "a key-value pair, group, or comment"), 779 GKeyFileKeyValuePair *pair; local 786 pair = g_slice_new (GKeyFileKeyValuePair); 787 pair->key = NULL; 788 pair->value = g_strndup (line, length); 791 g_list_prepend (key_file->current_group->key_value_pairs, pair); 1057 GKeyFileKeyValuePair *pair; local 1059 pair = (GKeyFileKeyValuePair *) key_file_node->data; 1061 if (pair->key != NULL 1120 GKeyFileKeyValuePair *pair; local 1133 GKeyFileKeyValuePair *pair; local 1261 GKeyFileKeyValuePair *pair; local 1314 GKeyFileKeyValuePair *pair; local 2495 GKeyFileKeyValuePair *pair; local 2602 GKeyFileKeyValuePair *pair; local 2692 GKeyFileKeyValuePair *pair; local 2786 GKeyFileKeyValuePair *pair; local 2804 GKeyFileKeyValuePair *pair; local 2977 GKeyFileKeyValuePair *pair; local 3056 GKeyFileKeyValuePair *pair; local 3193 GKeyFileKeyValuePair *pair; local 3225 GKeyFileKeyValuePair *pair; local 3299 GKeyFileKeyValuePair *pair; local [all...] |
/external/webkit/WebCore/css/ |
CSSPrimitiveValue.h | 33 class Pair; 158 Pair* getPairValue(ExceptionCode&) const; 159 Pair* getPairValue() const { return m_type != CSS_PAIR ? 0 : m_value.pair; } 196 void init(PassRefPtr<Pair>); 211 Pair* pair; member in union:WebCore::CSSPrimitiveValue::__anon6457
|
/external/stlport/src/ |
ios.cpp | 93 static pair<PODType*, size_t> 101 return pair<PODType*, size_t>(new_array, new_N); 104 return pair<PODType*, size_t>(__STATIC_CAST(PODType*,0), 0); 107 return pair<PODType*, size_t>(__array, N); 151 pair<long*, size_t> tmp = _Stl_expand_array(_M_iwords, _M_num_iwords, index); 168 pair<void**, size_t> tmp = _Stl_expand_array(_M_pwords, _M_num_pwords, index); 182 pair<pair<event_callback, int>*, size_t> tmp 241 pair<event_callback, int>* tmp = _Stl_copy_array(x._M_callbacks, x._M_callback_index);
|
message_facets.h | 44 allocator<pair<_STLP_CONST nl_catd_type, locale> > > map_type; 79 allocator<pair<_STLP_CONST messages_base::catalog, nl_catd_type> > > map_type; 81 allocator<pair<_STLP_CONST nl_catd_type, messages_base::catalog> > > rmap_type;
|
/cts/tools/vm-tests/src/dot/junit/opcodes/move_wide_16/ |
Test_move_wide_16.java | 100 * @title src register is a part of reg pair 114 * register pair, but not touching the other half, the old register pair gets broken
|
/cts/tools/vm-tests/src/dot/junit/opcodes/move_wide_from16/ |
Test_move_wide_from16.java | 93 * @title src register is a part of reg pair 107 * register pair, but not touching the other half, the old register pair gets broken
|
/external/astl/tests/ |
test_set.cpp | 40 using std::pair; 57 pair<set<int>::iterator, bool> res; 93 pair<set<string>::iterator, bool> res;
|
/external/proguard/src/proguard/optimize/peephole/ |
InstructionSequencesReplacer.java | 47 * with subsequently the sequence pair index, 74 * with subsequently the sequence pair index, 104 * with subsequently the sequence pair index,
|
/external/stlport/stlport/stl/ |
_tempbuf.h | 48 pair<_Tp*, ptrdiff_t> _STLP_CALL 54 inline pair<_Tp*, ptrdiff_t> _STLP_CALL get_temporary_buffer(ptrdiff_t __len) { 65 inline pair<_Tp*, ptrdiff_t> _STLP_CALL
|