| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
11 // calculates and represents the interval partition of a function, or a
12 // preexisting interval partition.
14 // In this way, the interval partition may be used to reduce a flow graph down
15 // to its degenerate single node interval partition (unless it is irreducible).
18 // whether it should add the "tails" of an interval to an interval itself or if
33 class Interval;
37 // IntervalPartition - This class builds and holds an "interval partition" for
40 // interval is a (possibly nonexistent) loop with a "tail" of non-loopin
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
11 // calculates and represents the interval partition of a function, or a
12 // preexisting interval partition.
14 // In this way, the interval partition may be used to reduce a flow graph down
15 // to its degenerate single node interval partition (unless it is irreducible).
18 // whether it should add the "tails" of an interval to an interval itself or if
33 class Interval;
37 // IntervalPartition - This class builds and holds an "interval partition" for
40 // interval is a (possibly nonexistent) loop with a "tail" of non-loopin
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
11 // calculates and represents the interval partition of a function, or a
12 // preexisting interval partition.
14 // In this way, the interval partition may be used to reduce a flow graph down
15 // to its degenerate single node interval partition (unless it is irreducible).
18 // whether it should add the "tails" of an interval to an interval itself or if
33 class Interval;
37 // IntervalPartition - This class builds and holds an "interval partition" for
40 // interval is a (possibly nonexistent) loop with a "tail" of non-loopin
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
11 // calculates and represents the interval partition of a function, or a
12 // preexisting interval partition.
14 // In this way, the interval partition may be used to reduce a flow graph down
15 // to its degenerate single node interval partition (unless it is irreducible).
18 // whether it should add the "tails" of an interval to an interval itself or if
26 #include "llvm/Analysis/Interval.h"
34 // IntervalPartition - This class builds and holds an "interval partition" for
37 // interval is a (possibly nonexistent) loop with a "tail" of non-loopin
[all...] |
| 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/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
11 // calculates and represents the interval partition of a function, or a
12 // preexisting interval partition.
14 // In this way, the interval partition may be used to reduce a flow graph down
15 // to its degenerate single node interval partition (unless it is irreducible).
18 // whether it should add the "tails" of an interval to an interval itself or if
26 #include "llvm/Analysis/Interval.h"
34 // IntervalPartition - This class builds and holds an "interval partition" for
37 // interval is a (possibly nonexistent) loop with a "tail" of non-loopin
[all...] |
| 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/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
11 // calculates and represents the interval partition of a function, or a
12 // preexisting interval partition.
14 // In this way, the interval partition may be used to reduce a flow graph down
15 // to its degenerate single node interval partition (unless it is irreducible).
18 // whether it should add the "tails" of an interval to an interval itself or if
26 #include "llvm/Analysis/Interval.h"
34 // IntervalPartition - This class builds and holds an "interval partition" for
37 // interval is a (possibly nonexistent) loop with a "tail" of non-loopin
[all...] |
| 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/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
11 // calculates and represents the interval partition of a function, or a
12 // preexisting interval partition.
14 // In this way, the interval partition may be used to reduce a flow graph down
15 // to its degenerate single node interval partition (unless it is irreducible).
18 // whether it should add the "tails" of an interval to an interval itself or if
26 #include "llvm/Analysis/Interval.h"
34 // IntervalPartition - This class builds and holds an "interval partition" for
37 // interval is a (possibly nonexistent) loop with a "tail" of non-loopin
[all...] |
| 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-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
11 // calculates and represents the interval partition of a function, or a
12 // preexisting interval partition.
14 // In this way, the interval partition may be used to reduce a flow graph down
15 // to its degenerate single node interval partition (unless it is irreducible).
18 // whether it should add the "tails" of an interval to an interval itself or if
26 #include "llvm/Analysis/Interval.h"
34 // IntervalPartition - This class builds and holds an "interval partition" for
37 // interval is a (possibly nonexistent) loop with a "tail" of non-loopin
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
11 // calculates and represents the interval partition of a function, or a
12 // preexisting interval partition.
14 // In this way, the interval partition may be used to reduce a flow graph down
15 // to its degenerate single node interval partition (unless it is irreducible).
18 // whether it should add the "tails" of an interval to an interval itself or if
26 #include "llvm/Analysis/Interval.h"
34 // IntervalPartition - This class builds and holds an "interval partition" for
37 // interval is a (possibly nonexistent) loop with a "tail" of non-loopin
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===//
11 // calculates and represents the interval partition of a function, or a
12 // preexisting interval partition.
14 // In this way, the interval partition may be used to reduce a flow graph down
15 // to its degenerate single node interval partition (unless it is irreducible).
18 // whether it should add the "tails" of an interval to an interval itself or if
26 #include "llvm/Analysis/Interval.h"
34 // IntervalPartition - This class builds and holds an "interval partition" for
37 // interval is a (possibly nonexistent) loop with a "tail" of non-loopin
[all...] |
| /external/skia/src/gpu/ |
| GrResourceAllocator.h | 25 * to interval to find proxy reuse). When it comes time to allocate the resources it
30 * allocates a new resource (preferably from the free pool) for the new interval
31 * adds the new interval to the active list (that is sorted by increasing end index)
48 // Add a usage interval from 'start' to 'end' inclusive. This is usually used for renderTargets.
49 // If an existing interval already exists it will be expanded to include the new range.
53 // Add an interval that spans just the current op. Usually this is for texture uses.
54 // If an existing interval already exists it will be expanded to include the new operation.
76 class Interval;
95 typedef SkTDynamicHash<Interval, unsigned int> IntvlHash;
97 class Interval {
[all...] |
| GrResourceAllocator.cpp | 20 void GrResourceAllocator::Interval::assign(sk_sp<GrSurface> s) {
49 if (Interval* intvl = fIntvlHash.find(proxy->uniqueID().asUInt())) {
50 // Revise the interval for an existing use
53 // This interval is for the initial upload to a deferred proxy. Due to the vagaries
58 // Direct reads from the render target itself should occur w/in the existing interval
68 Interval* newIntvl;
74 newIntvl = fIntervalAllocator.make<Interval>(proxy, start, end);
88 GrResourceAllocator::Interval* GrResourceAllocator::IntervalList::popHead() {
89 Interval* temp = fHead;
97 void GrResourceAllocator::IntervalList::insertByIncreasingStart(Interval* intvl)
[all...] |
| /external/skqp/src/gpu/ |
| GrResourceAllocator.h | 25 * to interval to find proxy reuse). When it comes time to allocate the resources it
30 * allocates a new resource (preferably from the free pool) for the new interval
31 * adds the new interval to the active list (that is sorted by increasing end index)
48 // Add a usage interval from 'start' to 'end' inclusive. This is usually used for renderTargets.
49 // If an existing interval already exists it will be expanded to include the new range.
53 // Add an interval that spans just the current op. Usually this is for texture uses.
54 // If an existing interval already exists it will be expanded to include the new operation.
76 class Interval;
95 typedef SkTDynamicHash<Interval, unsigned int> IntvlHash;
97 class Interval {
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| IntervalSet.java | 56 protected List<Interval> intervals;
60 intervals = new ArrayList<Interval>(2); // most sets are 1 or 2 elements
63 public IntervalSet(List<Interval> intervals) {
88 /** Add interval; i.e., add all integers from a to b to set.
96 add(Interval.create(a,b));
100 protected void add(Interval addition) {
108 Interval r = (Interval) iter.next();
113 // next to each other, make a single larger interval
114 Interval bigger = addition.union(r)
[all...] |
| /external/llvm/unittests/Support/ |
| TimerTest.cpp | 28 struct timespec Interval;
29 Interval.tv_sec = 0;
30 Interval.tv_nsec = 1000000;
31 nanosleep(&Interval, nullptr);
|
| /external/llvm/include/llvm/Support/ |
| CachePruning.h | 29 /// Define the pruning interval. This is intended to be used to avoid scanning
33 Interval = PruningInterval;
63 unsigned Interval = 0;
|
| /external/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...] |
| /external/deqp/framework/common/ |
| tcuFloatFormat.hpp | 62 Interval roundOut (const Interval& x, bool roundUnderOverflow) const;
65 Interval convert (const Interval& x) const;
68 std::string intervalToHex (const Interval& interval) const;
75 Interval clampValue (double d) const;
|
| /external/swiftshader/third_party/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/darwin-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/darwin-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...] |
