| /external/deqp/framework/common/ |
| tcuInterval.hpp | 23 * \brief Interval arithmetic and floating point precisions.
57 class Interval
60 // Empty interval.
61 Interval (void)
66 // Intentionally not explicit. Conversion from double to Interval is common
68 Interval (double val)
73 Interval (const Interval& a, const Interval& b)
82 Interval nan (void) const { return m_hasNaN ? TCU_NAN : Interval();
[all...] |
| tcuInterval.cpp | 21 * \brief Interval arithmetic.
35 Interval applyMonotone (DoubleFunc1& func, const Interval& arg0)
37 Interval ret;
43 Interval applyMonotone (DoubleIntervalFunc1& func, const Interval& arg0)
45 return Interval(func(arg0.lo()), func(arg0.hi()));
48 Interval applyMonotone (DoubleFunc2& func, const Interval& arg0, const Interval& arg1
[all...] |
| 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;
|
| 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/opencv3/3rdparty/openexr/Imath/ |
| ImathInterval.h | 43 // class Imath::Interval<class T>
46 // An Interval has a min and a max and some miscellaneous
58 class Interval
70 // Constructors - an "empty" Interval is created by default
73 Interval();
74 Interval(const T& point);
75 Interval(const T& minT, const T& maxT);
81 bool operator == (const Interval<T> &src) const;
84 // Interval manipulation
89 void extendBy(const Interval<T>& interval)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Interval.java | 30 /** An immutable inclusive interval a..b */
31 public class Interval {
34 static Interval[] cache = new Interval[INTERVAL_POOL_MAX_VALUE+1];
44 public Interval(int a, int b) { this.a=a; this.b=b; }
46 /** Interval objects are used readonly so share all with the
49 * Interval object with a..a in it. On Java.g, 218623 IntervalSets
52 public static Interval create(int a, int b) {
53 //return new Interval(a,b);
56 return new Interval(a,b)
[all...] |
| 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/include/llvm/Analysis/ |
| Interval.h | 1 //===- llvm/Analysis/Interval.h - Interval Class Declaration ----*- C++ -*-===//
10 // This file contains the declaration of the Interval class, which
11 // represents a set of CFG nodes and is a portion of an interval partition.
15 // 1. The header node of an interval dominates all of the elements of the
16 // interval
33 /// Interval Class - An Interval is a set of nodes defined such that every node
34 /// in the interval has all of its predecessors in the interval (except for th
[all...] |
| 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...] |
| /external/skia/src/effects/gradients/ |
| Sk4fGradientBase.h | 28 struct Interval {
29 Interval(SkPMColor c0, SkScalar p0,
32 Interval(const Sk4f& c0, const Sk4f& dc,
45 const Interval* findInterval(SkScalar fx) const;
47 SkSTArray<8, Interval, true> fIntervals;
58 mutable const Interval* fCachedInterval;
|
| Sk4fGradientBase.cpp | 31 Interval::Interval(SkPMColor c0, SkScalar p0,
48 Interval::Interval(const Sk4f& c0, const Sk4f& dc,
58 Interval::contains(SkScalar fx) const {
73 // The main job here is to build an interval list. Intervals are a different
81 // It also means that the interval order matches the color stops when dx >= 0,
85 // avoid this if interval storage size becomes a concern.
91 // interpolation space (note: the interval color storage is SkPM4f, but
109 // interval series - then the iterator operates just as in th
213 const Interval& interval = fIntervals[i]; local
[all...] |
| /ndk/tests/device/test-stlport_shared-exception/jni/ |
| unroll1.cpp | 18 class Interval;
68 struct DomainTraits<Interval>
72 typedef Interval Domain_t;
73 typedef Interval OneDomain_t;
101 class Interval : public Domain<DomainTraits<Interval> >
104 Interval(const Interval &a) : Domain<DomainTraits<Interval> >() {
105 for (int i=0; i < DomainTraits<Interval>::dimensions; ++i
[all...] |
| /ndk/tests/device/test-stlport_static-exception/jni/ |
| unroll1.cpp | 18 class Interval;
68 struct DomainTraits<Interval>
72 typedef Interval Domain_t;
73 typedef Interval OneDomain_t;
101 class Interval : public Domain<DomainTraits<Interval> >
104 Interval(const Interval &a) : Domain<DomainTraits<Interval> >() {
105 for (int i=0; i < DomainTraits<Interval>::dimensions; ++i
[all...] |
| /external/llvm/lib/Support/ |
| LockFileManager.cpp | 262 unsigned long Interval = 1;
264 struct timespec Interval;
265 Interval.tv_sec = 0;
266 Interval.tv_nsec = 1000000;
272 // Sleep for the designated interval, to allow the owning process time to
277 Sleep(Interval);
279 nanosleep(&Interval, nullptr);
296 Interval *= 2;
298 Interval.tv_sec *= 2;
299 Interval.tv_nsec *= 2
[all...] |
| /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...] |
| 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/nv50/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...] |
| /external/v8/test/unittests/compiler/ |
| live-range-builder.h | 44 // Traverse the provided interval specifications backwards, because that is
47 Interval pair = pairs_[i];
65 typedef std::pair<int, int> Interval;
66 typedef std::vector<Interval> IntervalList;
|
| /art/runtime/gc/collector/ |
| immune_spaces.cc | 42 using Interval = std::tuple</*start*/uintptr_t, /*end*/uintptr_t, /*is_heap*/bool>;
43 std::vector<Interval> intervals;
57 intervals.push_back(Interval(reinterpret_cast<uintptr_t>(image_oat_file->Begin()),
62 intervals.push_back(Interval(space_begin, space_end, /*is_heap*/true));
65 // Intervals are already sorted by begin, if a new interval begins at the end of the current
66 // region then we append, otherwise we restart the current interval. To prevent starting an
67 // interval on an oat file, ignore oat files that are not extending an existing interval.
68 // If the total number of image bytes in the current interval is larger than the current best
70 for (const Interval& interval : intervals)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| winusbio.h | 61 UCHAR Interval;
|
| /external/v8/src/regexp/ |
| regexp-ast.cc | 31 static Interval ListCaptureRegisters(ZoneList<RegExpTree*>* children) {
32 Interval result = Interval::Empty();
39 Interval RegExpAlternative::CaptureRegisters() {
44 Interval RegExpDisjunction::CaptureRegisters() {
49 Interval RegExpLookaround::CaptureRegisters() {
54 Interval RegExpCapture::CaptureRegisters() {
55 Interval self(StartRegister(index()), EndRegister(index()));
60 Interval RegExpQuantifier::CaptureRegisters() {
|
| regexp-ast.h | 47 // A simple closed interval.
48 class Interval {
50 Interval() : from_(kNone), to_(kNone) {}
51 Interval(int from, int to) : from_(from), to_(to) {}
52 Interval Union(Interval that) {
58 return Interval(Min(from_, that.from_), Max(to_, that.to_));
64 static Interval Empty() { return Interval(); }
196 // Returns the interval of registers used for captures within thi
[all...] |
| /external/deqp/external/vulkancts/modules/vulkan/shaderexecutor/ |
| vktShaderBuiltinPrecisionTests.cpp | 83 using tcu::Interval;
178 * \brief Type traits for generalized interval types.
185 * We now need generalized operations for each type and its interval
188 * The type Traits<T>::IVal is the approximation of T: it is `Interval` for
226 //! Print out an interval with the precision of `fmt`.
257 //! The resulting interval might not be a singleton if rounding in both
276 typedef Interval IVal;
278 static Interval doMakeIVal (const T& value)
281 // hence Interval can represent their ranges without problems.
282 return Interval(double(value))
[all...] |
| /external/deqp/modules/glshared/ |
| glsBuiltinPrecisionTests.cpp | 71 // interval computation.
94 using tcu::Interval;
199 * \brief Type traits for generalized interval types.
206 * We now need generalized operations for each type and its interval
209 * The type Traits<T>::IVal is the approximation of T: it is `Interval` for
247 //! Print out an interval with the precision of `fmt`.
278 //! The resulting interval might not be a singleton if rounding in both
297 typedef Interval IVal;
299 static Interval doMakeIVal (const T& value)
302 // hence Interval can represent their ranges without problems
[all...] |
