/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- * vim: set ts=8 sts=2 et sw=2 tw=80: /* This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this http://mozilla.org/MPL/2.0/. */ #include <limits>#include <string.h>#include "js/Array.h" // JS::IsArrayObject #include "js/Exception.h" #include "js/friend/ErrorMessages.h" // JSMSG_* #include "js/JSON.h" #include "js/MemoryFunctions.h" #include "js/Printf.h" #include "js/PropertyAndElement.h" // JS_GetProperty #include "jsapi-tests/tests.h" using namespace js;class AutoInflatedString {const cx;public :explicit AutoInflatedString(JSContext* cx)template <size_t N>void operator =(const char (&str)[N]) {if (!chars_) {void operator =(const char * str) {if (!chars_) {const char16_t* chars() const { return chars_; }const { return length_; }// Primitives "true" , expected));"false" , expected));"null" , expected));"0" , expected));"1" , expected));"-1" , expected));"1" , expected));"1.75" , expected));"9e9" , expected));double >::infinity());"9e99999" , expected));const char16_t emptystr[] = {'\0' };"\" \"" , expected));const char16_t nullstr[] = {'\0' };"\" \\u0000\"" , expected));const char16_t backstr[] = {'\b' };"\" \\b\"" , expected));"\" \\u0008\"" , expected));const char16_t newlinestr[] = {'\n' ,"\" \\n\"" , expected));"\" \\u000A\"" , expected));// Arrays bool isArray;"[]" , &v));"length" , &v2));"[1]" , &v));"0" , &v2));"length" , &v2));// Objects "{}" , &v));"{ \" f\": 17 }" , &v));"f" , &v2));return true ;template <size_t N>static JSLinearString* NewString(JSContext* cx, const char16_t (&chars)[N]) {return js::NewStringCopyN<CanGC>(cx, chars, N);template <size_t N>inline bool Parse(JSContext* cx, const char (&input)[N],return true ;template <size_t N>inline bool TryParse(JSContext* cx, const char (&input)[N],return true ;"" , 1, 1));"\n" , 2, 1));"\r" , 2, 1));"\r\n" , 2, 1));"[" , 1, 2));"[,]" , 1, 2));"[1,]" , 1, 4));"{a:2}" , 1, 2));"{\" a\":2,}" , 1, 8));"]" , 1, 1));"\" ", 1, 2)); "{]" , 1, 2));"[}" , 1, 2));"'wrongly-quoted string'" , 1, 1));"{\" a\":2 \n b:3}" , 2, 2));"\n[" , 2, 2));"\n[,]" , 2, 2));"\n[1,]" , 2, 4));"\n{a:2}" , 2, 2));"\n{\" a\":2,}" , 2, 8));"\n]" , 2, 1));"\" bad string\n\"" , 1, 12));"\r'wrongly-quoted string'" , 2, 1));"\n\" ", 2, 2)); "\n{]" , 2, 2));"\n[}" , 2, 2));"{\" a\":[2,3],\n\" b\":,5,6}" , 2, 5));"{\" a\":2 \r b:3}" , 2, 2));"\r[" , 2, 2));"\r[,]" , 2, 2));"\r[1,]" , 2, 4));"\r{a:2}" , 2, 2));"\r{\" a\":2,}" , 2, 8));"\r]" , 2, 1));"\" bad string\r\"" , 1, 12));"\r'wrongly-quoted string'" , 2, 1));"\r\" ", 2, 2)); "\r{]" , 2, 2));"\r[}" , 2, 2));"{\" a\":[2,3],\r\" b\":,5,6}" , 2, 5));"{\" a\":2 \r\n b:3}" , 2, 2));"\r\n[" , 2, 2));"\r\n[,]" , 2, 2));"\r\n[1,]" , 2, 4));"\r\n{a:2}" , 2, 2));"\r\n{\" a\":2,}" , 2, 8));"\r\n]" , 2, 1));"\" bad string\r\n\"" , 1, 12));"\r\n'wrongly-quoted string'" , 2, 1));"\r\n\" ", 2, 2)); "\r\n{]" , 2, 2));"\r\n[}" , 2, 2));"{\" a\":[2,3],\r\n\" b\":,5,6}" , 2, 5));"\n\" bad string\n\"" , 2, 12));"\r\" bad string\r\"" , 2, 12));"\r\n\" bad string\r\n\"" , 2, 12));"{\n\" a\":[2,3],\r\" b\":,5,6}" , 3, 5));"{\r\" a\":[2,3],\n\" b\":,5,6}" , 3, 5));"[\" \\t\\q", 1, 6)); "[\" \\t\x00", 1, 5)); "[\" \\t\x01", 1, 5)); "[\" \\t\\\x00", 1, 6)); "[\" \\t\\\x01", 1, 6)); // Unicode escape errors are messy. The first bad character could be // non-hexadecimal, or it could be absent entirely. Include tests where // there's a bad character, followed by zero to as many characters as are // needed to form a complete Unicode escape sequence, plus one. (The extra // characters beyond are valuable because our implementation checks for // too-few subsequent characters first, before checking for subsequent // non-hexadecimal characters. So \u<END>, \u0<END>, \u00<END>, and // \u000<END> are all *detected* as invalid by the same code path, but the // process of computing the first invalid character follows a different // code path for each. And \uQQQQ, \u0QQQ, \u00QQ, and \u000Q are detected // as invalid by the same code path [ignoring which precise subexpression // triggers failure of a single condition], but the computation of the // first invalid character follows a different code path for each.) "[\" \\t\\u", 1, 7)); "[\" \\t\\uZ", 1, 7)); "[\" \\t\\uZZ", 1, 7)); "[\" \\t\\uZZZ", 1, 7)); "[\" \\t\\uZZZZ", 1, 7)); "[\" \\t\\uZZZZZ", 1, 7)); "[\" \\t\\u0", 1, 8)); "[\" \\t\\u0Z", 1, 8)); "[\" \\t\\u0ZZ", 1, 8)); "[\" \\t\\u0ZZZ", 1, 8)); "[\" \\t\\u0ZZZZ", 1, 8)); "[\" \\t\\u00", 1, 9)); "[\" \\t\\u00Z", 1, 9)); "[\" \\t\\u00ZZ", 1, 9)); "[\" \\t\\u00ZZZ", 1, 9)); "[\" \\t\\u000", 1, 10)); "[\" \\t\\u000Z", 1, 10)); "[\" \\t\\u000ZZ", 1, 10)); return true ;template <size_t N>inline bool Error(JSContext* cx, const char (&input)[N], uint32_t expectedLine,bool ok = JS_ParseJSON(cx, str.chars(), str.length(), &dummy);"line %d column %d" , expectedLine, expectedColumn);/* We do not execute JS, so there should be no exception thrown. */ return true ;static bool Censor(JSContext* cx, unsigned argc, JS::Value* vp) {const unsigned expectedArgCount =return true ;"censor" );"true" , filter));"false" , filter));"null" , filter));"1" , filter));"1.75" , filter));"[]" , filter));"[1]" , filter));"{}" , filter));return true ;template <size_t N>inline bool TryParse(JSContext* cx, const char (&input)[N],return true ;quality 100%
¤ Dauer der Verarbeitung: 0.17 Sekunden
(vorverarbeitet)
¤ *© Formatika GbR, Deutschland
