1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
//===- Interval.cpp -------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
#include "llvm/Transforms/Vectorize/SandboxVectorizer/Interval.h"
#include "llvm/SandboxIR/Instruction.h"
#include "llvm/Support/Debug.h"
#include "llvm/Transforms/Vectorize/SandboxVectorizer/DependencyGraph.h"
namespace llvm::sandboxir {
template <typename T> bool Interval<T>::disjoint(const Interval &Other) const {
if (Other.empty())
return true;
if (empty())
return true;
return Other.Bottom->comesBefore(Top) || Bottom->comesBefore(Other.Top);
}
#ifndef NDEBUG
template <typename T> void Interval<T>::print(raw_ostream &OS) const {
auto *Top = top();
auto *Bot = bottom();
OS << "Top: ";
if (Top != nullptr)
OS << *Top;
else
OS << "nullptr";
OS << "\n";
OS << "Bot: ";
if (Bot != nullptr)
OS << *Bot;
else
OS << "nullptr";
OS << "\n";
}
template <typename T> void Interval<T>::dump() const { print(dbgs()); }
#endif
template class Interval<Instruction>;
template class Interval<MemDGNode>;
} // namespace llvm::sandboxir
|
