mirror of
https://github.com/rn10950/RetroZilla.git
synced 2024-08-30 01:20:43 +02:00
186 lines
5.5 KiB
C++
186 lines
5.5 KiB
C++
/* -*- 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
|
|
*
|
|
* 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/
|
|
*
|
|
* 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.
|
|
*
|
|
* 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 ***** */
|
|
#include <stdio.h>
|
|
#include "plstr.h"
|
|
#include "nsCSSProps.h"
|
|
#include "nsCSSKeywords.h"
|
|
#include "nsString.h"
|
|
|
|
static const char* const kJunkNames[] = {
|
|
nsnull,
|
|
"",
|
|
"123",
|
|
"backgroundz",
|
|
"zzzzzz",
|
|
"#@$&@#*@*$@$#"
|
|
};
|
|
|
|
int TestProps() {
|
|
int rv = 0;
|
|
nsCSSProperty id;
|
|
nsCSSProperty index;
|
|
|
|
// Everything appears to assert if we don't do this first...
|
|
nsCSSProps::AddRefTable();
|
|
|
|
// 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
|
|
extern const char* const kCSSRawProperties[];
|
|
const char*const* et = &kCSSRawProperties[0];
|
|
const char*const* end = &kCSSRawProperties[eCSSProperty_COUNT];
|
|
index = eCSSProperty_UNKNOWN;
|
|
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);
|
|
rv = -1;
|
|
}
|
|
if (id != index) {
|
|
printf("bug: name='%s' id=%d index=%d\n", tagName, id, index);
|
|
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_ConvertASCIItoUCS2(tagName));
|
|
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);
|
|
rv = -1;
|
|
}
|
|
et++;
|
|
}
|
|
|
|
// Now make sure we don't find some garbage
|
|
for (int i = 0; i < (int) (sizeof(kJunkNames) / sizeof(const char*)); i++) {
|
|
const char* const tag = kJunkNames[i];
|
|
id = nsCSSProps::LookupProperty(nsCAutoString(tag));
|
|
if (id >= 0) {
|
|
printf("bug: found '%s'\n", tag ? tag : "(null)");
|
|
rv = -1;
|
|
}
|
|
}
|
|
|
|
nsCSSProps::ReleaseTable();
|
|
return rv;
|
|
}
|
|
|
|
int TestKeywords() {
|
|
nsCSSKeywords::AddRefTable();
|
|
|
|
int rv = 0;
|
|
nsCSSKeyword id;
|
|
nsCSSKeyword index;
|
|
|
|
extern const char* const kCSSRawKeywords[];
|
|
|
|
// 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
|
|
const char*const* et = &kCSSRawKeywords[0];
|
|
const char*const* end = &kCSSRawKeywords[eCSSKeyword_COUNT - 1];
|
|
index = eCSSKeyword_UNKNOWN;
|
|
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);
|
|
rv = -1;
|
|
}
|
|
if (id != index) {
|
|
printf("bug: name='%s' id=%d index=%d\n", tagName, id, index);
|
|
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) {
|
|
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);
|
|
rv = -1;
|
|
}
|
|
et++;
|
|
}
|
|
|
|
// Now make sure we don't find some garbage
|
|
for (int i = 0; i < (int) (sizeof(kJunkNames) / sizeof(const char*)); i++) {
|
|
const char* const tag = kJunkNames[i];
|
|
id = nsCSSKeywords::LookupKeyword(nsCAutoString(tag));
|
|
if (eCSSKeyword_UNKNOWN < id) {
|
|
printf("bug: found '%s'\n", tag ? tag : "(null)");
|
|
rv = -1;
|
|
}
|
|
}
|
|
|
|
nsCSSKeywords::ReleaseTable();
|
|
return rv;
|
|
}
|
|
|
|
int main(int argc, char** argv)
|
|
{
|
|
TestProps();
|
|
TestKeywords();
|
|
return 0;
|
|
}
|