/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...] |
H A D | BitSet.java | 104 Interval I = (Interval) iter.next();
|
/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 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/llvm/lib/Support/ |
H A D | LockFileManager.cpp | 170 unsigned long Interval = 1; local 172 struct timespec Interval; 173 Interval.tv_sec = 0; 174 Interval.tv_nsec = 1000000; 184 Sleep(Interval); 186 nanosleep(&Interval, NULL); 198 Interval *= 2; 200 Interval.tv_sec *= 2; 201 Interval.tv_nsec *= 2; 202 if (Interval [all...] |
/external/openfst/src/include/fst/ |
H A D | interval-set.h | 39 struct Interval { struct in class:fst::IntervalSet 43 Interval() : begin(-1), end(-1) {} function in struct:fst::IntervalSet::Interval 45 Interval(T b, T e) : begin(b), end(e) {} function in struct:fst::IntervalSet::Interval 47 bool operator<(const Interval &i) const { 51 bool operator==(const Interval &i) const { 55 bool operator!=(const Interval &i) const { 80 vector<Interval> *Intervals() { return &intervals_; } 82 const vector<Interval> *Intervals() const { return &intervals_; } 98 const vector<Interval> *intervals = iset.Intervals(); 99 for (typename vector<Interval> 365 typedef typename IntervalSet<T>::Interval Interval; typedef [all...] |
H A D | state-reachable.h | 50 typedef typename IntervalSet<I>::Interval Interval; typedef in class:fst::IntervalReachVisitor 73 vector<Interval> *intervals = (*isets_)[s].Intervals(); 87 intervals->push_back(Interval(index, index + 1)); 89 intervals->push_back(Interval(index_, index_ + 1)); 114 vector<Interval> *intervals = (*isets_)[s].Intervals(); 146 typedef typename IntervalSet<I>::Interval Interval; typedef in class:fst::StateReachable 189 vector< IntervalSet<I> > isets_; // Interval sets per state
|
H A D | label-reachable.h | 46 typedef typename IntervalSet<L>::Interval Interval; typedef in class:fst::LabelReachableData 108 vector<IntervalSet <L> > isets_; // Interval sets per state. 150 typedef typename IntervalSet<Label>::Interval Interval; typedef in class:fst::LabelReachable 306 const vector<Interval> *intervals = isets[s_].Intervals(); 358 for (typename vector<Interval>::const_iterator
|
/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(),
|
H A D | Android.mk | 24 Interval.cpp \
|
/external/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/webkit/Source/WebCore/xml/ |
H A D | XPathFunctions.cpp | 53 class Interval { class in namespace:WebCore::XPath 57 Interval(); 58 Interval(int value); 59 Interval(int min, int max); 71 Interval args; 266 inline Interval::Interval() function in class:WebCore::XPath::Interval 271 inline Interval::Interval(int value) function in class:WebCore::XPath::Interval 276 inline Interval function in class:WebCore::XPath::Interval [all...] |
/external/v8/src/ |
H A D | jsregexp.h | 718 class Interval { class in namespace:v8::internal 720 Interval() : from_(kNone), to_(kNone) { } function in class:v8::internal::Interval 721 Interval(int from, int to) : from_(from), to_(to) { } function in class:v8::internal::Interval 722 Interval Union(Interval that) { 728 return Interval(Min(from_, that.from_), Max(to_, that.to_)); 736 static Interval Empty() { return Interval(); } 771 static ActionNode* ClearCaptures(Interval range, RegExpNode* on_success); 1230 explicit DeferredClearCaptures(Interval rang [all...] |
H A D | ast.cc | 679 static Interval ListCaptureRegisters(ZoneList<RegExpTree*>* children) { 680 Interval result = Interval::Empty(); 687 Interval RegExpAlternative::CaptureRegisters() { 692 Interval RegExpDisjunction::CaptureRegisters() { 697 Interval RegExpLookahead::CaptureRegisters() { 702 Interval RegExpCapture::CaptureRegisters() { 703 Interval self(StartRegister(index()), EndRegister(index())); 708 Interval RegExpQuantifier::CaptureRegisters() {
|
H A D | ast.h | 2210 virtual Interval CaptureRegisters() { return Interval::Empty(); } 2228 virtual Interval CaptureRegisters(); 2249 virtual Interval CaptureRegisters(); 2422 virtual Interval CaptureRegisters(); 2457 virtual Interval CaptureRegisters(); 2487 virtual Interval CaptureRegisters();
|
/external/opencv/cvaux/src/ |
H A D | cvsegment.cpp | 75 #define DIFF(p1,p2) ((unsigned)((p1)[0] - (p2)[0] + d_lw)<=Interval && \ 76 (unsigned)((p1)[1] - (p2)[1] + d_lw)<=Interval && \ 77 (unsigned)((p1)[2] - (p2)[2] + d_lw)<=Interval) 81 CV_IABS((p1)[2] - (p2)[2]) <=Interval )*/ 93 unsigned Interval = (unsigned) (d_up + d_lw); local
|
/external/llvm/lib/CodeGen/ |
H A D | StackColoring.cpp | 527 LiveInterval* Interval = Intervals[FromSlot]; local 528 assert(Interval->find(Index) != Interval->end() &&
|
H A D | LiveIntervalAnalysis.cpp | 1 //===-- LiveIntervalAnalysis.cpp - Live Interval Analysis -----------------===// 51 "Live Interval Analysis", false, false) 57 "Live Interval Analysis", false, false) 864 LiveInterval& Interval = getOrCreateInterval(reg); local 865 VNInfo* VN = Interval.getNextValue( 871 Interval.addRange(LR);
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | nt_io.c | 147 IN PLARGE_INTEGER Interval 452 LARGE_INTEGER Interval; local 453 Interval.QuadPart = -5000000; // 0.5 sec. from now 455 NtDelayExecution(FALSE, &Interval);
|
/external/ppp/pppd/plugins/radius/etc/ |
H A D | dictionary | 91 ATTRIBUTE Acct-Interim-Interval 85 integer
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | GrammarAST.java | 34 import org.antlr.misc.Interval;
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
H A D | CodeGenerator.java | 778 Interval I = (Interval) iter.next();
|