mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 19:23:23 +01:00
d3fb929e1b
Summary:
This patch adds Pi Blocks to the DDG. A pi-block represents a group of DDG
nodes that are part of a strongly-connected component of the graph.
Replacing all the SCCs with pi-blocks results in an acyclic representation
of the DDG. For example if we have:
{a -> b}, {b -> c, d}, {c -> a}
the cycle a -> b -> c -> a is abstracted into a pi-block "p" as follows:
{p -> d} with "p" containing: {a -> b}, {b -> c}, {c -> a}
In this implementation the edges between nodes that are part of the pi-block
are preserved. The crossing edges (edges where one end of the edge is in the
set of nodes belonging to an SCC and the other end is outside that set) are
replaced with corresponding edges to/from the pi-block node instead.
Authored By: bmahjour
Reviewer: Meinersbur, fhahn, myhsu, xtian, dmgreen, kbarton, jdoerfert
Reviewed By: Meinersbur
Subscribers: ychen, arphaman, simoll, a.elovikov, mgorny, hiraditya, jfb, wuzish, llvm-commits, jsji, Whitney, etiotto, ppc-slack
Tag: #llvm
Differential Revision: https://reviews.llvm.org/D68827
49 lines
1.6 KiB
C++
49 lines
1.6 KiB
C++
//===- llvm/ADT/EnumeratedArray.h - Enumerated Array-------------*- C++ -*-===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file defines an array type that can be indexed using scoped enum values.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_ADT_ENUMERATEDARRAY_H
|
|
#define LLVM_ADT_ENUMERATEDARRAY_H
|
|
|
|
#include <cassert>
|
|
|
|
namespace llvm {
|
|
|
|
template <typename ValueType, typename Enumeration,
|
|
Enumeration LargestEnum = Enumeration::Last, typename IndexType = int,
|
|
IndexType Size = 1 + static_cast<IndexType>(LargestEnum)>
|
|
class EnumeratedArray {
|
|
public:
|
|
EnumeratedArray() = default;
|
|
EnumeratedArray(ValueType V) {
|
|
for (IndexType IX = 0; IX < Size; ++IX) {
|
|
Underlying[IX] = V;
|
|
}
|
|
}
|
|
inline const ValueType &operator[](const Enumeration Index) const {
|
|
auto IX = static_cast<const IndexType>(Index);
|
|
assert(IX >= 0 && IX < Size && "Index is out of bounds.");
|
|
return Underlying[IX];
|
|
}
|
|
inline ValueType &operator[](const Enumeration Index) {
|
|
return const_cast<ValueType &>(
|
|
static_cast<const EnumeratedArray<ValueType, Enumeration, LargestEnum,
|
|
IndexType, Size> &>(*this)[Index]);
|
|
}
|
|
|
|
private:
|
|
ValueType Underlying[Size];
|
|
};
|
|
|
|
} // namespace llvm
|
|
|
|
#endif // LLVM_ADT_ENUMERATEDARRAY_H
|