| /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...] |
| drd_segment.c | 39 Segment* DRD_(g_sg_list);
62 static void sg_init(Segment* const sg,
66 Segment* creator_sg;
100 VG_(message)(Vg_DebugMsg, "New segment for thread %d with vc %s\n",
107 static void DRD_(sg_cleanup)(Segment* const sg)
116 /** Allocate and initialize a new segment. */
117 Segment* DRD_(sg_new)(const DrdThreadId creator, const DrdThreadId created)
119 Segment* sg;
126 sg = VG_(malloc)("drd.segment.sn.1", sizeof(*sg));
137 static void DRD_(sg_delete)(Segment* const sg
[all...] |
| drd_semaphore.c | 50 /** Push a segment at the end of the queue 'p->last_sem_post_seg'. */
51 static void drd_segment_push(struct semaphore_info* p, Segment* sg)
61 tl_assert(*(Segment**)VG_(indexXA)(p->last_sem_post_seg, n) == sg);
64 /** Pop a segment from the beginning of the queue 'p->last_sem_post_seg'. */
65 static Segment* drd_segment_pop(struct semaphore_info* p)
68 Segment* sg;
78 sg = *(Segment**)VG_(indexXA)(p->last_sem_post_seg, sz - 1);
110 VG_(free), sizeof(Segment*));
119 Segment* sg;
174 Segment* sg
[all...] |
| /external/chromium_org/net/disk_cache/flash/ |
| segment.cc | 9 #include "net/disk_cache/flash/segment.h"
14 Segment::Segment(int32 index, bool read_only, Storage* storage)
27 Segment::~Segment() {
33 bool Segment::HaveOffset(int32 offset) const {
38 void Segment::AddUser() {
43 void Segment::ReleaseUser() {
48 bool Segment::HasNoUsers() const {
53 bool Segment::Init()
[all...] |
| segment.h | 19 // size logical segments, represented by this class. Since segment size is
20 // fixed, the storage size should be a multiple of segment size. The picture
24 // | segment 0 | segment 1 | ... | segment n-1 | segment n |
31 // A segment is constructed by taking its index within the storage, a flag
32 // indicating whether it is a read-only segment and a pointer to the storage on
34 // it. Init() function must be called right after the construction of a segment
37 // non-mutating functions; mutating functions can be called if the segment i
[all...] |
| segment_unittest.cc | 7 #include "net/disk_cache/flash/segment.h"
43 scoped_ptr<disk_cache::Segment> segment(
44 new disk_cache::Segment(0, false, &storage));
45 EXPECT_TRUE(segment->Init());
47 EXPECT_TRUE(segment->HasNoUsers());
48 segment->AddUser();
49 segment->AddUser();
50 EXPECT_FALSE(segment->HasNoUsers());
52 segment->ReleaseUser()
[all...] |
| log_store.h | 18 class Segment;
74 // one segment open for writing, and multiple open for reading.
75 std::vector<Segment*> open_segments_;
77 // The index of the segment currently being written to. It's an index to
|
| /external/chromium_org/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_;
94 // Find a segment with a suitable size to keep around.
95 Segment* keep = NULL
212 Segment* segment = NewSegment(static_cast<int>(new_size)); local
[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/chromium_org/mojo/public/bindings/lib/ |
| buffer.h | 48 struct Segment {
49 Segment* next;
54 void* AllocateInSegment(Segment* segment, size_t num_bytes);
58 Segment fixed_;
59 Segment* overflow_;
|
| buffer.cc | 59 Segment* doomed = overflow_;
90 void* ScratchBuffer::AllocateInSegment(Segment* segment, size_t delta) {
92 if (static_cast<size_t>(segment->end - segment->cursor) >= delta) {
93 result = segment->cursor;
95 segment->cursor += delta;
106 // Ensure segment buffer is aligned.
107 size_t segment_size = internal::Align(sizeof(Segment)) + delta;
109 Segment* segment = static_cast<Segment*>(malloc(segment_size)) local
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkPathMeasure.h | 59 /** Given a start and stop distance, return in dst the intervening segment(s).
60 If the segment is zero-length, return false, else return true.
63 Begin the segment with a moveTo if startWithMoveTo is true
88 struct Segment {
96 SkTDArray<Segment> fSegments;
99 static const Segment* NextSegment(const Segment*);
106 const Segment* distanceToSegment(SkScalar distance, SkScalar* t);
|
| /external/skia/include/core/ |
| SkPathMeasure.h | 59 /** Given a start and stop distance, return in dst the intervening segment(s).
60 If the segment is zero-length, return false, else return true.
63 Begin the segment with a moveTo if startWithMoveTo is true
88 struct Segment {
96 SkTDArray<Segment> fSegments;
99 static const Segment* NextSegment(const Segment*);
106 const Segment* distanceToSegment(SkScalar distance, SkScalar* t);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 24 import com.android.ide.common.api.Segment;
29 public final Segment with;
32 public final Segment edge;
55 public Match(GuidelineHandler handler, Segment edge, Segment with,
|
| GuidelineHandler.java | 63 import com.android.ide.common.api.Segment;
137 protected List<Segment> mHorizontalEdges;
143 protected List<Segment> mVerticalEdges;
149 protected List<Segment> mCenterVertEdges;
155 protected List<Segment> mCenterHorizEdges;
235 mHorizontalEdges = new ArrayList<Segment>();
236 mVerticalEdges = new ArrayList<Segment>();
237 mCenterVertEdges = new ArrayList<Segment>();
238 mCenterHorizEdges = new ArrayList<Segment>();
323 mHorizontalEdges.add(new Segment(b.y, b.x, b.x2(), node, id, TOP, WITHOUT_MARGIN))
[all...] |
| ResizeHandler.java | 36 import com.android.ide.common.api.Segment;
107 protected void snapVertical(Segment vEdge, int x, Rect newBounds) {
130 protected void snapHorizontal(Segment hEdge, int y, Rect newBounds) {
188 Segment hEdge = null;
189 Segment vEdge = null;
196 hEdge = new Segment(b.y, b.x, b.x2(), child, childId, mHorizontalEdgeType, NO_MARGIN);
198 hEdge = new Segment(b.y2(), b.x, b.x2(), child, childId, mHorizontalEdgeType,
205 vEdge = new Segment(b.x, b.y, b.y2(), child, childId, mVerticalEdgeType, NO_MARGIN);
207 vEdge = new Segment(b.x2(), b.y, b.y2(), child, childId, mVerticalEdgeType, NO_MARGIN);
|
| /external/libvpx/libwebm/ |
| 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;
|
| /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/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];
181 StringRef &Segment, // Out.
192 return "mach-o section specifier requires a segment and section "
195 // Capture segment, remove leading and trailing whitespace.
196 Segment = Comma.first;
197 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 | 44 private ArrayList<Segment> mSegments = new ArrayList();
61 private final class Segment {
138 Segment(StatusBarNotification n, Drawable icon, CharSequence text) {
189 final Segment seg = mSegments.get(0);
203 final Segment newSegment = new Segment(n, icon, text);
207 Segment seg = mSegments.get(i);
217 Segment seg = mSegments.get(0);
249 Segment seg = mSegments.get(i);
264 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;
|
