2008-05-15 10:04:30 +00:00
|
|
|
//===-- Use.cpp - Implement the Use class ---------------------------------===//
|
2008-05-10 08:32:32 +00:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the algorithm for finding the User of a Use.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/User.h"
|
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
|
2008-05-13 22:51:52 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Use swap Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
void Use::swap(Use &RHS) {
|
2008-09-19 15:13:20 +00:00
|
|
|
Value *V1(Val);
|
|
|
|
Value *V2(RHS.Val);
|
2008-05-13 22:51:52 +00:00
|
|
|
if (V1 != V2) {
|
|
|
|
if (V1) {
|
|
|
|
removeFromList();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (V2) {
|
|
|
|
RHS.removeFromList();
|
2008-09-19 15:13:20 +00:00
|
|
|
Val = V2;
|
2008-05-13 22:51:52 +00:00
|
|
|
V2->addUse(*this);
|
|
|
|
} else {
|
2008-09-19 15:13:20 +00:00
|
|
|
Val = 0;
|
2008-05-13 22:51:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (V1) {
|
2008-09-19 15:13:20 +00:00
|
|
|
RHS.Val = V1;
|
2008-05-13 22:51:52 +00:00
|
|
|
V1->addUse(RHS);
|
|
|
|
} else {
|
2008-09-19 15:13:20 +00:00
|
|
|
RHS.Val = 0;
|
2008-05-13 22:51:52 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-05-10 08:32:32 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Use getImpliedUser Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
const Use *Use::getImpliedUser() const {
|
|
|
|
const Use *Current = this;
|
|
|
|
|
|
|
|
while (true) {
|
2009-01-05 16:05:32 +00:00
|
|
|
unsigned Tag = (Current++)->Prev.getInt();
|
2008-05-10 08:32:32 +00:00
|
|
|
switch (Tag) {
|
|
|
|
case zeroDigitTag:
|
|
|
|
case oneDigitTag:
|
|
|
|
continue;
|
|
|
|
|
|
|
|
case stopTag: {
|
|
|
|
++Current;
|
|
|
|
ptrdiff_t Offset = 1;
|
|
|
|
while (true) {
|
2009-01-05 16:05:32 +00:00
|
|
|
unsigned Tag = Current->Prev.getInt();
|
2008-05-10 08:32:32 +00:00
|
|
|
switch (Tag) {
|
|
|
|
case zeroDigitTag:
|
|
|
|
case oneDigitTag:
|
|
|
|
++Current;
|
|
|
|
Offset = (Offset << 1) + Tag;
|
|
|
|
continue;
|
|
|
|
default:
|
|
|
|
return Current + Offset;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
case fullStopTag:
|
|
|
|
return Current;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Use initTags Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
Use *Use::initTags(Use * const Start, Use *Stop, ptrdiff_t Done) {
|
|
|
|
ptrdiff_t Count = Done;
|
|
|
|
while (Start != Stop) {
|
|
|
|
--Stop;
|
2008-09-19 15:13:20 +00:00
|
|
|
Stop->Val = 0;
|
2008-05-10 08:32:32 +00:00
|
|
|
if (!Count) {
|
2009-01-05 17:19:25 +00:00
|
|
|
Stop->Prev.setFromOpaqueValue(reinterpret_cast<Use**>(Done == 0
|
|
|
|
? fullStopTag
|
|
|
|
: stopTag));
|
2008-05-10 08:32:32 +00:00
|
|
|
++Done;
|
|
|
|
Count = Done;
|
|
|
|
} else {
|
2009-01-05 16:05:32 +00:00
|
|
|
Stop->Prev.setFromOpaqueValue(reinterpret_cast<Use**>(Count & 1));
|
2008-05-10 08:32:32 +00:00
|
|
|
Count >>= 1;
|
|
|
|
++Done;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return Start;
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Use zap Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
void Use::zap(Use *Start, const Use *Stop, bool del) {
|
|
|
|
if (del) {
|
|
|
|
while (Start != Stop) {
|
|
|
|
(--Stop)->~Use();
|
|
|
|
}
|
|
|
|
::operator delete(Start);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (Start != Stop) {
|
|
|
|
(Start++)->set(0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AugmentedUse layout struct
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
struct AugmentedUse : Use {
|
2009-01-05 16:05:32 +00:00
|
|
|
PointerIntPair<User*, 1, Tag> ref;
|
2008-05-10 08:32:32 +00:00
|
|
|
AugmentedUse(); // not implemented
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Use getUser Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
User *Use::getUser() const {
|
|
|
|
const Use *End = getImpliedUser();
|
2009-01-05 17:19:25 +00:00
|
|
|
const PointerIntPair<User*, 1, Tag>& ref(
|
|
|
|
static_cast<const AugmentedUse*>(End - 1)->ref);
|
2009-01-05 16:05:32 +00:00
|
|
|
User *She = ref.getPointer();
|
|
|
|
return ref.getInt()
|
2009-01-05 16:28:14 +00:00
|
|
|
? She
|
|
|
|
: (User*)End;
|
2008-05-10 08:32:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// User allocHungoffUses Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
Use *User::allocHungoffUses(unsigned N) const {
|
2008-05-15 10:04:30 +00:00
|
|
|
Use *Begin = static_cast<Use*>(::operator new(sizeof(Use) * N
|
|
|
|
+ sizeof(AugmentedUse)
|
|
|
|
- sizeof(Use)));
|
2008-05-10 08:32:32 +00:00
|
|
|
Use *End = Begin + N;
|
2009-01-05 16:28:14 +00:00
|
|
|
PointerIntPair<User*, 1, Tag>& ref(static_cast<AugmentedUse&>(End[-1]).ref);
|
2009-01-05 16:05:32 +00:00
|
|
|
ref.setPointer(const_cast<User*>(this));
|
|
|
|
ref.setInt(tagOne);
|
2008-05-10 08:32:32 +00:00
|
|
|
return Use::initTags(Begin, End);
|
|
|
|
}
|
|
|
|
|
|
|
|
} // End llvm namespace
|