[CSS Grid] Introduce an explicit type for resolved grid positions

Source/core/css/parser/BisonCSSParser-in.cpp

 /*
  * Copyright (C) 2003 Lars Knoll (knoll@kde.org)
  * Copyright (C) 2005 Allan Sandfeld Jensen (kde@carewolf.com)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2007 Nicholas Shanks <webkit@nickshanks.com>
  * Copyright (C) 2008 Eric Seidel <eric@webkit.org>
  * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
  * Copyright (C) 2012 Adobe Systems Incorporated. All rights reserved.
  * Copyright (C) 2012 Intel Corporation. All rights reserved.
  *
@@ skipping 65 matching lines @@
 #include "core/css/StyleRuleImport.h"
 #include "core/css/StyleSheetContents.h"
 #include "core/css/parser/CSSParserIdioms.h"
 #include "core/dom/Document.h"
 #include "core/frame/FrameHost.h"
 #include "core/frame/PageConsole.h"
 #include "core/frame/Settings.h"
 #include "core/html/parser/HTMLParserIdioms.h"
 #include "core/inspector/InspectorInstrumentation.h"
 #include "core/rendering/RenderTheme.h"
+#include "core/rendering/style/GridResolvedPosition.h"
 #include "core/svg/SVGParserUtilities.h"
 #include "platform/FloatConversion.h"
 #include "wtf/BitArray.h"
 #include "wtf/HexNumber.h"
 #include "wtf/text/StringBuffer.h"
 #include "wtf/text/StringBuilder.h"
 #include "wtf/text/StringImpl.h"
 #include "wtf/text/TextEncoding.h"
 #include <limits.h>
 
@@ skipping 4850 matching lines @@
             }
 
             NamedGridAreaMap::iterator gridAreaIt = gridAreaMap.find(gridAreaName);
             if (gridAreaIt == gridAreaMap.end()) {
                 gridAreaMap.add(gridAreaName, GridCoordinate(GridSpan(rowCount, rowCount), GridSpan(currentCol, lookAheadCol)));
             } else {
                 GridCoordinate& gridCoordinate = gridAreaIt->value;
 
                 // The following checks test that the grid area is a single filled-in rectangle.
                 // 1. The new row is adjacent to the previously parsed row.
-                if (rowCount != gridCoordinate.rows.initialPositionIndex + 1)
+                if (rowCount != (unsigned)gridCoordinate.rows.initialPositionIndex + 1)
                     return 0;
 
                 // 2. The new area starts at the same position as the previously parsed area.
-                if (currentCol != gridCoordinate.columns.initialPositionIndex)
+                if (currentCol != (unsigned)gridCoordinate.columns.initialPositionIndex)
                     return 0;
 
                 // 3. The new area ends at the same position as the previously parsed area.
-                if (lookAheadCol != gridCoordinate.columns.finalPositionIndex)
+                if (lookAheadCol != (unsigned)gridCoordinate.columns.finalPositionIndex)
                     return 0;
 
-                ++gridCoordinate.rows.finalPositionIndex;
+                gridCoordinate.rows.finalPositionIndex.setIntegerPosition(gridCoordinate.rows.finalPositionIndex.integerPosition() + 1);
             }
             currentCol = lookAheadCol;
         }
 
         ++rowCount;
         m_valueList->next();
     }
 
     if (!rowCount || !columnCount)
         return 0;
@@ skipping 5494 matching lines @@
 {
     // The tokenizer checks for the construct of an+b.
     // However, since the {ident} rule precedes the {nth} rule, some of those
     // tokens are identified as string literal. Furthermore we need to accept
     // "odd" and "even" which does not match to an+b.
     return equalIgnoringCase(token, "odd") || equalIgnoringCase(token, "even")
         || equalIgnoringCase(token, "n") || equalIgnoringCase(token, "-n");
 }
 
 }