6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-15 04:30:12 +00:00
Code Issues Projects Releases Wiki Activity

Add explicit keywords.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@44234 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman 2007-11-19 15:30:20 +00:00
parent 089617d9e3
commit adf3eab773
6 changed files with 17 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
include/llvm/ADT/StringMap.h
View File

@ -28,7 +28,7 @@ namespace llvm {
class StringMapEntryBase {
unsigned StrLen;
public:
StringMapEntryBase(unsigned Len) : StrLen(Len) {}
explicit StringMapEntryBase(unsigned Len) : StrLen(Len) {}
unsigned getKeyLength() const { return StrLen; }
};
@ -55,7 +55,7 @@ protected:
unsigned NumTombstones;
unsigned ItemSize;
protected:
StringMapImpl(unsigned itemSize) : ItemSize(itemSize) {
explicit StringMapImpl(unsigned itemSize) : ItemSize(itemSize) {
// Initialize the map with zero buckets to allocation.
TheTable = 0;
NumBuckets = 0;
@ -115,7 +115,7 @@ template<typename ValueTy>
class StringMapEntry : public StringMapEntryBase {
ValueTy Val;
public:
StringMapEntry(unsigned StrLen)
explicit StringMapEntry(unsigned StrLen)
: StringMapEntryBase(StrLen), Val() {}
StringMapEntry(unsigned StrLen, const ValueTy &V)
: StringMapEntryBase(StrLen), Val(V) {}
@ -204,7 +204,7 @@ class StringMap : public StringMapImpl {
typedef StringMapEntry<ValueTy> MapEntryTy;
public:
StringMap() : StringMapImpl(sizeof(MapEntryTy)) {}
StringMap(unsigned InitialSize)
explicit StringMap(unsigned InitialSize)
: StringMapImpl(InitialSize, sizeof(MapEntryTy)) {}
AllocatorTy &getAllocator() { return Allocator; }
@ -314,7 +314,7 @@ class StringMapConstIterator {
protected:
StringMapImpl::ItemBucket *Ptr;
public:
StringMapConstIterator(StringMapImpl::ItemBucket *Bucket,
explicit StringMapConstIterator(StringMapImpl::ItemBucket *Bucket,
bool NoAdvance = false)
: Ptr(Bucket) {
if (!NoAdvance) AdvancePastEmptyBuckets();

6
include/llvm/Analysis/ScalarEvolutionExpressions.h
View File

@ -285,7 +285,7 @@ namespace llvm {
class SCEVAddExpr : public SCEVCommutativeExpr {
friend class ScalarEvolution;
SCEVAddExpr(const std::vector<SCEVHandle> &ops)
explicit SCEVAddExpr(const std::vector<SCEVHandle> &ops)
: SCEVCommutativeExpr(scAddExpr, ops) {
}
@ -305,7 +305,7 @@ namespace llvm {
class SCEVMulExpr : public SCEVCommutativeExpr {
friend class ScalarEvolution;
SCEVMulExpr(const std::vector<SCEVHandle> &ops)
explicit SCEVMulExpr(const std::vector<SCEVHandle> &ops)
: SCEVCommutativeExpr(scMulExpr, ops) {
}
@ -468,7 +468,7 @@ namespace llvm {
friend class ScalarEvolution;
Value *V;
SCEVUnknown(Value *v) : SCEV(scUnknown), V(v) {}
explicit SCEVUnknown(Value *v) : SCEV(scUnknown), V(v) {}
protected:
~SCEVUnknown();

2
include/llvm/Bitcode/Serialize.h
View File

@ -31,7 +31,7 @@ class Serializer {
MapTy PtrMap;
public:
Serializer(BitstreamWriter& stream);
explicit Serializer(BitstreamWriter& stream);
~Serializer();
template <typename T>

2
lib/Bitcode/Reader/BitcodeReader.cpp
View File

@ -123,7 +123,7 @@ namespace {
void operator=(const ConstantPlaceHolder &); // DO NOT IMPLEMENT
public:
Use Op;
ConstantPlaceHolder(const Type *Ty)
explicit ConstantPlaceHolder(const Type *Ty)
: ConstantExpr(Ty, Instruction::UserOp1, &Op, 1),
Op(UndefValue::get(Type::Int32Ty), this) {
}

3
lib/Bitcode/Writer/BitcodeWriterPass.cpp
View File

@ -20,7 +20,8 @@ namespace {
std::ostream &Out; // ostream to print on
public:
static char ID; // Pass identifcation, replacement for typeid
WriteBitcodePass(std::ostream &o) : ModulePass((intptr_t) &ID), Out(o) {}
explicit WriteBitcodePass(std::ostream &o)
: ModulePass((intptr_t) &ID), Out(o) {}
const char *getPassName() const { return "Bitcode Writer"; }

8
lib/Transforms/Scalar/CorrelatedExprs.cpp
View File

@ -57,7 +57,7 @@ namespace {
Value *Val; // Relation to what value?
unsigned Rel; // SetCC or ICmp relation, or Add if no information
public:
Relation(Value *V) : Val(V), Rel(Instruction::Add) {}
explicit Relation(Value *V) : Val(V), Rel(Instruction::Add) {}
bool operator<(const Relation &R) const { return Val < R.Val; }
Value *getValue() const { return Val; }
unsigned getRelation() const { return Rel; }
@ -112,7 +112,7 @@ namespace {
//
Value *Replacement;
public:
ValueInfo(const Type *Ty)
explicit ValueInfo(const Type *Ty)
: Bounds(Ty->isInteger() ? cast<IntegerType>(Ty)->getBitWidth() : 32),
Replacement(0) {}
@ -146,7 +146,7 @@ namespace {
return *I;
// Insert and return the new relationship...
return *Relationships.insert(I, V);
return *Relationships.insert(I, Relation(V));
}
const Relation *requestRelation(Value *V) const {
@ -176,7 +176,7 @@ namespace {
typedef std::map<Value*, ValueInfo> ValueMapTy;
ValueMapTy ValueMap;
public:
RegionInfo(BasicBlock *bb) : BB(bb) {}
explicit RegionInfo(BasicBlock *bb) : BB(bb) {}
// getEntryBlock - Return the block that dominates all of the members of
// this region.