HomeSort by relevance Sort by last modified time
    Searched refs:DefStack (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/Target/Hexagon/
RDFGraph.h 634 struct DefStack {
635 DefStack() = default;
640 typedef DefStack::value_type value_type;
654 Iterator(const DefStack &S, bool Top);
656 // the top of the DefStack.
657 const DefStack &DS;
659 friend struct DefStack;
682 typedef std::map<RegisterRef,DefStack> DefStackMap;
775 NodeAddr<T> TA, DefStack &DS);
RDFGraph.cpp 290 const Print<DataFlowGraph::DefStack> &P) {
742 DataFlowGraph::DefStack::Iterator::Iterator(const DataFlowGraph::DefStack &S,
756 unsigned DataFlowGraph::DefStack::size() const {
766 void DataFlowGraph::DefStack::pop() {
773 void DataFlowGraph::DefStack::start_block(NodeId N) {
781 void DataFlowGraph::DefStack::clear_block(NodeId N) {
795 unsigned DataFlowGraph::DefStack::nextUp(unsigned P) const {
810 unsigned DataFlowGraph::DefStack::nextDown(unsigned P) const {
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/
RDFGraph.h 670 struct DefStack {
671 DefStack() = default;
678 using value_type = DefStack::value_type;
695 friend struct DefStack;
697 Iterator(const DefStack &S, bool Top);
700 // the top of the DefStack.
701 const DefStack &DS;
733 // Map: Register (physical or virtual) -> DefStack
734 using DefStackMap = std::unordered_map<RegisterId, DefStack>;
857 NodeAddr<T> TA, DefStack &DS)
    [all...]
RDFGraph.cpp 340 const Print<DataFlowGraph::DefStack> &P) {
683 DataFlowGraph::DefStack::Iterator::Iterator(const DataFlowGraph::DefStack &S,
697 unsigned DataFlowGraph::DefStack::size() const {
707 void DataFlowGraph::DefStack::pop() {
714 void DataFlowGraph::DefStack::start_block(NodeId N) {
722 void DataFlowGraph::DefStack::clear_block(NodeId N) {
736 unsigned DataFlowGraph::DefStack::nextUp(unsigned P) const {
751 unsigned DataFlowGraph::DefStack::nextDown(unsigned P) const {
    [all...]

Completed in 115 milliseconds