| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2003 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 2003 Lars Knoll (knoll@kde.org) |
| 3 * Copyright (C) 2005 Allan Sandfeld Jensen (kde@carewolf.com) | 3 * Copyright (C) 2005 Allan Sandfeld Jensen (kde@carewolf.com) |
| 4 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc.
All rights reserved. | 4 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc.
All rights reserved. |
| 5 * Copyright (C) 2007 Nicholas Shanks <webkit@nickshanks.com> | 5 * Copyright (C) 2007 Nicholas Shanks <webkit@nickshanks.com> |
| 6 * Copyright (C) 2008 Eric Seidel <eric@webkit.org> | 6 * Copyright (C) 2008 Eric Seidel <eric@webkit.org> |
| 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) | 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) |
| 8 * Copyright (C) 2012 Adobe Systems Incorporated. All rights reserved. | 8 * Copyright (C) 2012 Adobe Systems Incorporated. All rights reserved. |
| 9 * Copyright (C) 2012 Intel Corporation. All rights reserved. | 9 * Copyright (C) 2012 Intel Corporation. All rights reserved. |
| 10 * | 10 * |
| (...skipping 1894 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1905 hasHotSpot = true; | 1905 hasHotSpot = true; |
| 1906 hotSpot = IntPoint(coords[0], coords[1]); | 1906 hotSpot = IntPoint(coords[0], coords[1]); |
| 1907 } | 1907 } |
| 1908 | 1908 |
| 1909 if (!list) | 1909 if (!list) |
| 1910 list = CSSValueList::createCommaSeparated(); | 1910 list = CSSValueList::createCommaSeparated(); |
| 1911 | 1911 |
| 1912 if (image) | 1912 if (image) |
| 1913 list->append(CSSCursorImageValue::create(image, hasHotSpot, hotS
pot)); | 1913 list->append(CSSCursorImageValue::create(image, hasHotSpot, hotS
pot)); |
| 1914 | 1914 |
| 1915 if ((inStrictMode() && !value) || (value && !(value->unit == CSSPars
erValue::Operator && value->iValue == ','))) | 1915 if (!value || !(value->unit == CSSParserValue::Operator && value->iV
alue == ',')) |
| 1916 return false; | 1916 return false; |
| 1917 value = m_valueList->next(); // comma | 1917 value = m_valueList->next(); // comma |
| 1918 } | 1918 } |
| 1919 if (list) { | 1919 if (list) { |
| 1920 if (!value) { // no value after url list (MSIE 5 compatibility) | 1920 if (!value) |
| 1921 if (list->length() != 1) | 1921 return false; |
| 1922 return false; | 1922 if (inQuirksMode() && value->id == CSSValueHand) // MSIE 5 compatibi
lity :/ |
| 1923 } else if (inQuirksMode() && value->id == CSSValueHand) // MSIE 5 co
mpatibility :/ | |
| 1924 list->append(cssValuePool().createIdentifierValue(CSSValuePointe
r)); | 1923 list->append(cssValuePool().createIdentifierValue(CSSValuePointe
r)); |
| 1925 else if ((value->id >= CSSValueAuto && value->id <= CSSValueWebkitGr
abbing) || value->id == CSSValueCopy || value->id == CSSValueNone) | 1924 else if ((value->id >= CSSValueAuto && value->id <= CSSValueWebkitGr
abbing) || value->id == CSSValueCopy || value->id == CSSValueNone) |
| 1926 list->append(cssValuePool().createIdentifierValue(value->id)); | 1925 list->append(cssValuePool().createIdentifierValue(value->id)); |
| 1927 m_valueList->next(); | 1926 m_valueList->next(); |
| 1928 parsedValue = list.release(); | 1927 parsedValue = list.release(); |
| 1929 break; | 1928 break; |
| 1930 } else if (value) { | 1929 } else if (value) { |
| 1931 id = value->id; | 1930 id = value->id; |
| 1932 if (inQuirksMode() && value->id == CSSValueHand) { // MSIE 5 compati
bility :/ | 1931 if (inQuirksMode() && value->id == CSSValueHand) { // MSIE 5 compati
bility :/ |
| 1933 id = CSSValuePointer; | 1932 id = CSSValuePointer; |
| (...skipping 10057 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 11991 { | 11990 { |
| 11992 // The tokenizer checks for the construct of an+b. | 11991 // The tokenizer checks for the construct of an+b. |
| 11993 // However, since the {ident} rule precedes the {nth} rule, some of those | 11992 // However, since the {ident} rule precedes the {nth} rule, some of those |
| 11994 // tokens are identified as string literal. Furthermore we need to accept | 11993 // tokens are identified as string literal. Furthermore we need to accept |
| 11995 // "odd" and "even" which does not match to an+b. | 11994 // "odd" and "even" which does not match to an+b. |
| 11996 return equalIgnoringCase(token, "odd") || equalIgnoringCase(token, "even") | 11995 return equalIgnoringCase(token, "odd") || equalIgnoringCase(token, "even") |
| 11997 || equalIgnoringCase(token, "n") || equalIgnoringCase(token, "-n"); | 11996 || equalIgnoringCase(token, "n") || equalIgnoringCase(token, "-n"); |
| 11998 } | 11997 } |
| 11999 | 11998 |
| 12000 } | 11999 } |
| OLD | NEW |