| /external/valgrind/main/drd/ |
| drd_segment.h | 31 * Segments and segment lists. A segment represents information about
33 * clock associated with each segment.
43 typedef struct segment struct
46 struct segment* next;
47 struct segment* prev;
49 /** Reference count: number of pointers that point to this segment. */
51 /** Stack trace of the first instruction of the segment. */
53 /** Vector clock associated with the segment. */
57 * with the segment
[all...] |
| drd_segment.c | 58 static void sg_init(Segment* const sg,
62 Segment* creator_sg;
94 VG_(message)(Vg_DebugMsg, "New segment for thread %d with vc %s\n",
101 static void DRD_(sg_cleanup)(Segment* const sg)
110 /** Allocate and initialize a new segment. */
111 Segment* DRD_(sg_new)(const DrdThreadId creator, const DrdThreadId created)
113 Segment* sg;
120 sg = VG_(malloc)("drd.segment.sn.1", sizeof(*sg));
126 static void DRD_(sg_delete)(Segment* const sg)
133 VG_(message)(Vg_DebugMsg, "Discarding the segment with vector clock %s\n"
[all...] |
| drd_semaphore.c | 51 /** Push a segment at the end of the queue 'p->last_sem_post_seg'. */
52 static void drd_segment_push(struct semaphore_info* p, Segment* sg)
62 tl_assert(*(Segment**)VG_(indexXA)(p->last_sem_post_seg, n) == sg);
65 /** Pop a segment from the beginning of the queue 'p->last_sem_post_seg'. */
66 static Segment* drd_segment_pop(struct semaphore_info* p)
69 Segment* sg;
79 sg = *(Segment**)VG_(indexXA)(p->last_sem_post_seg, sz - 1);
111 VG_(free), sizeof(Segment*));
120 Segment* sg;
175 Segment* sg
[all...] |
| drd_thread.h | 70 Segment* first; /**< Pointer to first segment. */
71 Segment* last; /**< Pointer to last segment. */
171 void DRD_(thread_get_latest_segment)(Segment** sg, const DrdThreadId tid);
175 const Segment* sg);
185 const Segment* const p);
339 /** Return a pointer to the latest segment for the specified thread. */
341 Segment* DRD_(thread_get_segment)(const DrdThreadId tid)
351 /** Return a pointer to the latest segment for the running thread. *
[all...] |
| /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...] |
| zone.h | 49 class Segment;
59 // allocation is attempted, a segment of memory will be requested
75 // small (size <= kMaximumKeptSegmentSize) segment around if it finds one.
78 // Deletes the last small segment kept around by DeleteAll().
126 // Creates a new segment, sets it size, and pushes it to the front
127 // of the segment chain. Returns the new segment.
128 Segment* NewSegment(int size);
130 // Deletes the given segment. Does not touch the segment chain
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/gpu/ |
| LoopBlinnPathProcessor.h | 45 class Segment;
96 void conditionallySubdivide(LoopBlinnPathProcessorImplementation::Segment*,
97 Vector<LoopBlinnPathProcessorImplementation::Segment*>& nextSegments);
105 Vector<LoopBlinnPathProcessorImplementation::Segment*> allSegmentsOverlappingY(LoopBlinnPathProcessorImplementation::Contour*, float x, float y);
|
| 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::__anon14866::SweepData
[all...] |
| /external/skia/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);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 22 import com.android.ide.common.api.Segment;
27 public final Segment with;
30 public final Segment edge;
53 public Match(GuidelineHandler handler, Segment edge, Segment with,
|
| GuidelineHandler.java | 61 import com.android.ide.common.api.Segment;
135 protected List<Segment> mHorizontalEdges;
141 protected List<Segment> mVerticalEdges;
147 protected List<Segment> mCenterVertEdges;
153 protected List<Segment> mCenterHorizEdges;
233 mHorizontalEdges = new ArrayList<Segment>();
234 mVerticalEdges = new ArrayList<Segment>();
235 mCenterVertEdges = new ArrayList<Segment>();
236 mCenterHorizEdges = new ArrayList<Segment>();
316 mHorizontalEdges.add(new Segment(b.y, b.x, b.x2(), node, id, TOP, WITHOUT_MARGIN))
[all...] |
| ResizeHandler.java | 34 import com.android.ide.common.api.Segment;
98 protected void snapVertical(Segment vEdge, int x, Rect newBounds) {
121 protected void snapHorizontal(Segment hEdge, int y, Rect newBounds) {
171 Segment hEdge = null;
172 Segment vEdge = null;
179 hEdge = new Segment(b.y, b.x, b.x2(), child, childId, mHorizontalEdgeType, NO_MARGIN);
181 hEdge = new Segment(b.y2(), b.x, b.x2(), child, childId, mHorizontalEdgeType,
188 vEdge = new Segment(b.x, b.y, b.y2(), child, childId, mVerticalEdgeType, NO_MARGIN);
190 vEdge = new Segment(b.x2(), b.y, b.y2(), child, childId, mVerticalEdgeType, NO_MARGIN);
|
| MoveHandler.java | 35 import com.android.ide.common.api.Segment;
47 * different segment types -- the left edge, the right edge, the baseline, the center
105 protected void snapVertical(Segment vEdge, int x, Rect newBounds) {
130 protected void snapHorizontal(Segment hEdge, int y, Rect newBounds) {
192 Segment edge = new Segment(b.y, b.x, b.x2(), null, null, TOP, NO_MARGIN);
194 edge = new Segment(b.y2(), b.x, b.x2(), null, null, BOTTOM, NO_MARGIN);
197 edge = new Segment(b.x, b.y, b.y2(), null, null, LEFT, NO_MARGIN);
199 edge = new Segment(b.x2(), b.y, b.y2(), null, null, RIGHT, NO_MARGIN);
203 edge = new Segment(b.centerX(), b.y, b.y2(), null, null, CENTER_VERTICAL, NO_MARGIN)
[all...] |
| /external/libvpx/mkvparser/ |
| 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...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| ResizeState.java | 24 import com.android.ide.common.api.Segment;
51 public Segment horizontalFillSegment;
54 public Segment verticalFillSegment;
|
| /external/llvm/lib/MC/ |
| MCSectionMachO.cpp | 75 MCSectionMachO::MCSectionMachO(StringRef Segment, StringRef Section,
78 assert(Segment.size() <= 16 && Section.size() <= 16 &&
79 "Segment or section string too long");
81 if (i < Segment.size())
82 SegmentName[i] = Segment[i];
180 StringRef &Segment, // Out.
191 return "mach-o section specifier requires a segment and section "
194 // Capture segment, remove leading and trailing whitespace.
195 Segment = Comma.first;
196 StripSpaces(Segment);
[all...] |
| /external/guava/guava-tests/test/com/google/common/cache/ |
| CacheTesting.java | 28 import com.google.common.cache.LocalCache.Segment;
99 * Forces the segment containing the given {@code key} to expand (see
100 * {@link Segment#expand()}.
105 Segment<K, V> segment = map.segmentFor(hash); local
106 segment.expand();
132 for (Segment segment : map.segments) {
133 drainRecencyQueue(segment);
138 static void drainRecencyQueue(Segment<?, ?> segment)
[all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/phone/ |
| Ticker.java | 49 private ArrayList<Segment> mSegments = new ArrayList();
56 private final class Segment {
133 Segment(StatusBarNotification n, Drawable icon, CharSequence text) {
184 final Segment seg = mSegments.get(0);
197 final Segment newSegment = new Segment(n, icon, n.notification.tickerText);
201 Segment seg = mSegments.get(i);
211 Segment seg = mSegments.get(0);
229 Segment seg = mSegments.get(i);
244 Segment seg = mSegments.get(0)
[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...] |
| /frameworks/av/media/libstagefright/matroska/ |
| MatroskaExtractor.h | 26 struct Segment;
68 mkvparser::Segment *mSegment;
|
| /sdk/rule_api/src/com/android/ide/common/api/ |
| Segment.java | 24 * A segment is a straight horizontal or vertical line between two points, typically an
25 * edge of a node but also possibly some internal segment like a baseline or a center
32 public class Segment {
64 public Segment(int at, int from, int to, @NonNull INode node, @Nullable String id,
80 return "Segment [edgeType=" + edgeType + ", node=" + nodeStr + ", at=" + at + ", id=" + id
|
| /external/libvpx/libmkv/ |
| testlibmkv.c | 28 Ebml_StartSubElement(&ebml, &startSegment, Segment); //segment
30 //segment info
|
| /external/skia/src/core/ |
| SkPathMeasure.cpp | 34 SkScalar SkPathMeasure::Segment::getScalarT() const {
38 const SkPathMeasure::Segment* SkPathMeasure::NextSegment(const Segment* seg) {
113 Segment* seg = fSegments.append();
137 Segment* seg = fSegments.append();
153 Segment* seg;
212 const Segment* seg = fSegments.begin();
213 const Segment* stop = fSegments.end();
222 const Segment* s = seg;
382 const SkPathMeasure::Segment* SkPathMeasure::distanceToSegment
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCSectionMachO.h | 37 MCSectionMachO(StringRef Segment, StringRef Section,
163 StringRef &Segment, // Out.
|
| /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...] |
