gecko-dev/layout/html/tests/TestCSSPropertyLookup.cpp

186 lines
5.5 KiB
C++
Raw Normal View History

/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
1998-04-13 20:24:54 +00:00
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
1998-04-13 20:24:54 +00:00
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
1998-04-13 20:24:54 +00:00
*
* The Original Code is mozilla.org code.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1998
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
*
* Alternatively, the contents of this file may be used under the terms of
* either of the GNU General Public License Version 2 or later (the "GPL"),
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
1998-04-13 20:24:54 +00:00
#include <stdio.h>
#include "plstr.h"
#include "nsCSSProps.h"
#include "nsCSSKeywords.h"
#include "nsString.h"
1998-04-13 20:24:54 +00:00
2003-02-26 01:53:03 +00:00
static const char* const kJunkNames[] = {
1998-04-13 20:24:54 +00:00
nsnull,
"",
"123",
"backgroundz",
"zzzzzz",
"#@$&@#*@*$@$#"
};
int TestProps() {
int rv = 0;
nsCSSProperty id;
nsCSSProperty index;
1998-04-13 20:24:54 +00:00
// Everything appears to assert if we don't do this first...
nsCSSProps::AddRefTable();
1998-04-13 20:24:54 +00:00
// First make sure we can find all of the tags that are supposed to
// be in the table. Futz with the case to make sure any case will
// work
2003-02-26 01:53:03 +00:00
extern const char* const kCSSRawProperties[];
const char*const* et = &kCSSRawProperties[0];
const char*const* end = &kCSSRawProperties[eCSSProperty_COUNT];
index = eCSSProperty_UNKNOWN;
1998-04-13 20:24:54 +00:00
while (et < end) {
char tagName[100];
PL_strcpy(tagName, *et);
index = nsCSSProperty(PRInt32(index) + 1);
id = nsCSSProps::LookupProperty(nsCString(tagName));
if (id == eCSSProperty_UNKNOWN) {
printf("bug: can't find '%s'\n", tagName);
1998-04-13 20:24:54 +00:00
rv = -1;
}
if (id != index) {
printf("bug: name='%s' id=%d index=%d\n", tagName, id, index);
1998-04-13 20:24:54 +00:00
rv = -1;
}
// fiddle with the case to make sure we can still find it
if (('a' <= tagName[0]) && (tagName[0] <= 'z')) {
tagName[0] = tagName[0] - 32;
}
id = nsCSSProps::LookupProperty(NS_ConvertASCIItoUTF16(tagName));
1998-04-13 20:24:54 +00:00
if (id < 0) {
printf("bug: can't find '%s'\n", tagName);
rv = -1;
}
if (index != id) {
printf("bug: name='%s' id=%d index=%d\n", tagName, id, index);
1998-04-13 20:24:54 +00:00
rv = -1;
}
et++;
}
// Now make sure we don't find some garbage
1999-07-16 19:08:44 +00:00
for (int i = 0; i < (int) (sizeof(kJunkNames) / sizeof(const char*)); i++) {
2003-02-26 01:53:03 +00:00
const char* const tag = kJunkNames[i];
id = nsCSSProps::LookupProperty(nsCAutoString(tag));
1998-04-13 20:24:54 +00:00
if (id >= 0) {
printf("bug: found '%s'\n", tag ? tag : "(null)");
rv = -1;
}
}
nsCSSProps::ReleaseTable();
1998-04-13 20:24:54 +00:00
return rv;
}
int TestKeywords() {
nsCSSKeywords::AddRefTable();
1998-04-13 20:24:54 +00:00
int rv = 0;
nsCSSKeyword id;
nsCSSKeyword index;
2003-02-26 01:53:03 +00:00
extern const char* const kCSSRawKeywords[];
1998-04-13 20:24:54 +00:00
// First make sure we can find all of the tags that are supposed to
// be in the table. Futz with the case to make sure any case will
// work
2003-02-26 01:53:03 +00:00
const char*const* et = &kCSSRawKeywords[0];
const char*const* end = &kCSSRawKeywords[eCSSKeyword_COUNT - 1];
index = eCSSKeyword_UNKNOWN;
1998-04-13 20:24:54 +00:00
while (et < end) {
char tagName[512];
char* underscore = &(tagName[0]);
PL_strcpy(tagName, *et);
while (*underscore) {
if (*underscore == '_') {
*underscore = '-';
}
underscore++;
}
index = nsCSSKeyword(PRInt32(index) + 1);
id = nsCSSKeywords::LookupKeyword(nsCString(tagName));
if (id <= eCSSKeyword_UNKNOWN) {
printf("bug: can't find '%s'\n", tagName);
1998-04-13 20:24:54 +00:00
rv = -1;
}
if (id != index) {
printf("bug: name='%s' id=%d index=%d\n", tagName, id, index);
1998-04-13 20:24:54 +00:00
rv = -1;
}
// fiddle with the case to make sure we can still find it
if (('a' <= tagName[0]) && (tagName[0] <= 'z')) {
tagName[0] = tagName[0] - 32;
}
id = nsCSSKeywords::LookupKeyword(nsCString(tagName));
if (id <= eCSSKeyword_UNKNOWN) {
1998-04-13 20:24:54 +00:00
printf("bug: can't find '%s'\n", tagName);
rv = -1;
}
if (id != index) {
printf("bug: name='%s' id=%d index=%d\n", tagName, id, index);
1998-04-13 20:24:54 +00:00
rv = -1;
}
et++;
}
// Now make sure we don't find some garbage
1999-07-16 19:08:44 +00:00
for (int i = 0; i < (int) (sizeof(kJunkNames) / sizeof(const char*)); i++) {
2003-02-26 01:53:03 +00:00
const char* const tag = kJunkNames[i];
id = nsCSSKeywords::LookupKeyword(nsCAutoString(tag));
if (eCSSKeyword_UNKNOWN < id) {
1998-04-13 20:24:54 +00:00
printf("bug: found '%s'\n", tag ? tag : "(null)");
rv = -1;
}
}
nsCSSKeywords::ReleaseTable();
1998-04-13 20:24:54 +00:00
return rv;
}
int main(int argc, char** argv)
{
TestProps();
TestKeywords();
return 0;
}