/openbsd/gnu/usr.bin/perl/cpan/Compress-Raw-Zlib/t/compress/ |
H A D | CompTestUtils.pm | 340 'IO::Compress::Gzip' => { Inverse => 'IO::Uncompress::Gunzip', 345 'IO::Uncompress::Gunzip' => { Inverse => 'IO::Compress::Gzip', 373 'IO::Compress::Zip' => { Inverse => 'IO::Uncompress::Unzip', 378 'IO::Uncompress::Unzip' => { Inverse => 'IO::Compress::Zip', 406 'IO::Compress::Lzf' => { Inverse => 'IO::Uncompress::UnLzf', 411 'IO::Uncompress::UnLzf' => { Inverse => 'IO::Compress::Lzf', 428 'IO::Compress::Xz' => { Inverse => 'IO::Uncompress::UnXz', 433 'IO::Uncompress::UnXz' => { Inverse => 'IO::Compress::Xz', 515 return $TOP{$class}{Inverse}; 549 if ! defined $TOP{$compWith}{Inverse}; [all …]
|
/openbsd/gnu/usr.bin/perl/cpan/IO-Compress/t/compress/ |
H A D | CompTestUtils.pm | 299 'IO::Compress::Gzip' => { Inverse => 'IO::Uncompress::Gunzip', 304 'IO::Uncompress::Gunzip' => { Inverse => 'IO::Compress::Gzip', 332 'IO::Compress::Zip' => { Inverse => 'IO::Uncompress::Unzip', 337 'IO::Uncompress::Unzip' => { Inverse => 'IO::Compress::Zip', 365 'IO::Compress::Lzf' => { Inverse => 'IO::Uncompress::UnLzf', 370 'IO::Uncompress::UnLzf' => { Inverse => 'IO::Compress::Lzf', 387 'IO::Compress::Xz' => { Inverse => 'IO::Uncompress::UnXz', 392 'IO::Uncompress::UnXz' => { Inverse => 'IO::Compress::Xz', 474 return $TOP{$class}{Inverse}; 508 if ! defined $TOP{$compWith}{Inverse}; [all …]
|
/openbsd/gnu/usr.bin/perl/cpan/Compress-Raw-Bzip2/t/compress/ |
H A D | CompTestUtils.pm | 299 'IO::Compress::Gzip' => { Inverse => 'IO::Uncompress::Gunzip', 304 'IO::Uncompress::Gunzip' => { Inverse => 'IO::Compress::Gzip', 332 'IO::Compress::Zip' => { Inverse => 'IO::Uncompress::Unzip', 337 'IO::Uncompress::Unzip' => { Inverse => 'IO::Compress::Zip', 365 'IO::Compress::Lzf' => { Inverse => 'IO::Uncompress::UnLzf', 370 'IO::Uncompress::UnLzf' => { Inverse => 'IO::Compress::Lzf', 387 'IO::Compress::Xz' => { Inverse => 'IO::Uncompress::UnXz', 392 'IO::Uncompress::UnXz' => { Inverse => 'IO::Compress::Xz', 474 return $TOP{$class}{Inverse}; 508 if ! defined $TOP{$compWith}{Inverse}; [all …]
|
/openbsd/gnu/llvm/llvm/include/llvm/ADT/ |
H A D | GraphTraits.h | 97 struct Inverse { struct 100 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() argument 105 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {}; 115 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator> 117 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G), 118 GraphTraits<Inverse<GraphType>>::nodes_end(G)); 129 iterator_range<typename GraphTraits<Inverse<GraphType>>::ChildIteratorType> 131 return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G), 132 GraphTraits<Inverse<GraphType>>::child_end(G));
|
H A D | DepthFirstIterator.h | 261 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> { 262 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V) in idf_iterator() 263 : df_iterator<Inverse<T>, SetTy, External>(V) {} in idf_iterator() 268 return idf_iterator<T>::begin(Inverse<T>(G)); in idf_begin() 273 return idf_iterator<T>::end(Inverse<T>(G)); in idf_end() 287 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V) in idf_ext_iterator() 293 return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S); in idf_ext_begin() 298 return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S); in idf_ext_end()
|
H A D | PostOrderIterator.h | 220 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External> { 221 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) : in ipo_iterator() 222 po_iterator<Inverse<T>, SetType, External> (V) {} in ipo_iterator() 245 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) : in ipo_ext_iterator()
|
/openbsd/gnu/llvm/llvm/include/llvm/IR/ |
H A D | CFG.h | 324 template <> struct GraphTraits<Inverse<BasicBlock*>> { 328 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; } 333 template <> struct GraphTraits<Inverse<const BasicBlock*>> { 337 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; } 389 template <> struct GraphTraits<Inverse<Function*>> : 390 public GraphTraits<Inverse<BasicBlock*>> { 391 static NodeRef getEntryNode(Inverse<Function *> G) { 395 template <> struct GraphTraits<Inverse<const Function*>> : 396 public GraphTraits<Inverse<const BasicBlock*>> { 397 static NodeRef getEntryNode(Inverse<const Function *> G) {
|
/openbsd/gnu/llvm/llvm/include/llvm/Analysis/ |
H A D | LoopInfoImpl.h | 118 for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB)) in hasDedicatedExits() 218 for (const auto Pred : children<Inverse<BlockT *>>(Header)) { in getLoopPredecessor() 236 for (const auto Pred : children<Inverse<BlockT *>>(Header)) { in getLoopLatch() 323 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop() 324 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop() 330 llvm::make_range(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop() 331 GraphTraits<Inverse<BlockT *>>::child_end(BB))) in verifyLoop() 441 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in discoverAndMapSubloop() 483 for (const auto Pred : children<Inverse<BlockT *>>(PredBB)) { in discoverAndMapSubloop() 566 for (const auto Backedge : children<Inverse<BlockT *>>(Header)) { in analyze()
|
H A D | Interval.h | 127 template <> struct GraphTraits<Inverse<Interval*>> { 131 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
H A D | LoopInfo.h | 261 auto PredBegin = GraphTraits<Inverse<BlockT *>>::child_begin(Header); in isLoopLatch() 262 auto PredEnd = GraphTraits<Inverse<BlockT *>>::child_end(Header); in isLoopLatch() 272 for (const auto Pred : children<Inverse<BlockT *>>(H)) in getNumBackEdges() 354 for (const auto Pred : children<Inverse<BlockT *>>(H)) in getLoopLatches()
|
H A D | IntervalIterator.h | 87 class IGT = GraphTraits<Inverse<NodeTy *>>>
|
H A D | RegionInfo.h | 268 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>; 687 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
|
H A D | BlockFrequencyInfoImpl.h | 860 using Predecessor = GraphTraits<Inverse<const BlockT *>>; 1549 for (const BlockT *DstBB : children<Inverse<const BlockT *>>(SrcBB)) {
|
H A D | MemorySSA.h | 1204 template <> struct GraphTraits<Inverse<MemoryAccess *>> {
|
/openbsd/gnu/llvm/llvm/include/llvm/CodeGen/ |
H A D | MachineFunction.h | 1325 template <> struct GraphTraits<Inverse<MachineFunction*>> : 1326 public GraphTraits<Inverse<MachineBasicBlock*>> { 1327 static NodeRef getEntryNode(Inverse<MachineFunction *> G) { 1331 template <> struct GraphTraits<Inverse<const MachineFunction*>> : 1332 public GraphTraits<Inverse<const MachineBasicBlock*>> { 1333 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
|
H A D | MachineBasicBlock.h | 1240 template <> struct GraphTraits<Inverse<MachineBasicBlock*>> { 1244 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) { 1252 template <> struct GraphTraits<Inverse<const MachineBasicBlock*>> { 1256 static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
|
/openbsd/gnu/llvm/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanCFG.h | 273 template <> struct GraphTraits<Inverse<VPBlockBase *>> { 277 static NodeRef getEntryNode(Inverse<NodeRef> B) {
|
/openbsd/gnu/llvm/clang/include/clang/Analysis/ |
H A D | CFG.h | 1508 template <> struct GraphTraits<Inverse< ::clang::CFGBlock *>> { 1512 static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) { 1520 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock *>> { 1524 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) { 1563 template <> struct GraphTraits<Inverse< ::clang::CFG *>> 1564 : public GraphTraits<Inverse< ::clang::CFGBlock *>> { 1572 template <> struct GraphTraits<Inverse<const ::clang::CFG *>> 1573 : public GraphTraits<Inverse<const ::clang::CFGBlock *>> {
|
/openbsd/gnu/llvm/llvm/include/llvm/Support/ |
H A D | CFGDiff.h | 137 std::conditional_t<InverseEdge, Inverse<NodePtr>, NodePtr>; in getChildren()
|
H A D | GenericIteratedDominanceFrontier.h | 60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
|
H A D | GenericDomTree.h | 719 Split<Inverse<NodeT *>>(NewBB); 858 SmallVector<NodeRef, 4> PredBlocks(children<Inverse<N>>(NewBB)); 863 for (auto *Pred : children<Inverse<N>>(NewBBSucc)) {
|
/openbsd/gnu/llvm/llvm/lib/Analysis/ |
H A D | ScalarEvolution.cpp | 11519 auto ProveViaCond = [&](const Value *Condition, bool Inverse) { in isBasicBlockEntryGuardedByCond() argument 11521 if (isImpliedCond(Pred, LHS, RHS, Condition, Inverse, CtxI)) in isBasicBlockEntryGuardedByCond() 11525 return isImpliedCond(P, LHS, RHS, Condition, Inverse, CtxI); in isBasicBlockEntryGuardedByCond() 11596 ConstantInt::getBool(FoundCondValue->getContext(), Inverse)) in isImpliedCond() 11608 if (!Inverse) in isImpliedCond() 11609 return isImpliedCond(Pred, LHS, RHS, Op0, Inverse, CtxI) || in isImpliedCond() 11610 isImpliedCond(Pred, LHS, RHS, Op1, Inverse, CtxI); in isImpliedCond() 11612 if (Inverse) in isImpliedCond() 11613 return isImpliedCond(Pred, LHS, RHS, Op0, Inverse, CtxI) || in isImpliedCond() 11614 isImpliedCond(Pred, LHS, RHS, Op1, Inverse, CtxI); in isImpliedCond() [all …]
|
/openbsd/gnu/usr.bin/binutils/cpu/ |
H A D | iq10.cpu | 574 (dni cm32andn "Counter Manager And With Inverse" (MACH10 USES-RS USES-RT USES-RD) 817 (dnmi m-cm32andn "Counter Manager And With Inverse" (MACH10 USES-RS USES-RT USES-RD NO-DIS)
|
/openbsd/gnu/usr.bin/binutils-2.17/cpu/ |
H A D | iq10.cpu | 574 (dni cm32andn "Counter Manager And With Inverse" (MACH10 USES-RS USES-RT USES-RD) 817 (dnmi m-cm32andn "Counter Manager And With Inverse" (MACH10 USES-RS USES-RT USES-RD NO-DIS)
|
/openbsd/gnu/llvm/llvm/lib/IR/ |
H A D | ConstantFold.cpp | 1882 Constant *Inverse = ConstantExpr::getBitCast(C1, CE2Op0->getType()); in ConstantFoldCompareInstruction() local 1883 return ConstantExpr::getICmp(Predicate, Inverse, CE2Op0); in ConstantFoldCompareInstruction()
|