| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/Scalar/ |
| JumpThreading.h | 37 typedef SmallVectorImpl<std::pair<Constant *, BasicBlock *>> PredValueInfo;
38 typedef SmallVector<std::pair<Constant *, BasicBlock *>, 8> PredValueInfoTy;
74 DenseSet<std::pair<Value *, BasicBlock *>> RecursionSet;
80 DenseSet<std::pair<Value *, BasicBlock *>> &TheSet;
81 std::pair<Value *, BasicBlock *> ThePair;
83 RecursionSetRemover(DenseSet<std::pair<Value *, BasicBlock *>> &S,
84 std::pair<Value *, BasicBlock *> P)
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Transforms/Scalar/ |
| JumpThreading.h | 52 using PredValueInfo = SmallVectorImpl<std::pair<Constant *, BasicBlock *>>;
53 using PredValueInfoTy = SmallVector<std::pair<Constant *, BasicBlock *>, 8>;
89 DenseSet<std::pair<Value *, BasicBlock *>> RecursionSet;
95 DenseSet<std::pair<Value *, BasicBlock *>> &TheSet;
96 std::pair<Value *, BasicBlock *> ThePair;
98 RecursionSetRemover(DenseSet<std::pair<Value *, BasicBlock *>> &S,
99 std::pair<Value *, BasicBlock *> P)
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Transforms/Scalar/ |
| JumpThreading.h | 52 using PredValueInfo = SmallVectorImpl<std::pair<Constant *, BasicBlock *>>;
53 using PredValueInfoTy = SmallVector<std::pair<Constant *, BasicBlock *>, 8>;
89 DenseSet<std::pair<Value *, BasicBlock *>> RecursionSet;
95 DenseSet<std::pair<Value *, BasicBlock *>> &TheSet;
96 std::pair<Value *, BasicBlock *> ThePair;
98 RecursionSetRemover(DenseSet<std::pair<Value *, BasicBlock *>> &S,
99 std::pair<Value *, BasicBlock *> P)
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/Scalar/ |
| JumpThreading.h | 52 using PredValueInfo = SmallVectorImpl<std::pair<Constant *, BasicBlock *>>;
53 using PredValueInfoTy = SmallVector<std::pair<Constant *, BasicBlock *>, 8>;
89 DenseSet<std::pair<Value *, BasicBlock *>> RecursionSet;
95 DenseSet<std::pair<Value *, BasicBlock *>> &TheSet;
96 std::pair<Value *, BasicBlock *> ThePair;
98 RecursionSetRemover(DenseSet<std::pair<Value *, BasicBlock *>> &S,
99 std::pair<Value *, BasicBlock *> P)
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Transforms/Scalar/ |
| JumpThreading.h | 52 using PredValueInfo = SmallVectorImpl<std::pair<Constant *, BasicBlock *>>;
53 using PredValueInfoTy = SmallVector<std::pair<Constant *, BasicBlock *>, 8>;
89 DenseSet<std::pair<Value *, BasicBlock *>> RecursionSet;
95 DenseSet<std::pair<Value *, BasicBlock *>> &TheSet;
96 std::pair<Value *, BasicBlock *> ThePair;
98 RecursionSetRemover(DenseSet<std::pair<Value *, BasicBlock *>> &S,
99 std::pair<Value *, BasicBlock *> P)
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/utility/pairs/pairs.pair/ |
| const_first_const_second.pass.cpp | 14 // template <class T1, class T2> struct pair
16 // pair(const T1& x, const T2& y);
40 using P1 = std::pair<T1, int>;
41 using P2 = std::pair<int, T1>;
53 typedef std::pair<float, short*> P;
59 typedef std::pair<ImplicitT, int> P;
76 typedef std::pair<float, short*> P;
82 using P = std::pair<ExplicitT, int>;
90 using P = std::pair<ImplicitT, int>;
|
| assign_rv_pair.pass.cpp | 14 // template <class T1, class T2> struct pair
16 // pair& operator=(pair&& p);
52 typedef std::pair<std::unique_ptr<int>, short> P;
60 using P = std::pair<int&, int&&>;
72 using P = std::pair<int, NonAssignable>;
78 using P = std::pair<CountAssign, CopyAssignable>;
88 using P = std::pair<CountAssign, MoveAssignable>;
|
| const_pair_U_V.pass.cpp | 14 // template <class T1, class T2> struct pair
16 // template <class U, class V> EXPLICIT constexpr pair(const pair<U, V>& p);
29 using P1 = std::pair<T1, int>;
30 using P2 = std::pair<int, T1>;
31 using UP1 = std::pair<U1, int> const&;
32 using UP2 = std::pair<int, U1> const&;
40 struct DPair : public std::pair<T, U> {
41 using Base = std::pair<T, U>;
60 typedef std::pair<int, short> P1
[all...] |
| /external/libevent/test/ |
| regress_et.c | 82 evutil_socket_t pair[2] = {-1,-1}; local
92 if (evutil_ersatz_socketpair_(AF_INET, SOCK_STREAM, 0, pair) == -1) {
96 if (evutil_socketpair(LOCAL_SOCKETPAIR_AF, SOCK_STREAM, 0, pair) == -1) {
103 tt_int_op(send(pair[0], test, (int)strlen(test)+1, 0), >, 0);
104 shutdown(pair[0], EVUTIL_SHUT_WR);
121 ev = event_new(base, pair[1], EV_READ|EV_ET|EV_PERSIST, read_cb, &ev);
126 * will read a single byte from pair[1] in either case. If we're edge
150 evutil_closesocket(pair[0]);
151 evutil_closesocket(pair[1]);
172 ev_et = event_new(base, data->pair[0], EV_READ|EV_ET, read_cb, ev_et)
[all...] |
| /external/lzma/CPP/7zip/UI/FileManager/ |
| SysIconUtils.cpp | 187 CAttribIconPair pair;
local
193 , attrib, pair.IconIndex
194 // , pair.TypeName
203 pair.Attrib = attrib;
204 _attribMap.Insert(insertPos, pair);
205 // if (typeName) *typeName = pair.TypeName;
206 return pair.IconIndex;
242 CExtIconPair pair;
local
243 pair.Ext = ext;
244 GetRealIconIndex(us2fs(fileName + dotPos), attrib, pair.IconIndex);
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/std/ |
| std_map.i | 67 class _Alloc = allocator<std::pair<const _Key, _Tp > > >
74 typedef std::pair<const _Key, _Tp> value_type;
85 %fragment(SWIG_Traits_frag(std::pair< _Key, _Tp >), "header",
90 template <> struct traits<std::pair< _Key, _Tp > > {
93 return "std::pair<" #_Key "," #_Tp " >";
100 fragment=SWIG_Traits_frag(std::pair<_Key, _Tp >),
|
| /external/autotest/server/tests/netperf2/ |
| netperf2.py | 7 def run_once(self, pair, test, time, stream_list, cycles):
8 print "running on %s and %s\n" % (pair[0], pair[1])
13 server = hosts.create_host(pair[0])
14 client = hosts.create_host(pair[1])
|
| /external/autotest/server/tests/netpipe/ |
| netpipe.py | 7 def run_once(self, pair, buffer, upper_bound, variance):
8 print "running on %s and %s\n" % (pair[0], pair[1])
13 server = hosts.create_host(pair[0])
14 client = hosts.create_host(pair[1])
|
| /external/clang/test/SemaCXX/ |
| implicit-member-functions.cpp | 88 template<typename T, typename U> struct pair { struct in namespace:Recursion
89 pair();
93 pair(const pair<V,W> &);
107 pair<Point<K>, Vector<K>> x;
111 // pair's templated constructor, which triggers instantiation of the
|
| /external/libbrillo/brillo/message_loops/ |
| fake_message_loop.h | 78 std::pair<base::Time, MessageLoop::TaskId>,
79 std::vector<std::pair<base::Time, MessageLoop::TaskId>>,
80 std::greater<std::pair<base::Time, MessageLoop::TaskId>>> fire_order_;
82 // The bag of watched (fd, mode) pair associated with the TaskId that's
84 std::multimap<std::pair<int, WatchMode>, MessageLoop::TaskId> fds_watched_;
87 std::set<std::pair<int, WatchMode>> fds_ready_;
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| equal_range_const.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
16 // pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
29 typedef std::pair<int, std::string> P;
42 std::pair<I, I> r = c.equal_range(30);
52 min_allocator<std::pair<const int, std::string>>> C;
54 typedef std::pair<int, std::string> P;
67 std::pair<I, I> r = c.equal_range(30);
|
| equal_range_non_const.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
16 // pair<iterator, iterator> equal_range(const key_type& k);
29 typedef std::pair<int, std::string> P;
42 std::pair<I, I> r = c.equal_range(30);
52 min_allocator<std::pair<const int, std::string>>> C;
54 typedef std::pair<int, std::string> P;
67 std::pair<I, I> r = c.equal_range(30);
|
| /external/libcxx/test/std/utilities/utility/pairs/pairs.pair/ |
| assign_rv_pair.pass.cpp | 14 // template <class T1, class T2> struct pair
16 // pair& operator=(pair&& p);
52 typedef std::pair<std::unique_ptr<int>, short> P;
60 using P = std::pair<int&, int&&>;
72 using P = std::pair<int, NonAssignable>;
78 using P = std::pair<CountAssign, CopyAssignable>;
88 using P = std::pair<CountAssign, MoveAssignable>;
|
| const_pair_U_V.pass.cpp | 14 // template <class T1, class T2> struct pair
16 // template <class U, class V> EXPLICIT constexpr pair(const pair<U, V>& p);
29 using P1 = std::pair<T1, int>;
30 using P2 = std::pair<int, T1>;
31 using UP1 = std::pair<U1, int> const&;
32 using UP2 = std::pair<int, U1> const&;
40 struct DPair : public std::pair<T, U> {
41 using Base = std::pair<T, U>;
60 typedef std::pair<int, short> P1
[all...] |
| /frameworks/base/core/java/android/app/usage/ |
| CacheQuotaService.java | 30 import android.util.Pair;
79 final Pair<RemoteCallback, List<CacheQuotaHint>> pair = local
80 Pair.create(callback, requests);
81 Message msg = mHandler.obtainMessage(ServiceHandler.MSG_SEND_LIST, pair);
98 final Pair<RemoteCallback, List<CacheQuotaHint>> pair = local
99 (Pair<RemoteCallback, List<CacheQuotaHint>>) msg.obj;
100 List<CacheQuotaHint> processed = onComputeCacheQuotaHints(pair.second);
104 final RemoteCallback callback = pair.first
[all...] |
| /hardware/interfaces/compatibility_matrices/ |
| compatibility_matrix.mk | 82 $(GEN): $(foreach pair,$(PRIVATE_KERNEL_CONFIG_DATA_PATHS),\
83 $(wildcard $(call word-colon,2,$(pair))/android-base*.cfg))
84 $(GEN): PRIVATE_FLAGS += $(foreach pair,$(PRIVATE_KERNEL_CONFIG_DATA_PATHS),\
85 --kernel=$(call word-colon,1,$(pair)):$(call normalize-path-list,\
86 $(wildcard $(call word-colon,2,$(pair))/android-base*.cfg)))
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/ |
| equal_range_const.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
16 // pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
29 typedef std::pair<int, std::string> P;
42 std::pair<I, I> r = c.equal_range(30);
52 min_allocator<std::pair<const int, std::string>>> C;
54 typedef std::pair<int, std::string> P;
67 std::pair<I, I> r = c.equal_range(30);
|
| equal_range_non_const.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
16 // pair<iterator, iterator> equal_range(const key_type& k);
29 typedef std::pair<int, std::string> P;
42 std::pair<I, I> r = c.equal_range(30);
52 min_allocator<std::pair<const int, std::string>>> C;
54 typedef std::pair<int, std::string> P;
67 std::pair<I, I> r = c.equal_range(30);
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| move.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
39 test_allocator<std::pair<const int, std::string> >
44 test_allocator<std::pair<const int, std::string> >(10)
52 (test_allocator<std::pair<const int, std::string> >(10)));
65 test_allocator<std::pair<const int, std::string> >
67 typedef std::pair<int, std::string> P;
81 test_allocator<std::pair<const int, std::string> >(10)
93 (test_allocator<std::pair<const int, std::string> >(10)));
106 min_allocator<std::pair<const int, std::string> >
111 min_allocator<std::pair<const int, std::string> >(
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| move.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>>
39 test_allocator<std::pair<const int, std::string> >
44 test_allocator<std::pair<const int, std::string> >(10)
52 (test_allocator<std::pair<const int, std::string> >(10)));
65 test_allocator<std::pair<const int, std::string> >
67 typedef std::pair<int, std::string> P;
81 test_allocator<std::pair<const int, std::string> >(10)
93 (test_allocator<std::pair<const int, std::string> >(10)));
106 min_allocator<std::pair<const int, std::string> >
111 min_allocator<std::pair<const int, std::string> >(
[all...] |
