xref: /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/GlobalStatus.cpp (revision d5b0e70f7e04d971691517ce1304d86a1e367e2e)
1 //===-- GlobalStatus.cpp - Compute status info for globals -----------------==//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 
9 #include "llvm/Transforms/Utils/GlobalStatus.h"
10 #include "llvm/ADT/SmallPtrSet.h"
11 #include "llvm/IR/BasicBlock.h"
12 #include "llvm/IR/Constant.h"
13 #include "llvm/IR/Constants.h"
14 #include "llvm/IR/GlobalValue.h"
15 #include "llvm/IR/GlobalVariable.h"
16 #include "llvm/IR/InstrTypes.h"
17 #include "llvm/IR/Instruction.h"
18 #include "llvm/IR/Instructions.h"
19 #include "llvm/IR/IntrinsicInst.h"
20 #include "llvm/IR/Use.h"
21 #include "llvm/IR/User.h"
22 #include "llvm/IR/Value.h"
23 #include "llvm/Support/AtomicOrdering.h"
24 #include "llvm/Support/Casting.h"
25 #include <algorithm>
26 #include <cassert>
27 
28 using namespace llvm;
29 
30 /// Return the stronger of the two ordering. If the two orderings are acquire
31 /// and release, then return AcquireRelease.
32 ///
33 static AtomicOrdering strongerOrdering(AtomicOrdering X, AtomicOrdering Y) {
34   if ((X == AtomicOrdering::Acquire && Y == AtomicOrdering::Release) ||
35       (Y == AtomicOrdering::Acquire && X == AtomicOrdering::Release))
36     return AtomicOrdering::AcquireRelease;
37   return (AtomicOrdering)std::max((unsigned)X, (unsigned)Y);
38 }
39 
40 /// It is safe to destroy a constant iff it is only used by constants itself.
41 /// Note that constants cannot be cyclic, so this test is pretty easy to
42 /// implement recursively.
43 ///
44 bool llvm::isSafeToDestroyConstant(const Constant *C) {
45   if (isa<GlobalValue>(C))
46     return false;
47 
48   if (isa<ConstantData>(C))
49     return false;
50 
51   for (const User *U : C->users())
52     if (const Constant *CU = dyn_cast<Constant>(U)) {
53       if (!isSafeToDestroyConstant(CU))
54         return false;
55     } else
56       return false;
57   return true;
58 }
59 
60 static bool analyzeGlobalAux(const Value *V, GlobalStatus &GS,
61                              SmallPtrSetImpl<const Value *> &VisitedUsers) {
62   if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(V))
63     if (GV->isExternallyInitialized())
64       GS.StoredType = GlobalStatus::StoredOnce;
65 
66   for (const Use &U : V->uses()) {
67     const User *UR = U.getUser();
68     if (const Constant *C = dyn_cast<Constant>(UR)) {
69       const ConstantExpr *CE = dyn_cast<ConstantExpr>(C);
70       if (CE && isa<PointerType>(CE->getType())) {
71         // Recursively analyze pointer-typed constant expressions.
72         // FIXME: Do we need to add constexpr selects to VisitedUsers?
73         if (analyzeGlobalAux(CE, GS, VisitedUsers))
74           return true;
75       } else {
76         // Ignore dead constant users.
77         if (!isSafeToDestroyConstant(C))
78           return true;
79       }
80     } else if (const Instruction *I = dyn_cast<Instruction>(UR)) {
81       if (!GS.HasMultipleAccessingFunctions) {
82         const Function *F = I->getParent()->getParent();
83         if (!GS.AccessingFunction)
84           GS.AccessingFunction = F;
85         else if (GS.AccessingFunction != F)
86           GS.HasMultipleAccessingFunctions = true;
87       }
88       if (const LoadInst *LI = dyn_cast<LoadInst>(I)) {
89         GS.IsLoaded = true;
90         // Don't hack on volatile loads.
91         if (LI->isVolatile())
92           return true;
93         GS.Ordering = strongerOrdering(GS.Ordering, LI->getOrdering());
94       } else if (const StoreInst *SI = dyn_cast<StoreInst>(I)) {
95         // Don't allow a store OF the address, only stores TO the address.
96         if (SI->getOperand(0) == V)
97           return true;
98 
99         // Don't hack on volatile stores.
100         if (SI->isVolatile())
101           return true;
102 
103         GS.Ordering = strongerOrdering(GS.Ordering, SI->getOrdering());
104 
105         // If this is a direct store to the global (i.e., the global is a scalar
106         // value, not an aggregate), keep more specific information about
107         // stores.
108         if (GS.StoredType != GlobalStatus::Stored) {
109           const Value *Ptr = SI->getPointerOperand()->stripPointerCasts();
110           if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(Ptr)) {
111             Value *StoredVal = SI->getOperand(0);
112 
113             if (Constant *C = dyn_cast<Constant>(StoredVal)) {
114               if (C->isThreadDependent()) {
115                 // The stored value changes between threads; don't track it.
116                 return true;
117               }
118             }
119 
120             if (GV->hasInitializer() && StoredVal == GV->getInitializer()) {
121               if (GS.StoredType < GlobalStatus::InitializerStored)
122                 GS.StoredType = GlobalStatus::InitializerStored;
123             } else if (isa<LoadInst>(StoredVal) &&
124                        cast<LoadInst>(StoredVal)->getOperand(0) == GV) {
125               if (GS.StoredType < GlobalStatus::InitializerStored)
126                 GS.StoredType = GlobalStatus::InitializerStored;
127             } else if (GS.StoredType < GlobalStatus::StoredOnce) {
128               GS.StoredType = GlobalStatus::StoredOnce;
129               GS.StoredOnceStore = SI;
130             } else if (GS.StoredType == GlobalStatus::StoredOnce &&
131                        GS.getStoredOnceValue() == StoredVal) {
132               // noop.
133             } else {
134               GS.StoredType = GlobalStatus::Stored;
135             }
136           } else {
137             GS.StoredType = GlobalStatus::Stored;
138           }
139         }
140       } else if (isa<BitCastInst>(I) || isa<GetElementPtrInst>(I) ||
141                  isa<AddrSpaceCastInst>(I)) {
142         // Skip over bitcasts and GEPs; we don't care about the type or offset
143         // of the pointer.
144         if (analyzeGlobalAux(I, GS, VisitedUsers))
145           return true;
146       } else if (isa<SelectInst>(I) || isa<PHINode>(I)) {
147         // Look through selects and PHIs to find if the pointer is
148         // conditionally accessed. Make sure we only visit an instruction
149         // once; otherwise, we can get infinite recursion or exponential
150         // compile time.
151         if (VisitedUsers.insert(I).second)
152           if (analyzeGlobalAux(I, GS, VisitedUsers))
153             return true;
154       } else if (isa<CmpInst>(I)) {
155         GS.IsCompared = true;
156       } else if (const MemTransferInst *MTI = dyn_cast<MemTransferInst>(I)) {
157         if (MTI->isVolatile())
158           return true;
159         if (MTI->getArgOperand(0) == V)
160           GS.StoredType = GlobalStatus::Stored;
161         if (MTI->getArgOperand(1) == V)
162           GS.IsLoaded = true;
163       } else if (const MemSetInst *MSI = dyn_cast<MemSetInst>(I)) {
164         assert(MSI->getArgOperand(0) == V && "Memset only takes one pointer!");
165         if (MSI->isVolatile())
166           return true;
167         GS.StoredType = GlobalStatus::Stored;
168       } else if (const auto *CB = dyn_cast<CallBase>(I)) {
169         if (!CB->isCallee(&U))
170           return true;
171         GS.IsLoaded = true;
172       } else {
173         return true; // Any other non-load instruction might take address!
174       }
175     } else {
176       // Otherwise must be some other user.
177       return true;
178     }
179   }
180 
181   return false;
182 }
183 
184 GlobalStatus::GlobalStatus() = default;
185 
186 bool GlobalStatus::analyzeGlobal(const Value *V, GlobalStatus &GS) {
187   SmallPtrSet<const Value *, 16> VisitedUsers;
188   return analyzeGlobalAux(V, GS, VisitedUsers);
189 }
190