Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:insert (Results 1151 - 1175 of 1909) sorted by null

<<41424344454647484950>>

/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/
MachineBasicBlock.h	496 /// This is the correct point to insert lowered copies at the beginning of a 501 /// debug. This is the correct point to insert copies at the beginning of a 553 /// Insert MI into the instruction list before I, possibly inside a bundle. 558 /// MIBundleBuilder::insert() for a more reliable way of doing that. 559 instr_iterator insert(instr_iterator I, MachineInstr *M); 561 /// Insert a range of instructions into the instruction list before I. 563 void insert(iterator I, IT S, IT E) { function in class:llvm::MachineBasicBlock 566 Insts.insert(I.getInstrIterator(), S, E); 569 /// Insert MI into the instruction list before I. 570 iterator insert(iterator I, MachineInstr *MI) function in class:llvm::MachineBasicBlock     [all...]
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/
OnDiskHashTable.h	88 /// \brief Insert an item into the appropriate hash bucket. 89 void insert(Bucket *Buckets, size_t Size, Item *E) { function in class:llvm::OnDiskChainedHashTableGenerator 104 insert(NewBuckets, NewSize, E); 114 /// \brief Insert an entry into the table. 115 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator 118 insert(Key, Data, InfoObj); 121 /// \brief Insert an entry into the table. 124 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator 129 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h	413 Impl.insert(N); 419 if (N && !static_cast<ExplodedNode*>(N)->isSink()) Impl.insert(N); 430 void insert(const ExplodedNodeSet &S) { function in class:clang::ento::ExplodedNodeSet 435 Impl.insert(S.begin(), S.end());
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
DenseMap.h	175 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::DenseMapBase 182 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { function in class:llvm::DenseMapBase 196 // Otherwise, insert the new element. 213 // Otherwise, insert the new element. 219 /// Alternate version of insert() which allows a different, and possibly 232 // Otherwise, insert the new element. 239 /// insert - Range insertion of pairs. 241 void insert(InputIt I, InputIt E) { function in class:llvm::DenseMapBase 243 insert(*I); 342 // Insert all the old elements     [all...]
SmallVector.h	464 iterator insert(iterator I, T &&Elt) { function in class:llvm::SmallVectorImpl 494 iterator insert(iterator I, const T &Elt) { function in class:llvm::SmallVectorImpl 523 iterator insert(iterator I, size_type NumToInsert, const T &Elt) { function in class:llvm::SmallVectorImpl 569 // Insert the non-overwritten middle part. 575 iterator insert(iterator I, ItTy From, ItTy To) { function in class:llvm::SmallVectorImpl 626 // Insert the non-overwritten middle part. 631 void insert(iterator I, std::initializer_list<T> IL) { function in class:llvm::SmallVectorImpl 632 insert(I, IL.begin(), IL.end());
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/
OnDiskHashTable.h	88 /// \brief Insert an item into the appropriate hash bucket. 89 void insert(Bucket *Buckets, size_t Size, Item *E) { function in class:llvm::OnDiskChainedHashTableGenerator 104 insert(NewBuckets, NewSize, E); 114 /// \brief Insert an entry into the table. 115 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator 118 insert(Key, Data, InfoObj); 121 /// \brief Insert an entry into the table. 124 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator 129 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
/prebuilts/clang/host/linux-x86/clang-4393122/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h	413 Impl.insert(N); 419 if (N && !static_cast<ExplodedNode*>(N)->isSink()) Impl.insert(N); 430 void insert(const ExplodedNodeSet &S) { function in class:clang::ento::ExplodedNodeSet 435 Impl.insert(S.begin(), S.end());
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/
DenseMap.h	176 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::DenseMapBase 183 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { function in class:llvm::DenseMapBase 197 // Otherwise, insert the new element. 214 // Otherwise, insert the new element. 220 /// Alternate version of insert() which allows a different, and possibly 233 // Otherwise, insert the new element. 240 /// insert - Range insertion of pairs. 242 void insert(InputIt I, InputIt E) { function in class:llvm::DenseMapBase 244 insert(*I); 343 // Insert all the old elements     [all...]
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/
MachineBasicBlock.h	493 /// This is the correct point to insert lowered copies at the beginning of a 498 /// debug. This is the correct point to insert copies at the beginning of a 550 /// Insert MI into the instruction list before I, possibly inside a bundle. 555 /// MIBundleBuilder::insert() for a more reliable way of doing that. 556 instr_iterator insert(instr_iterator I, MachineInstr *M); 558 /// Insert a range of instructions into the instruction list before I. 560 void insert(iterator I, IT S, IT E) { function in class:llvm::MachineBasicBlock 563 Insts.insert(I.getInstrIterator(), S, E); 566 /// Insert MI into the instruction list before I. 567 iterator insert(iterator I, MachineInstr *MI) function in class:llvm::MachineBasicBlock     [all...]
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/
OnDiskHashTable.h	88 /// \brief Insert an item into the appropriate hash bucket. 89 void insert(Bucket *Buckets, size_t Size, Item *E) { function in class:llvm::OnDiskChainedHashTableGenerator 104 insert(NewBuckets, NewSize, E); 114 /// \brief Insert an entry into the table. 115 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator 118 insert(Key, Data, InfoObj); 121 /// \brief Insert an entry into the table. 124 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator 129 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
/prebuilts/clang/host/linux-x86/clang-4479392/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h	413 Impl.insert(N); 419 if (N && !static_cast<ExplodedNode*>(N)->isSink()) Impl.insert(N); 430 void insert(const ExplodedNodeSet &S) { function in class:clang::ento::ExplodedNodeSet 435 Impl.insert(S.begin(), S.end());
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/
DenseMap.h	176 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::DenseMapBase 183 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { function in class:llvm::DenseMapBase 197 // Otherwise, insert the new element. 214 // Otherwise, insert the new element. 220 /// Alternate version of insert() which allows a different, and possibly 233 // Otherwise, insert the new element. 240 /// insert - Range insertion of pairs. 242 void insert(InputIt I, InputIt E) { function in class:llvm::DenseMapBase 244 insert(*I); 343 // Insert all the old elements     [all...]
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/
MachineBasicBlock.h	493 /// This is the correct point to insert lowered copies at the beginning of a 498 /// debug. This is the correct point to insert copies at the beginning of a 550 /// Insert MI into the instruction list before I, possibly inside a bundle. 555 /// MIBundleBuilder::insert() for a more reliable way of doing that. 556 instr_iterator insert(instr_iterator I, MachineInstr *M); 558 /// Insert a range of instructions into the instruction list before I. 560 void insert(iterator I, IT S, IT E) { function in class:llvm::MachineBasicBlock 563 Insts.insert(I.getInstrIterator(), S, E); 566 /// Insert MI into the instruction list before I. 567 iterator insert(iterator I, MachineInstr *MI) function in class:llvm::MachineBasicBlock     [all...]
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Support/
OnDiskHashTable.h	88 /// \brief Insert an item into the appropriate hash bucket. 89 void insert(Bucket *Buckets, size_t Size, Item *E) { function in class:llvm::OnDiskChainedHashTableGenerator 104 insert(NewBuckets, NewSize, E); 114 /// \brief Insert an entry into the table. 115 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator 118 insert(Key, Data, InfoObj); 121 /// \brief Insert an entry into the table. 124 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator 129 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
/prebuilts/clang/host/linux-x86/clang-4579689/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h	413 Impl.insert(N); 419 if (N && !static_cast<ExplodedNode*>(N)->isSink()) Impl.insert(N); 430 void insert(const ExplodedNodeSet &S) { function in class:clang::ento::ExplodedNodeSet 435 Impl.insert(S.begin(), S.end());
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/
DenseMap.h	191 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::DenseMapBase 198 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { function in class:llvm::DenseMapBase 213 // Otherwise, insert the new element. 232 // Otherwise, insert the new element. 239 /// Alternate version of insert() which allows a different, and possibly 253 // Otherwise, insert the new element. 261 /// insert - Range insertion of pairs. 263 void insert(InputIt I, InputIt E) { function in class:llvm::DenseMapBase 265 insert(*I); 364 // Insert all the old elements     [all...]
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/
MachineBasicBlock.h	496 /// This is the correct point to insert lowered copies at the beginning of a 501 /// debug. This is the correct point to insert copies at the beginning of a 553 /// Insert MI into the instruction list before I, possibly inside a bundle. 558 /// MIBundleBuilder::insert() for a more reliable way of doing that. 559 instr_iterator insert(instr_iterator I, MachineInstr *M); 561 /// Insert a range of instructions into the instruction list before I. 563 void insert(iterator I, IT S, IT E) { function in class:llvm::MachineBasicBlock 566 Insts.insert(I.getInstrIterator(), S, E); 569 /// Insert MI into the instruction list before I. 570 iterator insert(iterator I, MachineInstr *MI) function in class:llvm::MachineBasicBlock     [all...]
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/
OnDiskHashTable.h	88 /// \brief Insert an item into the appropriate hash bucket. 89 void insert(Bucket *Buckets, size_t Size, Item *E) { function in class:llvm::OnDiskChainedHashTableGenerator 104 insert(NewBuckets, NewSize, E); 114 /// \brief Insert an entry into the table. 115 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator 118 insert(Key, Data, InfoObj); 121 /// \brief Insert an entry into the table. 124 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator 129 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
/prebuilts/clang/host/linux-x86/clang-4630689/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h	413 Impl.insert(N); 419 if (N && !static_cast<ExplodedNode*>(N)->isSink()) Impl.insert(N); 430 void insert(const ExplodedNodeSet &S) { function in class:clang::ento::ExplodedNodeSet 435 Impl.insert(S.begin(), S.end());
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/
DenseMap.h	191 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::DenseMapBase 198 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { function in class:llvm::DenseMapBase 213 // Otherwise, insert the new element. 232 // Otherwise, insert the new element. 239 /// Alternate version of insert() which allows a different, and possibly 253 // Otherwise, insert the new element. 261 /// insert - Range insertion of pairs. 263 void insert(InputIt I, InputIt E) { function in class:llvm::DenseMapBase 265 insert(*I); 364 // Insert all the old elements     [all...]
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/
MachineBasicBlock.h	496 /// This is the correct point to insert lowered copies at the beginning of a 501 /// debug. This is the correct point to insert copies at the beginning of a 553 /// Insert MI into the instruction list before I, possibly inside a bundle. 558 /// MIBundleBuilder::insert() for a more reliable way of doing that. 559 instr_iterator insert(instr_iterator I, MachineInstr *M); 561 /// Insert a range of instructions into the instruction list before I. 563 void insert(iterator I, IT S, IT E) { function in class:llvm::MachineBasicBlock 566 Insts.insert(I.getInstrIterator(), S, E); 569 /// Insert MI into the instruction list before I. 570 iterator insert(iterator I, MachineInstr *MI) function in class:llvm::MachineBasicBlock     [all...]
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/
OnDiskHashTable.h	88 /// \brief Insert an item into the appropriate hash bucket. 89 void insert(Bucket *Buckets, size_t Size, Item *E) { function in class:llvm::OnDiskChainedHashTableGenerator 104 insert(NewBuckets, NewSize, E); 114 /// \brief Insert an entry into the table. 115 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator 118 insert(Key, Data, InfoObj); 121 /// \brief Insert an entry into the table. 124 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator 129 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
/prebuilts/clang/host/linux-x86/clang-4639204/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h	413 Impl.insert(N); 419 if (N && !static_cast<ExplodedNode*>(N)->isSink()) Impl.insert(N); 430 void insert(const ExplodedNodeSet &S) { function in class:clang::ento::ExplodedNodeSet 435 Impl.insert(S.begin(), S.end());
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/
DenseMap.h	191 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::DenseMapBase 198 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { function in class:llvm::DenseMapBase 213 // Otherwise, insert the new element. 232 // Otherwise, insert the new element. 239 /// Alternate version of insert() which allows a different, and possibly 253 // Otherwise, insert the new element. 261 /// insert - Range insertion of pairs. 263 void insert(InputIt I, InputIt E) { function in class:llvm::DenseMapBase 265 insert(*I); 364 // Insert all the old elements     [all...]
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/
MachineBasicBlock.h	496 /// This is the correct point to insert lowered copies at the beginning of a 501 /// debug. This is the correct point to insert copies at the beginning of a 553 /// Insert MI into the instruction list before I, possibly inside a bundle. 558 /// MIBundleBuilder::insert() for a more reliable way of doing that. 559 instr_iterator insert(instr_iterator I, MachineInstr *M); 561 /// Insert a range of instructions into the instruction list before I. 563 void insert(iterator I, IT S, IT E) { function in class:llvm::MachineBasicBlock 566 Insts.insert(I.getInstrIterator(), S, E); 569 /// Insert MI into the instruction list before I. 570 iterator insert(iterator I, MachineInstr *MI) function in class:llvm::MachineBasicBlock     [all...]

Completed in 1240 milliseconds

<<41424344454647484950>>