| /external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
| D | BackgroundHTMLInputStream.cpp | 41 m_segments.append(input); in append()
52 …m_checkpoints.append(Checkpoint(m_current, m_segments.size(), tokensExtractedSincePreviousCheckpoi… in createCheckpoint()
69 m_segments[i] = String(); in invalidateCheckpointsBefore()
89 for (size_t i = checkpoint.numberOfSegmentsAlreadyAppended; i < m_segments.size(); ++i) { in rewindTo()
90 ASSERT(!m_segments[i].isNull()); in rewindTo()
91 m_current.append(SegmentedString(m_segments[i])); in rewindTo()
102 m_segments.clear(); in rewindTo()
|
| D | BackgroundHTMLInputStream.h | 70 Vector<String> m_segments; variable
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
| D | ShapeInsideInfo.h | 74 return lineOverlapsShapeBounds() && m_segments.size(); in hasSegments()
79 return m_segments; in segments()
87 ASSERT(m_segmentRanges.size() < m_segments.size()); in currentSegment()
88 return &m_segments[m_segmentRanges.size()]; in currentSegment()
90 void clearSegments() { m_segments.clear(); } in clearSegments()
118 SegmentList m_segments; variable
|
| D | ShapeInsideInfo.cpp | 66 for (size_t i = 0; i < m_segments.size(); i++) { in updateSegmentsForLine()
67 m_segments[i].logicalLeft -= lineOffset.width(); in updateSegmentsForLine()
68 m_segments[i].logicalRight -= lineOffset.width(); in updateSegmentsForLine()
78 m_segments.clear(); in updateSegmentsForLine()
82 m_segments = computeSegmentsForLine(lineTop, lineHeight); in updateSegmentsForLine()
84 return m_segments.size(); in updateSegmentsForLine()
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| D | SharedBuffer.cpp | 298 m_segments.append(segment); in append()
300 segment = m_segments.last() + positionInSegment; in append()
313 m_segments.append(segment); in append()
325 for (unsigned i = 0; i < m_segments.size(); ++i) in clear()
326 freeSegment(m_segments[i]); in clear()
328 m_segments.clear(); in clear()
346 if (!m_segments.isEmpty()) { in copy()
371 for (unsigned i = 0; i < m_segments.size(); ++i) { in buffer()
373 memcpy(destination, m_segments[i], bytesToCopy); in buffer()
376 freeSegment(m_segments[i]); in buffer()
[all …]
|
| D | SharedBuffer.h | 121 mutable Vector<char*> m_segments; variable
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ime/ |
| D | InputMethodContext.cpp | 148 m_segments.clear(); in segments()
150 return m_segments; in segments()
153 return m_segments; in segments()
157 m_segments.append(0); in segments()
160 m_segments.append(underlines[i].startOffset); in segments()
163 return m_segments; in segments()
|
| D | InputMethodContext.h | 92 Vector<unsigned> m_segments; variable
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/animation/ |
| D | TimingFunction.h | 245 double max = m_segments.isEmpty() ? 0 : m_segments.last().max(); in appendSegment()
247 m_segments.append(Segment(max, upperBound, timingFunction)); in appendSegment()
252 ASSERT(!m_segments.isEmpty()); in evaluate()
253 ASSERT(m_segments.last().max() == 1); in evaluate()
255 const Segment* segment = &m_segments[i++]; in evaluate()
256 while (fraction >= segment->max() && i < m_segments.size()) { in evaluate()
257 segment = &m_segments[i++]; in evaluate()
303 Vector<Segment> m_segments; variable
|
| D | TimingFunctionTestHelper.cpp | 45 for (size_t i = 0; i < timingFunction.m_segments.size(); i++) { in PrintTo()
46 ChainedTimingFunction::Segment segment = timingFunction.m_segments[i]; in PrintTo()
49 if (i+1 != timingFunction.m_segments.size()) { in PrintTo()
65 if (lhs.m_segments.size() != ctf.m_segments.size()) in equals()
68 for (size_t i = 0; i < lhs.m_segments.size(); i++) { in equals()
69 if (!equals(lhs.m_segments[i], ctf.m_segments[i])) in equals()
|
| /external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
| D | Region.cpp | 238 m_spans.append(Span(y, m_segments.size())); in appendSpan()
246 SegmentIterator lastSpanBegin = m_segments.data() + m_spans.last().segmentIndex; in canCoalesce()
247 SegmentIterator lastSpanEnd = m_segments.data() + m_segments.size(); in canCoalesce()
267 m_segments.appendRange(begin, end); in appendSpan()
278 m_segments.append(x); in appendSegment()
297 if (it->segmentIndex == m_segments.size()) in segmentsBegin()
300 return &m_segments[it->segmentIndex]; in segmentsBegin()
309 if (it->segmentIndex == m_segments.size()) in segmentsEnd()
315 ASSERT_WITH_SECURITY_IMPLICATION(segmentIndex <= m_segments.size()); in segmentsEnd()
316 return m_segments.data() + segmentIndex; in segmentsEnd()
[all …]
|
| D | Region.h | 84 bool isRect() const { return m_spans.size() <= 2 && m_segments.size() <= 2; } in isRect()
126 Vector<int, 32> m_segments; variable
171 return a.m_spans == b.m_spans && a.m_segments == b.m_segments;
|
| /external/chromium_org/third_party/WebKit/Source/core/animation/ |
| D | CompositorAnimations.cpp | 111 for (size_t i = 0; i < timefunc->m_segments.size(); i++) { in reverse()
112 size_t index = timefunc->m_segments.size() - i - 1; in reverse()
114 RefPtr<TimingFunction> rtf = reverse(timefunc->m_segments[index].m_timingFunction.get()); in reverse()
115 reversed->appendSegment(1 - timefunc->m_segments[index].m_min, rtf.get()); in reverse()
216 if (!chained->m_segments.size()) in isCandidateForAnimationOnCompositor()
219 if (frames.size() != chained->m_segments.size() + 1) in isCandidateForAnimationOnCompositor()
222 for (size_t timeIndex = 0; timeIndex < chained->m_segments.size(); timeIndex++) { in isCandidateForAnimationOnCompositor()
223 const ChainedTimingFunction::Segment& segment = chained->m_segments[timeIndex]; in isCandidateForAnimationOnCompositor()
429 ASSERT(keyframes.size() == chained.m_segments.size() + 1); in addKeyframesToCurve()
431 keyframeTimingFunction = chained.m_segments[i].m_timingFunction.get(); in addKeyframesToCurve()
|