mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 19:12:56 +02:00
076a6683eb
We've been running doxygen with the autobrief option for a couple of years now. This makes the \brief markers into our comments redundant. Since they are a visual distraction and we don't want to encourage more \brief markers in new code either, this patch removes them all. Patch produced by for i in $(git grep -l '\\brief'); do perl -pi -e 's/\\brief //g' $i & done Differential Revision: https://reviews.llvm.org/D46290 llvm-svn: 331272
68 lines
2.5 KiB
C++
68 lines
2.5 KiB
C++
//===- llvm/Analysis/OrderedBasicBlock.h --------------------- -*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file defines the OrderedBasicBlock class. OrderedBasicBlock maintains
|
|
// an interface where clients can query if one instruction comes before another
|
|
// in a BasicBlock. Since BasicBlock currently lacks a reliable way to query
|
|
// relative position between instructions one can use OrderedBasicBlock to do
|
|
// such queries. OrderedBasicBlock is lazily built on a source BasicBlock and
|
|
// maintains an internal Instruction -> Position map. A OrderedBasicBlock
|
|
// instance should be discarded whenever the source BasicBlock changes.
|
|
//
|
|
// It's currently used by the CaptureTracker in order to find relative
|
|
// positions of a pair of instructions inside a BasicBlock.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_ANALYSIS_ORDEREDBASICBLOCK_H
|
|
#define LLVM_ANALYSIS_ORDEREDBASICBLOCK_H
|
|
|
|
#include "llvm/ADT/DenseMap.h"
|
|
#include "llvm/IR/BasicBlock.h"
|
|
|
|
namespace llvm {
|
|
|
|
class Instruction;
|
|
class BasicBlock;
|
|
|
|
class OrderedBasicBlock {
|
|
private:
|
|
/// Map a instruction to its position in a BasicBlock.
|
|
SmallDenseMap<const Instruction *, unsigned, 32> NumberedInsts;
|
|
|
|
/// Keep track of last instruction inserted into \p NumberedInsts.
|
|
/// It speeds up queries for uncached instructions by providing a start point
|
|
/// for new queries in OrderedBasicBlock::comesBefore.
|
|
BasicBlock::const_iterator LastInstFound;
|
|
|
|
/// The position/number to tag the next instruction to be found.
|
|
unsigned NextInstPos;
|
|
|
|
/// The source BasicBlock to map.
|
|
const BasicBlock *BB;
|
|
|
|
/// Given no cached results, find if \p A comes before \p B in \p BB.
|
|
/// Cache and number out instruction while walking \p BB.
|
|
bool comesBefore(const Instruction *A, const Instruction *B);
|
|
|
|
public:
|
|
OrderedBasicBlock(const BasicBlock *BasicB);
|
|
|
|
/// Find out whether \p A dominates \p B, meaning whether \p A
|
|
/// comes before \p B in \p BB. This is a simplification that considers
|
|
/// cached instruction positions and ignores other basic blocks, being
|
|
/// only relevant to compare relative instructions positions inside \p BB.
|
|
/// Returns false for A == B.
|
|
bool dominates(const Instruction *A, const Instruction *B);
|
|
};
|
|
|
|
} // End llvm namespace
|
|
|
|
#endif
|