Searched defs:segment (Results 26 - 50 of 172) sorted by relevance

1234567

/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
H A Dvp9_aq_complexity.c42 int segment; local
46 // Clear down the segment map.
70 for (segment = 1; segment < active_segments; ++segment) {
73 aq_c_q_adj_factor[aq_strength][segment],
76 // For AQ complexity mode, we dont allow Q0 in a segment if the base
77 // Q is not 0. Q0 (lossless) implies 4x4 only and in AQ mode 2 a segment
84 vp9_enable_segfeature(seg, segment, SEG_LVL_ALT_Q);
85 vp9_set_segdata(seg, segment, SEG_LVL_ALT_
110 unsigned char segment; local
[all...]
/external/chromium_org/third_party/sfntly/cpp/src/sample/subtly/
H A Dfont_assembler.cc96 // For simplicity, we will have one segment per contiguous range.
105 if (character != last_chararacter + 1) { // new segment
122 // The last segment is still open.
125 // Updating the id_range_offset for every segment.
127 Ptr<CMapTable::CMapFormat4::Builder::Segment> segment = segment_list->at(i); local
128 segment->set_id_range_offset(segment->id_range_offset()
131 // Adding the final, required segment.
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DSimplifyFindNext_Test.cpp32 SimplifyFindNextTest::Segment& segment = contours[0].debugSegments()[0]; local
34 pts[0] = segment.xyAtT(&segment.span(endIndex));
39 SimplifyFindNextTest::Segment* next = segment.findNextWinding(chaseArray,
H A DShapeOps.cpp25 Segment* segment = backPtr.fOther; local
29 if (segment->activeAngle(nextStart, done, angles)) {
38 return last->segment();
47 sorted[0]->segment()->debugShowSort(__FUNCTION__, sorted, 0);
57 segment = angle->segment();
58 } while (segment->windSum(angle) == SK_MinS32);
60 segment->debugShowSort(__FUNCTION__, sorted, firstIndex);
62 int sumMiWinding = segment->updateWindingReverse(angle);
63 int sumSuWinding = segment
[all...]
/external/chromium_org/v8/src/
H A Dzone.cc16 // chained together forming a LIFO structure with the newest segment
37 // Computes the address of the nth byte in this segment.
112 // Find a segment with a suitable size to keep around.
115 // and freeing every segment except the one we wish to keep.
119 // Unlink the segment we wish to keep from the list.
127 // Zap the entire current segment (including the header).
135 // If we have found a segment we want to keep, we must recompute the
138 // force a new segment to be allocated on demand.
143 // Un-poison so we can re-use the segment later.
146 // Zap the contents of the kept segment (bu
195 DeleteSegment(Segment* segment, int size) argument
236 Segment* segment = NewSegment(static_cast<int>(new_size)); local
[all...]
H A Ddate.cc47 void DateCache::ClearSegment(DST* segment) { argument
48 segment->start_sec = kMaxEpochTimeInSec;
49 segment->end_sec = -kMaxEpochTimeInSec;
50 segment->offset_ms = 0;
51 segment->last_used = 0;
184 // Extend the after_ segment.
187 // The after_ segment is either invalid or starts too late.
189 // If the after_ segment is valid, replace it with a new segment.
244 // If the before_ segment end
[all...]
/external/sfntly/cpp/src/sample/subtly/
H A Dfont_assembler.cc96 // For simplicity, we will have one segment per contiguous range.
105 if (character != last_chararacter + 1) { // new segment
122 // The last segment is still open.
125 // Updating the id_range_offset for every segment.
127 Ptr<CMapTable::CMapFormat4::Builder::Segment> segment = segment_list->at(i); local
128 segment->set_id_range_offset(segment->id_range_offset()
131 // Adding the final, required segment.
/external/skia/experimental/Intersection/
H A DSimplifyFindNext_Test.cpp32 SimplifyFindNextTest::Segment& segment = contours[0].debugSegments()[0]; local
34 pts[0] = segment.xyAtT(&segment.span(endIndex));
39 SimplifyFindNextTest::Segment* next = segment.findNextWinding(chaseArray,
H A DShapeOps.cpp25 Segment* segment = backPtr.fOther; local
29 if (segment->activeAngle(nextStart, done, angles)) {
38 return last->segment();
47 sorted[0]->segment()->debugShowSort(__FUNCTION__, sorted, 0);
57 segment = angle->segment();
58 } while (segment->windSum(angle) == SK_MinS32);
60 segment->debugShowSort(__FUNCTION__, sorted, firstIndex);
62 int sumMiWinding = segment->updateWindingReverse(angle);
63 int sumSuWinding = segment
[all...]
/external/chromium_org/net/tools/dump_cache/
H A Durl_to_filename_encoder.cc52 void UrlToFilenameEncoder::AppendSegment(string* segment, string* dest) { argument
53 CHECK(!segment->empty());
54 if ((*segment == ".") || (*segment == "..")) {
56 dest->append(*segment);
57 segment->clear();
59 size_t segment_size = segment->size();
61 // We need to inject ",-" at the end of the segment to signify that
68 if ((*segment)[segment_size - 1] == kEscapeChar) {
70 } else if ((*segment)[segment_siz
95 string segment; local
[all...]
/external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/
H A DShapeOutsideInfo.cpp291 LineSegment segment = computedShape().getExcludedInterval((borderBoxLineTop - logicalTopOffset()), std::min(lineHeight, shapeLogicalBottom() - borderBoxLineTop)); local
292 if (segment.isValid) {
294 LayoutUnit rawLeftMarginBoxDelta = segment.logicalLeft + logicalLeftOffset() + logicalLeftMargin;
298 LayoutUnit rawRightMarginBoxDelta = segment.logicalRight + logicalLeftOffset() - containingBlock.logicalWidthForChild(&m_renderer) - logicalRightMargin;
/external/chromium_org/third_party/WebKit/Source/platform/
H A DSharedBuffer.cpp91 const char* segment; local
93 while (unsigned segmentLength = sharedBuffer->getSomeData(segment, offset)) {
95 memcpy(snippet + offset, segment, length);
235 const char* segment; local
237 while (size_t length = data->getSomeData(segment, position)) {
238 append(segment, length);
259 char* segment; local
261 segment = allocateSegment();
262 m_segments.append(segment);
264 segment
304 const char* segment = 0; local
391 const char* segment = 0; local
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Dcaniter.cpp228 // allocate the arrays, and find the strings that are CE to each segment
242 // for each segment, get all the combinations that can produce
341 // we have a segment, in NFD. Find all the strings that are canonically equivalent to it.
342 UnicodeString* CanonicalIterator::getEquivalents(const UnicodeString &segment, int32_t &result_len, UErrorCode &status) { argument
354 int32_t segLen = segment.extract(USeg, 256, status);
384 // TODO: check if operator == is semanticaly the same as attempt.equals(segment)
385 if (attempt==segment) {
430 Hashtable *CanonicalIterator::getEquivalents2(Hashtable *fillinResult, const UChar *segment, int32_t segLen, UErrorCode &status) { argument
436 //if (PROGRESS) printf("Adding: %s\n", UToS(Tr(segment)));
438 UnicodeString toPut(segment, segLe
498 extract(Hashtable *fillinResult, UChar32 comp, const UChar *segment, int32_t segLen, int32_t segmentPos, UErrorCode &status) argument
[all...]
H A Dnormlzr.cpp481 UnicodeString segment(text->next32PostInc());
488 segment.append(c);
492 fNorm2->normalize(segment, buffer, errorCode);
504 UnicodeString segment; local
507 segment.insert(0, c);
514 fNorm2->normalize(segment, buffer, errorCode);
/external/chromium_org/third_party/skia/src/pathops/
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()) {
H A DSkOpAngle.h53 void set(const SkOpSegment* segment, int start, int end);
59 SkOpSegment* segment() const { function in class:SkOpAngle
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...]
/external/chromium_org/third_party/webrtc/base/
H A Dstream_unittest.cc100 StreamSegment* segment = new StreamSegment(test); local
102 SeekTest(segment, 20);
103 delete segment;
130 // Create a segment of test stream in range [100,600)
132 StreamSegment* segment = new StreamSegment(test, 500); local
135 StreamInterface* stream = segment;
158 delete segment;
/external/eigen/Eigen/src/plugins/
H A DBlockMethods.h760 /** \returns a dynamic-size expression of a segment (i.e. a vector block) in *this.
764 * \param start the first coefficient in the segment
765 * \param n the number of coefficients in the segment
774 * \sa class Block, segment(Index)
776 inline SegmentReturnType segment(Index start, Index n) function
783 /** This is the const version of segment(Index,Index).*/
784 inline ConstSegmentReturnType segment(Index start, Index n) const function
794 * \param n the number of coefficients in the segment
822 * \param n the number of coefficients in the segment
846 /** \returns a fixed-size expression of a segment (
863 inline typename FixedSegmentReturnType<N>::Type segment(Index start, Index n = N) function
871 inline typename ConstFixedSegmentReturnType<N>::Type segment(Index start, Index n = N) const function
[all...]
/external/guava/guava-tests/test/com/google/common/cache/
H A DCacheTesting.java99 * Forces the segment containing the given {@code key} to expand (see
105 Segment<K, V> segment = map.segmentFor(hash);
106 segment.expand();
132 for (Segment segment : map.segments) {
133 drainRecencyQueue(segment);
138 static void drainRecencyQueue(Segment<?, ?> segment) { argument
139 segment.lock();
141 segment.cleanUp();
143 segment.unlock();
154 for (LocalCache.Segment segment
159 drainReferenceQueue(LocalCache.Segment<?, ?> segment) argument
307 segmentSize(Segment<?, ?> segment) argument
312 segmentTable(Segment<K, V> segment) argument
337 writeQueueSize(Segment<?, ?> segment) argument
350 accessQueueSize(Segment<?, ?> segment) argument
431 expireEntries(Segment<?, ?> segment, long now) argument
[all...]
/external/icu/icu4c/source/common/
H A Dcaniter.cpp228 // allocate the arrays, and find the strings that are CE to each segment
242 // for each segment, get all the combinations that can produce
341 // we have a segment, in NFD. Find all the strings that are canonically equivalent to it.
342 UnicodeString* CanonicalIterator::getEquivalents(const UnicodeString &segment, int32_t &result_len, UErrorCode &status) { argument
354 int32_t segLen = segment.extract(USeg, 256, status);
384 // TODO: check if operator == is semanticaly the same as attempt.equals(segment)
385 if (attempt==segment) {
430 Hashtable *CanonicalIterator::getEquivalents2(Hashtable *fillinResult, const UChar *segment, int32_t segLen, UErrorCode &status) { argument
436 //if (PROGRESS) printf("Adding: %s\n", UToS(Tr(segment)));
438 UnicodeString toPut(segment, segLe
498 extract(Hashtable *fillinResult, UChar32 comp, const UChar *segment, int32_t segLen, int32_t segmentPos, UErrorCode &status) argument
[all...]
H A Dnormlzr.cpp481 UnicodeString segment(text->next32PostInc());
488 segment.append(c);
492 fNorm2->normalize(segment, buffer, errorCode);
504 UnicodeString segment; local
507 segment.insert(0, c);
514 fNorm2->normalize(segment, buffer, errorCode);
/external/libnfc-nci/src/nfc/tags/
H A Drw_t1t.c963 tNFC_STATUS RW_T1tReadSeg (UINT8 segment) argument
974 if (segment >= T1T_MAX_SEGMENTS)
976 RW_TRACE_ERROR1 ("RW_T1tReadSeg - Invalid Segment: %u", segment);
982 RW_T1T_BLD_ADDS ((adds), (segment));
/external/skia/src/pathops/
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()) {
H A DSkOpAngle.h53 void set(const SkOpSegment* segment, int start, int end);
59 SkOpSegment* segment() const { function in class:SkOpAngle

Completed in 598 milliseconds

1234567