| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1997 Martin Jones (mjones@kde.org) | 2 * Copyright (C) 1997 Martin Jones (mjones@kde.org) |
| 3 * (C) 1997 Torben Weis (weis@kde.org) | 3 * (C) 1997 Torben Weis (weis@kde.org) |
| 4 * (C) 1998 Waldo Bastian (bastian@kde.org) | 4 * (C) 1998 Waldo Bastian (bastian@kde.org) |
| 5 * (C) 1999 Lars Knoll (knoll@kde.org) | 5 * (C) 1999 Lars Knoll (knoll@kde.org) |
| 6 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 6 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
| 7 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple Inc. All r
ights reserved. | 7 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple Inc. All r
ights reserved. |
| 8 * Copyright (C) 2006 Alexey Proskuryakov (ap@nypop.com) | 8 * Copyright (C) 2006 Alexey Proskuryakov (ap@nypop.com) |
| 9 * | 9 * |
| 10 * This library is free software; you can redistribute it and/or | 10 * This library is free software; you can redistribute it and/or |
| (...skipping 384 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 395 void RenderTable::simplifiedNormalFlowLayout() | 395 void RenderTable::simplifiedNormalFlowLayout() |
| 396 { | 396 { |
| 397 for (RenderTableSection* section = topSection(); section; section = sectionB
elow(section)) { | 397 for (RenderTableSection* section = topSection(); section; section = sectionB
elow(section)) { |
| 398 section->layoutIfNeeded(); | 398 section->layoutIfNeeded(); |
| 399 section->computeOverflowFromCells(); | 399 section->computeOverflowFromCells(); |
| 400 } | 400 } |
| 401 } | 401 } |
| 402 | 402 |
| 403 void RenderTable::layout() | 403 void RenderTable::layout() |
| 404 { | 404 { |
| 405 StackStats::LayoutCheckPoint layoutCheckPoint; | |
| 406 ASSERT(needsLayout()); | 405 ASSERT(needsLayout()); |
| 407 | 406 |
| 408 if (simplifiedLayout()) | 407 if (simplifiedLayout()) |
| 409 return; | 408 return; |
| 410 | 409 |
| 411 recalcSectionsIfNeeded(); | 410 recalcSectionsIfNeeded(); |
| 412 // FIXME: We should do this recalc lazily in borderStart/borderEnd so that w
e don't have to make sure | 411 // FIXME: We should do this recalc lazily in borderStart/borderEnd so that w
e don't have to make sure |
| 413 // to call this before we call borderStart/borderEnd to avoid getting a stal
e value. | 412 // to call this before we call borderStart/borderEnd to avoid getting a stal
e value. |
| 414 recalcBordersInRowDirection(); | 413 recalcBordersInRowDirection(); |
| 415 | 414 |
| (...skipping 1026 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1442 const BorderValue& RenderTable::tableEndBorderAdjoiningCell(const RenderTableCel
l* cell) const | 1441 const BorderValue& RenderTable::tableEndBorderAdjoiningCell(const RenderTableCel
l* cell) const |
| 1443 { | 1442 { |
| 1444 ASSERT(cell->isFirstOrLastCellInRow()); | 1443 ASSERT(cell->isFirstOrLastCellInRow()); |
| 1445 if (hasSameDirectionAs(cell->row())) | 1444 if (hasSameDirectionAs(cell->row())) |
| 1446 return style()->borderEnd(); | 1445 return style()->borderEnd(); |
| 1447 | 1446 |
| 1448 return style()->borderStart(); | 1447 return style()->borderStart(); |
| 1449 } | 1448 } |
| 1450 | 1449 |
| 1451 } | 1450 } |
| OLD | NEW |