| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| IntervalIterator.h | 1 //===- IntervalIterator.h - Interval Iterator Declaration -------*- C++ -*-===//
15 // 2. An IntervalPartition& object, composed of Interval nodes.
37 #include "llvm/Analysis/Interval.h"
57 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
65 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) {
70 // with the task of adding a node to the new interval, depending on the
72 // case), the BasicBlock itself is added to the interval.
73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
78 // with the task of adding a node to the new interval, depending on the
80 // case), the BasicBlock itself is added to the interval. In the case o
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| IntervalIterator.h | 1 //===- IntervalIterator.h - Interval Iterator Declaration -------*- C++ -*-===//
15 // 2. An IntervalPartition& object, composed of Interval nodes.
37 #include "llvm/Analysis/Interval.h"
57 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
65 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) {
70 // with the task of adding a node to the new interval, depending on the
72 // case), the BasicBlock itself is added to the interval.
73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
78 // with the task of adding a node to the new interval, depending on the
80 // case), the BasicBlock itself is added to the interval. In the case o
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| IntervalIterator.h | 1 //===- IntervalIterator.h - Interval Iterator Declaration -------*- C++ -*-===//
15 // 2. An IntervalPartition& object, composed of Interval nodes.
50 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
59 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) {
64 // with the task of adding a node to the new interval, depending on the
66 // case), the BasicBlock itself is added to the interval.
68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
73 // with the task of adding a node to the new interval, depending on the
75 // case), the BasicBlock itself is added to the interval. In the case of
76 // an IntervalPartition source graph (Interval case), all of the membe
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| IntervalIterator.h | 1 //===- IntervalIterator.h - Interval Iterator Declaration -------*- C++ -*-===//
15 // 2. An IntervalPartition& object, composed of Interval nodes.
50 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
59 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) {
64 // with the task of adding a node to the new interval, depending on the
66 // case), the BasicBlock itself is added to the interval.
68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
73 // with the task of adding a node to the new interval, depending on the
75 // case), the BasicBlock itself is added to the interval. In the case of
76 // an IntervalPartition source graph (Interval case), all of the membe
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| IntervalIterator.h | 1 //===- IntervalIterator.h - Interval Iterator Declaration -------*- C++ -*-===//
15 // 2. An IntervalPartition& object, composed of Interval nodes.
50 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
59 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) {
64 // with the task of adding a node to the new interval, depending on the
66 // case), the BasicBlock itself is added to the interval.
68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
73 // with the task of adding a node to the new interval, depending on the
75 // case), the BasicBlock itself is added to the interval. In the case of
76 // an IntervalPartition source graph (Interval case), all of the membe
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| IntervalIterator.h | 1 //===- IntervalIterator.h - Interval Iterator Declaration -------*- C++ -*-===//
15 // 2. An IntervalPartition& object, composed of Interval nodes.
37 #include "llvm/Analysis/Interval.h"
57 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
65 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) {
70 // with the task of adding a node to the new interval, depending on the
72 // case), the BasicBlock itself is added to the interval.
73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
78 // with the task of adding a node to the new interval, depending on the
80 // case), the BasicBlock itself is added to the interval. In the case o
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| IntervalIterator.h | 1 //===- IntervalIterator.h - Interval Iterator Declaration -------*- C++ -*-===//
15 // 2. An IntervalPartition& object, composed of Interval nodes.
37 #include "llvm/Analysis/Interval.h"
57 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
65 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) {
70 // with the task of adding a node to the new interval, depending on the
72 // case), the BasicBlock itself is added to the interval.
73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
78 // with the task of adding a node to the new interval, depending on the
80 // case), the BasicBlock itself is added to the interval. In the case o
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| IntervalIterator.h | 1 //===- IntervalIterator.h - Interval Iterator Declaration -------*- C++ -*-===//
15 // 2. An IntervalPartition& object, composed of Interval nodes.
37 #include "llvm/Analysis/Interval.h"
57 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
65 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) {
70 // with the task of adding a node to the new interval, depending on the
72 // case), the BasicBlock itself is added to the interval.
73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
78 // with the task of adding a node to the new interval, depending on the
80 // case), the BasicBlock itself is added to the interval. In the case o
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| IntervalIterator.h | 1 //===- IntervalIterator.h - Interval Iterator Declaration -------*- C++ -*-===//
15 // 2. An IntervalPartition& object, composed of Interval nodes.
37 #include "llvm/Analysis/Interval.h"
57 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
65 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) {
70 // with the task of adding a node to the new interval, depending on the
72 // case), the BasicBlock itself is added to the interval.
73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
78 // with the task of adding a node to the new interval, depending on the
80 // case), the BasicBlock itself is added to the interval. In the case o
[all...] |
| /external/deqp/external/vulkancts/modules/vulkan/ycbcr/ |
| vktYCbCrUtil.cpp | 48 using tcu::Interval;
944 tcu::Interval ChannelAccess::getChannel (const tcu::FloatFormat& conversionFormat,
960 const tcu::Interval result (conversionFormat.roundOut(conversionFormat.roundOut((double)signExtend(bits, m_channelSize), false)
963 return tcu::Interval(de::max(-1.0, result.lo()), de::max(-1.0, result.hi()));
975 return tcu::Interval();
980 return tcu::Interval();
[all...] |
| /external/llvm/lib/Support/ |
| LockFileManager.cpp | 287 unsigned long Interval = 1;
289 struct timespec Interval;
290 Interval.tv_sec = 0;
291 Interval.tv_nsec = 1000000;
297 // Sleep for the designated interval, to allow the owning process time to
302 Sleep(Interval);
304 nanosleep(&Interval, nullptr);
321 Interval *= 2;
323 Interval.tv_sec *= 2;
324 Interval.tv_nsec *= 2
[all...] |
| /external/skqp/src/gpu/ |
| GrResourceAllocator.cpp | 20 void GrResourceAllocator::Interval::assign(sk_sp<GrSurface> s) {
51 if (Interval* intvl = fIntvlHash.find(proxy->uniqueID().asUInt())) {
52 // Revise the interval for an existing use
55 // This interval is for the initial upload to a deferred proxy. Due to the vagaries
60 // Direct reads from the render target itself should occur w/in the existing interval
70 Interval* newIntvl;
76 newIntvl = fIntervalAllocator.make<Interval>(proxy, start, end);
90 GrResourceAllocator::Interval* GrResourceAllocator::IntervalList::popHead() {
91 Interval* temp = fHead;
99 void GrResourceAllocator::IntervalList::insertByIncreasingStart(Interval* intvl)
[all...] |
| /external/deqp/framework/common/ |
| tcuFloatFormat.cpp | 38 Interval chooseInterval(YesNoMaybe choice, const Interval& no, const Interval& yes)
48 return Interval();
155 Interval FloatFormat::clampValue (double d) const
168 return Interval(d);
173 Interval FloatFormat::convert (const Interval& x) const
175 Interval ret;
176 Interval tmp = x
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| Interval.cpp | 1 //===- Interval.cpp - Interval class code ---------------------------------===//
10 // This file contains the definition of the Interval class, which represents a
15 #include "llvm/Analysis/Interval.h"
24 // Interval Implementation
27 // isLoop - Find out if there is a back edge in this interval...
29 bool Interval::isLoop() const {
30 // There is a loop in this interval iff one of the predecessors of the header
31 // node lives in the interval.
40 void Interval::print(raw_ostream &OS) const
[all...] |
| IntervalPartition.cpp | 1 //===- IntervalPartition.cpp - Interval Partition module code -------------===//
11 // calculates and represent the interval partition of a function.
20 "Interval Partition Construction", true, true)
40 // addIntervalToPartition - Add an interval to the internal list of intervals,
41 // and then add mappings from all of the basic blocks in the interval to the
42 // interval itself (in the IntervalMap).
44 void IntervalPartition::addIntervalToPartition(Interval *I) {
48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
53 // updatePredecessors - Interval generation only sets the successor fields of
54 // the interval data structures. After interval generation is complete
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_util.cpp | 91 Interval::Interval(const Interval& that) : head(NULL), tail(NULL)
96 Interval::~Interval()
102 Interval::clear()
112 Interval::extend(int a, int b)
156 bool Interval::contains(int pos) const
164 bool Interval::overlaps(const Interval &that) cons
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| CachePruning.h | 28 /// The pruning interval. This is intended to be used to avoid scanning the
31 std::chrono::seconds Interval = std::chrono::seconds(1200);
49 /// which means a pruning interval of 30 seconds, expiration time of 24 hours
54 /// occured, i.e. if Policy.Interval was expired.
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Support/ |
| CachePruning.h | 28 /// The pruning interval. This is intended to be used to avoid scanning the
31 std::chrono::seconds Interval = std::chrono::seconds(1200);
49 /// which means a pruning interval of 30 seconds, expiration time of 24 hours
54 /// occured, i.e. if Policy.Interval was expired.
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Support/ |
| CachePruning.h | 28 /// The pruning interval. This is intended to be used to avoid scanning the
31 std::chrono::seconds Interval = std::chrono::seconds(1200);
49 /// which means a pruning interval of 30 seconds, expiration time of 24 hours
54 /// occured, i.e. if Policy.Interval was expired.
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/ |
| CachePruning.h | 28 /// The pruning interval. This is intended to be used to avoid scanning the
31 std::chrono::seconds Interval = std::chrono::seconds(1200);
54 /// which means a pruning interval of 30 seconds, expiration time of 24 hours
59 /// occured, i.e. if Policy.Interval was expired.
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Support/ |
| CachePruning.h | 28 /// The pruning interval. This is intended to be used to avoid scanning the
31 std::chrono::seconds Interval = std::chrono::seconds(1200);
54 /// which means a pruning interval of 30 seconds, expiration time of 24 hours
59 /// occured, i.e. if Policy.Interval was expired.
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Support/ |
| CachePruning.h | 28 /// The pruning interval. This is intended to be used to avoid scanning the
31 std::chrono::seconds Interval = std::chrono::seconds(1200);
54 /// which means a pruning interval of 30 seconds, expiration time of 24 hours
59 /// occured, i.e. if Policy.Interval was expired.
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/ |
| CachePruning.h | 28 /// The pruning interval. This is intended to be used to avoid scanning the
31 std::chrono::seconds Interval = std::chrono::seconds(1200);
54 /// which means a pruning interval of 30 seconds, expiration time of 24 hours
59 /// occured, i.e. if Policy.Interval was expired.
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| CachePruning.h | 28 /// The pruning interval. This is intended to be used to avoid scanning the
31 std::chrono::seconds Interval = std::chrono::seconds(1200);
49 /// which means a pruning interval of 30 seconds, expiration time of 24 hours
54 /// occured, i.e. if Policy.Interval was expired.
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/ |
| CachePruning.h | 28 /// The pruning interval. This is intended to be used to avoid scanning the
31 std::chrono::seconds Interval = std::chrono::seconds(1200);
49 /// which means a pruning interval of 30 seconds, expiration time of 24 hours
54 /// occured, i.e. if Policy.Interval was expired.
|
