/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...] |
/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, @Nullable INode node, @Nullable String id, 80 return "Segment [edgeType=" + edgeType + ", node=" + nodeStr + ", at=" + at + ", id=" + id
|
/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);
|
/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/libvpx/vp8/common/ |
loopfilter.c | 317 /* Note the baseline filter values for each segment */ 355 int Segment = (alt_flt_enabled) ? mbd->mode_info_context->mbmi.segment_id : 0; 357 filter_level = baseline_filter_level[Segment]; 423 /* Note the baseline filter values for each segment */ 459 int Segment = (alt_flt_enabled) ? mbd->mode_info_context->mbmi.segment_id : 0; 460 filter_level = baseline_filter_level[Segment]; 531 /* Note the baseline filter values for each segment */ 567 int Segment = (alt_flt_enabled) ? mbd->mode_info_context->mbmi.segment_id : 0; 568 filter_level = baseline_filter_level[Segment];
|
/external/libvpx/vp8/decoder/ |
threading.c | 257 int Segment; 351 Segment = (alt_flt_enabled) ? xd->mode_info_context->mbmi.segment_id : 0; 352 filter_level = pbi->mt_baseline_filter_level[Segment]; 651 /* Note the baseline filter values for each segment */ 695 int Segment; [all...] |
/external/llvm/lib/CodeGen/ |
TargetLoweringObjectFileImpl.cpp | 442 StringRef Segment, Section; 446 MCSectionMachO::ParseSectionSpecifier(SectionVal, Segment, Section, 455 getContext().getMachOSection(Segment, Section, TAA, StubSize, 469 StringRef Segment, Section; 473 MCSectionMachO::ParseSectionSpecifier(GV->getSection(), Segment, Section, 484 getContext().getMachOSection(Segment, Section, TAA, StubSize, Kind); 550 // linker needs to write to it, put it in the data segment. 571 // segment, not in the text segment.
|
/external/llvm/lib/Target/X86/ |
X86AsmPrinter.cpp | 360 const MachineOperand &Segment = MI->getOperand(Op+4); 361 if (Segment.getReg()) {
|
X86ISelDAGToDAG.cpp | 65 SDValue Segment; 76 Segment(), GV(0), CP(0), BlockAddr(0), ES(0), JT(-1), Align(0), 206 SDValue &Segment); 209 SDValue &Segment); 212 SDValue &Segment); 216 SDValue &Segment, 222 SDValue &Segment); 234 SDValue &Disp, SDValue &Segment) { 259 if (AM.Segment.getNode()) 260 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/libmkv/ |
EbmlIDs.h | 35 //segment 36 Segment = 0x18538067, 42 //Segment Information
|
/external/skia/src/gpu/ |
GrAAConvexPathRenderer.cpp | 23 struct Segment { 32 // is the corner where the previous segment meets this segment 47 typedef SkTArray<Segment, true> SegmentArray; 121 const Segment& sega = (*segments)[a]; 123 Segment& segb = (*segments)[b]; 133 if (Segment::kLine == segb.fType) { 145 const Segment& sega = (*segments)[a]; 147 Segment& segb = (*segments)[b]; 224 segments->back().fType = Segment::kLine [all...] |
/frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/phone/ |
Ticker.java | 49 private ArrayList<Segment> mSegments = new ArrayList(); 66 private final class Segment { 143 Segment(StatusBarNotification n, Drawable icon, CharSequence text) { 194 final Segment seg = mSegments.get(0); 208 final Segment newSegment = new Segment(n, icon, text); 212 Segment seg = mSegments.get(i); 222 Segment seg = mSegments.get(0); 240 Segment seg = mSegments.get(i); 255 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 | 35 bool ParseSectionSwitch(const char *Segment, const char *Section, 308 bool DarwinAsmParser::ParseSectionSwitch(const char *Segment, 317 bool isText = StringRef(Segment) == "__TEXT"; // FIXME: Hack. 319 Segment, Section, TAA, StubSize, 446 StringRef Segment, Section; 451 MCSectionMachO::ParseSectionSpecifier(SectionSpec, Segment, Section, 458 bool isText = Segment == "__TEXT"; // FIXME: Hack. 460 Segment, Section, TAA, StubSize, 622 StringRef Segment; 623 if (getParser().ParseIdentifier(Segment)) [all...] |
/external/libvpx/mkvparser/ |
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::__anon16213::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...] |
/sdk/traceview/src/com/android/traceview/ |
TimeLineView.java | 58 private Segment[] mSegments; 420 ArrayList<Segment> segmentList = new ArrayList<Segment>(); 455 // Create a Segment object for each visible part of a block. 465 // Add this segment if it has a non-zero elapsed time. 467 Segment segment = new Segment(rd, top, topStartTime, local 469 segmentList.add(segment); 518 mSegments = segmentList.toArray(new Segment[segmentList.size()]) 554 Segment segment = new Segment(rd, top, lastEndTime, topEndTime); local [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
org.eclipse.text_3.5.0.v20100601-1300.jar | |