OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Google Inc. All Rights Reserved. | 2 * Copyright (C) 2011 Google Inc. All Rights Reserved. |
3 * Copyright (C) 2012 Apple Inc. All rights reserved. | 3 * Copyright (C) 2012 Apple Inc. All rights reserved. |
4 * | 4 * |
5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
7 * are met: | 7 * are met: |
8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. 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 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
(...skipping 463 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
474 listTreeScopes(nodeB, treeScopesB); | 474 listTreeScopes(nodeB, treeScopesB); |
475 | 475 |
476 size_t indexA = treeScopesA.size(); | 476 size_t indexA = treeScopesA.size(); |
477 size_t indexB = treeScopesB.size(); | 477 size_t indexB = treeScopesB.size(); |
478 | 478 |
479 for (; indexA > 0 && indexB > 0 && treeScopesA[indexA - 1] == treeScopesB[in
dexB - 1]; --indexA, --indexB) { } | 479 for (; indexA > 0 && indexB > 0 && treeScopesA[indexA - 1] == treeScopesB[in
dexB - 1]; --indexA, --indexB) { } |
480 | 480 |
481 return treeScopesA[indexA] == treeScopesB[indexB] ? treeScopesA[indexA] : 0; | 481 return treeScopesA[indexA] == treeScopesB[indexB] ? treeScopesA[indexA] : 0; |
482 } | 482 } |
483 | 483 |
484 #if SECURITY_ASSERT_ENABLED && !ENABLE(OILPAN) | 484 #if ENABLE(SECURITY_ASSERT) && !ENABLE(OILPAN) |
485 bool TreeScope::deletionHasBegun() | 485 bool TreeScope::deletionHasBegun() |
486 { | 486 { |
487 return rootNode().m_deletionHasBegun; | 487 return rootNode().m_deletionHasBegun; |
488 } | 488 } |
489 | 489 |
490 void TreeScope::beginDeletion() | 490 void TreeScope::beginDeletion() |
491 { | 491 { |
492 rootNode().m_deletionHasBegun = true; | 492 rootNode().m_deletionHasBegun = true; |
493 } | 493 } |
494 #endif | 494 #endif |
(...skipping 48 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
543 visitor->trace(m_document); | 543 visitor->trace(m_document); |
544 visitor->trace(m_parentTreeScope); | 544 visitor->trace(m_parentTreeScope); |
545 visitor->trace(m_idTargetObserverRegistry); | 545 visitor->trace(m_idTargetObserverRegistry); |
546 visitor->trace(m_selection); | 546 visitor->trace(m_selection); |
547 visitor->trace(m_elementsById); | 547 visitor->trace(m_elementsById); |
548 visitor->trace(m_imageMapsByName); | 548 visitor->trace(m_imageMapsByName); |
549 visitor->trace(m_labelsByForAttribute); | 549 visitor->trace(m_labelsByForAttribute); |
550 } | 550 } |
551 | 551 |
552 } // namespace WebCore | 552 } // namespace WebCore |
OLD | NEW |