RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 19:52:54 +01:00
Code Issues Projects Releases Wiki Activity

Doxygenate comments.

Browse Source 
llvm-svn: 59753
This commit is contained in:
Dan Gohman 2008-11-20 22:09:52 +00:00
parent 378c8a6a81
commit 0ba3f17e9f
1 changed files with 26 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

56
include/llvm/Target/TargetInstrItineraries.h
View File

@ -19,60 +19,56 @@
namespace llvm {
//===----------------------------------------------------------------------===//
// Instruction stage - These values represent a step in the execution of an
// instruction. The latency represents the number of discrete time slots used
// need to complete the stage. Units represent the choice of functional units
// that can be used to complete the stage. Eg. IntUnit1, IntUnit2.
//
/// Instruction stage - These values represent a step in the execution of an
/// instruction. The latency represents the number of discrete time slots used
/// need to complete the stage. Units represent the choice of functional units
/// that can be used to complete the stage. Eg. IntUnit1, IntUnit2.
///
struct InstrStage {
unsigned Cycles; // Length of stage in machine cycles
unsigned Units; // Choice of functional units
unsigned Cycles; ///< Length of stage in machine cycles
unsigned Units; ///< Choice of functional units
};
//===----------------------------------------------------------------------===//
// Instruction itinerary - An itinerary represents a sequential series of steps
// required to complete an instruction. Itineraries are represented as
// sequences of instruction stages.
//
/// Instruction itinerary - An itinerary represents a sequential series of steps
/// required to complete an instruction. Itineraries are represented as
/// sequences of instruction stages.
///
struct InstrItinerary {
unsigned First; // Index of first stage in itinerary
unsigned Last; // Index of last + 1 stage in itinerary
unsigned First; ///< Index of first stage in itinerary
unsigned Last; ///< Index of last + 1 stage in itinerary
};
//===----------------------------------------------------------------------===//
// Instruction itinerary Data - Itinerary data supplied by a subtarget to be
// used by a target.
//
/// Instruction itinerary Data - Itinerary data supplied by a subtarget to be
/// used by a target.
///
struct InstrItineraryData {
const InstrStage *Stages; // Array of stages selected
const InstrItinerary *Itineratries; // Array of itineraries selected
const InstrStage *Stages; ///< Array of stages selected
const InstrItinerary *Itineratries; ///< Array of itineraries selected
//
// Ctors.
//
/// Ctors.
///
InstrItineraryData() : Stages(0), Itineratries(0) {}
InstrItineraryData(const InstrStage *S, const InstrItinerary *I)
: Stages(S), Itineratries(I) {}
//
// isEmpty - Returns true if there are no itineraries.
//
/// isEmpty - Returns true if there are no itineraries.
///
inline bool isEmpty() const { return Itineratries == 0; }
//
// begin - Return the first stage of the itinerary.
//
/// begin - Return the first stage of the itinerary.
///
inline const InstrStage *begin(unsigned ItinClassIndx) const {
unsigned StageIdx = Itineratries[ItinClassIndx].First;
return Stages + StageIdx;
}
//
// end - Return the last+1 stage of the itinerary.
//
/// end - Return the last+1 stage of the itinerary.
///
inline const InstrStage *end(unsigned ItinClassIndx) const {
unsigned StageIdx = Itineratries[ItinClassIndx].Last;
return Stages + StageIdx;