| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| 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; } in Interval() method in Interval
52 public static Interval create(int a, int b) { in create()
56 return new Interval(a,b); in create()
59 cache[a] = new Interval(a,a); in create()
68 Interval other = (Interval)o; in equals()
73 public boolean startsBeforeDisjoint(Interval other) { in startsBeforeDisjoint()
78 public boolean startsBeforeNonDisjoint(Interval other) { in startsBeforeNonDisjoint()
83 public boolean startsAfter(Interval other) { return this.a>other.a; } in startsAfter()
[all …]
|
| D | IntervalSet.java | 56 protected List<Interval> intervals;
60 intervals = new ArrayList<Interval>(2); // most sets are 1 or 2 elements in IntervalSet()
63 public IntervalSet(List<Interval> intervals) { in IntervalSet()
96 add(Interval.create(a,b)); in add()
100 protected void add(Interval addition) { in add()
108 Interval r = (Interval) iter.next(); in add()
114 Interval bigger = addition.union(r); in add()
119 Interval next = (Interval) iter.next(); in add()
200 Interval I = (Interval) other.intervals.get(i); in addAll()
231 Interval first = (Interval)intervals.get(0); in complement()
[all …]
|
| D | BitSet.java | 104 Interval I = (Interval) iter.next(); in addAll()
|
| /external/llvm/include/llvm/Analysis/ |
| D | Interval.h | 37 class Interval {
47 inline Interval(BasicBlock *Header) : HeaderNode(Header) { in Interval() function
51 inline Interval(const Interval &I) // copy ctor in Interval() function
93 inline bool operator==(const Interval &I) const {
107 inline Interval::succ_iterator succ_begin(Interval *I) { in succ_begin()
110 inline Interval::succ_iterator succ_end(Interval *I) { in succ_end()
117 inline Interval::pred_iterator pred_begin(Interval *I) { in pred_begin()
120 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end()
124 template <> struct GraphTraits<Interval*> {
125 typedef Interval NodeType;
[all …]
|
| D | IntervalPartition.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; } in getRootInterval()
78 inline Interval *getBlockInterval(BasicBlock *BB) { in getBlockInterval()
89 const std::vector<Interval*> &getIntervals() const { return Intervals; } in getIntervals()
99 void addIntervalToPartition(Interval *I);
106 void updatePredecessors(Interval *Int);
|
| D | IntervalIterator.h | 50 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); } in getNodeHeader()
59 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB) { in getSourceGraphNode()
68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { in addNodeToInterval()
79 inline void addNodeToInterval(Interval *Int, Interval *I) { in addNodeToInterval()
91 std::vector<std::pair<Interval*, typename Interval::succ_iterator> > IntStack;
126 inline const Interval *operator*() const { return IntStack.back().first; }
127 inline Interval *operator*() { return IntStack.back().first; }
128 inline const Interval *operator->() const { return operator*(); }
129 inline Interval *operator->() { return operator*(); }
136 Interval::succ_iterator &SuccIt = IntStack.back().second,
[all …]
|
| /external/openfst/src/include/fst/ |
| D | interval-set.h | 39 struct Interval { struct
43 Interval() : begin(-1), end(-1) {} in Interval() argument
45 Interval(T b, T e) : begin(b), end(e) {} in Interval() function
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_; } in Intervals() argument
82 const vector<Interval> *Intervals() const { return &intervals_; } in Intervals()
98 const vector<Interval> *intervals = iset.Intervals(); in Union()
99 for (typename vector<Interval>::const_iterator it = intervals->begin(); in Union()
[all …]
|
| D | state-reachable.h | 50 typedef typename IntervalSet<I>::Interval Interval; typedef
73 vector<Interval> *intervals = (*isets_)[s].Intervals(); in InitState()
87 intervals->push_back(Interval(index, index + 1)); in InitState()
89 intervals->push_back(Interval(index_, index_ + 1)); in InitState()
114 vector<Interval> *intervals = (*isets_)[s].Intervals(); in FinishState()
146 typedef typename IntervalSet<I>::Interval Interval; typedef
|
| D | label-reachable.h | 46 typedef typename IntervalSet<L>::Interval Interval; typedef
150 typedef typename IntervalSet<Label>::Interval Interval; typedef
306 const vector<Interval> *intervals = isets[s_].Intervals(); in Reach()
358 for (typename vector<Interval>::const_iterator in Reach()
|
| /external/llvm/lib/Support/ |
| D | LockFileManager.cpp | 170 unsigned long Interval = 1; in waitForUnlock() local
172 struct timespec Interval; in waitForUnlock() local
173 Interval.tv_sec = 0; in waitForUnlock()
174 Interval.tv_nsec = 1000000; in waitForUnlock()
184 Sleep(Interval); in waitForUnlock()
186 nanosleep(&Interval, NULL); in waitForUnlock()
198 Interval *= 2; in waitForUnlock()
200 Interval.tv_sec *= 2; in waitForUnlock()
201 Interval.tv_nsec *= 2; in waitForUnlock()
202 if (Interval.tv_nsec >= 1000000000) { in waitForUnlock()
[all …]
|
| /external/webkit/Source/WebCore/xml/ |
| D | XPathFunctions.cpp | 53 class Interval { class
57 Interval();
58 Interval(int value);
59 Interval(int min, int max);
71 Interval args;
266 inline Interval::Interval() in DEFINE_FUNCTION_CREATOR()
271 inline Interval::Interval(int value) in Interval() function in WebCore::XPath::Interval
276 inline Interval::Interval(int min, int max) in Interval() function in WebCore::XPath::Interval
281 inline bool Interval::contains(int value) const in contains()
685 { "concat", { &createFunConcat, Interval(2, Interval::Inf) } }, in createFunctionMap()
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | ImmutableIntervalMap.h | 21 class Interval {
27 Interval(int64_t S, int64_t E) : Start(S), End(E) {} in Interval() function
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)); in removeOverlap()
173 Interval NewK(CurrentK.getStart(), K.getStart()-1); in removeOverlap()
176 Interval NewK1(CurrentK.getStart(), K.getStart()-1); in removeOverlap()
179 Interval NewK2(K.getEnd()+1, CurrentK.getEnd()); in removeOverlap()
184 Interval NewK(K.getEnd()+1, CurrentK.getEnd()); in removeOverlap()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | IntervalPartition.cpp | 44 void IntervalPartition::addIntervalToPartition(Interval *I) { in addIntervalToPartition()
48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); in addIntervalToPartition()
58 void IntervalPartition::updatePredecessors(Interval *Int) { in updatePredecessors()
60 for (Interval::succ_iterator I = Int->Successors.begin(), in updatePredecessors()
|
| D | Interval.cpp | 29 bool Interval::isLoop() const { in isLoop()
40 void Interval::print(raw_ostream &OS) const { in print()
|
| D | CMakeLists.txt | 22 Interval.cpp
|
| D | Android.mk | 24 Interval.cpp \
|
| /external/v8/src/ |
| D | jsregexp.h | 718 class Interval {
720 Interval() : from_(kNone), to_(kNone) { } in Interval() function
721 Interval(int from, int to) : from_(from), to_(to) { } in Interval() function
722 Interval Union(Interval that) { in Union()
728 return Interval(Min(from_, that.from_), Max(to_, that.to_)); in Union()
736 static Interval Empty() { return Interval(); } in Empty()
771 static ActionNode* ClearCaptures(Interval range, RegExpNode* on_success);
1230 explicit DeferredClearCaptures(Interval range) in DeferredClearCaptures()
1233 Interval range() { return range_; } in range()
1235 Interval range_;
|
| D | ast.cc | 679 static Interval ListCaptureRegisters(ZoneList<RegExpTree*>* children) {
680 Interval result = Interval::Empty();
687 Interval RegExpAlternative::CaptureRegisters() { in CaptureRegisters()
692 Interval RegExpDisjunction::CaptureRegisters() { in CaptureRegisters()
697 Interval RegExpLookahead::CaptureRegisters() { in CaptureRegisters()
702 Interval RegExpCapture::CaptureRegisters() { in CaptureRegisters()
703 Interval self(StartRegister(index()), EndRegister(index())); in CaptureRegisters()
708 Interval RegExpQuantifier::CaptureRegisters() { in CaptureRegisters()
|
| D | ast.h | 2210 virtual Interval CaptureRegisters() { return Interval::Empty(); } in CaptureRegisters()
2228 virtual Interval CaptureRegisters();
2249 virtual Interval CaptureRegisters();
2422 virtual Interval CaptureRegisters();
2457 virtual Interval CaptureRegisters();
2487 virtual Interval CaptureRegisters();
|
| /external/tcpdump/tests/ |
| D | lmp.new | 11 Verify Interval: 20
37 Hello Interval: 5
38 Hello Dead Interval: 15
60 Hello Interval: 5
61 Hello Dead Interval: 15
106 Verify Dead Interval: 50
|
| D | lmp.out | 11 Verify Interval: 20
37 Hello Interval: 5
38 Hello Dead Interval: 15
60 Hello Interval: 5
61 Hello Dead Interval: 15
106 Verify Dead Interval: 50
|
| /external/opencv/cvaux/src/ |
| 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)
93 unsigned Interval = (unsigned) (d_up + d_lw); in icvSegmFloodFill_Stage1() local
|
| /external/e2fsprogs/lib/ext2fs/ |
| D | nt_io.c | 147 IN PLARGE_INTEGER Interval
452 LARGE_INTEGER Interval; in _OpenNtName() local
453 Interval.QuadPart = -5000000; // 0.5 sec. from now in _OpenNtName()
455 NtDelayExecution(FALSE, &Interval); in _OpenNtName()
|
| /external/llvm/lib/CodeGen/ |
| D | StackColoring.cpp | 527 LiveInterval* Interval = Intervals[FromSlot]; in remapInstructions() local
528 assert(Interval->find(Index) != Interval->end() && in remapInstructions()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| D | GrammarAST.java | 34 import org.antlr.misc.Interval;
|