third_party/WebKit/Source/core/dom/shadow/ComposedTreeTraversal.h - Issue 1649983003: Remove the forced layout in getComputedStyle for elements in Shadow DOM

Side by Side Diff: third_party/WebKit/Source/core/dom/shadow/ComposedTreeTraversal.h

Issue 1649983003: Remove the forced layout in getComputedStyle for elements in Shadow DOM (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master

Patch Set: Look at ShadowRoots when walking up the tree in updateLayoutTreeForNodeIfNeeded. Created 4 years, 10 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

View unified diff | Download patch

« third_party/WebKit/Source/core/dom/LayoutTreeBuilderTraversal.h ('K') | « third_party/WebKit/Source/core/dom/LayoutTreeBuilderTraversal.cpp ('k') | third_party/WebKit/Source/core/dom/shadow/ComposedTreeTraversal.cpp » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Hide Comments ('s')

OLD	NEW
1 /*	1 /*

2 * Copyright (C) 2012 Google Inc. All rights reserved.	2 * Copyright (C) 2012 Google Inc. All rights reserved.

3 *	3 *

4 * Redistribution and use in source and binary forms, with or without	4 * Redistribution and use in source and binary forms, with or without

5 * modification, are permitted provided that the following conditions are	5 * modification, are permitted provided that the following conditions are

6 * met:	6 * met:

7 *	7 *

8 * * Redistributions of source code must retain the above copyright	8 * * Redistributions of source code must retain the above copyright

9 * notice, this list of conditions and the following disclaimer.	9 * notice, this list of conditions and the following disclaimer.

10 * * Neither the name of Google Inc. nor the names of its	10 * * Neither the name of Google Inc. nor the names of its

(...skipping 135 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
146 static Node* traverseNext(const Node&, const Node* stayWithin);	146 static Node* traverseNext(const Node&, const Node* stayWithin);

147 static Node* traverseNextSkippingChildren(const Node&, const Node* stayWithi n);	147 static Node* traverseNextSkippingChildren(const Node&, const Node* stayWithi n);

148 static Node* traversePrevious(const Node&);	148 static Node* traversePrevious(const Node&);

149	149

150 static Node* traverseFirstChild(const Node&);	150 static Node* traverseFirstChild(const Node&);

151 static Node* traverseLastChild(const Node&);	151 static Node* traverseLastChild(const Node&);

152 static Node* traverseChild(const Node&, TraversalDirection);	152 static Node* traverseChild(const Node&, TraversalDirection);

153	153

154 static ContainerNode* traverseParent(const Node&, ParentTraversalDetails* = 0);	154 static ContainerNode* traverseParent(const Node&, ParentTraversalDetails* = 0);

155 // TODO(hayato): Make ParentTraversalDetails be aware of slot elements too.	155 // TODO(hayato): Make ParentTraversalDetails be aware of slot elements too.

156 static ContainerNode* traverseParentForV0(const Node&, ParentTraversalDetai ls* = 0);	156 static ContainerNode* traverseParentForV0(const Node&, ParentTraversalDetail s* = 0);

157 static ContainerNode* traverseParentOrHost(const Node&);	157 static ContainerNode* traverseParentOrHost(const Node&, ParentTraversalDetai ls* = 0);
	rune 2016/02/01 09:24:23 0 -> nullptr? 0 -> nullptr?
158	158

159 static Node* traverseNextSibling(const Node&);	159 static Node* traverseNextSibling(const Node&);

160 static Node* traversePreviousSibling(const Node&);	160 static Node* traversePreviousSibling(const Node&);

161	161

162 static Node* traverseSiblings(const Node&, TraversalDirection);	162 static Node* traverseSiblings(const Node&, TraversalDirection);

163 static Node* traverseSiblingsForV1HostChild(const Node&, TraversalDirection) ;	163 static Node* traverseSiblingsForV1HostChild(const Node&, TraversalDirection) ;

164 static Node* traverseSiblingsForV0Distribution(const Node&, TraversalDirecti on);	164 static Node* traverseSiblingsForV0Distribution(const Node&, TraversalDirecti on);

165	165

166 static Node* traverseNextAncestorSibling(const Node&);	166 static Node* traverseNextAncestorSibling(const Node&);

167 static Node* traversePreviousAncestorSibling(const Node&);	167 static Node* traversePreviousAncestorSibling(const Node&);

(...skipping 137 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
305 }	305 }

306	306

307 inline Node* ComposedTreeTraversal::traverseLastChild(const Node& node)	307 inline Node* ComposedTreeTraversal::traverseLastChild(const Node& node)

308 {	308 {

309 return traverseChild(node, TraversalDirectionBackward);	309 return traverseChild(node, TraversalDirectionBackward);

310 }	310 }

311	311

312 } // namespace blink	312 } // namespace blink

313	313

314 #endif	314 #endif

OLD	NEW