llvm.org GIT mirror llvm / cf3056d
Regularize header file comments git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@9071 91177308-0d34-0410-b5e6-96231b3b80d8 Chris Lattner 17 years ago
45 changed file(s) with 86 addition(s) and 99 deletion(s). Raw diff Collapse all Expand all
None //===- Expressions.cpp - Expression Analysis Utilities ----------------------=//
0 //===- Expressions.cpp - Expression Analysis Utilities --------------------===//
11 //
22 // This file defines a package of expression analysis utilties:
33 //
None //===- FindUnsafePointerTypes.cpp - Check pointer usage safety --------------=//
0 //===- FindUnsafePointerTypes.cpp - Check pointer usage safety ------------===//
11 //
22 // This file defines a pass that can be used to determine, interprocedurally,
33 // which pointer types are accessed unsafely in a program. If there is an
None //===- FindUsedTypes.cpp - Find all Types used by a module ------------------=//
0 //===- FindUsedTypes.cpp - Find all Types used by a module ----------------===//
11 //
22 // This pass is used to seek out all of the types in use by the program.
33 //
None //===- Interval.cpp - Interval class code ------------------------*- C++ -*--=//
0 //===- Interval.cpp - Interval class code ---------------------------------===//
11 //
22 // This file contains the definition of the Interval class, which represents a
33 // partition of a control flow graph of some kind.
None //===- IntervalPartition.cpp - Interval Partition module code ----*- C++ -*--=//
0 //===- IntervalPartition.cpp - Interval Partition module code -------------===//
11 //
22 // This file contains the definition of the IntervalPartition class, which
33 // calculates and represent the interval partition of a function.
66
77 #include "llvm/Analysis/IntervalIterator.h"
88 #include "Support/STLExtras.h"
9
10 using std::make_pair;
119
1210 static RegisterAnalysis
1311 X("intervals", "Interval Partition Construction", true);
3836 // Add mappings for all of the basic blocks in I to the IntervalPartition
3937 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
4038 It != End; ++It)
41 IntervalMap.insert(make_pair(*It, I));
39 IntervalMap.insert(std::make_pair(*It, I));
4240 }
4341
4442 // updatePredecessors - Interval generation only sets the successor fields of
None //===-- BBLiveVar.h - Live Variable Analysis for a BasicBlock ----*- C++ -*--=//
0 //===-- BBLiveVar.h - Live Variable Analysis for a BasicBlock ---*- C++ -*-===//
11 //
22 // This is a BasicBlock annotation class that is used by live var analysis to
33 // hold data flow information for a basic block.
None //===- LoopInfo.cpp - Natural Loop Calculator -------------------------------=//
0 //===- LoopInfo.cpp - Natural Loop Calculator -----------------------------===//
11 //
22 // This file defines the LoopInfo class that is used to identify natural loops
33 // and determine the loop depth of various nodes of the CFG. Note that the
None //===-- ParserInternals.h - Definitions internal to the parser ---*- C++ -*--=//
0 //===-- ParserInternals.h - Definitions internal to the parser --*- C++ -*-===//
11 //
22 // This header file defines the various variables that are shared among the
33 // different components of the parser...
None //===-- llvmAsmParser.y - Parser for llvm assembly files ---------*- C++ -*--=//
0 //===-- llvmAsmParser.y - Parser for llvm assembly files --------*- C++ -*-===//
11 //
22 // This file implements the bison parser for LLVM assembly languages files.
33 //
4 //===------------------------------------------------------------------------=//
4 //===----------------------------------------------------------------------===//
55
66 %{
77 #include "ParserInternals.h"
None //===-- ReaderInternals.h - Definitions internal to the reader ---*- C++ -*--=//
0 //===-- ReaderInternals.h - Definitions internal to the reader ------------===//
11 //
22 // This header file defines various stuff that is used by the bytecode reader.
33 //
None //===-- WriteConst.cpp - Functions for writing constants ---------*- C++ -*--=//
0 //===-- ConstantWriter.cpp - Functions for writing constants --------------===//
11 //
22 // This file implements the routines for encoding constants to a bytecode
33 // stream.
4 //
5 // Note that the performance of this library is not terribly important, because
6 // it shouldn't be used by JIT type applications... so it is not a huge focus
7 // at least. :)
84 //
95 //===----------------------------------------------------------------------===//
106
None //===-- WriteInst.cpp - Functions for writing instructions -------*- C++ -*--=//
0 //===-- InstructionWriter.cpp - Functions for writing instructions --------===//
11 //
22 // This file implements the routines for encoding instruction opcodes to a
33 // bytecode stream.
4 //
5 // Note that the performance of this library is not terribly important, because
6 // it shouldn't be used by JIT type applications... so it is not a huge focus
7 // at least. :)
84 //
95 //===----------------------------------------------------------------------===//
106
None //===-- SlotCalculator.cpp - Calculate what slots values land in ------------=//
0 //===-- SlotCalculator.cpp - Calculate what slots values land in ----------===//
11 //
22 // This file implements a useful analysis step to figure out what numbered
33 // slots values in a program will land in (keeping track of per plane
None //===-- Writer.cpp - Library for writing VM bytecode files -------*- C++ -*--=//
0 //===-- Writer.cpp - Library for writing VM bytecode files ----------------===//
11 //
22 // This library implements the functionality defined in llvm/Bytecode/Writer.h
33 //
None //===-- WriterInternals.h - Data structures shared by the Writer -*- C++ -*--=//
0 //===- WriterInternals.h - Data structures shared by the Writer -*- C++ -*-===//
11 //
22 // This header defines the interface used between components of the bytecode
33 // writer.
None //===-- SchedGraph.h - Scheduling Graph --------------------------*- C++ -*--=//
0 //===-- SchedGraph.h - Scheduling Graph -------------------------*- C++ -*-===//
11 //
2 // Purpose:
3 // Scheduling graph based on SSA graph plus extra dependence edges
4 // capturing dependences due to machine resources (machine registers,
5 // CC registers, and any others).
6 //
7 // Strategy:
8 // This graph tries to leverage the SSA graph as much as possible,
9 // but captures the extra dependences through a common interface.
2 // This is a scheduling graph based on SSA graph plus extra dependence edges
3 // capturing dependences due to machine resources (machine registers, CC
4 // registers, and any others).
5 //
6 // This graph tries to leverage the SSA graph as much as possible, but captures
7 // the extra dependences through a common interface.
108 //
119 //===----------------------------------------------------------------------===//
1210
None //===-- ModuloScheduling.cpp - Software Pipeling Approach - SMS --*- C++ -*--=//
0 //===-- ModuloScheduling.cpp - Software Pipeling Approach - SMS -----------===//
11 //
22 // The is a software pipelining pass based on the Swing Modulo Scheduling
33 // algorithm (SMS).
None //===-- Annotation.cpp - Implement the Annotation Classes --------*- C++ -*--=//
0 //===-- Annotation.cpp - Implement the Annotation Classes -----------------===//
11 //
22 // This file implements the AnnotationManager class.
33 //
None //===-- SchedGraph.h - Scheduling Graph --------------------------*- C++ -*--=//
0 //===-- SchedGraph.h - Scheduling Graph -------------------------*- C++ -*-===//
11 //
2 // Purpose:
3 // Scheduling graph based on SSA graph plus extra dependence edges
4 // capturing dependences due to machine resources (machine registers,
5 // CC registers, and any others).
6 //
7 // Strategy:
8 // This graph tries to leverage the SSA graph as much as possible,
9 // but captures the extra dependences through a common interface.
2 // This is a scheduling graph based on SSA graph plus extra dependence edges
3 // capturing dependences due to machine resources (machine registers, CC
4 // registers, and any others).
5 //
6 // This graph tries to leverage the SSA graph as much as possible, but captures
7 // the extra dependences through a common interface.
108 //
119 //===----------------------------------------------------------------------===//
1210
None //===-- BBLiveVar.h - Live Variable Analysis for a BasicBlock ----*- C++ -*--=//
0 //===-- BBLiveVar.h - Live Variable Analysis for a BasicBlock ---*- C++ -*-===//
11 //
22 // This is a BasicBlock annotation class that is used by live var analysis to
33 // hold data flow information for a basic block.
None //===-- ModuloScheduling.cpp - Software Pipeling Approach - SMS --*- C++ -*--=//
0 //===-- ModuloScheduling.cpp - Software Pipeling Approach - SMS -----------===//
11 //
22 // The is a software pipelining pass based on the Swing Modulo Scheduling
33 // algorithm (SMS).
None //===-- SparcRegClassInfo.h - Register class def'ns for Sparc ----*- C++ -*--=//
0 //===-- SparcRegClassInfo.h - Register class def'ns for Sparc ---*- C++ -*-===//
11 //
2 // This file defines the register classes used by the Sparc target description.
2 // This file defines the register classes used by the Sparc target description.
33 //
44 //===----------------------------------------------------------------------===//
55
1111 //-----------------------------------------------------------------------------
1212 // Integer Register Class
1313 //-----------------------------------------------------------------------------
14
1514
1615 struct SparcIntRegClass : public TargetRegClassInfo {
1716 SparcIntRegClass(unsigned ID)
None //===- MutateStructTypes.cpp - Change struct defns --------------------------=//
0 //===- MutateStructTypes.cpp - Change struct defns ------------------------===//
11 //
22 // This pass is used to change structure accesses and type definitions in some
33 // way. It can be used to arbitrarily permute structure fields, safely, without
None //===- SimpleStructMutation.cpp - Swap structure elements around -*- C++ -*--=//
0 //===- SimpleStructMutation.cpp - Swap structure elements around ----------===//
11 //
22 // This pass does a simple transformation that swaps all of the elements of the
33 // struct types in the program around.
None //===-- EmitFunctions.cpp - interface to insert instrumentation --*- C++ -*--=//
0 //===-- EmitFunctions.cpp - interface to insert instrumentation -----------===//
11 //
22 // This inserts a global constant table with function pointers all along
33 //
None //===-- CombineBranch.cpp ------------------------------------ ---*- C++ -*--=//
0 //===-- CombineBranch.cpp -------------------------------------------------===//
1 //
12 // Pass to instrument loops
23 //
34 // At every backedge, insert a counter for that backedge and a call function
5 //
46 //===----------------------------------------------------------------------===//
57
68 #include "llvm/Analysis/Dominators.h"
None //===-- ------------------------llvm/graph.h ---------------------*- C++ -*--=//
0 //===-- Graph.h -------------------------------------------------*- C++ -*-===//
11 //
2 //Header file for Graph: This Graph is used by
3 //PathProfiles class, and is used
4 //for detecting proper points in cfg for code insertion
2 // Header file for Graph: This Graph is used by PathProfiles class, and is used
3 // for detecting proper points in cfg for code insertion
54 //
65 //===----------------------------------------------------------------------===//
76
None //===-- GrapAuxiliary.cpp- Auxiliary functions on graph ----------*- C++ -*--=//
0 //===- GraphAuxiliary.cpp - Auxiliary functions on graph ------------------===//
11 //
2 //auxiliary function associated with graph: they
3 //all operate on graph, and help in inserting
4 //instrumentation for trace generation
2 // auxiliary function associated with graph: they all operate on graph, and help
3 // in inserting instrumentation for trace generation
54 //
65 //===----------------------------------------------------------------------===//
76
None //===-- InstLoops.cpp ---------------------------------------- ---*- C++ -*--=//
0 //===-- InstLoops.cpp -----------------------------------------------------===//
1 //
12 // Pass to instrument loops
23 //
34 // At every backedge, insert a counter for that backedge and a call function
5 //
46 //===----------------------------------------------------------------------===//
57
68 #include "llvm/Analysis/Dominators.h"
2628 BLACK
2729 };
2830
29 namespace{
31 namespace {
3032 typedef std::map BBMap;
3133 struct InstLoops : public FunctionPass {
3234 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
None //===-- ProfilePaths.cpp - interface to insert instrumentation ---*- C++ -*--=//
1 //
2 // This inserts instrumentation for counting
3 // execution of paths though a given function
4 // Its implemented as a "Function" Pass, and called using opt
0 //===-- ProfilePaths.cpp - interface to insert instrumentation --*- C++ -*-===//
1 //
2 // This inserts instrumentation for counting execution of paths though a given
3 // function Its implemented as a "Function" Pass, and called using opt
54 //
65 // This pass is implemented by using algorithms similar to
76 // 1."Efficient Path Profiling": Ball, T. and Larus, J. R.,
8 // Proceedings of Micro-29, Dec 1996, Paris, France.
7 // Proceedings of Micro-29, Dec 1996, Paris, France.
98 // 2."Efficiently Counting Program events with support for on-line
109 // "queries": Ball T., ACM Transactions on Programming Languages
11 // and systems, Sep 1994.
12 //
13 // The algorithms work on a Graph constructed over the nodes
14 // made from Basic Blocks: The transformations then take place on
15 // the constructed graph (implementation in Graph.cpp and GraphAuxiliary.cpp)
16 // and finally, appropriate instrumentation is placed over suitable edges.
17 // (code inserted through EdgeCode.cpp).
10 // and systems, Sep 1994.
11 //
12 // The algorithms work on a Graph constructed over the nodes made from Basic
13 // Blocks: The transformations then take place on the constructed graph
14 // (implementation in Graph.cpp and GraphAuxiliary.cpp) and finally, appropriate
15 // instrumentation is placed over suitable edges. (code inserted through
16 // EdgeCode.cpp).
1817 //
19 // The algorithm inserts code such that every acyclic path in the CFG
20 // of a function is identified through a unique number. the code insertion
21 // is optimal in the sense that its inserted over a minimal set of edges. Also,
22 // the algorithm makes sure than initialization, path increment and counter
23 // update can be collapsed into minimum number of edges.
18 // The algorithm inserts code such that every acyclic path in the CFG of a
19 // function is identified through a unique number. the code insertion is optimal
20 // in the sense that its inserted over a minimal set of edges. Also, the
21 // algorithm makes sure than initialization, path increment and counter update
22 // can be collapsed into minimum number of edges.
23 //
2424 //===----------------------------------------------------------------------===//
2525
2626 #include "llvm/Transforms/Utils/UnifyFunctionExitNodes.h"
None //===----Instrumentation/ProfilePaths/RetracePath.cppTrigger.cpp--*- C++ -*--=//
0 //===- RetracePath.cpp ----------------------------------------------------===//
11 //
22 // Retraces a path of BasicBlock, given a path number and a graph!
33 //
None //===- TraceValues.cpp - Value Tracing for debugging -------------*- C++ -*--=//
0 //===- TraceValues.cpp - Value Tracing for debugging ----------------------===//
11 //
22 // Support for inserting LLVM code to print values at basic block and function
33 // exits.
None //===- LevelRaise.cpp - Code to change LLVM to higher level -----------------=//
0 //===- LevelRaise.cpp - Code to change LLVM to higher level ---------------===//
11 //
22 // This file implements the 'raising' part of the LevelChange API. This is
33 // useful because, in general, it makes the LLVM code terser and easier to
None //===-- TransformInternals.cpp - Implement shared functions for transforms --=//
0 //===- TransformInternals.cpp - Implement shared functions for transforms -===//
11 //
22 // This file defines shared functions used by the different components of the
33 // Transforms library.
None //===-- TransformInternals.h - Shared functions for Transforms ---*- C++ -*--=//
0 //===-- TransformInternals.h - Shared functions for Transforms --*- C++ -*-===//
11 //
22 // This header file declares shared functions used by the different components
33 // of the Transforms library.
None //===-- Function.cpp - Implement the Global object classes -------*- C++ -*--=//
0 //===-- Function.cpp - Implement the Global object classes ----------------===//
11 //
22 // This file implements the Function & GlobalVariable classes for the VMCore
33 // library.
None //===-- Instruction.cpp - Implement the Instruction class --------*- C++ -*--=//
0 //===-- Instruction.cpp - Implement the Instruction class -----------------===//
11 //
22 // This file implements the Instruction class for the VMCore library.
33 //
None //===-- Module.cpp - Implement the Module class ------------------*- C++ -*--=//
0 //===-- Module.cpp - Implement the Module class ---------------------------===//
11 //
22 // This file implements the Module class for the VMCore library.
33 //
None //===- PassManagerT.h - Container for Passes ---------------------*- C++ -*--=//
0 //===- PassManagerT.h - Container for Passes ------------------------------===//
11 //
22 // This file defines the PassManagerT class. This class is used to hold,
33 // maintain, and optimize execution of Pass's. The PassManager class ensures
None //===-- SlotCalculator.cpp - Calculate what slots values land in ------------=//
0 //===-- SlotCalculator.cpp - Calculate what slots values land in ----------===//
11 //
22 // This file implements a useful analysis step to figure out what numbered
33 // slots values in a program will land in (keeping track of per plane
None //===-- SymbolTable.cpp - Implement the SymbolTable class -------------------=//
0 //===-- SymbolTable.cpp - Implement the SymbolTable class -----------------===//
11 //
22 // This file implements the SymbolTable class for the VMCore library.
33 //
None //===-- iBranch.cpp - Implement the Branch instruction -----------*- C++ -*--=//
0 //===-- iBranch.cpp - Implement the Branch instruction --------------------===//
11 //
22 // This file implements the 'br' instruction, which can represent either a
33 // conditional or unconditional branch.
None //===-- iCall.cpp - Implement the call & invoke instructions -----*- C++ -*--=//
0 //===-- iCall.cpp - Implement the call & invoke instructions --------------===//
11 //
22 // This file implements the call and invoke instructions.
33 //
None //===-- iSwitch.cpp - Implement the Switch instruction -----------*- C++ -*--=//
0 //===-- iSwitch.cpp - Implement the Switch instruction --------------------===//
11 //
22 // This file implements the Switch instruction...
33 //
11 //
22 // This file implements the bison parser for Table Generator files...
33 //
4 //===------------------------------------------------------------------------=//
4 //===----------------------------------------------------------------------===//
55
66 %{
77 #include "Record.h"