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 175 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
186 // We can have any number of anonymous layout objects inserted between | 186 // We can have any number of anonymous layout objects inserted between |
187 // us and our parent so make sure we skip over them. | 187 // us and our parent so make sure we skip over them. |
188 LayoutObject* ancestor = layoutObject()->parent(); | 188 LayoutObject* ancestor = layoutObject()->parent(); |
189 while (ancestor->isAnonymous() || (ancestor->node() && ancestor->node()->isP
seudoElement())) { | 189 while (ancestor->isAnonymous() || (ancestor->node() && ancestor->node()->isP
seudoElement())) { |
190 ASSERT(ancestor->parent()); | 190 ASSERT(ancestor->parent()); |
191 ancestor = ancestor->parent(); | 191 ancestor = ancestor->parent(); |
192 } | 192 } |
193 return ancestor->node(); | 193 return ancestor->node(); |
194 } | 194 } |
195 | 195 |
196 } // namespace | 196 } // namespace blink |
OLD | NEW |