Home
last modified time | relevance | path

Searched refs:Inverse (Results 1 – 25 of 33) sorted by relevance

12

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h97 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 DDepthFirstIterator.h261 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 DPostOrderIterator.h222 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External> {
223 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) : in ipo_iterator()
224 po_iterator<Inverse<T>, SetType, External> (V) {} in ipo_iterator()
247 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) : in ipo_ext_iterator()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h324 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) {
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInterval.h127 template <> struct GraphTraits<Inverse<Interval*>> {
131 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
H A DIntervalIterator.h87 class IGT = GraphTraits<Inverse<NodeTy *>>>
H A DRegionInfo.h268 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
687 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
H A DMemorySSA.h1198 template <> struct GraphTraits<Inverse<MemoryAccess *>> {
H A DBlockFrequencyInfoImpl.h860 using Predecessor = GraphTraits<Inverse<const BlockT *>>;
H A DScalarEvolution.h1899 const Value *FoundCondValue, bool Inverse,
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineFunction.h1413 template <> struct GraphTraits<Inverse<MachineFunction*>> :
1414 public GraphTraits<Inverse<MachineBasicBlock*>> {
1415 static NodeRef getEntryNode(Inverse<MachineFunction *> G) {
1419 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1420 public GraphTraits<Inverse<const MachineBasicBlock*>> {
1421 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
H A DMachineBasicBlock.h1277 template <> struct GraphTraits<Inverse<MachineBasicBlock*>> {
1281 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
1289 template <> struct GraphTraits<Inverse<const MachineBasicBlock*>> {
1293 static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h274 template <> struct GraphTraits<Inverse<VPBlockBase *>> {
278 static NodeRef getEntryNode(Inverse<NodeRef> B) {
/freebsd-14.2/contrib/llvm-project/clang/include/clang/Analysis/
H A DCFG.h1496 template <> struct GraphTraits<Inverse< ::clang::CFGBlock *>> {
1500 static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) {
1508 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock *>> {
1512 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
1551 template <> struct GraphTraits<Inverse< ::clang::CFG *>>
1552 : public GraphTraits<Inverse< ::clang::CFGBlock *>> {
1560 template <> struct GraphTraits<Inverse<const ::clang::CFG *>>
1561 : public GraphTraits<Inverse<const ::clang::CFGBlock *>> {
/freebsd-14.2/sys/contrib/device-tree/src/arm/
H A Dimx53-usbarmory.dts5 * Copyright (C) 2015, Inverse Path
51 model = "Inverse Path USB armory";
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Support/
H A DCFGDiff.h137 std::conditional_t<InverseEdge, Inverse<NodePtr>, NodePtr>; in getChildren()
H A DGenericIteratedDominanceFrontier.h59 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
H A DGenericLoopInfoImpl.h450 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in discoverAndMapSubloop()
H A DGenericDomTree.h719 Split<Inverse<NodeT *>>(NewBB);
H A DGenericDomTreeConstruction.h117 std::conditional_t<Inversed, Inverse<NodePtr>, NodePtr>; in getChildren()
/freebsd-14.2/crypto/openssl/doc/man3/
H A DSSL_CONF_cmd.pod459 B<SessionTicket>: session ticket support, enabled by default. Inverse of
463 B<Compression>: SSL/TLS compression support, disabled by default. Inverse
468 is set by default. Inverse of B<SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS>.
472 B<DHSingle>: enable single use DH keys, set by default. Inverse of
475 B<ECDHSingle>: enable single use ECDH keys, set by default. Inverse of
501 default. Inverse of B<SSL_OP_NO_ENCRYPT_THEN_MAC>: that is,
524 default. Inverse of B<SSL_OP_NO_EXTENDED_MASTER_SECRET>: that is,
528 default. Inverse of B<SSL_OP_DISABLE_TLSEXT_CA_NAMES>: that is,
/freebsd-14.2/contrib/libdivsufsort/include/
H A Ddivsufsort.h.cmake115 * Inverse BW-transforms a given BWTed string.
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLICM.cpp2399 bool Inverse = false; in hoistMinMax() local
2403 Inverse = true; in hoistMinMax()
2423 if (Inverse) in hoistMinMax()
2458 if (Inverse) in hoistMinMax()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DScalarEvolution.cpp11470 auto ProveViaCond = [&](const Value *Condition, bool Inverse) { in isBasicBlockEntryGuardedByCond() argument
11472 if (isImpliedCond(Pred, LHS, RHS, Condition, Inverse, CtxI)) in isBasicBlockEntryGuardedByCond()
11476 return isImpliedCond(P, LHS, RHS, Condition, Inverse, CtxI); in isBasicBlockEntryGuardedByCond()
11556 ConstantInt::getBool(FoundCondValue->getContext(), Inverse)) in isImpliedCond()
11568 if (!Inverse) in isImpliedCond()
11569 return isImpliedCond(Pred, LHS, RHS, Op0, Inverse, CtxI) || in isImpliedCond()
11570 isImpliedCond(Pred, LHS, RHS, Op1, Inverse, CtxI); in isImpliedCond()
11572 if (Inverse) in isImpliedCond()
11573 return isImpliedCond(Pred, LHS, RHS, Op0, Inverse, CtxI) || in isImpliedCond()
11574 isImpliedCond(Pred, LHS, RHS, Op1, Inverse, CtxI); in isImpliedCond()
[all …]
/freebsd-14.2/crypto/heimdal/doc/
H A Dcopyright.texi427 Thanks to: Dan Hoey for his excellent Initial and Inverse permutation

12