Searched refs:segment (Results 51 - 75 of 361) sorted by relevance

1234567891011>>

/external/valgrind/main/drd/tests/
H A Dtc21_pthonce.stderr.exp8 Other segment start (thread 2)
10 Other segment end (thread 2)
18 Other segment start (thread 2)
20 Other segment end (thread 2)
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/xpath/
H A DXMPPath.java17 * Representates an XMP XMPPath with segment accessor methods.
51 * Append a path segment
53 * @param segment the segment to add
55 public void add(XMPPathSegment segment) argument
57 segments.add(segment);
62 * @param index the index of the segment to return
63 * @return Returns a path segment.
/external/chromium_org/third_party/libvpx/source/libvpx/
H A Dwebmdec.h23 void *segment; member in struct:WebmInputContext
H A Dwebmenc.h29 void *segment; member in struct:EbmlGlobal
/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsOp.cpp17 SkOpSegment* segment = backPtr.fOther; local
22 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done,
34 return last->segment();
43 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex);
54 segment = angle->segment();
55 winding = segment->windSum(angle);
57 int sumMiWinding = segment->updateWindingReverse(angle);
58 int sumSuWinding = segment->updateOppWindingReverse(angle);
59 if (segment
[all...]
H A DSkPathOpsDebug.cpp160 const SkOpSegment* segment = next->fSegment; local
161 bool operandsMatch = firstOperand == segment->operand();
162 signSum += operandsMatch ? segment->spanSign(next) : segment->oppSign(next);
163 oppSum += operandsMatch ? segment->oppSign(next) : segment->spanSign(next);
164 const SkOpSpan& span = segment->span(SkMin32(next->fStart, next->fEnd));
165 if (segment->_xor()) {
169 if (segment->oppXor()) {
188 const SkOpSegment* segment local
233 const SkOpSegment* segment = next->fSegment; local
[all...]
H A DSkIntersectionHelper.h86 const SkOpSegment& segment = fContour->segments()[fIndex]; local
88 SkDPoint midPtByT = segment.dPtAtT(mid);
106 const SkOpSegment& segment = fContour->segments()[fIndex]; local
107 SegmentType type = (SegmentType) segment.verb();
111 if (segment.isHorizontal()) {
114 if (segment.isVertical()) {
/external/fio/lib/
H A Drand.c95 unsigned int segment, unsigned int len)
105 if (segment > len)
106 segment = len;
115 this_len = (segment * (100 - percentage)) / 100;
93 fill_random_buf_percentage(struct frand_state *fs, void *buf, unsigned int percentage, unsigned int segment, unsigned int len) argument
/external/skia/src/pathops/
H A DSkPathOpsOp.cpp17 SkOpSegment* segment = backPtr.fOther; local
22 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done,
34 return last->segment();
43 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex);
54 segment = angle->segment();
55 winding = segment->windSum(angle);
57 int sumMiWinding = segment->updateWindingReverse(angle);
58 int sumSuWinding = segment->updateOppWindingReverse(angle);
59 if (segment
[all...]
H A DSkPathOpsDebug.cpp159 const SkOpSegment* segment = next->fSegment; local
160 bool operandsMatch = firstOperand == segment->operand();
161 signSum += operandsMatch ? segment->spanSign(next) : segment->oppSign(next);
162 oppSum += operandsMatch ? segment->oppSign(next) : segment->spanSign(next);
163 const SkOpSpan& span = segment->span(SkMin32(next->fStart, next->fEnd));
164 if (segment->_xor()) {
168 if (segment->oppXor()) {
187 const SkOpSegment* segment local
232 const SkOpSegment* segment = next->fSegment; local
[all...]
H A DSkIntersectionHelper.h86 const SkOpSegment& segment = fContour->segments()[fIndex]; local
88 SkDPoint midPtByT = segment.dPtAtT(mid);
106 const SkOpSegment& segment = fContour->segments()[fIndex]; local
107 SegmentType type = (SegmentType) segment.verb();
111 if (segment.isHorizontal()) {
114 if (segment.isVertical()) {
/external/chromium_org/third_party/WebKit/Source/platform/graphics/
H A DThreadSafeDataTransport.cpp50 const char* segment = 0; local
51 while (size_t length = buffer->getSomeData(segment, m_readPosition)) {
53 newBufferQueue.append(SharedBuffer::create(segment, length));
/external/chromium_org/third_party/icu/source/common/unicode/
H A Dcaniter.h184 // we have a segment, in NFD. Find all the strings that are canonically equivalent to it.
185 UnicodeString *getEquivalents(const UnicodeString &segment, int32_t &result_len, UErrorCode &status); //private String[] getEquivalents(String segment)
187 //Set getEquivalents2(String segment);
188 Hashtable *getEquivalents2(Hashtable *fillinResult, const UChar *segment, int32_t segLen, UErrorCode &status);
189 //Hashtable *getEquivalents2(const UnicodeString &segment, int32_t segLen, UErrorCode &status);
192 * See if the decomposition of cp2 is at segment starting at segmentPos
196 //Set extract(int comp, String segment, int segmentPos, StringBuffer buffer);
197 Hashtable *extract(Hashtable *fillinResult, UChar32 comp, const UChar *segment, int32_t segLen, int32_t segmentPos, UErrorCode &status);
198 //Hashtable *extract(UChar32 comp, const UnicodeString &segment, int32_
[all...]
/external/eigen/unsupported/Eigen/src/SVD/
H A DBDCSVD.h385 m_naiveU.row(0).segment(firstCol, n + 1).real() << b.matrixU().row(0);
386 m_naiveU.row(1).segment(firstCol, n + 1).real() << b.matrixU().row(n);
418 l = m_naiveU.row(firstCol + k).segment(firstCol, k);
419 f = m_naiveU.row(firstCol + k + 1).segment(firstCol + k + 1, n - k - 1);
423 l = m_naiveU.row(1).segment(firstCol, k);
424 f = m_naiveU.row(0).segment(firstCol + k + 1, n - k - 1);
439 MatrixXr q1 (m_naiveU.col(firstCol + k).segment(firstCol, k + 1));
443 m_naiveU.col(i + 1).segment(firstCol, k + 1) << m_naiveU.col(i).segment(firstCol, k + 1);
446 m_naiveU.col(firstCol).segment( firstCo
[all...]
/external/icu/icu4c/source/common/unicode/
H A Dcaniter.h184 // we have a segment, in NFD. Find all the strings that are canonically equivalent to it.
185 UnicodeString *getEquivalents(const UnicodeString &segment, int32_t &result_len, UErrorCode &status); //private String[] getEquivalents(String segment)
187 //Set getEquivalents2(String segment);
188 Hashtable *getEquivalents2(Hashtable *fillinResult, const UChar *segment, int32_t segLen, UErrorCode &status);
189 //Hashtable *getEquivalents2(const UnicodeString &segment, int32_t segLen, UErrorCode &status);
192 * See if the decomposition of cp2 is at segment starting at segmentPos
196 //Set extract(int comp, String segment, int segmentPos, StringBuffer buffer);
197 Hashtable *extract(Hashtable *fillinResult, UChar32 comp, const UChar *segment, int32_t segLen, int32_t segmentPos, UErrorCode &status);
198 //Hashtable *extract(UChar32 comp, const UnicodeString &segment, int32_
[all...]
/external/chromium_org/third_party/icu/source/i18n/
H A Dnortrans.cpp135 UnicodeString segment; local
142 segment.remove();
144 segment.append(c);
154 fNorm2.normalize(segment, normalized, errorCode);
158 if(segment != normalized) {
/external/icu/icu4c/source/i18n/
H A Dnortrans.cpp135 UnicodeString segment; local
142 segment.remove();
144 segment.append(c);
154 fNorm2.normalize(segment, normalized, errorCode);
158 if(segment != normalized) {
/external/okhttp/okio/src/main/java/okio/
H A DOkBuffer.java141 Segment segment = head;
142 int pos = segment.pos;
143 int limit = segment.limit;
145 byte[] data = segment.data;
150 head = segment.pop();
151 SegmentPool.INSTANCE.recycle(segment);
153 segment.pos = pos;
172 Segment segment = head;
173 int pos = segment.pos;
174 int limit = segment
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DComputingConcurrentHashMapTest.java114 Segment<Object, Object> segment = map.segments[0];
122 ReferenceEntry<Object, Object> entry = segment.getEntry(key, hash);
127 checkEvictionQueues(map, segment, readOrder, writeOrder);
129 assertTrue(segment.recencyQueue.isEmpty());
141 assertTrue(segment.recencyQueue.size() <= DRAIN_THRESHOLD);
144 int undrainedIndex = reads.size() - segment.recencyQueue.size();
145 checkAndDrainRecencyQueue(map, segment, reads.subList(undrainedIndex, reads.size()));
148 checkEvictionQueues(map, segment, readOrder, writeOrder);
171 Segment<Object, Object> segment = map.segments[0];
172 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment
[all...]
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/rdf/tests/
H A Drdftest1.asm4 ;; [1] relocation within the same segment in each module
6 ;; [3] relocation to same segment in different module
7 ;; [4] relocation to different segment in different module
H A Drdfseg2.asm1 ;; library function for rdfseg - this file is linked as a far segment
/external/icu/icu4c/source/layout/
H A DContextualGlyphSubstProc2.cpp100 const LookupSegment *segment = lookupTable2->lookupSegment(lookupTable2->segments, gid); local
101 if (segment != NULL) {
102 newGlyph = SWAPW(segment->value);
116 const LEReferenceTo<LookupSingle> segment = lookupTable6->lookupSingle(lookupTable6->entries, gid); local
117 if (segment != NULL) {
118 newGlyph = SWAPW(segment->value);
/external/chromium_org/third_party/WebKit/Source/platform/
H A DSharedBufferChunkReader.cpp100 // Read the next segment.
136 const char* segment = 0; local
137 while (size_t segmentLength = m_buffer->getSomeData(segment, bufferPosition)) {
139 data.append(segment, requestedSize - readBytesCount);
143 data.append(segment, segmentLength);
/external/eigen/test/
H A Deigen2support.cpp41 VERIFY_IS_EQUAL((m1.col(0).start(1)), (m1.col(0).segment(0,1)));
42 VERIFY_IS_EQUAL((m1.col(0).template start<1>()), (m1.col(0).segment(0,1)));
43 VERIFY_IS_EQUAL((m1.col(0).end(1)), (m1.col(0).segment(rows-1,1)));
44 VERIFY_IS_EQUAL((m1.col(0).template end<1>()), (m1.col(0).segment(rows-1,1)));
/external/elfutils/0.153/libdwfl/
H A Ddwfl_segment_report_module.c64 This more than covers the phdrs and note segment in the average 64-bit
76 /* Return user segment index closest to ADDR but not above it.
79 addr_segndx (Dwfl *dwfl, size_t segment, GElf_Addr addr, bool next) argument
84 if (dwfl->lookup_segndx[segment] >= 0)
85 ndx = dwfl->lookup_segndx[segment];
86 if (++segment >= dwfl->lookup_elts - 1)
89 while (dwfl->lookup_addr[segment] < addr);
93 while (dwfl->lookup_segndx[segment] < 0)
94 if (++segment >= dwfl->lookup_elts - 1)
96 ndx = dwfl->lookup_segndx[segment];
109 size_t segment = ndx; local
[all...]

Completed in 7406 milliseconds

1234567891011>>