| 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 389 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 400 visitor->trace(m_nodeToInsertionPoints); | 400 visitor->trace(m_nodeToInsertionPoints); |
| 401 visitor->trace(m_selectFeatures); | 401 visitor->trace(m_selectFeatures); |
| 402 // Shadow roots are linked with previous and next pointers which are traced. | 402 // Shadow roots are linked with previous and next pointers which are traced. |
| 403 // It is therefore enough to trace one of the shadow roots here and the | 403 // It is therefore enough to trace one of the shadow roots here and the |
| 404 // rest will be traced from there. | 404 // rest will be traced from there. |
| 405 visitor->trace(m_shadowRoots.head()); | 405 visitor->trace(m_shadowRoots.head()); |
| 406 visitor->trace(m_slotAssignment); | 406 visitor->trace(m_slotAssignment); |
| 407 #endif | 407 #endif |
| 408 } | 408 } |
| 409 | 409 |
| 410 } // namespace | 410 } // namespace blink |
| OLD | NEW |