Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
| 4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
| 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r ights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r ights reserved. |
| 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) | 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) |
| 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo bile.com/) | 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo bile.com/) |
| 8 * | 8 * |
| 9 * This library is free software; you can redistribute it and/or | 9 * This library is free software; you can redistribute it and/or |
| 10 * modify it under the terms of the GNU Library General Public | 10 * modify it under the terms of the GNU Library General Public |
| (...skipping 2256 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 2267 ASSERT(insertionPoint->containingShadowRoot()); | 2267 ASSERT(insertionPoint->containingShadowRoot()); |
| 2268 if (!insertionPoint->containingShadowRoot()->isOpenOrV0()) | 2268 if (!insertionPoint->containingShadowRoot()->isOpenOrV0()) |
| 2269 break; | 2269 break; |
| 2270 filteredInsertionPoints.append(insertionPoint); | 2270 filteredInsertionPoints.append(insertionPoint); |
| 2271 } | 2271 } |
| 2272 return StaticNodeList::adopt(filteredInsertionPoints); | 2272 return StaticNodeList::adopt(filteredInsertionPoints); |
| 2273 } | 2273 } |
| 2274 | 2274 |
| 2275 HTMLSlotElement* Node::assignedSlot() const | 2275 HTMLSlotElement* Node::assignedSlot() const |
| 2276 { | 2276 { |
| 2277 if (!isChildOfV1ShadowHost()) | |
| 2278 return nullptr; | |
|
kochi
2016/03/01 12:55:40
Why this shortcut is necessary?
isChildOfV1Shadow
| |
| 2277 ASSERT(!needsDistributionRecalc()); | 2279 ASSERT(!needsDistributionRecalc()); |
| 2278 if (ElementShadow* shadow = parentElementShadow()) { | 2280 if (ElementShadow* shadow = parentElementShadow()) { |
| 2279 if (shadow->isV1()) | 2281 if (shadow->isV1()) |
| 2280 return shadow->assignedSlotFor(*this); | 2282 return shadow->assignedSlotFor(*this); |
| 2281 } | 2283 } |
| 2282 return nullptr; | 2284 return nullptr; |
| 2283 } | 2285 } |
| 2284 | 2286 |
| 2285 HTMLSlotElement* Node::assignedSlotForBinding() | 2287 HTMLSlotElement* Node::assignedSlotForBinding() |
| 2286 { | 2288 { |
| (...skipping 153 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 2440 | 2442 |
| 2441 void showNodePath(const blink::Node* node) | 2443 void showNodePath(const blink::Node* node) |
| 2442 { | 2444 { |
| 2443 if (node) | 2445 if (node) |
| 2444 node->showNodePathForThis(); | 2446 node->showNodePathForThis(); |
| 2445 else | 2447 else |
| 2446 fprintf(stderr, "Cannot showNodePath for (nil)\n"); | 2448 fprintf(stderr, "Cannot showNodePath for (nil)\n"); |
| 2447 } | 2449 } |
| 2448 | 2450 |
| 2449 #endif | 2451 #endif |
| OLD | NEW |