HomeSort by: relevance | last modified time | path
    Searched refs:getEntry (Results 1 - 25 of 61) sorted by relevancy

1 2 3

  /src/external/bsd/openldap/dist/contrib/ldapc++/src/
LDAPSearchResult.h 42 const LDAPEntry* getEntry() const;
LDAPSearchResult.cpp 48 const LDAPEntry* LDAPSearchResult::getEntry() const{
49 DEBUG(LDAP_DEBUG_TRACE,"LDAPSearchResult::getEntry()" << endl);
LDAPSearchResults.cpp 30 entryList.addEntry(*((LDAPSearchResult*)res)->getEntry());
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
NonRelocatableStringpool.h 35 EmptyString = getEntry("");
38 DwarfStringPoolEntryRef getEntry(StringRef S);
42 uint64_t getStringOffset(StringRef S) { return getEntry(S).getOffset(); }
DwarfStringPoolEntry.h 59 DwarfStringPoolEntry getEntry() const { return getMapEntry()->getValue(); }
DbgEntityHistoryCalculator.h 108 Entry &getEntry(InlinedEntity Var, EntryIndex Index) {
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
VPlanVerifier.cpp 47 make_range(df_iterator<const VPBlockBase *>::begin(Region->getEntry()),
96 const VPBlockBase *Entry = Region->getEntry();
115 make_range(df_iterator<const VPBlockBase *>::begin(Region->getEntry()),
VPlanPredicator.cpp 188 VPBasicBlock *EntryBlock = cast<VPBasicBlock>(Region->getEntry());
208 ReversePostOrderTraversal<VPBlockBase *> RPOT(Region->getEntry());
236 predicateRegionRec(cast<VPRegionBlock>(Plan.getEntry()));
239 linearizeRegionRec(cast<VPRegionBlock>(Plan.getEntry()));
247 VPDomTree.recalculate(*(cast<VPRegionBlock>(Plan.getEntry())));
VPlanTransforms.cpp 24 auto *TopRegion = cast<VPRegionBlock>(Plan->getEntry());
25 ReversePostOrderTraversal<VPBlockBase *> RPOT(TopRegion->getEntry());
VPlan.cpp 143 Block = Region->getEntry();
150 Block = Region->getEntry();
155 assert(ParentPlan->getEntry() == this &&
186 assert(Parent->getEntry() == this &&
767 for (const VPBlockBase *Block : depth_first(getEntry())) {
854 for (const VPBlockBase *Block : depth_first(Plan.getEntry()))
938 assert(Region->getEntry() && "Region contains no inner blocks.");
939 for (const VPBlockBase *Block : depth_first(Region->getEntry()))
1196 ReversePostOrderTraversal<VPBlockBase *> RPOT(Region->getEntry());
1238 visitRegion(cast<VPRegionBlock>(Plan.getEntry()), Old2New, IAI)
    [all...]
VPlan.h 1640 const VPBlockBase *getEntry() const { return Entry; }
1641 VPBlockBase *getEntry() { return Entry; }
1762 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1765 return nodes_iterator::begin(N->getEntry());
1781 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
1784 return nodes_iterator::begin(N->getEntry());
1842 return R->getEntry();
1899 BlockTy getEntry() { return Entry; }
1914 return N.getEntry();
1933 return N.getEntry();
    [all...]
  /src/external/gpl3/binutils/dist/gprofng/src/
CacheMap.h 71 Entry *getEntry (Key_t key);
134 Entry *entry = getEntry (key);
142 CacheMap<Key_t, Value_t>::getEntry (Key_t key)
159 Entry *entry = getEntry (key);
176 Entry *entry = getEntry (key);
  /src/external/gpl3/binutils.old/dist/gprofng/src/
CacheMap.h 71 Entry *getEntry (Key_t key);
134 Entry *entry = getEntry (key);
142 CacheMap<Key_t, Value_t>::getEntry (Key_t key)
159 Entry *entry = getEntry (key);
176 Entry *entry = getEntry (key);
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
RegionIterator.h 111 BItor(BlockTraits::child_begin(node->getEntry())) {
114 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor))
124 BItor(BlockTraits::child_end(node->getEntry())) {}
150 while (BItor != BlockTraits::child_end(getNode()->getEntry())
191 : Node(node), Itor(BlockTraits::child_begin(node->getEntry())) {
197 while (BlockTraits::child_end(Node->getEntry()) != Itor &&
204 : Node(node), Itor(BlockTraits::child_end(node->getEntry())) {
235 while (Itor != succ_end(Node->getEntry())
294 return R->getNode(R->getEntry()); \
310 return R->getBBNode(R->getEntry()); \
    [all...]
RegionInfoImpl.h 70 BlockT *OldEntry = getEntry();
79 if (Child->getEntry() == OldEntry)
110 BlockT *entry = getEntry(), *exit = getExit();
164 BlockT *entry = getEntry();
234 if (getEntry()->getName().empty()) {
237 getEntry()->printAsOperand(OS, false);
239 entryName = std::string(getEntry()->getName());
259 BlockT *entry = getEntry(), *exit = getExit();
302 verifyWalk(getEntry(), &visited);
352 if (R->getEntry() != BB
    [all...]
RegionInfo.h 174 inline BlockT *getEntry() const { return entry.getPointer(); }
322 BlockT *getEntry() const {
323 return RegionNodeBase<Tr>::getEntry();
390 /// @return A region also starting at getEntry(), but reaching to the next
391 /// basic block that forms with getEntry() a (non-canonical) region.
459 return contains(SubRegion->getEntry()) &&
609 block_iterator block_begin() { return block_iterator(getEntry(), getExit()); }
614 return const_block_iterator(getEntry(), getExit());
998 return getEntry();
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/
DwarfStringPool.h 56 EntryRef getEntry(AsmPrinter &Asm, StringRef Str);
58 /// Same as getEntry, except that you can use EntryRef::getIndex to obtain a
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
StructurizeCFG.cpp 431 Loops[Exit] = N->getEntry();
460 BasicBlock *BB = N->getEntry();
506 BasicBlock *Entry = R->getEntry();
530 << RN->getEntry()->getName() << "\n");
536 Visited.insert(RN->getEntry());
736 Order.back()->getEntry();
746 BasicBlock *Entry = PrevNode->getEntry();
783 BBPredicates &Preds = Predicates[Node->getEntry()];
791 BBPredicates &Preds = Predicates[Node->getEntry()];
805 if (!Dominated && DT->dominates(BB, PrevNode->getEntry()))
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
SnippetRepetitor.cpp 30 auto Entry = Filler.getEntry();
60 auto Entry = Filler.getEntry();
Assembler.h 69 BasicBlockFiller getEntry() { return Entry; }
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
NonRelocatableStringpool.cpp 13 DwarfStringPoolEntryRef NonRelocatableStringpool::getEntry(StringRef S) {
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
RegionPass.cpp 92 PassManagerPrettyStackEntry X(P, *CurrentRegion->getEntry());
280 Function &F = *R.getEntry()->getParent();
287 if (R.getEntry() == &F.getEntryBlock())
RegionPrinter.cpp 89 if (R->getParent()->getEntry() == destBB)
94 if (R && R->getEntry() == destBB && R->contains(srcBB))
234 llvm::Function *F = RI->getTopLevelRegion()->getEntry()->getParent();
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPUMachineCFGStructurizer.cpp 397 MachineBasicBlock *getEntry();
552 MachineBasicBlock *getEntry() {
554 return (Tree->isRegion()) ? Tree->getRegionMRT()->getEntry()
907 while (Current != nullptr && Current->getEntry() != nullptr) {
929 O.getParent()->getParent() == getEntry());
972 MachineBasicBlock *LinearizedRegion::getEntry() { return Entry; }
1014 LLVM_DEBUG(this->getEntry()->getParent()->dump());
1232 MachineBasicBlock *Entry = Region->getEntry();
1258 MachineBasicBlock *Entry = Region->getEntry();
1662 auto Entry = Region->getEntry();
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/opt/
PassPrinters.cpp 173 << R->getEntry()->getParent()->getName() << "':\n";
176 .print(Out, R->getEntry()->getParent()->getParent());

Completed in 73 milliseconds

1 2 3