| /external/llvm/include/llvm/Analysis/ |
| 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
41 typedef std::map<BasicBlock*, Interval*> IntervalMapTy
[all...] |
| 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...] |
| 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/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...] |
| Android.mk | 25 Interval.cpp \
|
| /external/llvm/include/llvm/ADT/ |
| ImmutableIntervalMap.h | 21 class Interval {
27 Interval(int64_t S, int64_t E) : Start(S), End(E) {}
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 NewK(K.getEnd()+1, CurrentK.getEnd())
[all...] |
| /external/webkit/Source/WebCore/xml/ |
| XPathFunctions.cpp | 53 class Interval {
57 Interval();
58 Interval(int value);
59 Interval(int min, int max);
71 Interval args;
266 inline Interval::Interval()
271 inline Interval::Interval(int value)
276 inline Interval::Interval(int min, int max
[all...] |
| /frameworks/base/core/java/android/widget/ |
| GridLayout.java | 589 Interval span = spec.span;
638 lp.setRowSpecSpan(new Interval(row, row + rowSpan));
639 lp.setColumnSpecSpan(new Interval(col, col + colSpan));
643 private static int clip(Interval minorRange, boolean minorWasDefined, int count) {
666 final Interval majorRange = majorSpec.span;
674 final Interval minorRange = minorSpec.span;
873 Interval span = spec.span;
2158 Interval interval = (Interval) that; local
[all...] |
| /frameworks/base/media/libdrm/mobile1/include/parser/ |
| parser_rel.h | 64 T_DRM_DATETIME Interval; /**< The interval time */
|
| /external/clang/lib/Frontend/ |
| CompilerInstance.cpp | 887 unsigned long Interval = 1;
889 struct timespec Interval;
890 Interval.tv_sec = 0;
891 Interval.tv_nsec = 1000000;
896 // Sleep for the designated interval, to allow the owning process time to
901 Sleep(Interval);
903 nanosleep(&Interval, NULL);
915 Interval *= 2;
917 Interval.tv_sec *= 2;
918 Interval.tv_nsec *= 2
[all...] |
| /external/v8/src/ |
| jsregexp.h | 712 // A simple closed interval.
713 class Interval {
715 Interval() : from_(kNone), to_(kNone) { }
716 Interval(int from, int to) : from_(from), to_(to) { }
717 Interval Union(Interval that) {
723 return Interval(Min(from_, that.from_), Max(to_, that.to_));
731 static Interval Empty() { return Interval(); }
766 static ActionNode* ClearCaptures(Interval range, RegExpNode* on_success)
[all...] |
| ast.cc | 851 static Interval ListCaptureRegisters(ZoneList<RegExpTree*>* children) {
852 Interval result = Interval::Empty();
859 Interval RegExpAlternative::CaptureRegisters() {
864 Interval RegExpDisjunction::CaptureRegisters() {
869 Interval RegExpLookahead::CaptureRegisters() {
874 Interval RegExpCapture::CaptureRegisters() {
875 Interval self(StartRegister(index()), EndRegister(index()));
880 Interval RegExpQuantifier::CaptureRegisters() {
|
| ast.h | [all...] |
| /frameworks/base/media/libdrm/mobile1/src/objmng/ |
| drm_api.c | 236 pRights->DisplayConstraint.Interval.date;
238 pRights->DisplayConstraint.Interval.time;
252 pRights->PlayConstraint.Interval.date;
254 pRights->PlayConstraint.Interval.time;
269 pRights->ExecuteConstraint.Interval.date;
271 pRights->ExecuteConstraint.Interval.time;
286 pRights->PrintConstraint.Interval.date;
288 pRights->PrintConstraint.Interval.time;
389 if (0 != (uint8_t)(XXConstraint->Indicator & DRM_INTERVAL_CONSTRAINT)) { /* Have interval time restrict? */
394 XXConstraint->Indicator &= ~DRM_INTERVAL_CONSTRAINT; /* Write off interval right *
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocLinearScan.cpp | 61 cl::desc("Attempt trivial coalescing of interval ends"),
239 /// initIntervalSets - initialize the interval sets.
270 /// specified interval. It's passed the physical registers whose spill
272 /// conflict with the interval.
278 /// attemptTrivialCoalescing - If a simple interval is defined by a copy,
280 /// if the register is not defined during the life time of the interval.
351 /// register interval if we have one, otherwise return 0.
440 /// attemptTrivialCoalescing - If a simple interval is defined by a copy, try
442 /// register is not defined during live time of the interval. If the interval i
[all...] |
| LiveIntervalAnalysis.cpp | 1 //===-- LiveIntervalAnalysis.cpp - Live Interval Analysis -----------------===//
60 "Live Interval Analysis", false, false)
69 "Live Interval Analysis", false, false)
267 /// partially re-defining the specified live interval. A common case of this is
270 LiveInterval &interval) {
276 interval.getLiveRangeContaining(RedefIndex.getUseIndex());
279 return DefMI->findRegisterDefOperandIdx(interval.reg) != -1;
289 LiveInterval &interval) {
290 DEBUG(dbgs() << "\t\tregister: " << PrintReg(interval.reg, tri_));
294 // done once for the vreg. We use an empty interval to detect the firs
[all...] |
| /external/v8/test/cctest/ |
| test-log.cc | 755 class Interval {
757 Interval()
761 ~Interval() { delete next_; }
769 void CloneFrom(Interval* src) {
811 if (next_ == NULL) next_ = new Interval();
820 Interval* get_next() { return next_; }
826 Interval* next_;
892 Interval bounds;
[all...] |
| /external/opencv/cvaux/src/ |
| 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);
|
| /external/bluetooth/glib/glib/ |
| guniprop.c | 418 struct Interval
427 struct Interval *interval = (struct Interval *)elt; local
429 if (c < interval->start)
431 if (c > interval->end)
452 static const struct Interval wide[] = {
497 static const struct Interval ambiguous[] = {
[all...] |
| /development/host/windows/usb/winusb/ |
| adb_winusb_interface.cpp | 268 info->polling_interval = pipe_info.Interval;
|
| /external/e2fsprogs/lib/ext2fs/ |
| nt_io.c | 147 IN PLARGE_INTEGER Interval
452 LARGE_INTEGER Interval;
453 Interval.QuadPart = -5000000; // 0.5 sec. from now
455 NtDelayExecution(FALSE, &Interval);
|
| /external/ppp/pppd/plugins/radius/etc/ |
| dictionary | 91 ATTRIBUTE Acct-Interim-Interval 85 integer
|
| /frameworks/base/media/libdrm/mobile1/src/parser/ |
| parser_rel.c | 175 {"<o-dd:interval>","</o-dd:interval>"},
330 "o-ex:rights\\o-ex:agreement\\o-ex:permission\\o-dd:%s\\o-ex:constraint\\o-dd:interval",
335 if (pBuf) { /* If interval element exit then get the value */
408 YMD_HMS_2_INT(year, mon, day, pConstraint->Interval.date, hour,
409 min, sec, pConstraint->Interval.time);
|
| /device/google/accessory/arduino/USB_Host_Shield/ |
| Usb.h | 103 byte Interval; // Polling interval in frames.
|
