search for: nodet

...om > /root/projects/safecode/llvm/lib/Support/IntervalMap.cpp:14: > /root/projects/safecode/llvm/include/llvm/ADT/IntervalMap.h:1980:32: > error: use 'template' keyword to treat 'newNode' as a dependent template > name > Node[NewNode] = this->map->newNode<NodeT>(); > ^ > template > 1 error generated. > make[1]: *** > [/root/projects/safecode/build/lib/Support/Debug/IntervalMap.o] Error 1 > > > Any lights will be appreciated on the above issue . > > Thanks >...

Hi! Is it possible to get findNearestCommonDominator working for post dominator trees by changing llvm/include/llvm/Analysis/Dominators.h starting at line 432: NodeT *findNearestCommonDominator(NodeT *A, NodeT *B) { /*assert (!this->isPostDominator() && "This is not implemented for post dominators");*/ assert (A->getParent() == B->getParent() && "Two blocks are not in same function"); if (!this->isPost...

Hi, As part of an ongoing work to extend the GraphDiff (this models a CFG view), I came across the need to have a common interface for accessing successors/predecessors in various IR units, such that a type such as `typename NodeT::succ_iterator` could be used in templated code. In particular, the need arose for BasicBlocks, MachineBasicBlocks, VPBlockBase and clang::CFGBlock. The least invasive change seemed to be to use the interface already being used in MachineBasicBlock and clang::CFGBlock, and: (1) update BasicBlock t...

...ojects/safecode/llvm/lib/Support/IntervalMap.cpp:14: >> /root/projects/safecode/llvm/include/llvm/ADT/IntervalMap.h:1980:32: >> error: use 'template' keyword to treat 'newNode' as a dependent template >> name >> Node[NewNode] = this->map->newNode<NodeT>(); >> ^ >> template >> 1 error generated. >> make[1]: *** >> [/root/projects/safecode/build/lib/Support/Debug/IntervalMap.o] Error 1 >> >> >> Any lights will be appreciated on the abov...

...build In file included from /root/projects/safecode/llvm/lib/Support/IntervalMap.cpp:14: /root/projects/safecode/llvm/include/llvm/ADT/IntervalMap.h:1980:32: error: use 'template' keyword to treat 'newNode' as a dependent template name Node[NewNode] = this->map->newNode<NodeT>(); ^ template 1 error generated. make[1]: *** [/root/projects/safecode/build/lib/Support/Debug/IntervalMap.o] Error 1 Any lights will be appreciated on the above issue . Thanks Umesh -------------- next part -------------- An HTML...

....org> wrote: > >> Hi, >> >> As part of an ongoing work to extend the GraphDiff (this models a CFG >> view), I came across the need to have a common interface for accessing >> successors/predecessors in various IR units, such that a type such as >> `typename NodeT::succ_iterator` could be used in templated code. >> > > I /think/ this can be achieved with the existing API by using > "decltype(succ_begin(std::declval<NodeT>()))" instead of the typename > you've got as an example (it looks like succ_begin is the extension p...

...> /root/projects/safecode/llvm/lib/Support/IntervalMap.cpp:14: > /root/projects/safecode/llvm/include/llvm/ADT/IntervalMap.h:1980:32: > error: use 'template' keyword to treat 'newNode' as a dependent > template name > Node[NewNode] = this->map->newNode<NodeT>(); > ^ > template > 1 error generated. > make[1]: *** > [/root/projects/safecode/build/lib/Support/Debug/IntervalMap.o] Error 1 > > > Any lights will be appreciated on the above issue . > > Thanks >...

...ominator() && "This is not implemented for post dominators"); assert (A->getParent() == B->getParent() && "Two blocks are not in same function"); // If either A or B is a entry block then it is nearest common dominator. NodeT &Entry = A->getParent()->front(); if (A == &Entry || B == &Entry) return &Entry; When commenting out the assert it seems to work. Perhaps it has to be changed that the check for entry block (which seems to be an optimization) is only done for DominatorTree: if...

...t;>> >>>> As part of an ongoing work to extend the GraphDiff (this models a CFG >>>> view), I came across the need to have a common interface for accessing >>>> successors/predecessors in various IR units, such that a type such as >>>> `typename NodeT::succ_iterator` could be used in templated code. >>>> >>> >>> I /think/ this can be achieved with the existing API by using >>> "decltype(succ_begin(std::declval<NodeT>()))" instead of the typename >>> you've got as an example (it...

When looking into https://llvm.org/bugs/show_bug.cgi?id=24866, I discovered that the root cause of the crash is that I was expecting every basic block to have a corresponding Node in the dominator tree. Apparently, the "while.end" basic block in the example does not have a Node in the Dominator Tree. Can anyone tell me if this is expected? If so, under what circumstances?

Hi Piotr, On March 31, 2017 at 1:07:12 PM, Piotr Padlewski (piotr.padlewski at gmail.com) wrote: > [snip] > Do I understand it correctly, that it is legal to do the hoist because all > of the instructions above %vtable does not throw? Yes, I think you're right.  HeaderMayThrow is a conservative approximation, and the conservativeness is biting us here. > Are there any plans to

...ysisUsage &AU) const { AU.addRequired<CallGraph>(); } Error list: /Developer/llvm/include/llvm/Analysis/Dominators.h:666:35: error: no viable conversion from 'typename TraitsTy::nodes_iterator' (aka 'mapped_iterator<CallGraph::iterator, DerefFun>') to 'NodeType *' (aka 'llvm::CallGraphNode *') if (TraitsTy::child_begin(I) == TraitsTy::child_end(I)) ^ /Developer/llvm/lib/Transforms/ThreadBufferOptimizer/ThreadBufferOptimizer.h:59:10: note: in instantiation of function template specialization '...

...e operands of SELECT_CC to have the same value type, so if > + // necessary we need to convert LHS and RHS to be the same type True and > + // False. True and False are guaranteed to have the same type as this > + // SELECT_CC node. > + > + if (CompareVT != VT) { > + ISD::NodeType ConversionOp = ISD::DELETED_NODE; > + if (VT == MVT::f32 && CompareVT == MVT::i32) { > + if (isUnsignedIntSetCC(CCOpcode)) { > + ConversionOp = ISD::UINT_TO_FP; > + } else { > + ConversionOp = ISD::SINT_TO_FP; > + } > + } else if (V...