/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 (bool hasNaN_, double lo_, double hi_) function in class:tcu::Interval 76 Interval (const Interval& a, const Interval& b) function in class:tcu::Interval 85 Interval na [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/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 78 /// isSuccessor - find out if a basic block is a successor of this Interval 92 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/swiftshader/third_party/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 51 inline Interval(const Interval &I) // copy ctor function in class:llvm::Interval 66 /// Predecessors - List of BasicBlocks that have this 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/gpu/ |
H A D | GrResourceAllocator.h | 54 class Interval; 69 typedef SkTDynamicHash<Interval, unsigned int> IntvlHash; 71 class Interval { class in class:GrResourceAllocator 73 Interval(GrSurfaceProxy* proxy, unsigned int start, unsigned int end) function in class:GrResourceAllocator::Interval 83 static const uint32_t& GetKey(const Interval& intvl) { 92 Interval* fNext; 100 Interval* temp = fHead; 107 const Interval* peekHead() const { return fHead; } 108 Interval* popHead(); 109 void insertByIncreasingStart(Interval*); [all...] |
H A D | GrResourceAllocator.cpp | 18 if (Interval* intvl = fIntvlHash.find(proxy->uniqueID().asUInt())) { 26 Interval* newIntvl = new Interval(proxy, start, end); 32 GrResourceAllocator::Interval* GrResourceAllocator::IntervalList::popHead() { 33 Interval* temp = fHead; 41 void GrResourceAllocator::IntervalList::insertByIncreasingStart(Interval* intvl) { 49 Interval* prev = fHead; 50 Interval* next = prev->fNext; 59 void GrResourceAllocator::IntervalList::insertByIncreasingEnd(Interval* intvl) { 67 Interval* pre [all...] |
/external/llvm/unittests/Support/ |
H A D | 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/ |
H A D | CachePruning.h | 33 Interval = PruningInterval; 63 unsigned Interval = 0; member in class:llvm::CachePruning
|
/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"; 48 OS << "Interval Predecessors:\n"; 52 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) {
|
/external/llvm/lib/Support/ |
H A D | LockFileManager.cpp | 287 unsigned long Interval = 1; local 289 struct timespec Interval; 290 Interval.tv_sec = 0; 291 Interval.tv_nsec = 1000000; 302 Sleep(Interval); 304 nanosleep(&Interval, nullptr); 321 Interval *= 2; 323 Interval.tv_sec *= 2; 324 Interval.tv_nsec *= 2; 325 if (Interval [all...] |
/external/swiftshader/third_party/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/nouveau/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...] |
/external/deqp/external/vulkancts/modules/vulkan/ycbcr/ |
H A D | vktYCbCrConversionTests.cpp | 72 using tcu::Interval; 308 Interval getChannel (const FloatFormat& conversionFormat, 434 Interval ChannelAccess::getChannel (const FloatFormat& conversionFormat, 450 const Interval result (conversionFormat.roundOut(conversionFormat.roundOut((double)signExtend(bits, m_channelSize), false) 453 return Interval(de::max(-1.0, result.lo()), de::max(-1.0, result.hi())); 465 return Interval(); 470 return Interval(); 629 Interval rangeExpandChroma (vk::VkSamplerYcbcrRangeKHR range, 632 const Interval& sample) 639 return conversionFormat.roundOut(sample - conversionFormat.roundOut(Interval((doubl [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
H A D | ImmutableIntervalMap.h | 21 class Interval { class in namespace:llvm 27 Interval(int64_t S, int64_t E) : Start(S), End(E) {} function in class:llvm::Interval 35 typedef const std::pair<Interval, T> value_type; 37 typedef const Interval key_type; 38 typedef const Interval &key_type_ref; 155 Interval CurrentK = ImutInfo::KeyOfValue(this->Value(T)); 173 Interval NewK(CurrentK.getStart(), K.getStart()-1); 176 Interval NewK1(CurrentK.getStart(), K.getStart()-1); 179 Interval NewK2(K.getEnd()+1, CurrentK.getEnd()); 184 Interval New [all...] |
/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() {
|