/external/deqp/framework/common/ |
H A D | tcuInterval.hpp | 23 * \brief Interval arithmetic and floating point precisions. 57 class Interval class in namespace:tcu 61 Interval (void) function in class:tcu::Interval 66 // Intentionally not explicit. Conversion from double to Interval is common 68 Interval (double val) function in class:tcu::Interval 73 Interval (const Interval& a, const Interval& b) function in class:tcu::Interval 82 Interval nan (void) const { return m_hasNaN ? TCU_NAN : Interval(); } 148 Interval (bool hasNaN_, double lo_, double hi_) function in class:tcu::Interval [all...] |
H A D | 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 [all...] |
H A D | 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;
|
H A D | 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 tm [all...] |
/external/opencv3/3rdparty/openexr/Imath/ |
H A D | ImathInterval.h | 43 // class Imath::Interval<class T> 46 // An Interval has a min and a max and some miscellaneous 58 class Interval class in namespace:Imath 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< 125 inline Interval<T>::Interval() function in class:Imath::Interval 131 inline Interval<T>::Interval(const T& point) function in class:Imath::Interval 138 inline Interval<T>::Interval(const T& minV, const T& maxV) function in class:Imath::Interval [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Interval.java | 31 public class Interval { class 34 static Interval[] cache = new Interval[INTERVAL_POOL_MAX_VALUE+1]; 44 public Interval(int a, int b) { this.a=a; this.b=b; } method in class:Interval 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); 59 cache[a] = new Interval( [all...] |
H A D | 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) { 96 add(Interval.create(a,b)); 100 protected void add(Interval addition) { 108 Interval r = (Interval) iter.next(); 114 Interval bigger = addition.union(r); 119 Interval next = (Interval) ite [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | Interval.h | 1 //===- llvm/Analysis/Interval.h - Interval Class Declaration ----*- C++ -*-===// 10 // This file contains the declaration of the Interval class, which 33 /// Interval Class - An Interval is a set of nodes defined such that every node 37 class Interval { class in namespace:llvm 47 inline Interval(BasicBlock *Header) : HeaderNode(Header) { function in class:llvm::Interval 63 /// Predecessors - List of BasicBlocks that have this Interval's header block 77 /// isSuccessor - find out if a basic block is a successor of this Interval 90 inline bool operator==(const Interval [all...] |
H A D | IntervalPartition.h | 1 //===- IntervalPartition.h - Interval partition Calculation -----*- C++ -*-===// 26 #include "llvm/Analysis/Interval.h" 41 typedef std::map<BasicBlock*, Interval*> IntervalMapTy; 44 typedef std::vector<Interval*> IntervalListTy; 45 Interval *RootInterval; 46 std::vector<Interval*> Intervals; 69 inline Interval *getRootInterval() { return RootInterval; } 78 inline Interval *getBlockInterval(BasicBlock *BB) { 89 const std::vector<Interval*> &getIntervals() const { return Intervals; } 99 void addIntervalToPartition(Interval * [all...] |
H A D | 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) { 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { 76 // an IntervalPartition source graph (Interval case), all of the member 79 inline void addNodeToInterval(Interval *Int, Interval *I) { 91 std::vector<std::pair<Interval*, typename Interval [all...] |
/external/skia/src/effects/gradients/ |
H A D | Sk4fGradientBase.h | 28 struct Interval { struct in class:SkGradientShaderBase::GradientShaderBase4fContext 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;
|
H A D | Sk4fGradientBase.cpp | 31 Interval::Interval(SkPMColor c0, SkScalar p0, function in class:SkGradientShaderBase::GradientShaderBase4fContext::Interval 48 Interval::Interval(const Sk4f& c0, const Sk4f& dc, function in class:SkGradientShaderBase::GradientShaderBase4fContext::Interval 58 Interval::contains(SkScalar fx) const { 213 const Interval& interval = fIntervals[i]; 239 const SkGradientShaderBase::GradientShaderBase4fContext::Interval* 260 const Interval* i0 = fIntervals.begin(); 261 const Interval* i1 = fIntervals.end() - 1; 267 const Interval* [all...] |
H A D | Sk4fLinearGradient.cpp | 269 LinearIntervalProcessor(const Interval* firstInterval, 270 const Interval* lastInterval, 271 const Interval* i, 321 const Interval* next_interval(const Interval* i) const { 359 const Interval* fFirstInterval; 360 const Interval* fLastInterval; 361 const Interval* fInterval; // current interval
|
/external/llvm/lib/Support/ |
H A D | LockFileManager.cpp | 262 unsigned long Interval = 1; local 264 struct timespec Interval; 265 Interval.tv_sec = 0; 266 Interval.tv_nsec = 1000000; 277 Sleep(Interval); 279 nanosleep(&Interval, nullptr); 296 Interval *= 2; 298 Interval.tv_sec *= 2; 299 Interval.tv_nsec *= 2; 300 if (Interval [all...] |
/external/llvm/lib/Analysis/ |
H A D | 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 29 bool Interval::isLoop() const { 40 void Interval::print(raw_ostream &OS) const { 42 << "Interval Contents:\n"; 49 OS << "Interval Predecessors:\n"; 54 OS << "Interval Successor [all...] |
H A D | IntervalPartition.cpp | 1 //===- IntervalPartition.cpp - Interval Partition module code -------------===// 20 "Interval Partition Construction", true, true) 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 58 void IntervalPartition::updatePredecessors(Interval *Int) { 60 for (Interval::succ_iterator I = Int->Successors.begin(),
|
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_util.cpp | 91 Interval::Interval(const Interval& that) : head(NULL), tail(NULL) function in class:nv50_ir::Interval 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 [all...] |
H A D | nv50_ir_util.h | 418 class Interval 421 Interval() : head(0), tail(0) { } 422 Interval(const Interval&); 423 ~Interval(); 426 void insert(const Interval&); 427 void unify(Interval&); // clears source interval 433 bool overlaps(const Interval&) const; 571 void Interval::checkTail() const
|
/external/v8/test/unittests/compiler/ |
H A D | live-range-builder.h | 47 Interval pair = pairs_[i]; 65 typedef std::pair<int, int> Interval; typedef in class:v8::internal::compiler::TestRangeBuilder 66 typedef std::vector<Interval> IntervalList;
|
/external/v8/src/regexp/ |
H A D | 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() {
|
H A D | regexp-ast.h | 48 class Interval { class in namespace:v8::internal 50 Interval() : from_(kNone), to_(kNone) {} function in class:v8::internal::Interval 51 Interval(int from, int to) : from_(from), to_(to) {} function in class:v8::internal::Interval 52 Interval Union(Interval that) { 58 return Interval(Min(from_, that.from_), Max(to_, that.to_)); 64 static Interval Empty() { return Interval(); } 198 virtual Interval CaptureRegisters() { return Interval [all...] |
/external/deqp/external/vulkancts/modules/vulkan/shaderexecutor/ |
H A D | vktShaderBuiltinPrecisionTests.cpp | 83 using tcu::Interval; 188 * The type Traits<T>::IVal is the approximation of T: it is `Interval` for 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)); 285 static Interval doUnion (const Interval& a, const Interval& b) 290 static bool doContains (const Interval 1739 innerExtrema(const EvalContext&, const Interval&, const Interval&) const argument [all...] |
/external/deqp/modules/glshared/ |
H A D | glsBuiltinPrecisionTests.cpp | 94 using tcu::Interval; 209 * The type Traits<T>::IVal is the approximation of T: it is `Interval` for 297 typedef Interval IVal; 299 static Interval doMakeIVal (const T& value) 302 // hence Interval can represent their ranges without problems. 303 return Interval(double(value)); 306 static Interval doUnion (const Interval& a, const Interval& b) 311 static bool doContains (const Interval 1760 innerExtrema(const EvalContext&, const Interval&, const Interval&) const argument [all...] |
/external/llvm/lib/Target/AMDGPU/ |
H A D | SIInsertWaits.cpp | 306 RegInterval Interval = getRegInterval(RC, Op); local 307 for (unsigned j = Interval.first; j < Interval.second; ++j) { 412 RegInterval Interval = getRegInterval(RC, Op); local 413 for (unsigned j = Interval.first; j < Interval.second; ++j) {
|
/external/deqp/modules/egl/ |
H A D | teglResizeTests.cpp | 68 using tcu::Interval; 431 typedef tcu::Vector<Interval, 2> IvVec2; 451 Interval approximateInt (int i) 453 const Interval margin(-1.0, 1.0); // The resolution may be rounded 455 return (Interval(i) + margin) & Interval(0.0, TCU_INFINITY); 467 / Interval(inchPer10km));
|