| /external/valgrind/main/drd/ |
| drd_segment.h | 30 * Segments and segment lists. A segment represents information about
32 * clock associated with each segment.
42 typedef struct segment struct
44 struct segment* g_next;
45 struct segment* g_prev;
47 struct segment* thr_next;
48 struct segment* thr_prev;
50 /** Reference count: number of pointers that point to this segment. */
52 /** Stack trace of the first instruction of the segment. *
[all...] |
| /external/skia/include/core/ |
| SkPathMeasure.h | 61 /** Given a start and stop distance, return in dst the intervening segment(s).
62 If the segment is zero-length, return false, else return true.
65 Begin the segment with a moveTo if startWithMoveTo is true
90 struct Segment {
98 SkTDArray<Segment> fSegments;
101 static const Segment* NextSegment(const Segment*);
108 const Segment* distanceToSegment(SkScalar distance, SkScalar* t);
|
| /external/skia/legacy/include/core/ |
| SkPathMeasure.h | 57 /** Given a start and stop distance, return in dst the intervening segment(s).
58 If the segment is zero-length, return false, else return true.
61 Begin the segment with a moveTo if startWithMoveTo is true
86 struct Segment {
94 SkTDArray<Segment> fSegments;
97 static const Segment* NextSegment(const Segment*);
104 const Segment* distanceToSegment(SkScalar distance, SkScalar* t);
|
| /external/v8/src/ |
| zone.cc | 39 // chained together forming a LIFO structure with the newest segment
43 class Segment {
45 void Initialize(Segment* next, int size) {
50 Segment* next() const { return next_; }
54 int capacity() const { return size_ - sizeof(Segment); }
56 Address start() const { return address(sizeof(Segment)); }
60 // Computes the address of the nth byte in this segment.
65 Segment* next_;
87 // Creates a new segment, sets it size, and pushes it to the front
88 // of the segment chain. Returns the new segment
196 Segment* segment = NewSegment(new_size); local
[all...] |
| /external/llvm/lib/CodeGen/ |
| TargetLoweringObjectFileImpl.cpp | 461 StringRef Segment, Section;
465 MCSectionMachO::ParseSectionSpecifier(SectionVal, Segment, Section,
474 getContext().getMachOSection(Segment, Section, TAA, StubSize,
488 StringRef Segment, Section;
492 MCSectionMachO::ParseSectionSpecifier(GV->getSection(), Segment, Section,
503 getContext().getMachOSection(Segment, Section, TAA, StubSize, Kind);
569 // linker needs to write to it, put it in the data segment.
590 // segment, not in the text segment.
|
| /external/llvm/lib/Target/X86/ |
| X86AsmPrinter.cpp | 320 const MachineOperand &Segment = MI->getOperand(Op+4);
321 if (Segment.getReg()) {
337 // If this has a segment register, print it.
|
| X86ISelDAGToDAG.cpp | 62 SDValue Segment;
73 Segment(), GV(0), CP(0), BlockAddr(0), ES(0), JT(-1), Align(0),
202 SDValue &Segment);
205 SDValue &Segment);
208 SDValue &Segment);
212 SDValue &Segment,
218 SDValue &Segment);
230 SDValue &Disp, SDValue &Segment) {
257 if (AM.Segment.getNode())
258 Segment = AM.Segment
[all...] |
| X86ISelLowering.cpp | [all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| SegmentedVector.h | 87 SegmentedVectorIterator(SegmentedVector<T, SegmentSize>& vector, size_t segment, size_t index)
89 , m_segment(segment)
148 m_segments.append(new Segment);
193 typedef Vector<T, SegmentSize> Segment;
197 // Skip the first segment, because it's our inline segment, which was
208 Segment* segmentFor(size_t index)
223 segmentCount = std::max<size_t>(segmentCount, 1); // We always have at least our inline segment.
234 // Grow segment N to accomodate the remainder.
242 m_segments.append(new Segment);
[all...] |
| /frameworks/wilhelm/tools/permute/ |
| permute.c | 38 // mean length of each segment of the permutation, in seconds
40 // minimum length of each segment of the permutation, in seconds
44 /** Describes each contiguous segment generated */
50 } Segment;
61 Segment *mSegmentArray; // storage for the segments [max]
69 const Segment *x_ = (Segment *) x;
70 const Segment *y_ = (Segment *) y;
86 Segment *seg = &s->mSegmentArray[s->mSegmentCount++]
[all...] |
| /external/libvpx/libvpx/libmkv/ |
| EbmlIDs.h | 35 /* segment */
36 Segment = 0x18538067,
42 /* Segment Information */
|
| /external/skia/src/gpu/ |
| GrAAConvexPathRenderer.cpp | 23 struct Segment {
34 // is the corner where the previous segment meets this segment
52 typedef SkTArray<Segment, true> SegmentArray;
125 const Segment& sega = (*segments)[a];
127 Segment& segb = (*segments)[b];
137 if (Segment::kLine == segb.fType) {
149 const Segment& sega = (*segments)[a];
151 Segment& segb = (*segments)[b];
250 segments->back().fType = Segment::kLine
[all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/phone/ |
| Ticker.java | 46 private ArrayList<Segment> mSegments = new ArrayList();
63 private final class Segment {
140 Segment(StatusBarNotification n, Drawable icon, CharSequence text) {
191 final Segment seg = mSegments.get(0);
205 final Segment newSegment = new Segment(n, icon, text);
209 Segment seg = mSegments.get(i);
219 Segment seg = mSegments.get(0);
237 Segment seg = mSegments.get(i);
252 Segment seg = mSegments.get(0)
[all...] |
| /external/chromium/third_party/libjingle/source/talk/p2p/base/ |
| pseudotcp.h | 117 struct Segment {
153 bool process(Segment& seg);
179 // Maximum segment size, estimated protocol level, largest segment sent
|
| /external/llvm/lib/MC/MCParser/ |
| DarwinAsmParser.cpp | 36 bool ParseSectionSwitch(const char *Segment, const char *Section,
360 bool DarwinAsmParser::ParseSectionSwitch(const char *Segment,
371 Segment, Section, TAA, StubSize,
525 StringRef Segment, Section;
530 MCSectionMachO::ParseSectionSpecifier(SectionSpec, Segment, Section,
537 bool isText = Segment == "__TEXT"; // FIXME: Hack.
539 Segment, Section, TAA, StubSize,
701 StringRef Segment;
702 if (getParser().parseIdentifier(Segment))
703 return TokError("expected segment name after '.zerofill' directive")
[all...] |
| /external/libvpx/libwebm/ |
| mkvparser.cpp | 678 Segment::Segment(
703 Segment::~Segment()
727 long long Segment::CreateInstance(
730 Segment*& pSegment)
819 if (id == 0x08538067) //Segment ID
830 pSegment = new (std::nothrow) Segment(
852 return E_FILE_FORMAT_INVALID; //there is no segment
857 long long Segment::ParseHeaders()
[all...] |
| mkvparser.hpp | 73 class Segment;
297 Segment* const m_pSegment;
356 Segment*,
385 Segment*,
391 Segment*,
418 Segment*,
423 Segment*,
448 Segment* const m_pSegment;
455 Segment*,
490 Segment* const m_pSegment;
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/gpu/ |
| LoopBlinnPathProcessor.cpp | 64 using LoopBlinnPathProcessorImplementation::Segment;
90 class Segment;
113 struct ValueToString<LoopBlinnPathProcessorImplementation::Segment*> {
114 static String string(LoopBlinnPathProcessorImplementation::Segment* const& value)
124 // Segment
127 // Describes a segment of the path: either a cubic or a line segment.
131 class Segment {
132 WTF_MAKE_NONCOPYABLE(Segment);
140 Segment()
645 Segment* segment = m_arena->allocateObject<Segment>(); local
669 Segment* segment = m_arena->allocateObject<Segment>(); local
681 Segment* segment = m_arena->allocateObject<Segment>(); local
692 Segment* segment = m_arena->allocateObject<Segment>(); local
878 Segment* segment; member in struct:WebCore::__anon17851::SweepData
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentHashMap.java | 80 * well as elements of segment's table must use volatile access,
93 * that design (including forced construction of segment 0) exist
126 * The minimum capacity for per-segment tables. Must be a power
150 * key's hash code are used to choose the segment.
162 final Segment<K,V>[] segments;
237 // Spread bits to regularize both segment and index locations,
252 static final class Segment<K,V> extends ReentrantLock implements Serializable {
263 * per-segment versions of ConcurrentHashMap methods. (Other
284 * segment operation. On multiprocessors, using a bounded
292 * The per-segment table. Elements are accessed vi
847 Segment<K,V> segment = segmentAt(segments, i); local
860 Segment<K,V> segment = ensureSegment(i); local
948 Segment<K,V> segment; local
[all...] |
| /external/guava/guava/src/com/google/common/cache/ |
| LocalCache.java | 99 * If a maximum size is specified, a best-effort bounding is performed per segment, using a
104 * ordering of writes to a segment is sequentially consistent. An update to the map and recording
110 * This implementation uses a per-segment queue to record a memento of the additions, removals,
116 * operates per-segment rather than globally for increased implementation simplicity. We expect
136 * Number of cache access operations that can be buffered per segment before the cache's recency
159 * the segment.
164 * Shift value for indexing within segments. Helps prevent entries that end up in the same segment
170 final Segment<K, V>[] segments;
289 // Ensure sum of segment max weights = overall max weights
376 Segment<K, V> segment, ReferenceEntry<K, V> entry, V value, int weight)
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| MapMakerInternalMap.java | 80 * If a maximum size is specified, a best-effort bounding is performed per segment, using a
85 * ordering of writes to a segment is sequentially consistent. An update to the map and recording
91 * This implementation uses a per-segment queue to record a memento of the additions, removals,
97 * operates per-segment rather than globally for increased implementation simplicity. We expect
117 * Number of cache access operations that can be buffered per segment before the cache's recency
140 * the segment.
145 * Shift value for indexing within segments. Helps prevent entries that end up in the same segment
151 final transient Segment<K, V>[] segments;
248 // Ensure sum of segment max sizes = overall max size
299 Segment<K, V> segment, ReferenceEntry<K, V> entry, V value)
[all...] |
| /prebuilts/devtools/tools/lib/ |
| rule-api.jar | |
| traceview.jar | |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.text_3.5.0.v20100601-1300.jar | |
| /libcore/benchmarks/libs/ |
| caliper.jar | |
