Subzero: Auto-awesome iterators.

src/IceTargetLowering.h

 //===- subzero/src/IceTargetLowering.h - Lowering interface -----*- C++ -*-===//
 //
 //                        The Subzero Code Generator
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 //
 // This file declares the TargetLowering and LoweringContext
 // classes.  TargetLowering is an abstract class used to drive the
 // translation/lowering process.  LoweringContext maintains a
 // context for lowering each instruction, offering conveniences such
 // as iterating over non-deleted instructions.
 //
 //===----------------------------------------------------------------------===//
 
 #ifndef SUBZERO_SRC_ICETARGETLOWERING_H
 #define SUBZERO_SRC_ICETARGETLOWERING_H
 
 #include "IceDefs.h"
 #include "IceInst.h" // for the names of the Inst subtypes
 #include "IceTypes.h"
 
 namespace Ice {
 
+typedef uint8_t AsmCodeByte;
+
 class Assembler;
 
 // LoweringContext makes it easy to iterate through non-deleted
 // instructions in a node, and insert new (lowered) instructions at
 // the current point.  Along with the instruction list container and
 // associated iterators, it holds the current node, which is needed
 // when inserting new instructions in order to track whether variables
 // are used as single-block or multi-block.
 class LoweringContext {
 public:
   LoweringContext() : Node(NULL) {}
   ~LoweringContext() {}
   void init(CfgNode *Node);
   Inst *getNextInst() const {
     if (Next == End)
       return NULL;
     return *Next;
   }
   Inst *getNextInst(InstList::iterator &Iter) const {
     advanceForward(Iter);
     if (Iter == End)
       return NULL;
     return *Iter;
   }
   CfgNode *getNode() const { return Node; }
   bool atEnd() const { return Cur == End; }
   InstList::iterator getCur() const { return Cur; }
   InstList::iterator getEnd() const { return End; }
+  // Adaptor to enable range-based for loops.
+  InstList::iterator begin() const { return getCur(); }
+  InstList::iterator end() const { return getEnd(); }
   void insert(Inst *Inst);
   Inst *getLastInserted() const;
   void advanceCur() { Cur = Next; }
   void advanceNext() { advanceForward(Next); }
   void setInsertPoint(const InstList::iterator &Position) { Next = Position; }
 
 private:
   // Node is the argument to Inst::updateVars().
   CfgNode *Node;
   // Cur points to the current instruction being considered.  It is
@@ skipping 73 matching lines @@
   // the register such as in the prolog or epilog or for marking
   // scratch registers as killed by a call.
   virtual Variable *getPhysicalRegister(SizeT RegNum) = 0;
   // Returns a printable name for the register.
   virtual IceString getRegName(SizeT RegNum, Type Ty) const = 0;
 
   virtual bool hasFramePointer() const { return false; }
   virtual SizeT getFrameOrStackReg() const = 0;
   virtual size_t typeWidthInBytesOnStack(Type Ty) const = 0;
   virtual SizeT getBundleAlignLog2Bytes() const = 0;
-  virtual llvm::ArrayRef<uint8_t> getNonExecBundlePadding() const = 0;
+  virtual llvm::ArrayRef<AsmCodeByte> getNonExecBundlePadding() const = 0;
   bool hasComputedFrame() const { return HasComputedFrame; }
   bool shouldDoNopInsertion() const;
   // Returns true if this function calls a function that has the
   // "returns twice" attribute.
   bool callsReturnsTwice() const { return CallsReturnsTwice; }
   void setCallsReturnsTwice(bool RetTwice) {
     CallsReturnsTwice = RetTwice;
   }
   int32_t getStackAdjustment() const { return StackAdjustment; }
   void updateStackAdjustment(int32_t Offset) { StackAdjustment += Offset; }
@@ skipping 96 matching lines @@
 private:
   TargetGlobalInitLowering(const TargetGlobalInitLowering &)
   LLVM_DELETED_FUNCTION;
   TargetGlobalInitLowering &
   operator=(const TargetGlobalInitLowering &) LLVM_DELETED_FUNCTION;
 };
 
 } // end of namespace Ice
 
 #endif // SUBZERO_SRC_ICETARGETLOWERING_H