Wed, 31 Dec 2014 06:09:35 +0100
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
michael@0 | 1 | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ |
michael@0 | 2 | /* This Source Code Form is subject to the terms of the Mozilla Public |
michael@0 | 3 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
michael@0 | 4 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ |
michael@0 | 5 | |
michael@0 | 6 | |
michael@0 | 7 | /** |
michael@0 | 8 | File Name: 15.1.2.5-2.js |
michael@0 | 9 | ECMA Section: 15.1.2.5 Function properties of the global object |
michael@0 | 10 | unescape( string ) |
michael@0 | 11 | Description: |
michael@0 | 12 | |
michael@0 | 13 | This tests the cases where there are fewer than 4 characters following "%u", |
michael@0 | 14 | or fewer than 2 characters following "%" or "%u". |
michael@0 | 15 | |
michael@0 | 16 | The unescape function computes a new version of a string value in which |
michael@0 | 17 | each escape sequences of the sort that might be introduced by the escape |
michael@0 | 18 | function is replaced with the character that it represents. |
michael@0 | 19 | |
michael@0 | 20 | When the unescape function is called with one argument string, the |
michael@0 | 21 | following steps are taken: |
michael@0 | 22 | |
michael@0 | 23 | 1. Call ToString(string). |
michael@0 | 24 | 2. Compute the number of characters in Result(1). |
michael@0 | 25 | 3. Let R be the empty string. |
michael@0 | 26 | 4. Let k be 0. |
michael@0 | 27 | 5. If k equals Result(2), return R. |
michael@0 | 28 | 6. Let c be the character at position k within Result(1). |
michael@0 | 29 | 7. If c is not %, go to step 18. |
michael@0 | 30 | 8. If k is greater than Result(2)-6, go to step 14. |
michael@0 | 31 | 9. If the character at position k+1 within result(1) is not u, go to step |
michael@0 | 32 | 14. |
michael@0 | 33 | 10. If the four characters at positions k+2, k+3, k+4, and k+5 within |
michael@0 | 34 | Result(1) are not all hexadecimal digits, go to step 14. |
michael@0 | 35 | 11. Let c be the character whose Unicode encoding is the integer represented |
michael@0 | 36 | by the four hexadecimal digits at positions k+2, k+3, k+4, and k+5 |
michael@0 | 37 | within Result(1). |
michael@0 | 38 | 12. Increase k by 5. |
michael@0 | 39 | 13. Go to step 18. |
michael@0 | 40 | 14. If k is greater than Result(2)-3, go to step 18. |
michael@0 | 41 | 15. If the two characters at positions k+1 and k+2 within Result(1) are not |
michael@0 | 42 | both hexadecimal digits, go to step 18. |
michael@0 | 43 | 16. Let c be the character whose Unicode encoding is the integer represented |
michael@0 | 44 | by two zeroes plus the two hexadecimal digits at positions k+1 and k+2 |
michael@0 | 45 | within Result(1). |
michael@0 | 46 | 17. Increase k by 2. |
michael@0 | 47 | 18. Let R be a new string value computed by concatenating the previous value |
michael@0 | 48 | of R and c. |
michael@0 | 49 | 19. Increase k by 1. |
michael@0 | 50 | 20. Go to step 5. |
michael@0 | 51 | Author: christine@netscape.com |
michael@0 | 52 | Date: 28 october 1997 |
michael@0 | 53 | */ |
michael@0 | 54 | |
michael@0 | 55 | var SECTION = "15.1.2.5-2"; |
michael@0 | 56 | var VERSION = "ECMA_1"; |
michael@0 | 57 | startTest(); |
michael@0 | 58 | var TITLE = "unescape(string)"; |
michael@0 | 59 | |
michael@0 | 60 | writeHeaderToLog( SECTION + " "+ TITLE); |
michael@0 | 61 | |
michael@0 | 62 | // since there is only one character following "%", no conversion should occur. |
michael@0 | 63 | |
michael@0 | 64 | for ( var CHARCODE = 0; CHARCODE < 256; CHARCODE += 16 ) { |
michael@0 | 65 | new TestCase( SECTION, |
michael@0 | 66 | "unescape( %"+ (ToHexString(CHARCODE)).substring(0,1) +" )", |
michael@0 | 67 | "%"+(ToHexString(CHARCODE)).substring(0,1), |
michael@0 | 68 | unescape( "%" + (ToHexString(CHARCODE)).substring(0,1) ) ); |
michael@0 | 69 | } |
michael@0 | 70 | |
michael@0 | 71 | // since there is only one character following "%u", no conversion should occur. |
michael@0 | 72 | |
michael@0 | 73 | for ( var CHARCODE = 0; CHARCODE < 256; CHARCODE +=16 ) { |
michael@0 | 74 | new TestCase( SECTION, |
michael@0 | 75 | "unescape( %u"+ (ToHexString(CHARCODE)).substring(0,1) +" )", |
michael@0 | 76 | "%u"+(ToHexString(CHARCODE)).substring(0,1), |
michael@0 | 77 | unescape( "%u" + (ToHexString(CHARCODE)).substring(0,1) ) ); |
michael@0 | 78 | } |
michael@0 | 79 | |
michael@0 | 80 | |
michael@0 | 81 | // three char unicode string. no conversion should occur |
michael@0 | 82 | |
michael@0 | 83 | for ( var CHARCODE = 1024; CHARCODE < 65536; CHARCODE+= 1234 ) { |
michael@0 | 84 | new TestCase |
michael@0 | 85 | ( SECTION, |
michael@0 | 86 | "unescape( %u"+ (ToUnicodeString(CHARCODE)).substring(0,3)+ " )", |
michael@0 | 87 | |
michael@0 | 88 | "%u"+(ToUnicodeString(CHARCODE)).substring(0,3), |
michael@0 | 89 | unescape( "%u"+(ToUnicodeString(CHARCODE)).substring(0,3) ) |
michael@0 | 90 | ); |
michael@0 | 91 | } |
michael@0 | 92 | |
michael@0 | 93 | test(); |
michael@0 | 94 | |
michael@0 | 95 | function ToUnicodeString( n ) { |
michael@0 | 96 | var string = ToHexString(n); |
michael@0 | 97 | |
michael@0 | 98 | for ( var PAD = (4 - string.length ); PAD > 0; PAD-- ) { |
michael@0 | 99 | string = "0" + string; |
michael@0 | 100 | } |
michael@0 | 101 | |
michael@0 | 102 | return string; |
michael@0 | 103 | } |
michael@0 | 104 | function ToHexString( n ) { |
michael@0 | 105 | var hex = new Array(); |
michael@0 | 106 | |
michael@0 | 107 | for ( var mag = 1; Math.pow(16,mag) <= n ; mag++ ) { |
michael@0 | 108 | ; |
michael@0 | 109 | } |
michael@0 | 110 | |
michael@0 | 111 | for ( index = 0, mag -= 1; mag > 0; index++, mag-- ) { |
michael@0 | 112 | hex[index] = Math.floor( n / Math.pow(16,mag) ); |
michael@0 | 113 | n -= Math.pow(16,mag) * Math.floor( n/Math.pow(16,mag) ); |
michael@0 | 114 | } |
michael@0 | 115 | |
michael@0 | 116 | hex[hex.length] = n % 16; |
michael@0 | 117 | |
michael@0 | 118 | var string =""; |
michael@0 | 119 | |
michael@0 | 120 | for ( var index = 0 ; index < hex.length ; index++ ) { |
michael@0 | 121 | switch ( hex[index] ) { |
michael@0 | 122 | case 10: |
michael@0 | 123 | string += "A"; |
michael@0 | 124 | break; |
michael@0 | 125 | case 11: |
michael@0 | 126 | string += "B"; |
michael@0 | 127 | break; |
michael@0 | 128 | case 12: |
michael@0 | 129 | string += "C"; |
michael@0 | 130 | break; |
michael@0 | 131 | case 13: |
michael@0 | 132 | string += "D"; |
michael@0 | 133 | break; |
michael@0 | 134 | case 14: |
michael@0 | 135 | string += "E"; |
michael@0 | 136 | break; |
michael@0 | 137 | case 15: |
michael@0 | 138 | string += "F"; |
michael@0 | 139 | break; |
michael@0 | 140 | default: |
michael@0 | 141 | string += hex[index]; |
michael@0 | 142 | } |
michael@0 | 143 | } |
michael@0 | 144 | |
michael@0 | 145 | if ( string.length == 1 ) { |
michael@0 | 146 | string = "0" + string; |
michael@0 | 147 | } |
michael@0 | 148 | return string; |
michael@0 | 149 | } |