blob: 32cf954ac6588d787bacd32e71c2cc1006ed4a61 [file] [log] [blame]
Gabor Greif697e94c2008-05-15 10:04:30 +00001//===-- Use.cpp - Implement the Use class ---------------------------------===//
Gabor Greiff6caff662008-05-10 08:32:32 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file implements the algorithm for finding the User of a Use.
11//
12//===----------------------------------------------------------------------===//
13
Jay Foad59809c72011-01-16 08:10:57 +000014#include "llvm/Value.h"
Gabor Greiff6caff662008-05-10 08:32:32 +000015
16namespace llvm {
17
18//===----------------------------------------------------------------------===//
Gabor Greif5ef74042008-05-13 22:51:52 +000019// Use swap Implementation
20//===----------------------------------------------------------------------===//
21
22void Use::swap(Use &RHS) {
Gabor Greif715b9d22008-09-19 15:13:20 +000023 Value *V1(Val);
24 Value *V2(RHS.Val);
Gabor Greif5ef74042008-05-13 22:51:52 +000025 if (V1 != V2) {
26 if (V1) {
27 removeFromList();
28 }
29
30 if (V2) {
31 RHS.removeFromList();
Gabor Greif715b9d22008-09-19 15:13:20 +000032 Val = V2;
Gabor Greif5ef74042008-05-13 22:51:52 +000033 V2->addUse(*this);
34 } else {
Gabor Greif715b9d22008-09-19 15:13:20 +000035 Val = 0;
Gabor Greif5ef74042008-05-13 22:51:52 +000036 }
37
38 if (V1) {
Gabor Greif715b9d22008-09-19 15:13:20 +000039 RHS.Val = V1;
Gabor Greif5ef74042008-05-13 22:51:52 +000040 V1->addUse(RHS);
41 } else {
Gabor Greif715b9d22008-09-19 15:13:20 +000042 RHS.Val = 0;
Gabor Greif5ef74042008-05-13 22:51:52 +000043 }
44 }
45}
46
47//===----------------------------------------------------------------------===//
Gabor Greiff6caff662008-05-10 08:32:32 +000048// Use getImpliedUser Implementation
49//===----------------------------------------------------------------------===//
50
51const Use *Use::getImpliedUser() const {
52 const Use *Current = this;
53
54 while (true) {
Gabor Greif2231c2c2009-01-05 16:05:32 +000055 unsigned Tag = (Current++)->Prev.getInt();
Gabor Greiff6caff662008-05-10 08:32:32 +000056 switch (Tag) {
57 case zeroDigitTag:
58 case oneDigitTag:
59 continue;
60
61 case stopTag: {
62 ++Current;
63 ptrdiff_t Offset = 1;
64 while (true) {
Gabor Greif2231c2c2009-01-05 16:05:32 +000065 unsigned Tag = Current->Prev.getInt();
Gabor Greiff6caff662008-05-10 08:32:32 +000066 switch (Tag) {
67 case zeroDigitTag:
68 case oneDigitTag:
69 ++Current;
70 Offset = (Offset << 1) + Tag;
71 continue;
72 default:
73 return Current + Offset;
74 }
75 }
76 }
77
78 case fullStopTag:
79 return Current;
80 }
81 }
82}
83
84//===----------------------------------------------------------------------===//
85// Use initTags Implementation
86//===----------------------------------------------------------------------===//
87
88Use *Use::initTags(Use * const Start, Use *Stop, ptrdiff_t Done) {
Gabor Greif39c06b32010-07-19 14:48:15 +000089 while (Done < 20) {
Gabor Greiffee4daf2010-07-16 20:35:19 +000090 if (Start == Stop--)
91 return Start;
Gabor Greif39c06b32010-07-19 14:48:15 +000092 static const PrevPtrTag tags[20] = { fullStopTag, oneDigitTag, stopTag,
93 oneDigitTag, oneDigitTag, stopTag,
94 zeroDigitTag, oneDigitTag, oneDigitTag,
95 stopTag, zeroDigitTag, oneDigitTag,
96 zeroDigitTag, oneDigitTag, stopTag,
97 oneDigitTag, oneDigitTag, oneDigitTag,
98 oneDigitTag, stopTag
99 };
Gabor Greiffee4daf2010-07-16 20:35:19 +0000100 Stop->Prev.setFromOpaqueValue(reinterpret_cast<Use**>(tags[Done++]));
101 Stop->Val = 0;
102 }
103
Gabor Greiff6caff662008-05-10 08:32:32 +0000104 ptrdiff_t Count = Done;
105 while (Start != Stop) {
106 --Stop;
Gabor Greif715b9d22008-09-19 15:13:20 +0000107 Stop->Val = 0;
Gabor Greiff6caff662008-05-10 08:32:32 +0000108 if (!Count) {
Gabor Greif29609872010-07-17 20:52:46 +0000109 Stop->Prev.setFromOpaqueValue(reinterpret_cast<Use**>(stopTag));
Gabor Greiff6caff662008-05-10 08:32:32 +0000110 ++Done;
111 Count = Done;
112 } else {
Gabor Greif2231c2c2009-01-05 16:05:32 +0000113 Stop->Prev.setFromOpaqueValue(reinterpret_cast<Use**>(Count & 1));
Gabor Greiff6caff662008-05-10 08:32:32 +0000114 Count >>= 1;
115 ++Done;
116 }
117 }
118
119 return Start;
120}
121
122//===----------------------------------------------------------------------===//
123// Use zap Implementation
124//===----------------------------------------------------------------------===//
125
126void Use::zap(Use *Start, const Use *Stop, bool del) {
127 if (del) {
128 while (Start != Stop) {
129 (--Stop)->~Use();
130 }
131 ::operator delete(Start);
132 return;
133 }
134
135 while (Start != Stop) {
136 (Start++)->set(0);
137 }
138}
139
140//===----------------------------------------------------------------------===//
Gabor Greiff6caff662008-05-10 08:32:32 +0000141// Use getUser Implementation
142//===----------------------------------------------------------------------===//
143
144User *Use::getUser() const {
145 const Use *End = getImpliedUser();
Gabor Greif4077dd02009-01-05 17:19:25 +0000146 const PointerIntPair<User*, 1, Tag>& ref(
147 static_cast<const AugmentedUse*>(End - 1)->ref);
Gabor Greif2231c2c2009-01-05 16:05:32 +0000148 User *She = ref.getPointer();
149 return ref.getInt()
Gabor Greif6265ab82009-01-05 16:28:14 +0000150 ? She
151 : (User*)End;
Gabor Greiff6caff662008-05-10 08:32:32 +0000152}
153
Gabor Greiff6caff662008-05-10 08:32:32 +0000154} // End llvm namespace