/external/clang/test/SemaTemplate/ |
H A D | dependent-names.cpp | 141 template<typename T, typename U> struct pair {}; struct in namespace:std 238 std::ostream &print(std::ostream &out, std::pair<ns::Data, ns2::Data>); // expected-note {{should be declared prior to the call site or in an associated namespace of one of its arguments}} 244 Dump(std::pair<ns::Data, ns2::Data>()); // expected-note {{requested here}}
|
/external/icu/icu4c/source/i18n/ |
H A D | collationiterator.cpp | 797 // Decrement the value for the last pair. 806 // Read the first pair. 807 uint32_t pair; local 810 // Only "half a pair" if we have an odd number of digits. 811 pair = digits[0]; 814 pair = digits[0] * 10 + digits[1]; 817 pair = 11 + 2 * pair; 824 primary |= pair; 829 primary |= pair << shif [all...] |
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
H A D | CollationFastLatin.java | 93 * Use INDEX_MASK to find the pair of CEs after the fixed table. 294 * Single mini CE or a pair. 737 private static int getPrimaries(int variableTop, int pair) { argument 738 int ce = pair & 0xffff; 739 if(ce >= MIN_SHORT) { return pair & TWO_SHORT_PRIMARIES_MASK; } 740 if(ce > variableTop) { return pair & TWO_LONG_PRIMARIES_MASK; } 742 return pair; // special mini CE 754 private static int getSecondaries(int variableTop, int pair) { argument 755 if(pair <= 0xffff) { 757 if(pair > 779 getCases(int variableTop, boolean strengthIsPrimary, int pair) argument 819 getTertiaries(int variableTop, boolean withCaseBits, int pair) argument 869 getQuaternaries(int variableTop, int pair) argument [all...] |
/external/linux-tools-perf/src/tools/perf/util/ |
H A D | hist.c | 650 struct hist_entry *pair; local 668 list_for_each_entry(pair, &a->pairs.head, pairs.node) { 669 evsel = hists_to_evsel(pair->hists); 670 periods_a[perf_evsel__group_idx(evsel)] = pair->stat.period; 673 list_for_each_entry(pair, &b->pairs.head, pairs.node) { 674 evsel = hists_to_evsel(pair->hists); 675 periods_b[perf_evsel__group_idx(evsel)] = pair->stat.period; 881 struct hist_entry *pair) 900 cmp = hist_entry__collapse(he, pair); 911 he = hist_entry__new(pair); 880 hists__add_dummy_entry(struct hists *hists, struct hist_entry *pair) argument 956 struct hist_entry *pos, *pair; local 981 struct hist_entry *pos, *pair; local [all...] |
/external/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | HashedNameToDIE.h | 634 Pair &pair) const 636 pair.key = m_data.GetU32 (hash_data_offset_ptr); 637 pair.value.clear(); 641 if (pair.key == 0) 646 const char *strp_cstr = m_string_table.PeekCStr (pair.key); 683 pair.value.push_back (die_info); 712 Pair &pair) const 714 pair.key = m_data.GetU32 (hash_data_offset_ptr); 717 if (pair.key == 0) 722 const char *strp_cstr = m_string_table.PeekCStr (pair 783 Pair pair; local [all...] |
/external/llvm/include/llvm/IR/ |
H A D | ValueMap.h | 94 typedef std::pair<KeyT, ValueT> value_type; 146 // Inserts key,value pair into the map if the key isn't already in the map. 149 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { 154 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { 300 std::pair<KeyT, typename DenseMapT::mapped_type>, 316 operator std::pair<KeyT, ValueT>() const { 349 std::pair<KeyT, typename DenseMapT::mapped_type>, 366 operator std::pair<Key [all...] |
/external/lzma/C/ |
H A D | LzFind.c | 369 CLzRef *pair = son + ((_cyclicBufferPos - delta + ((delta > _cyclicBufferPos) ? _cyclicBufferSize : 0)) << 1);
local 384 *ptr1 = pair[0];
385 *ptr0 = pair[1];
393 ptr1 = pair + 1;
400 ptr0 = pair;
423 CLzRef *pair = son + ((_cyclicBufferPos - delta + ((delta > _cyclicBufferPos) ? _cyclicBufferSize : 0)) << 1);
local 434 *ptr1 = pair[0];
435 *ptr0 = pair[1];
443 ptr1 = pair + 1;
450 ptr0 = pair;
[all...] |
H A D | LzFindMt.c | 257 CLzRef *pair = son + ((_cyclicBufferPos - delta + ((delta > _cyclicBufferPos) ? _cyclicBufferSize : 0)) << 1);
local 272 *ptr1 = pair[0];
273 *ptr0 = pair[1];
281 ptr1 = pair + 1;
288 ptr0 = pair;
|
/external/toybox/kconfig/lxdialog/ |
H A D | util.c | 176 static int pair = 0; local 178 pair++; 179 init_pair(pair, color->fg, color->bg); 181 color->atr = A_BOLD | COLOR_PAIR(pair); 183 color->atr = COLOR_PAIR(pair);
|
/external/clang/test/Index/ |
H A D | recursive-cxx-member-calls.cpp | 4 template < class _T1, class _T2 > struct pair { _T2 second; }; struct in namespace:std 69 typedef std::pair < IdentifierInfo, const char *>actualtype; 73 typedef std::pair < IdentifierInfo, const char *>actualtype; 202 // CHECK-tokens: Keyword: "template" [4:3 - 4:11] ClassTemplate=pair:4:44 (Definition) 203 // CHECK-tokens: Punctuation: "<" [4:12 - 4:13] ClassTemplate=pair:4:44 (Definition) 206 // CHECK-tokens: Punctuation: "," [4:23 - 4:24] ClassTemplate=pair:4:44 (Definition) 209 // CHECK-tokens: Punctuation: ">" [4:35 - 4:36] ClassTemplate=pair:4:44 (Definition) 210 // CHECK-tokens: Keyword: "struct" [4:37 - 4:43] ClassTemplate=pair:4:44 (Definition) 211 // CHECK-tokens: Identifier: "pair" [4:44 - 4:48] ClassTemplate=pair [all...] |
/external/icu/icu4c/source/test/intltest/ |
H A D | icusvtst.cpp | 705 const StringPair* pair = (const StringPair*)names[i]; local 706 logln(" " + pair->displayName + " --> " + pair->id); 745 const StringPair* pair = (const StringPair*)names[i]; local 746 logln(" " + pair->displayName + " --> " + pair->id); 917 const StringPair* pair = (const StringPair*)names[i]; local 918 logln(" " + pair->displayName + " --> " + pair->id); 942 const StringPair* pair local [all...] |
H A D | tstnorm.cpp | 1441 const StringPair &pair=pairs[i]; local 1442 UnicodeString input=UnicodeString(pair.input, -1, US_INV).unescape(); 1443 UnicodeString expected=UnicodeString(pair.expected, -1, US_INV).unescape(); 1473 const StringPair &pair=pairs[i]; local 1474 UnicodeString input=UnicodeString(pair.input, -1, US_INV).unescape(); 1475 UnicodeString expected=UnicodeString(pair.expected, -1, US_INV).unescape();
|
/external/linux-tools-perf/src/tools/perf/ |
H A D | builtin-diff.c | 226 static double compute_delta(struct hist_entry *he, struct hist_entry *pair) argument 229 double new_percent = period_percent(pair, pair->stat.period); 231 pair->diff.period_ratio_delta = new_percent - old_percent; 232 pair->diff.computed = true; 233 return pair->diff.period_ratio_delta; 236 static double compute_ratio(struct hist_entry *he, struct hist_entry *pair) argument 239 double new_period = pair->stat.period; 241 pair->diff.computed = true; 242 pair 246 compute_wdiff(struct hist_entry *he, struct hist_entry *pair) argument 258 formula_delta(struct hist_entry *he, struct hist_entry *pair, char *buf, size_t size) argument 268 formula_ratio(struct hist_entry *he, struct hist_entry *pair, char *buf, size_t size) argument 277 formula_wdiff(struct hist_entry *he, struct hist_entry *pair, char *buf, size_t size) argument 288 formula_fprintf(struct hist_entry *he, struct hist_entry *pair, char *buf, size_t size) argument 378 struct hist_entry *pair; local 431 struct hist_entry *he, *pair; local 784 hpp__entry_pair(struct hist_entry *he, struct hist_entry *pair, int idx, char *buf, size_t size) argument 847 struct hist_entry *pair = get_pair_fmt(he, dfmt); local [all...] |
/external/lzma/CPP/7zip/UI/Common/ |
H A D | LoadCodecs.cpp | 329 const CIconPair &pair = IconPairs[i];
local 330 if (ext.CompareNoCase(pair.Ext) == 0)
332 iconIndex = pair.IconIndex;
|
H A D | ArchiveCommandLine.cpp | 474 NWildcard::CPair &pair = censor.Pairs[i];
local 475 ConvertToLongNames(pair.Prefix, pair.Head);
748 const CCodePagePair &pair = g_CodePagePairs[i];
local 749 if (name.Compare(pair.Name) == 0)
750 return pair.CodePage;
|
/external/v8/test/cctest/ |
H A D | test-regexp.cc | 141 MinMaxPair pair = { min_match, max_match }; local 142 return pair;
|
/external/harfbuzz_ng/src/ |
H A D | hb-ot-layout-gpos-table.hh | 566 * pair--first glyph is listed in the 717 * in the pair--may be zero (0) */ 720 * in the pair--may be zero (0) */ 807 * first glyph of the pair--may be zero 810 * second glyph of the pair--may be 815 * the first glyph of the pair */ 819 * the second glyph of the pair */ 1404 case Pair: return TRACE_RETURN (u.pair.dispatch (c)); 1422 case Pair: return TRACE_RETURN (u.pair.sanitize (c)); 1440 PairPos pair; member in union:OT::PosLookupSubTable::__anon5418 [all...] |
/external/icu/icu4c/source/tools/gennorm2/ |
H A D | n2builder.cpp | 378 // Insert (trail, composite) pair into compositions list for the lead character. 385 i=0; // "insert" the first pair at index 0 641 // A Jamo leading consonant or an LV pair combines-forward if it is at the end, 768 const CompositionPair &pair=pairs[i]; local 770 UChar32 compositeAndFwd=pair.composite<<1; 771 if(getNormRef(pair.composite).compositions!=NULL) { 776 if(pair.trail<Normalizer2Impl::COMP_1_TRAIL_LIMIT) { 778 firstUnit=pair.trail<<1; 782 firstUnit=(pair.trail<<1)|Normalizer2Impl::COMP_1_TRIPLE; 788 (pair [all...] |
/external/icu/icu4c/source/tools/tzcode/ |
H A D | tz2icu.cpp | 911 bool isNotSet(const pair<const string,FinalRule>& p) { 919 bool mapsToUnknownRule(const pair<const string,FinalZone>& p) { 931 void insertRuleID(const pair<string,FinalRule>& p) { argument 935 void eraseRuleID(const pair<string,FinalZone>& p) { argument 1404 void mergeFinalZone(const pair<string,FinalZone>& p) { argument
|
/external/ipsec-tools/src/racoon/ |
H A D | ipsec_doi.c | 184 struct prop_pair **pair; local 186 /* get proposal pair */ 187 pair = get_proppair(sa, IPSECDOI_TYPE_PH1); 188 if (pair == NULL) 192 newsa = get_ph1approval(iph1, pair); 194 free_proppair(pair); 209 get_ph1approval(iph1, pair) 211 struct prop_pair **pair; 225 if (pair[i] == NULL) 227 for (s = pair[ 892 struct prop_pair **pair; local 1290 struct prop_pair **pair = NULL; local 1635 struct prop_pair **pair, *p; local 1695 struct prop_pair **pair = NULL; local [all...] |
/external/linux-tools-perf/src/tools/perf/ui/browsers/ |
H A D | hists.c | 622 struct hist_entry *pair; local 630 list_for_each_entry(pair, &he->pairs.head, pairs.node) { 631 u64 period = get_field(pair); 632 u64 total = pair->hists->stats.total_period; 637 evsel = hists_to_evsel(pair->hists);
|
/external/openfst/src/include/fst/ |
H A D | replace.h | 31 using std::pair; using std::make_pair; 60 // ReplaceStateTable(const vector<pair<Label, const Fst<A>*> > &fst_tuples, 185 const vector<pair<Label, const Fst<A>*> > &fst_tuples, 254 const vector<pair<Label, const Fst<A>*> > &fst_tuples, 341 ReplaceFstImpl(const vector< pair<Label, const Fst<A>* > >& fst_tuples, argument 933 // Note that the constructor uses a vector of pair<>. These correspond 970 ReplaceFst(const vector<pair<Label, const Fst<A>* > >& fst_array, 974 ReplaceFst(const vector<pair<Label, const Fst<A>* > >& fst_array, 1432 // input argument is a vector of pair<>. These correspond to the tuple 1435 void Replace(const vector<pair<typenam [all...] |
/external/openssh/ |
H A D | monitor.c | 1907 int pair[2]; local 1909 if (socketpair(AF_UNIX, SOCK_STREAM, 0, pair) == -1) 1911 FD_CLOSEONEXEC(pair[0]); 1912 FD_CLOSEONEXEC(pair[1]); 1913 mon->m_recvfd = pair[0]; 1914 mon->m_sendfd = pair[1]; 1917 if (pipe(pair) == -1) 1919 FD_CLOSEONEXEC(pair[0]); 1920 FD_CLOSEONEXEC(pair[1]); 1921 mon->m_log_recvfd = pair[ [all...] |
/external/v8/src/compiler/ |
H A D | ast-graph-builder.cc | 695 Node* pair = local 697 Node* value = NewNode(common()->Projection(0), pair); 698 Node* should_filter = NewNode(common()->Projection(1), pair); 953 // for each pair of corresponding getters and setters. 1212 Node* pair = NewNode(op, current_context(), name); local 1213 callee_value = NewNode(common()->Projection(0), pair); 1214 receiver_value = NewNode(common()->Projection(1), pair); 1274 Node* pair = local 1276 Node* new_callee = NewNode(common()->Projection(0), pair); 1277 Node* new_receiver = NewNode(common()->Projection(1), pair); 1820 Node* pair = NewNode(op, current_context(), name); local [all...] |
/external/valgrind/VEX/priv/ |
H A D | guest_x86_helpers.c | 1579 ULong pair; local 1611 pair = x86g_check_fldcw ( (UInt)fpucw ); 1612 fpround = (UInt)pair; 1613 ew = (VexEmNote)(pair >> 32);
|