| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| DepthFirstIterator.h | 73 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N) ; } function in struct:llvm::df_iterator_default_set
75 void insert(IterT Begin, IterT End) { BaseSet::insert(Begin,End); } function in struct:llvm::df_iterator_default_set
103 this->Visited.insert(Node);
109 if (this->Visited.insert(Node).second)
131 if (this->Visited.insert(Next).second) {
|
| EquivalenceClasses.h | 27 /// supports three efficient operations: insert an element into a class of its
40 /// EC.unionSets(1, 2); // insert 1, 2 into the same set
41 /// EC.insert(4); EC.insert(5); // insert 4, 5 into own sets
132 member_iterator LeaderIt = member_begin(insert(*MI));
134 unionSets(LeaderIt, member_begin(insert(*MI)));
180 member_iterator MI = findLeader(insert(V));
197 /// insert - Insert a new value into the union/find set, ignoring the reques
199 iterator insert(const ElemTy &Data) { function in class:llvm::EquivalenceClasses
[all...] |
| ScopedHashTable.h | 17 // HT.insert(0, 0);
18 // HT.insert(1, 1);
21 // HT.insert(0, 42);
193 void insert(const K &Key, const V &Val) { function in class:llvm::ScopedHashTable
212 /// (possibly not the current) scope. While it is ok to insert into a scope
213 /// that isn't the current one, it isn't ok to insert *underneath* an existing
|
| simple_ilist.h | 31 /// insert(). These all take values by reference (not by pointer), except for
32 /// the range version of \a insert().
139 /// Insert a node at the front; never copies.
140 void push_front(reference Node) { insert(begin(), Node); }
142 /// Insert a node at the back; never copies.
143 void push_back(reference Node) { insert(end(), Node); }
154 /// Insert a node by reference; never copies.
155 iterator insert(iterator I, reference Node) { function in class:llvm::simple_ilist
160 /// Insert a range of nodes; never copies.
162 void insert(iterator I, Iterator First, Iterator Last) function in class:llvm::simple_ilist
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/MC/ |
| MCInst.h | 189 iterator insert(iterator I, const MCOperand &Op) { function in class:llvm::MCInst
190 return Operands.insert(I, Op);
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 393 InNeighbors[I.second].insert(I.first);
394 OutNeighbors[I.first].insert(I.second);
449 insert(const std::pair<VertexIdentifier, VertexAttribute> &Val) { function in class:llvm::xray::Graph
450 return Vertices.insert(Val);
454 insert(std::pair<VertexIdentifier, VertexAttribute> &&Val) { function in class:llvm::xray::Graph
455 return Vertices.insert(std::move(Val));
462 insert(const std::pair<EdgeIdentifier, EdgeAttribute> &Val) { function in class:llvm::xray::Graph
463 const auto &p = Edges.insert(Val);
468 InNeighbors[EI.second].insert(EI.first);
469 OutNeighbors[EI.first].insert(EI.second)
479 insert(std::pair<EdgeIdentifier, EdgeAttribute> &&Val) { function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/clang/AST/ |
| ASTVector.h | 216 iterator insert(const ASTContext &C, iterator I, const T &Elt) { function in class:clang::ASTVector
237 iterator insert(const ASTContext &C, iterator I, size_type NumToInsert, function in class:clang::ASTVector
280 // Insert the non-overwritten middle part.
286 iterator insert(const ASTContext &C, iterator I, ItTy From, ItTy To) { function in class:clang::ASTVector
333 // Insert the non-overwritten middle part.
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/clang/Analysis/Support/ |
| BumpVector.h | 165 /// insert - Insert some number of copies of element into a position. Return
167 iterator insert(iterator I, size_t Cnt, const_reference E, function in class:clang::BumpVector
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| EquivalenceClasses.h | 27 /// supports three efficient operations: insert an element into a class of its
40 /// EC.unionSets(1, 2); // insert 1, 2 into the same set
41 /// EC.insert(4); EC.insert(5); // insert 4, 5 into own sets
133 member_iterator LeaderIt = member_begin(insert(*MI));
135 unionSets(LeaderIt, member_begin(insert(*MI)));
181 member_iterator MI = findLeader(insert(V));
198 /// insert - Insert a new value into the union/find set, ignoring the reques
200 iterator insert(const ElemTy &Data) { function in class:llvm::EquivalenceClasses
[all...] |
| ScopedHashTable.h | 17 // HT.insert(0, 0);
18 // HT.insert(1, 1);
21 // HT.insert(0, 42);
195 void insert(const K &Key, const V &Val) { function in class:llvm::ScopedHashTable
214 /// (possibly not the current) scope. While it is ok to insert into a scope
215 /// that isn't the current one, it isn't ok to insert *underneath* an existing
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/MC/ |
| MCInst.h | 190 iterator insert(iterator I, const MCOperand &Op) { function in class:llvm::MCInst
191 return Operands.insert(I, Op);
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/XRay/ |
| Graph.h | 393 InNeighbors[I.second].insert(I.first);
394 OutNeighbors[I.first].insert(I.second);
449 insert(const std::pair<VertexIdentifier, VertexAttribute> &Val) { function in class:llvm::xray::Graph
450 return Vertices.insert(Val);
454 insert(std::pair<VertexIdentifier, VertexAttribute> &&Val) { function in class:llvm::xray::Graph
455 return Vertices.insert(std::move(Val));
462 insert(const std::pair<EdgeIdentifier, EdgeAttribute> &Val) { function in class:llvm::xray::Graph
463 const auto &p = Edges.insert(Val);
468 InNeighbors[EI.second].insert(EI.first);
469 OutNeighbors[EI.first].insert(EI.second)
479 insert(std::pair<EdgeIdentifier, EdgeAttribute> &&Val) { function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/clang/AST/ |
| ASTVector.h | 216 iterator insert(const ASTContext &C, iterator I, const T &Elt) { function in class:clang::ASTVector
237 iterator insert(const ASTContext &C, iterator I, size_type NumToInsert, function in class:clang::ASTVector
280 // Insert the non-overwritten middle part.
286 iterator insert(const ASTContext &C, iterator I, ItTy From, ItTy To) { function in class:clang::ASTVector
333 // Insert the non-overwritten middle part.
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/clang/Analysis/Support/ |
| BumpVector.h | 165 /// insert - Insert some number of copies of element into a position. Return
167 iterator insert(iterator I, size_t Cnt, const_reference E, function in class:clang::BumpVector
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| EquivalenceClasses.h | 27 /// supports three efficient operations: insert an element into a class of its
40 /// EC.unionSets(1, 2); // insert 1, 2 into the same set
41 /// EC.insert(4); EC.insert(5); // insert 4, 5 into own sets
133 member_iterator LeaderIt = member_begin(insert(*MI));
135 unionSets(LeaderIt, member_begin(insert(*MI)));
181 member_iterator MI = findLeader(insert(V));
198 /// insert - Insert a new value into the union/find set, ignoring the reques
200 iterator insert(const ElemTy &Data) { function in class:llvm::EquivalenceClasses
[all...] |
| ScopedHashTable.h | 17 // HT.insert(0, 0);
18 // HT.insert(1, 1);
21 // HT.insert(0, 42);
195 void insert(const K &Key, const V &Val) { function in class:llvm::ScopedHashTable
214 /// (possibly not the current) scope. While it is ok to insert into a scope
215 /// that isn't the current one, it isn't ok to insert *underneath* an existing
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/MC/ |
| MCInst.h | 190 iterator insert(iterator I, const MCOperand &Op) { function in class:llvm::MCInst
191 return Operands.insert(I, Op);
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/XRay/ |
| Graph.h | 393 InNeighbors[I.second].insert(I.first);
394 OutNeighbors[I.first].insert(I.second);
449 insert(const std::pair<VertexIdentifier, VertexAttribute> &Val) { function in class:llvm::xray::Graph
450 return Vertices.insert(Val);
454 insert(std::pair<VertexIdentifier, VertexAttribute> &&Val) { function in class:llvm::xray::Graph
455 return Vertices.insert(std::move(Val));
462 insert(const std::pair<EdgeIdentifier, EdgeAttribute> &Val) { function in class:llvm::xray::Graph
463 const auto &p = Edges.insert(Val);
468 InNeighbors[EI.second].insert(EI.first);
469 OutNeighbors[EI.first].insert(EI.second)
479 insert(std::pair<EdgeIdentifier, EdgeAttribute> &&Val) { function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/clang/AST/ |
| ASTVector.h | 216 iterator insert(const ASTContext &C, iterator I, const T &Elt) { function in class:clang::ASTVector
237 iterator insert(const ASTContext &C, iterator I, size_type NumToInsert, function in class:clang::ASTVector
280 // Insert the non-overwritten middle part.
286 iterator insert(const ASTContext &C, iterator I, ItTy From, ItTy To) { function in class:clang::ASTVector
333 // Insert the non-overwritten middle part.
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/clang/Analysis/Support/ |
| BumpVector.h | 165 /// insert - Insert some number of copies of element into a position. Return
167 iterator insert(iterator I, size_t Cnt, const_reference E, function in class:clang::BumpVector
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| EquivalenceClasses.h | 27 /// supports three efficient operations: insert an element into a class of its
40 /// EC.unionSets(1, 2); // insert 1, 2 into the same set
41 /// EC.insert(4); EC.insert(5); // insert 4, 5 into own sets
133 member_iterator LeaderIt = member_begin(insert(*MI));
135 unionSets(LeaderIt, member_begin(insert(*MI)));
181 member_iterator MI = findLeader(insert(V));
198 /// insert - Insert a new value into the union/find set, ignoring the reques
200 iterator insert(const ElemTy &Data) { function in class:llvm::EquivalenceClasses
[all...] |
| ScopedHashTable.h | 17 // HT.insert(0, 0);
18 // HT.insert(1, 1);
21 // HT.insert(0, 42);
195 void insert(const K &Key, const V &Val) { function in class:llvm::ScopedHashTable
214 /// (possibly not the current) scope. While it is ok to insert into a scope
215 /// that isn't the current one, it isn't ok to insert *underneath* an existing
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/GlobalISel/ |
| RegBankSelect.h | 110 /// before we actually need to insert something.
113 /// Tell if the insert point has already been materialized.
147 /// MachineBasicBlock::insert. I.e., additional code happens
166 /// MachineBasicBlock::insert and ::getPoint. The new code should
179 /// Insert \p MI in the just before ::getPoint()
180 MachineBasicBlock::iterator insert(MachineInstr &MI) { function in class:llvm::RegBankSelect::InsertPoint
181 return getInsertMBB().insert(getPoint(), &MI);
257 // If we try to insert before phis, we should use the insertion
261 // If we try to insert after the terminators, we should use the
321 Insert,
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/MC/ |
| MCInst.h | 197 iterator insert(iterator I, const MCOperand &Op) { function in class:llvm::MCInst
198 return Operands.insert(I, Op);
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/XRay/ |
| Graph.h | 393 InNeighbors[I.second].insert(I.first);
394 OutNeighbors[I.first].insert(I.second);
449 insert(const std::pair<VertexIdentifier, VertexAttribute> &Val) { function in class:llvm::xray::Graph
450 return Vertices.insert(Val);
454 insert(std::pair<VertexIdentifier, VertexAttribute> &&Val) { function in class:llvm::xray::Graph
455 return Vertices.insert(std::move(Val));
462 insert(const std::pair<EdgeIdentifier, EdgeAttribute> &Val) { function in class:llvm::xray::Graph
463 const auto &p = Edges.insert(Val);
468 InNeighbors[EI.second].insert(EI.first);
469 OutNeighbors[EI.first].insert(EI.second)
479 insert(std::pair<EdgeIdentifier, EdgeAttribute> &&Val) { function in class:llvm::xray::Graph
[all...] |
