| /ndk/sources/cxx-stl/llvm-libc++/test/iterators/iterator.primitives/iterator.traits/ |
| const_pointer.pass.cpp | 29 typedef std::iterator_traits<const A*> It;
30 static_assert((std::is_same<It::difference_type, std::ptrdiff_t>::value), "");
31 static_assert((std::is_same<It::value_type, A>::value), "");
32 static_assert((std::is_same<It::pointer, const A*>::value), "");
33 static_assert((std::is_same<It::reference, const A&>::value), "");
34 static_assert((std::is_same<It::iterator_category, std::random_access_iterator_tag>::value), "");
|
| empty.pass.cpp | 25 typedef std::iterator_traits<not_an_iterator> It;
|
| pointer.pass.cpp | 29 typedef std::iterator_traits<A*> It;
30 static_assert((std::is_same<It::difference_type, std::ptrdiff_t>::value), "");
31 static_assert((std::is_same<It::value_type, A>::value), "");
32 static_assert((std::is_same<It::pointer, A*>::value), "");
33 static_assert((std::is_same<It::reference, A&>::value), "");
34 static_assert((std::is_same<It::iterator_category, std::random_access_iterator_tag>::value), "");
|
| iterator.pass.cpp | 38 typedef std::iterator_traits<test_iterator> It;
39 static_assert((std::is_same<It::difference_type, int>::value), "");
40 static_assert((std::is_same<It::value_type, A>::value), "");
41 static_assert((std::is_same<It::pointer, A*>::value), "");
42 static_assert((std::is_same<It::iterator_category, std::forward_iterator_tag>::value), "");
|
| /ndk/sources/cxx-stl/llvm-libc++/test/iterators/iterator.primitives/iterator.basic/ |
| iterator.pass.cpp | 32 typedef std::iterator<std::forward_iterator_tag, T> It;
33 static_assert((std::is_same<typename It::value_type, T>::value), "");
34 static_assert((std::is_same<typename It::difference_type, std::ptrdiff_t>::value), "");
35 static_assert((std::is_same<typename It::pointer, T*>::value), "");
36 static_assert((std::is_same<typename It::reference, T&>::value), "");
37 static_assert((std::is_same<typename It::iterator_category, std::forward_iterator_tag>::value), "");
44 typedef std::iterator<std::bidirectional_iterator_tag, T, short> It;
45 static_assert((std::is_same<typename It::value_type, T>::value), "");
46 static_assert((std::is_same<typename It::difference_type, short>::value), "");
47 static_assert((std::is_same<typename It::pointer, T*>::value), "")
[all...] |
| /external/stlport/test/compiler/StTerm-order/ |
| stterm-test.cc | 19 It ctor done <-- 0
23 It dtor done <-- 0
32 It ctor done <-- 0
38 It dtor done <-- 0
66 class It
69 It();
70 ~It();
89 static It it; local
104 It::It(
[all...] |
| /external/chromium/chrome/browser/chromeos/login/ |
| signed_settings_temp_storage_unittest.cc | 45 typedef std::map<std::string, std::string>::iterator It;
46 std::vector<It> a_list;
47 for (It it = ref_map_.begin(); it != ref_map_.end(); ++it) {
48 a_list.push_back(it);
51 std::vector<It> b_list(a_list);
|
| /external/clang/test/SemaTemplate/ |
| overload-uneval.cpp | 28 class It
34 inline bool operator!=(const It &o) const { return i !=
40 Wibble<void*>::It a, b;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| multiseq_selection.h | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
134 It;
135 typedef typename std::iterator_traits<It>::difference_type
137 typedef typename std::iterator_traits<It>::value_type value_type;
383 It;
384 typedef typename std::iterator_traits<It>::difference_type
|
| /dalvik/vm/alloc/ |
| Visit.cpp | 73 typedef IndirectRefTable::iterator It; // TODO: C++0x auto
74 for (It it = table->begin(), end = table->end(); it != end; ++it) {
75 (*visitor)(*it, threadId, type, arg);
132 * Register is marked as live, it's a valid root.
|
| MarkSweep.cpp | 405 * referent has not yet been marked, put it on the appropriate list in
683 /* Referent is white and biased toward saving, mark it. */
688 /* Referent is white, queue it for clearing. */
714 /* Referent is white, clear it. */
757 * it as finalizable.
759 * This is called when Object.<init> completes normally. It's also
889 typedef IndirectRefTable::iterator It; // TODO: C++0x auto
890 for (It it = table->begin(), end = table->end(); it != end; ++it)
[all...] |
| /external/clang/include/clang/AST/ |
| DeclLookups.h | 27 StoredDeclsMap::iterator It, End;
36 all_lookups_iterator(StoredDeclsMap::iterator It,
38 : It(It), End(End) {}
40 reference operator*() const { return It->second.getLookupResult(); }
41 pointer operator->() const { return It->second.getLookupResult(); }
46 // should not expect to get them (or worse, rely on it).
48 ++It;
49 } while (It != End &&
50 It->first == DeclarationName::getUsingDirectiveName())
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineWorklist.h | 36 /// Add - Add the specified instruction to the worklist if it isn't already
37 /// in it.
65 // Remove - remove I from the worklist if it exists.
67 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
68 if (It == WorklistMap.end()) return; // Not in worklist.
71 Worklist[It->second] = 0;
73 WorklistMap.erase(It);
95 /// the map if it is large.
|
| InstCombineLoadStoreAlloca.cpp | 42 /// track of whether it moves the pointer (with IsOffset) but otherwise traverse
70 // If the GEP has all zero indices, it doesn't offset the pointer. If it
71 // doesn't, it does.
79 // If this is the function being called then we treat it like a load and
80 // ignore it.
84 // If this is a readonly/readnone call site, then we know it is just a
86 // ignore it if we know that the value isn't captured.
93 // copy, so it is only a read of the alloca.
108 // If this is isn't our memcpy/memmove, reject it as something we can'
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsSEISelLowering.cpp | 125 // -reloction-model=pic or it is an indirect call.
156 MachineFunction::iterator It = llvm::next(MachineFunction::iterator(BB));
161 F->insert(It, FBB);
162 F->insert(It, TBB);
163 F->insert(It, Sink);
|
| Mips16ISelLowering.cpp | 214 // cleaner way to do all of this but it will have to wait until the traditional
340 // check if it's complex
381 // qualifier so we will assume that we don't know what kind it is.
398 // -reloction-model=pic or it is an indirect call.
426 MachineFunction::iterator It = BB;
427 ++It;
439 F->insert(It, copy0MBB);
440 F->insert(It, sinkMBB);
489 MachineFunction::iterator It = BB;
490 ++It;
[all...] |
| /external/llvm/include/llvm/ADT/ |
| DepthFirstIterator.h | 22 // it to be more efficient, and allows external clients to use the set for
28 // it to be more efficient, and allows external clients to use the set for
105 ChildItTy &It = Top.second;
108 It = GT::child_begin(Node);
112 while (It != GT::child_end(Node)) {
113 NodeType *Next = *It++;
116 // No, do it now.
|
| /external/llvm/include/llvm/CodeGen/ |
| FunctionLoweringInfo.h | 114 /// TODO: This isn't per-function state, it's per-basic-block state. But
115 /// there's no other convenient place for it to live right now.
161 /// the register's LiveOutInfo is for a smaller bit width, it is extended to
169 // Only install this information if it tells us something.
188 DenseMap<const Value*, unsigned>::const_iterator It = ValueMap.find(PN);
189 if (It == ValueMap.end())
192 unsigned Reg = It->second;
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 10 // This file implements some loop unrolling utilities. It does not define any
45 ValueToValueMapTy::iterator It = VMap.find(Op);
46 if (It != VMap.end())
47 I->setOperand(op, It->second);
52 ValueToValueMapTy::iterator It = VMap.find(PN->getIncomingBlock(i));
53 if (It != VMap.end())
54 PN->setIncomingBlock(i, cast<BasicBlock>(It->second));
59 /// FoldBlockIntoPredecessor - Folds a basic block into its predecessor if it
107 // Inherit predecessor's name if it exists...
134 /// If a LoopPassManager is passed in, and the loop is fully removed, it will b
[all...] |
| /external/clang/tools/arcmt-test/ |
| arcmt-test.cpp | 30 //llvm::cl::desc("Test the result of transformations by parsing it in ARC mode"));
59 // This function isn't referenced outside its translation unit, but it
267 std::map<StringRef, StringRef>::iterator It;
268 It = resultMap.find(sys::path::filename(inputOrigFname));
269 if (It == resultMap.end()) {
276 sys::fs::exists(It->second, exists);
278 errs() << "error: '" << It->second << "' does not exist\n";
287 if (!filesCompareEqual(It->second, inputResultFname)) {
288 errs() << "error: '" << It->second << "' is different than "
293 resultMap.erase(It);
[all...] |
| /external/llvm/include/llvm/Support/ |
| CFG.h | 33 USE_iterator It;
37 while (!It.atEnd() && !isa<TerminatorInst>(*It))
38 ++It;
45 explicit inline PredIterator(Ptr *bb) : It(bb->use_begin()) {
48 inline PredIterator(Ptr *bb, bool) : It(bb->use_end()) {}
50 inline bool operator==(const Self& x) const { return It == x.It; }
54 assert(!It.atEnd() && "pred_iterator out of range!");
55 return cast<TerminatorInst>(*It)->getParent()
[all...] |
| /external/llvm/lib/Analysis/ |
| MemoryDependenceAnalysis.cpp | 11 // operation, what preceding memory operations it depends on. It builds on
83 /// getAnalysisUsage - Does not modify anything. It uses Alias Analysis.
206 // If this inst is a memory op, get the pointer it accessed
219 // If these two calls do not interfere, look past it.
242 // No dependence found. If this is the entry block of the function, it is
243 // unknown, otherwise it is non-local.
275 /// and Size) and compares it against a load. If the specified load could
287 // Load widening is hostile to ThreadSanitizer: it may cause false positives
311 // Get the alignment of the load in bytes. We assume that it is safe to loa
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| Reassociate.cpp | 159 /// opcode and if it only has one use.
211 return 0; // Otherwise it's a global or constant, rank 0.
226 // If this is a not or neg instruction, do not count it for rank. This
273 // and the APInt sum LHS + RHS may not be correct if it wraps (it is correct
275 // and multiplication), so it is important to correctly reduce the combined
357 /// This routine may modify the function, in which case it returns 'true'. The
358 /// changes it makes may well be destructive, changing the value computed by 'I'
388 /// it, and its operands also belong to the expression (but may be leaf nodes).
394 /// RewriteExprTree to put the values back in if the routine indicates that it
[all...] |
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchersInternal.h | 15 // or store the current node as bound to a specific string, so that it can be
26 // The matcher functions are defined in ASTMatchers.h. To make it possible
69 /// The node's base type should be in NodeBaseType or it will be unaccessible.
81 /// it cannot be converted to the specified type.
84 IDToNodeMap::const_iterator It = NodeMap.find(ID);
85 if (It == NodeMap.end()) {
88 return It->second.get<T>();
147 // first benchmarks indicate that it doesn't matter though.
232 /// on the actual node, or return false if it is not convertible.
253 /// type hierarchy instead of spelling it out
[all...] |
| /external/clang/lib/AST/ |
| DeclCXX.cpp | 196 // Add this base if it's not already in the list.
212 // Add this base if it's not already in the list.
252 // declare it and perform overload resolution to determine which function
253 // it actually calls. If it does have a simple move constructor, this
266 // declare it and perform overload resolution to determine which function
267 // it actually calls. If it does have a simple move assignment, this
370 /// that it saw a base class.
401 // A class is abstract if it has at least one pure virtual function
[all...] |
