previous 132 Source/bindings/v8/V8NPUtils.cpp ExceptionHandlerInfo* previous; previous 142 Source/bindings/v8/V8NPUtils.cpp info->previous = topHandler; previous 152 Source/bindings/v8/V8NPUtils.cpp topHandler = topHandler->previous; previous 187 Source/core/css/CSSParserValues.h CSSParserValue* previous() previous 2842 Source/core/css/parser/CSSPropertyParser.cpp m_valueList->previous(); previous 5935 Source/core/css/parser/CSSPropertyParser.cpp m_valueList->previous(); previous 6039 Source/core/css/parser/CSSPropertyParser.cpp m_valueList->previous(); previous 6150 Source/core/css/parser/CSSPropertyParser.cpp m_valueList->previous(); // The shorthand loop will advance back to this point. previous 7994 Source/core/css/parser/CSSPropertyParser.cpp m_valueList->previous(); previous 47 Source/core/dom/ChildNodeList.cpp Node* ChildNodeList::itemBefore(const Node* previous) const previous 49 Source/core/dom/ChildNodeList.cpp return LIKELY(!!previous) ? previous->previousSibling() : rootNode().lastChild(); previous 60 Source/core/dom/ElementTraversal.h static ElementType* previous(const ContainerNode& current) { return previousTemplate(current); } previous 61 Source/core/dom/ElementTraversal.h static ElementType* previous(const Node& current) { return previousTemplate(current); } previous 62 Source/core/dom/ElementTraversal.h static ElementType* previous(const ContainerNode& current, const Node* stayWithin) { return previousTemplate(current, stayWithin); } previous 63 Source/core/dom/ElementTraversal.h static ElementType* previous(const Node& current, const Node* stayWithin) { return previousTemplate(current, stayWithin); } previous 149 Source/core/dom/ElementTraversal.h Node* node = NodeTraversal::previous(current); previous 151 Source/core/dom/ElementTraversal.h node = NodeTraversal::previous(*node); previous 159 Source/core/dom/ElementTraversal.h Node* node = NodeTraversal::previous(current, stayWithin); previous 161 Source/core/dom/ElementTraversal.h node = NodeTraversal::previous(*node, stayWithin); previous 220 Source/core/dom/ElementTraversal.h element = Traversal<Element>::previous(element, ¤t); previous 248 Source/core/dom/ElementTraversal.h Element* element = Traversal<Element>::previous(current); previous 250 Source/core/dom/ElementTraversal.h element = Traversal<Element>::previous(*element); previous 258 Source/core/dom/ElementTraversal.h Element* element = Traversal<Element>::previous(current, stayWithin); previous 260 Source/core/dom/ElementTraversal.h element = Traversal<Element>::previous(*element, stayWithin); previous 43 Source/core/dom/LiveNodeList.cpp Element* LiveNodeList::itemBefore(const Element* previous) const previous 45 Source/core/dom/LiveNodeList.cpp return LiveNodeListBase::itemBefore(*this, previous); previous 100 Source/core/dom/LiveNodeListBase.h static Node* previousNode(const ContainerNode&, const Node& previous, bool onlyIncludeDirectChildren); previous 134 Source/core/dom/LiveNodeListBase.h inline Node* LiveNodeListBase::previousNode(const ContainerNode& base, const Node& previous, bool onlyIncludeDirectChildren) previous 136 Source/core/dom/LiveNodeListBase.h return onlyIncludeDirectChildren ? previous.previousSibling() : NodeTraversal::previous(previous, &base); previous 165 Source/core/dom/LiveNodeListBase.h Element* LiveNodeListBase::itemBefore(const Collection& collection, const Element* previous) previous 168 Source/core/dom/LiveNodeListBase.h if (LIKELY(!!previous)) // Without this LIKELY, length() and item() can be 10% slower. previous 169 Source/core/dom/LiveNodeListBase.h current = previousNode(collection.rootNode(), *previous, collection.shouldOnlyIncludeDirectChildren()); previous 1768 Source/core/dom/Node.cpp for (Node* previous = node->previousSibling(); previous; previous = previous->previousSibling()) previous 1769 Source/core/dom/Node.cpp if (previous->nodeName() == node->nodeName()) previous 297 Source/core/dom/Node.h void setPreviousSibling(Node* previous) { m_previous = previous; } previous 43 Source/core/dom/NodeChildRemovalTracker.h NodeChildRemovalTracker* previous() { return m_previous; } previous 64 Source/core/dom/NodeChildRemovalTracker.h for (NodeChildRemovalTracker* removal = s_last; removal; removal = removal->previous()) { previous 70 Source/core/dom/NodeIterator.cpp node = NodeTraversal::previous(*node, root); previous 183 Source/core/dom/NodeIterator.cpp node = NodeTraversal::previous(removedNode, root()); previous 189 Source/core/dom/NodeIterator.cpp node = NodeTraversal::previous(*node, root()); previous 201 Source/core/dom/NodeIterator.cpp Node* node = NodeTraversal::previous(removedNode, root()); previous 207 Source/core/dom/NodeIterator.cpp node = NodeTraversal::previous(*node, root()); previous 218 Source/core/dom/NodeIterator.cpp node = NodeTraversal::previous(*node, root()); previous 63 Source/core/dom/NodeRenderingTraversal.h Node* previous(const Node*, const Node* stayWithin); previous 36 Source/core/dom/NodeTraversal.cpp if (Node* previous = current.pseudoAwarePreviousSibling()) { previous 37 Source/core/dom/NodeTraversal.cpp while (previous->pseudoAwareLastChild()) previous 38 Source/core/dom/NodeTraversal.cpp previous = previous->pseudoAwareLastChild(); previous 39 Source/core/dom/NodeTraversal.cpp return previous; previous 104 Source/core/dom/NodeTraversal.cpp Node* previous = current.previousSibling(); previous 105 Source/core/dom/NodeTraversal.cpp while (previous->lastChild()) previous 106 Source/core/dom/NodeTraversal.cpp previous = previous->lastChild(); previous 107 Source/core/dom/NodeTraversal.cpp return previous; previous 51 Source/core/dom/NodeTraversal.h static Node* previous(const Node&, const Node* stayWithin = 0); previous 492 Source/core/dom/Position.cpp currentPos = currentPos.previous(); previous 153 Source/core/dom/Position.h Position previous(PositionMoveType = CodePoint) const; previous 63 Source/core/dom/shadow/ComposedTreeWalker.h void previous(); previous 162 Source/core/dom/shadow/ComposedTreeWalker.h inline void ComposedTreeWalker::previous() previous 165 Source/core/dom/shadow/ComposedTreeWalker.h if (Node* previous = traversePreviousSibling(m_node)) { previous 166 Source/core/dom/shadow/ComposedTreeWalker.h while (Node* child = traverseLastChild(previous)) previous 167 Source/core/dom/shadow/ComposedTreeWalker.h previous = child; previous 168 Source/core/dom/shadow/ComposedTreeWalker.h m_node = previous; previous 77 Source/core/editing/ApplyBlockElementCommand.cpp setEndingSelection(VisibleSelection(visibleStart, visibleEnd.previous(CannotCrossEditingBoundary), endingSelection().isDirectional())); previous 191 Source/core/editing/ApplyBlockElementCommand.cpp if (startStyle->preserveNewline() && isNewLineAtPosition(start) && !isNewLineAtPosition(start.previous()) && start.offsetInContainerNode() > 0) previous 192 Source/core/editing/ApplyBlockElementCommand.cpp start = startOfParagraph(VisiblePosition(end.previous())).deepEquivalent(); previous 218 Source/core/editing/ApplyBlockElementCommand.cpp if (!isNewLineAtPosition(end.previous()) && isNewLineAtPosition(end)) previous 104 Source/core/editing/BreakBlockquoteCommand.cpp pos = pos.previous(); previous 678 Source/core/editing/CompositeEditCommand.cpp VisiblePosition previousVisiblePos(visiblePos.previous()); previous 1091 Source/core/editing/CompositeEditCommand.cpp VisiblePosition beforeParagraph = startOfParagraphToMove.previous(); previous 1168 Source/core/editing/CompositeEditCommand.cpp VisiblePosition beforeParagraph = startOfParagraphToMove.previous(CannotCrossEditingBoundary); previous 1337 Source/core/editing/CompositeEditCommand.cpp VisiblePosition previous(caret.previous(CannotCrossEditingBoundary)); previous 1339 Source/core/editing/CompositeEditCommand.cpp if (enclosingNodeOfType(previous.deepEquivalent(), &isMailBlockquote)) previous 224 Source/core/editing/DeleteSelectionCommand.cpp VisiblePosition visiblePos = VisiblePosition(m_upstreamStart, VP_DEFAULT_AFFINITY).previous(); previous 379 Source/core/editing/DeleteSelectionCommand.cpp VisiblePosition previous = VisiblePosition(firstPositionInNode(m_startBlock.get())).previous(); previous 380 Source/core/editing/DeleteSelectionCommand.cpp if (previous.isNotNull() && !isEndOfBlock(previous)) previous 802 Source/core/editing/DeleteSelectionCommand.cpp bool lineBreakBeforeStart = lineBreakExistsAtVisiblePosition(VisiblePosition(m_upstreamStart).previous()); previous 263 Source/core/editing/Editor.cpp VisiblePosition previous = start.previous(); previous 265 Source/core/editing/Editor.cpp if (previous.isNull() || previous.deepEquivalent().deprecatedNode()->rootEditableElement() != startContainer->rootEditableElement()) previous 990 Source/core/editing/Editor.cpp VisiblePosition previous = next.previous(); previous 991 Source/core/editing/Editor.cpp if (next == previous) previous 993 Source/core/editing/Editor.cpp previous = previous.previous(); previous 994 Source/core/editing/Editor.cpp if (!inSameParagraph(next, previous)) previous 996 Source/core/editing/Editor.cpp RefPtrWillBeRawPtr<Range> range = makeRange(previous, next); previous 617 Source/core/editing/FrameSelection.cpp pos = pos.previous(CanSkipOverEditingBoundary); previous 779 Source/core/editing/FrameSelection.cpp pos = pos.previous(CanSkipOverEditingBoundary); previous 818 Source/core/editing/FrameSelection.cpp pos = pos.previous(CanSkipOverEditingBoundary); previous 895 Source/core/editing/FrameSelection.cpp pos = VisiblePosition(m_selection.extent(), m_selection.affinity()).previous(CanSkipOverEditingBoundary); previous 124 Source/core/editing/InsertListCommand.cpp setEndingSelection(VisibleSelection(visibleStart, visibleEnd.previous(CannotCrossEditingBoundary), endingSelection().isDirectional())); previous 277 Source/core/editing/InsertListCommand.cpp previousListChild = enclosingListChild(start.previous().deepEquivalent().deprecatedNode(), listNode); previous 349 Source/core/editing/InsertListCommand.cpp Element* previousList = adjacentEnclosingList(start, start.previous(CannotCrossEditingBoundary), listTag); previous 265 Source/core/editing/InsertParagraphSeparatorCommand.cpp if (isFirstInBlock || !inSameBlock(visiblePos, visiblePos.previous())) { previous 186 Source/core/editing/InsertTextCommand.cpp startPosition = endPosition.previous(); previous 386 Source/core/editing/ReplaceSelectionCommand.cpp VisiblePosition prev = startOfInsertedContent.previous(CannotCrossEditingBoundary); previous 962 Source/core/editing/ReplaceSelectionCommand.cpp setEndingSelection(endingSelection().visibleStart().previous()); previous 993 Source/core/editing/ReplaceSelectionCommand.cpp originalVisPosBeforeEndBR = VisiblePosition(positionBeforeNode(endBR), DOWNSTREAM).previous(); previous 1154 Source/core/editing/ReplaceSelectionCommand.cpp VisiblePosition destination = startOfParagraphToMove.previous(); previous 1239 Source/core/editing/ReplaceSelectionCommand.cpp if (visiblePos.previous() == originalVisPosBeforeEndBR) previous 1305 Source/core/editing/ReplaceSelectionCommand.cpp bool needsLeadingSpace = !isStartOfParagraph(startOfInsertedContent) && !isCharacterSmartReplaceExemptConsideringNonBreakingSpace(startOfInsertedContent.previous().characterAfter(), true); previous 1374 Source/core/editing/ReplaceSelectionCommand.cpp RefPtr<Text> previous = toText(text->previousSibling()); previous 1375 Source/core/editing/ReplaceSelectionCommand.cpp insertTextIntoNode(text, 0, previous->data()); previous 1378 Source/core/editing/ReplaceSelectionCommand.cpp position.moveToOffset(previous->length() + position.offsetInContainerNode()); previous 1380 Source/core/editing/ReplaceSelectionCommand.cpp updatePositionForNodeRemoval(position, *previous); previous 1384 Source/core/editing/ReplaceSelectionCommand.cpp positionOnlyToBeUpdated.moveToOffset(previous->length() + positionOnlyToBeUpdated.offsetInContainerNode()); previous 1385 Source/core/editing/ReplaceSelectionCommand.cpp else if (positionOnlyToBeUpdated.containerNode() == previous) previous 1388 Source/core/editing/ReplaceSelectionCommand.cpp updatePositionForNodeRemoval(positionOnlyToBeUpdated, *previous); previous 1391 Source/core/editing/ReplaceSelectionCommand.cpp removeNode(previous); previous 166 Source/core/editing/SpellChecker.cpp VisiblePosition oneBeforeStart = start.previous(); previous 198 Source/core/editing/SpellChecker.cpp VisiblePosition oneBeforeStart = startVisiblePosition(spellingSearchRange.get(), DOWNSTREAM).previous(); previous 305 Source/core/editing/TypingCommand.cpp VisiblePosition previous = start.previous(); previous 306 Source/core/editing/TypingCommand.cpp if (previous.isNotNull()) { previous 307 Source/core/editing/TypingCommand.cpp VisiblePosition p1 = startOfWord(previous, LeftWordIfOnBoundary); previous 435 Source/core/editing/TypingCommand.cpp if (visibleStart.previous(CannotCrossEditingBoundary).isNull()) { previous 454 Source/core/editing/TypingCommand.cpp if (isStartOfParagraph(visibleStart) && isFirstPositionAfterTable(visibleStart.previous(CannotCrossEditingBoundary))) { previous 472 Source/core/editing/TypingCommand.cpp selectionToDelete.setWithoutValidation(selectionToDelete.end(), selectionToDelete.end().previous(BackwardDeletion)); previous 777 Source/core/editing/VisiblePosition.cpp VisiblePosition previous = visiblePosition.previous(); previous 778 Source/core/editing/VisiblePosition.cpp return previous.isNull() || !previous.deepEquivalent().deprecatedNode()->isDescendantOf(node); previous 74 Source/core/editing/VisiblePosition.h VisiblePosition previous(EditingBoundaryCrossingRule = CanCrossEditingBoundary) const; previous 84 Source/core/editing/VisiblePosition.h UChar32 characterBefore() const { return previous().characterAfter(); } previous 417 Source/core/editing/VisibleSelection.cpp pos = pos.previous(); previous 642 Source/core/editing/VisibleSelection.cpp VisiblePosition previous(p); previous 644 Source/core/editing/VisibleSelection.cpp if (previous.isNull()) { previous 653 Source/core/editing/VisibleSelection.cpp m_end = previous.deepEquivalent(); previous 668 Source/core/editing/VisibleUnits.cpp p = c.previous(); previous 850 Source/core/editing/VisibleUnits.cpp visPos = visPos.previous(); previous 866 Source/core/editing/VisibleUnits.cpp visPos = c.previous(); previous 1352 Source/core/editing/VisibleUnits.cpp return p.isNotNull() && p.previous(CanCrossEditingBoundary).isNull(); previous 254 Source/core/editing/htmlediting.cpp p = p.previous(Character); previous 453 Source/core/editing/htmlediting.cpp if (isRenderedTable(n) && vPos == lastInElement.previous()) previous 984 Source/core/editing/htmlediting.cpp newSelection = VisibleSelection(startOfSelection, endOfSelection.previous(CannotCrossEditingBoundary)); previous 573 Source/core/editing/markup.cpp if (visibleStart == visibleEnd.previous()) previous 621 Source/core/editing/markup.cpp if (shouldAnnotate == AnnotateForInterchange && needInterchangeNewlineAfter(visibleEnd.previous())) previous 200 Source/core/fetch/MemoryCache.cpp MemoryCacheEntry* previous = current->m_previousInLiveResourcesList; previous 216 Source/core/fetch/MemoryCache.cpp current = previous; previous 235 Source/core/fetch/MemoryCache.cpp MemoryCacheEntry* previous = current->m_previousInAllResourcesList; previous 241 Source/core/fetch/MemoryCache.cpp current = previous; previous 255 Source/core/fetch/MemoryCache.cpp MemoryCacheEntry* previous = current->m_previousInAllResourcesList; previous 256 Source/core/fetch/MemoryCache.cpp ASSERT(!previous || contains(previous->m_resource.get())); previous 268 Source/core/fetch/MemoryCache.cpp if (previous && !contains(previous->m_resource.get())) previous 270 Source/core/fetch/MemoryCache.cpp current = previous; previous 276 Source/core/fetch/MemoryCache.cpp MemoryCacheEntry* previous = current->m_previousInAllResourcesList; previous 277 Source/core/fetch/MemoryCache.cpp ASSERT(!previous || contains(previous->m_resource.get())); previous 283 Source/core/fetch/MemoryCache.cpp if (previous && !contains(previous->m_resource.get())) previous 285 Source/core/fetch/MemoryCache.cpp current = previous; previous 346 Source/core/fetch/MemoryCache.cpp MemoryCacheEntry* previous = entry->m_previousInAllResourcesList; previous 351 Source/core/fetch/MemoryCache.cpp next->m_previousInAllResourcesList = previous; previous 353 Source/core/fetch/MemoryCache.cpp list->m_tail = previous; previous 355 Source/core/fetch/MemoryCache.cpp if (previous) previous 356 Source/core/fetch/MemoryCache.cpp previous->m_nextInAllResourcesList = next; previous 411 Source/core/fetch/MemoryCache.cpp MemoryCacheEntry* previous = entry->m_previousInLiveResourcesList; previous 417 Source/core/fetch/MemoryCache.cpp next->m_previousInLiveResourcesList = previous; previous 419 Source/core/fetch/MemoryCache.cpp list->m_tail = previous; previous 421 Source/core/fetch/MemoryCache.cpp if (previous) previous 422 Source/core/fetch/MemoryCache.cpp previous->m_nextInLiveResourcesList = next; previous 313 Source/core/frame/LocalFrame.cpp VisiblePosition previous = position.previous(); previous 314 Source/core/frame/LocalFrame.cpp if (previous.isNotNull()) { previous 315 Source/core/frame/LocalFrame.cpp RefPtrWillBeRawPtr<Range> previousCharacterRange = makeRange(previous, position); previous 279 Source/core/html/HTMLCollection.cpp Element* HTMLCollection::itemBefore(const Element* previous) const previous 281 Source/core/html/HTMLCollection.cpp return LiveNodeListBase::itemBefore(*this, previous); previous 342 Source/core/html/HTMLCollection.cpp inline Element* HTMLCollection::traverseNextElement(Element& previous) const previous 345 Source/core/html/HTMLCollection.cpp return virtualItemAfter(&previous); previous 347 Source/core/html/HTMLCollection.cpp return nextMatchingChildElement(*this, previous); previous 348 Source/core/html/HTMLCollection.cpp return nextMatchingElement(*this, previous); previous 111 Source/core/html/HTMLCollection.h Element* traverseNextElement(Element& previous) const; previous 83 Source/core/html/HTMLFormControlsCollection.cpp Element* HTMLFormControlsCollection::virtualItemAfter(Element* previous) const previous 87 Source/core/html/HTMLFormControlsCollection.cpp if (!previous) previous 89 Source/core/html/HTMLFormControlsCollection.cpp else if (m_cachedElement == previous) previous 92 Source/core/html/HTMLFormControlsCollection.cpp offset = findFormAssociatedElement(associatedElements, previous) + 1; previous 51 Source/core/html/HTMLNameCollection.cpp Element* HTMLNameCollection::virtualItemAfter(Element* previous) const previous 53 Source/core/html/HTMLNameCollection.cpp ASSERT(previous != ownerNode()); previous 56 Source/core/html/HTMLNameCollection.cpp if (!previous) previous 59 Source/core/html/HTMLNameCollection.cpp current = ElementTraversal::next(*previous, &ownerNode()); previous 56 Source/core/html/HTMLTableRowsCollection.cpp HTMLTableRowElement* HTMLTableRowsCollection::rowAfter(HTMLTableElement& table, HTMLTableRowElement* previous) previous 60 Source/core/html/HTMLTableRowsCollection.cpp if (previous && previous->parentNode() != table) { previous 61 Source/core/html/HTMLTableRowsCollection.cpp if (HTMLTableRowElement* row = Traversal<HTMLTableRowElement>::nextSibling(*previous)) previous 67 Source/core/html/HTMLTableRowsCollection.cpp if (!previous) previous 69 Source/core/html/HTMLTableRowsCollection.cpp else if (isInHead(previous)) previous 70 Source/core/html/HTMLTableRowsCollection.cpp child = Traversal<HTMLElement>::nextSibling(*previous->parentNode()); previous 79 Source/core/html/HTMLTableRowsCollection.cpp if (!previous || isInHead(previous)) previous 81 Source/core/html/HTMLTableRowsCollection.cpp else if (previous->parentNode() == table) previous 82 Source/core/html/HTMLTableRowsCollection.cpp child = Traversal<HTMLElement>::nextSibling(*previous); previous 83 Source/core/html/HTMLTableRowsCollection.cpp else if (isInBody(previous)) previous 84 Source/core/html/HTMLTableRowsCollection.cpp child = Traversal<HTMLElement>::nextSibling(*previous->parentNode()); previous 95 Source/core/html/HTMLTableRowsCollection.cpp if (!previous || !isInFoot(previous)) previous 98 Source/core/html/HTMLTableRowsCollection.cpp child = Traversal<HTMLElement>::nextSibling(*previous->parentNode()); previous 151 Source/core/html/HTMLTableRowsCollection.cpp Element* HTMLTableRowsCollection::virtualItemAfter(Element* previous) const previous 153 Source/core/html/HTMLTableRowsCollection.cpp return rowAfter(toHTMLTableElement(ownerNode()), toHTMLTableRowElement(previous)); previous 87 Source/core/html/forms/RadioInputType.cpp while ((htmlElement = (forward ? Traversal<HTMLElement>::next(*htmlElement) : Traversal<HTMLElement>::previous(*htmlElement)))) { previous 473 Source/core/html/forms/TextFieldInputType.cpp Node* previous = container ? container : element().innerTextElement(); previous 474 Source/core/html/forms/TextFieldInputType.cpp previous->parentNode()->insertBefore(placeholder, previous->nextSibling()); previous 475 Source/core/html/forms/TextFieldInputType.cpp ASSERT_WITH_SECURITY_IMPLICATION(placeholder->parentNode() == previous->parentNode()); previous 53 Source/core/html/imports/HTMLImportStateResolver.cpp if (ancestor->previous() && isBlockingFollowers(ancestor->previous())) previous 484 Source/core/page/FocusController.cpp for (Node* node = start; node; node = type == FocusTypeForward ? NodeTraversal::next(*node) : NodeTraversal::previous(*node)) { previous 511 Source/core/page/FocusController.cpp for (Node* node = start; node; node = NodeTraversal::previous(*node)) { previous 565 Source/core/page/FocusController.cpp startingNode = NodeTraversal::previous(*start); previous 574 Source/core/page/FocusController.cpp for (Node* node = startingNode; node; node = NodeTraversal::previous(*node)) { previous 137 Source/core/rendering/CounterNode.cpp CounterNode* previous = m_previousSibling; previous 138 Source/core/rendering/CounterNode.cpp if (!previous) previous 141 Source/core/rendering/CounterNode.cpp while (CounterNode* lastChild = previous->m_lastChild) previous 142 Source/core/rendering/CounterNode.cpp previous = lastChild; previous 144 Source/core/rendering/CounterNode.cpp return previous; previous 194 Source/core/rendering/CounterNode.cpp RenderCounter* previous = 0; previous 197 Source/core/rendering/CounterNode.cpp if (previous) previous 198 Source/core/rendering/CounterNode.cpp previous->m_nextForSameCounter = value->m_nextForSameCounter; previous 205 Source/core/rendering/CounterNode.cpp previous = iterator; previous 331 Source/core/rendering/CounterNode.cpp CounterNode* previous = oldChild->m_previousSibling; previous 337 Source/core/rendering/CounterNode.cpp if (previous) previous 338 Source/core/rendering/CounterNode.cpp previous->m_nextSibling = next; previous 345 Source/core/rendering/CounterNode.cpp next->m_previousSibling = previous; previous 348 Source/core/rendering/CounterNode.cpp m_lastChild = previous; previous 62 Source/core/rendering/RenderCounter.cpp Element* previous = ElementTraversal::previousIncludingPseudo(*self); previous 63 Source/core/rendering/RenderCounter.cpp while (previous && !previous->renderer()) previous 64 Source/core/rendering/RenderCounter.cpp previous = ElementTraversal::previousIncludingPseudo(*previous); previous 65 Source/core/rendering/RenderCounter.cpp return previous ? previous->renderer() : 0; previous 74 Source/core/rendering/RenderCounter.cpp Element* previous = ElementTraversal::pseudoAwarePreviousSibling(*self); previous 75 Source/core/rendering/RenderCounter.cpp while (previous && !previous->renderer()) previous 76 Source/core/rendering/RenderCounter.cpp previous = ElementTraversal::pseudoAwarePreviousSibling(*previous); previous 77 Source/core/rendering/RenderCounter.cpp if (previous) previous 78 Source/core/rendering/RenderCounter.cpp return previous->renderer(); previous 79 Source/core/rendering/RenderCounter.cpp previous = self->parentElement(); previous 80 Source/core/rendering/RenderCounter.cpp return previous ? previous->renderer() : 0; previous 433 Source/core/rendering/RenderCounter.cpp CounterNode* previous; previous 434 Source/core/rendering/RenderCounter.cpp for (RefPtr<CounterNode> child = node->lastDescendant(); child && child != node; child = previous) { previous 435 Source/core/rendering/RenderCounter.cpp previous = child->previousInPreOrder(); previous 154 Source/core/rendering/RenderListItem.cpp for (current = NodeRenderingTraversal::previous(current, listNode); current && current != listNode; current = NodeRenderingTraversal::previous(current, listNode)) { previous 288 Source/core/rendering/RenderObject.h void setPreviousSibling(RenderObject* previous) { m_previous = previous; } previous 98 Source/core/rendering/RenderText.cpp static void makeCapitalized(String* string, UChar previous) previous 110 Source/core/rendering/RenderText.cpp stringWithPrevious[0] = previous == noBreakSpace ? ' ' : previous; previous 111 Source/core/rendering/svg/RenderSVGText.cpp static inline bool findPreviousAndNextAttributes(RenderObject* root, RenderSVGInlineText* locateElement, SVGTextLayoutAttributes*& previous, SVGTextLayoutAttributes*& next) previous 126 Source/core/rendering/svg/RenderSVGText.cpp previous = text->layoutAttributes(); previous 184 Source/core/rendering/svg/RenderSVGText.cpp SVGTextLayoutAttributes* previous = 0; previous 187 Source/core/rendering/svg/RenderSVGText.cpp findPreviousAndNextAttributes(this, attributes->context(), previous, next); previous 189 Source/core/rendering/svg/RenderSVGText.cpp if (previous) previous 190 Source/core/rendering/svg/RenderSVGText.cpp m_layoutAttributesBuilder.buildLayoutAttributesForTextRenderer(previous->context()); previous 240 Source/core/rendering/svg/RenderSVGText.cpp SVGTextLayoutAttributes* previous = 0; previous 243 Source/core/rendering/svg/RenderSVGText.cpp findPreviousAndNextAttributes(this, text, previous, next); previous 245 Source/core/rendering/svg/RenderSVGText.cpp if (previous) previous 246 Source/core/rendering/svg/RenderSVGText.cpp affectedAttributes.append(previous); previous 576 Source/core/testing/Internals.cpp walker.previous(); previous 326 Source/core/xml/XPathStep.cpp for (n = NodeTraversal::previous(*n); n != parent; n = NodeTraversal::previous(*n)) previous 705 Source/platform/heap/Heap.cpp HeapPage<Header>** previous = &m_firstPage; previous 711 Source/platform/heap/Heap.cpp HeapPage<Header>::unlink(unused, previous); previous 715 Source/platform/heap/Heap.cpp previous = &page->m_next; previous 800 Source/platform/heap/Heap.h template<typename T> static Address reallocate(void* previous, size_t); previous 1203 Source/platform/heap/Heap.h Address Heap::reallocate(void* previous, size_t size) previous 1219 Source/platform/heap/Heap.h if (!previous) { previous 1223 Source/platform/heap/Heap.h FinalizedHeapObjectHeader* previousHeader = FinalizedHeapObjectHeader::fromPayload(previous); previous 1229 Source/platform/heap/Heap.h memcpy(address, previous, copySize); previous 53 Source/platform/mac/NSScrollerImpDetails.h + (id)scrollerImpWithStyle:(NSScrollerStyle)newScrollerStyle controlSize:(NSControlSize)newControlSize horizontal:(BOOL)horizontal replacingScrollerImp:(id)previous; previous 99 Source/platform/text/TextBoundaries.cpp *start = it->previous(); previous 62 Source/wtf/TreeNode.h NodeType* previous() const { return m_previous; } previous 75 Source/wtf/TreeNode.h ASSERT(!newChild->previous()); previous 84 Source/wtf/TreeNode.h NodeType* newPrevious = refChild->previous(); previous 99 Source/wtf/TreeNode.h ASSERT(!child->previous()); previous 124 Source/wtf/TreeNode.h m_lastChild = child->previous(); previous 127 Source/wtf/TreeNode.h NodeType* oldPrevious = child->previous(); previous 56 Source/wtf/TreeNodeTest.cpp ASSERT_EQ(lastChild->previous(), firstChild.get()); previous 80 Source/wtf/TreeNodeTest.cpp ASSERT_EQ(firstChild.get(), lastChild->previous()); previous 87 Source/wtf/TreeNodeTest.cpp ASSERT_EQ(middleChild->previous(), firstChild.get()); previous 90 Source/wtf/TreeNodeTest.cpp ASSERT_EQ(lastChild->previous(), middleChild.get()); previous 103 Source/wtf/TreeNodeTest.cpp ASSERT_EQ(child->previous(), nullNode.get()); previous 140 Source/wtf/TreeNodeTest.cpp ASSERT_EQ(trio.lastChild->previous(), trio.firstChild.get()); previous 166 Source/wtf/TreeNodeTest.cpp ASSERT_EQ(trio.middleChild->previous(), nullNode.get());