HomeSort by: relevance | last modified time | path
    Searched defs:ValueInfo (Results 1 - 7 of 7) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
CFLGraph.h 73 class ValueInfo {
98 using ValueMap = DenseMap<Value *, ValueInfo>;
CFLSteensAliasAnalysis.cpp 195 auto &ValueInfo = Mapping.second;
197 assert(ValueInfo.getNumLevels() > 0);
200 ValueInfo.getNodeInfoAtLevel(0).Attr);
201 for (unsigned I = 0, E = ValueInfo.getNumLevels() - 1; I < E; ++I) {
204 ValueInfo.getNodeInfoAtLevel(I + 1).Attr);
215 auto &ValueInfo = Mapping.second;
217 for (unsigned I = 0, E = ValueInfo.getNumLevels(); I < E; ++I) {
219 for (auto &Edge : ValueInfo.getNodeInfoAtLevel(I).Edges)
ModuleSummaryAnalysis.cpp 91 SetVector<ValueInfo> &RefEdges,
250 MapVector<ValueInfo, CalleeInfo> CallGraphEdges;
251 SetVector<ValueInfo> RefEdges, LoadRefEdges, StoreRefEdges;
349 auto &ValueInfo = CallGraphEdges[Index.getOrInsertValueInfo(
351 ValueInfo.updateHotness(Hotness);
357 ValueInfo.updateRelBlockFreq(BBFreq, EntryFreq);
391 std::vector<ValueInfo> Refs;
394 SetVector<ValueInfo> &Edges,
573 SetVector<ValueInfo> RefEdges;
638 if (ValueInfo VI = Index.getValueInfo(GlobalValue::getGUID(Name))
    [all...]
CFLAndersAliasAnalysis.cpp 610 auto &ValueInfo = Mapping.second;
611 assert(ValueInfo.getNumLevels() > 0);
614 for (unsigned I = 0, E = ValueInfo.getNumLevels(); I < E; ++I) {
618 for (auto &Edge : ValueInfo.getNodeInfoAtLevel(I).Edges) {
743 auto &ValueInfo = Mapping.second;
744 for (unsigned I = 0, E = ValueInfo.getNumLevels(); I < E; ++I) {
746 AttrMap.add(Node, ValueInfo.getNodeInfoAtLevel(I).Attr);
  /src/external/apache2/llvm/dist/clang/include/clang/AST/
ComparisonCategories.h 83 struct ValueInfo {
87 ValueInfo(ComparisonCategoryResult Kind, VarDecl *VD)
104 ValueInfo, static_cast<unsigned>(ComparisonCategoryResult::Last) + 1>
107 /// Lookup the ValueInfo struct for the specified ValueKind. If the
110 /// If the ValueInfo does not have a valid integer value the variable
112 ValueInfo *lookupValueInfo(ComparisonCategoryResult ValueKind) const;
126 const ValueInfo *getValueInfo(ComparisonCategoryResult ValueKind) const {
127 ValueInfo *Info = lookupValueInfo(ValueKind);
158 const ValueInfo *getEqualOrEquiv() const {
161 const ValueInfo *getLess() const
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
PredicateInfo.cpp 251 struct ValueInfo {
263 SmallVector<ValueInfo, 32> ValueInfos;
274 ValueInfo &getOrCreateValueInfo(Value *);
275 const ValueInfo &getValueInfo(Value *) const;
620 const auto &ValueInfo = getValueInfo(Op);
624 for (auto &PossibleCopy : ValueInfo.Infos) {
734 PredicateInfoBuilder::ValueInfo &
748 const PredicateInfoBuilder::ValueInfo &
  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
ModuleSummaryIndex.h 157 /// (which are used by ValueInfo) are not invalidated by insertion. Also it will
166 struct ValueInfo {
171 ValueInfo() = default;
172 ValueInfo(bool HaveGVs, const GlobalValueSummaryMapTy::value_type *R) {
213 // ValueInfo lifetime.
239 inline raw_ostream &operator<<(raw_ostream &OS, const ValueInfo &VI) {
246 inline bool operator==(const ValueInfo &A, const ValueInfo &B) {
248 "Need ValueInfo with non-null Ref for comparison");
252 inline bool operator!=(const ValueInfo &A, const ValueInfo &B)
    [all...]

Completed in 19 milliseconds