Revision bf8d0369
/dev/null | ||
---|---|---|
1 |
<!-- |
|
2 |
~ Copyright 2011 GRNET S.A. All rights reserved. |
|
3 |
~ |
|
4 |
~ Redistribution and use in source and binary forms, with or |
|
5 |
~ without modification, are permitted provided that the following |
|
6 |
~ conditions are met: |
|
7 |
~ |
|
8 |
~ 1. Redistributions of source code must retain the above |
|
9 |
~ copyright notice, this list of conditions and the following |
|
10 |
~ disclaimer. |
|
11 |
~ |
|
12 |
~ 2. Redistributions in binary form must reproduce the above |
|
13 |
~ copyright notice, this list of conditions and the following |
|
14 |
~ disclaimer in the documentation and/or other materials |
|
15 |
~ provided with the distribution. |
|
16 |
~ |
|
17 |
~ THIS SOFTWARE IS PROVIDED BY GRNET S.A. ``AS IS'' AND ANY EXPRESS |
|
18 |
~ OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|
19 |
~ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
|
20 |
~ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GRNET S.A OR |
|
21 |
~ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
22 |
~ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
|
23 |
~ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
|
24 |
~ USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED |
|
25 |
~ AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
|
26 |
~ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN |
|
27 |
~ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
28 |
~ POSSIBILITY OF SUCH DAMAGE. |
|
29 |
~ |
|
30 |
~ The views and conclusions contained in the software and |
|
31 |
~ documentation are those of the authors and should not be |
|
32 |
~ interpreted as representing official policies, either expressed |
|
33 |
~ or implied, of GRNET S.A. |
|
34 |
--> |
|
35 |
|
|
36 |
<html> |
|
37 |
<head> |
|
38 |
<title>Pithos</title> |
|
39 |
<link type="text/css" rel="stylesheet" href="/pithos/main.css"> |
|
40 |
</head> |
|
41 |
<body> |
|
42 |
<div class="wrapper" > |
|
43 |
<div class="header"></div> |
|
44 |
<div class="image_logo"> |
|
45 |
<table><tr> |
|
46 |
<td><a href="/"><img src="/pithos/images/service-logo.png"></img></a> |
|
47 |
</tr></table> |
|
48 |
</div> <!-- image_logo --> |
|
49 |
<div style="clear: both; "> </div> |
|
50 |
<div class="page_main"> |
|
51 |
<center> |
|
52 |
<p class="big">HTTP status 403 |
|
53 |
<p>You don't have permission to view the resource in the requested URI. |
|
54 |
</center> |
|
55 |
</div> |
|
56 |
<div class="footer"></div> |
|
57 |
</div> <!-- wrapper --> |
|
58 |
</body> |
|
59 |
</html> |
/dev/null | ||
---|---|---|
1 |
<!-- |
|
2 |
~ Copyright 2011 GRNET S.A. All rights reserved. |
|
3 |
~ |
|
4 |
~ Redistribution and use in source and binary forms, with or |
|
5 |
~ without modification, are permitted provided that the following |
|
6 |
~ conditions are met: |
|
7 |
~ |
|
8 |
~ 1. Redistributions of source code must retain the above |
|
9 |
~ copyright notice, this list of conditions and the following |
|
10 |
~ disclaimer. |
|
11 |
~ |
|
12 |
~ 2. Redistributions in binary form must reproduce the above |
|
13 |
~ copyright notice, this list of conditions and the following |
|
14 |
~ disclaimer in the documentation and/or other materials |
|
15 |
~ provided with the distribution. |
|
16 |
~ |
|
17 |
~ THIS SOFTWARE IS PROVIDED BY GRNET S.A. ``AS IS'' AND ANY EXPRESS |
|
18 |
~ OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|
19 |
~ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
|
20 |
~ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GRNET S.A OR |
|
21 |
~ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
22 |
~ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
|
23 |
~ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
|
24 |
~ USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED |
|
25 |
~ AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
|
26 |
~ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN |
|
27 |
~ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
28 |
~ POSSIBILITY OF SUCH DAMAGE. |
|
29 |
~ |
|
30 |
~ The views and conclusions contained in the software and |
|
31 |
~ documentation are those of the authors and should not be |
|
32 |
~ interpreted as representing official policies, either expressed |
|
33 |
~ or implied, of GRNET S.A. |
|
34 |
--> |
|
35 |
|
|
36 |
<html> |
|
37 |
<head> |
|
38 |
<title>Pithos</title> |
|
39 |
<link type="text/css" rel="stylesheet" href="/pithos/main.css"> |
|
40 |
</head> |
|
41 |
<body> |
|
42 |
<div class="wrapper" > |
|
43 |
<div class="header"></div> |
|
44 |
<div class="image_logo"> |
|
45 |
<table><tr> |
|
46 |
<td><a href="/"><img src="/pithos/images/service-logo.png"></img></a> |
|
47 |
</tr></table> |
|
48 |
</div> <!-- image_logo --> |
|
49 |
<div style="clear: both; "> </div> |
|
50 |
<div class="page_main"> |
|
51 |
<center> |
|
52 |
<p class="big">HTTP status 502 |
|
53 |
<p>The server received an invalid response from the upstream server it accessed in attempting to fulfill the request. |
|
54 |
</center> |
|
55 |
</div> |
|
56 |
<div class="footer"></div> |
|
57 |
</div> <!-- wrapper --> |
|
58 |
</body> |
|
59 |
</html> |
/dev/null | ||
---|---|---|
1 |
<!-- |
|
2 |
~ Copyright 2011 GRNET S.A. All rights reserved. |
|
3 |
~ |
|
4 |
~ Redistribution and use in source and binary forms, with or |
|
5 |
~ without modification, are permitted provided that the following |
|
6 |
~ conditions are met: |
|
7 |
~ |
|
8 |
~ 1. Redistributions of source code must retain the above |
|
9 |
~ copyright notice, this list of conditions and the following |
|
10 |
~ disclaimer. |
|
11 |
~ |
|
12 |
~ 2. Redistributions in binary form must reproduce the above |
|
13 |
~ copyright notice, this list of conditions and the following |
|
14 |
~ disclaimer in the documentation and/or other materials |
|
15 |
~ provided with the distribution. |
|
16 |
~ |
|
17 |
~ THIS SOFTWARE IS PROVIDED BY GRNET S.A. ``AS IS'' AND ANY EXPRESS |
|
18 |
~ OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|
19 |
~ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
|
20 |
~ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GRNET S.A OR |
|
21 |
~ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
22 |
~ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
|
23 |
~ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
|
24 |
~ USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED |
|
25 |
~ AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
|
26 |
~ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN |
|
27 |
~ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
28 |
~ POSSIBILITY OF SUCH DAMAGE. |
|
29 |
~ |
|
30 |
~ The views and conclusions contained in the software and |
|
31 |
~ documentation are those of the authors and should not be |
|
32 |
~ interpreted as representing official policies, either expressed |
|
33 |
~ or implied, of GRNET S.A. |
|
34 |
--> |
|
35 |
|
|
36 |
<html> |
|
37 |
<head> |
|
38 |
<title>Pithos</title> |
|
39 |
<link type="text/css" rel="stylesheet" href="/pithos/main.css"> |
|
40 |
</head> |
|
41 |
<body> |
|
42 |
<div class="wrapper" > |
|
43 |
<div class="header"></div> |
|
44 |
<div class="image_logo"> |
|
45 |
<table><tr> |
|
46 |
<td><a href="/"><img src="/pithos/images/service-logo.png"></img></a> |
|
47 |
</tr></table> |
|
48 |
</div> <!-- image_logo --> |
|
49 |
<div style="clear: both; "> </div> |
|
50 |
<div class="page_main"> |
|
51 |
<center> |
|
52 |
<p class="big">HTTP status 503 |
|
53 |
<p>We're very busy at the moment and can't handle your request. |
|
54 |
Please try again in a while. |
|
55 |
</center> |
|
56 |
</div> |
|
57 |
<div class="footer"></div> |
|
58 |
</div> <!-- wrapper --> |
|
59 |
</body> |
|
60 |
</html> |
/dev/null | ||
---|---|---|
1 |
/* kill defaults */ |
|
2 |
|
|
3 |
html, body, p, ul, dl, li, h1, h2, h3, h4, img { |
|
4 |
margin: 0; |
|
5 |
padding: 0; |
|
6 |
} |
|
7 |
|
|
8 |
ul { |
|
9 |
padding: 10px; |
|
10 |
} |
|
11 |
|
|
12 |
img { |
|
13 |
border: 0; |
|
14 |
padding: 8; |
|
15 |
} |
|
16 |
|
|
17 |
/* ============= */ |
|
18 |
p { |
|
19 |
margin-bottom: 20px; |
|
20 |
} |
|
21 |
|
|
22 |
a { |
|
23 |
text-decoration: none; |
|
24 |
color: #4d6399; |
|
25 |
} |
|
26 |
|
|
27 |
a:hover { |
|
28 |
text-decoration: underline; |
|
29 |
} |
|
30 |
|
|
31 |
a:active { |
|
32 |
border: none; |
|
33 |
} |
|
34 |
|
|
35 |
h1 { |
|
36 |
font-size: 24px; |
|
37 |
font-weight: bold; |
|
38 |
margin-top: 23px; |
|
39 |
margin-bottom: 29px; |
|
40 |
text-align: center; |
|
41 |
} |
|
42 |
|
|
43 |
h2 { |
|
44 |
font-size: 16px; |
|
45 |
font-weight: bold; |
|
46 |
margin-top: 23px; |
|
47 |
margin-bottom: 9px; |
|
48 |
} |
|
49 |
|
|
50 |
h3 { |
|
51 |
font-size: 12px; |
|
52 |
font-weight: bold; |
|
53 |
margin-top: 23px; |
|
54 |
margin-bottom: 9px; |
|
55 |
} |
|
56 |
|
|
57 |
body { |
|
58 |
background: url(/pithos/images/background.png); |
|
59 |
font-family: 'Lucida Grande', Verdana, Helvetica, Arial, sans-serif; |
|
60 |
font-size: 12px; |
|
61 |
line-height: 20px; |
|
62 |
color: #222; |
|
63 |
margin: 0px 20px 0px 20px; |
|
64 |
text-align: justify; |
|
65 |
} |
|
66 |
|
|
67 |
table { |
|
68 |
font-family: 'Lucida Grande', Verdana, Helvetica, Arial, sans-serif; |
|
69 |
font-size: 12px; |
|
70 |
font-style: italic; |
|
71 |
} |
|
72 |
|
|
73 |
div.page_main { |
|
74 |
margin-left: 25px; |
|
75 |
margin-right: 25px; |
|
76 |
padding-left: 20px; |
|
77 |
padding-right: 20px; |
|
78 |
} |
|
79 |
|
|
80 |
div.wrapper { |
|
81 |
width: 1024px; |
|
82 |
position: relative; |
|
83 |
background: url(/pithos/images/page_shadow.png) repeat-y; |
|
84 |
margin-left: auto; |
|
85 |
margin-right: auto; |
|
86 |
} |
|
87 |
|
|
88 |
div.header{ |
|
89 |
width: 1024px; |
|
90 |
position: relative; |
|
91 |
background: url(/pithos/images/header.png) no-repeat; |
|
92 |
margin-left: auto; |
|
93 |
margin-right: auto; |
|
94 |
padding:15px; |
|
95 |
} |
|
96 |
|
|
97 |
div.footer{ |
|
98 |
width: 1024px; |
|
99 |
height: 26px; |
|
100 |
background: url(/pithos/images/bottom.png) no-repeat; |
|
101 |
margin-left: auto; |
|
102 |
margin-right: auto; |
|
103 |
} |
|
104 |
|
|
105 |
div.disclaimer { |
|
106 |
background: url(/pithos/images/background.png); |
|
107 |
margin-top: 0; |
|
108 |
text-align: center; |
|
109 |
font-size: 10px; |
|
110 |
padding-bottom: 25px; |
|
111 |
text-decoration: none; |
|
112 |
} |
|
113 |
|
|
114 |
div.image_logo{ |
|
115 |
float:left; |
|
116 |
width: 100%; |
|
117 |
padding:0px; |
|
118 |
margin:0px 0px 0px 11px; |
|
119 |
} |
|
120 |
|
|
121 |
div.logo-wrap img { |
|
122 |
padding:0px; |
|
123 |
margin:0px; |
|
124 |
border:none; |
|
125 |
} |
|
126 |
|
|
127 |
p.big { |
|
128 |
font-size: 36px; |
|
129 |
font-weight: bold; |
|
130 |
} |
|
131 |
|
|
132 |
p.blurb { |
|
133 |
width: 70%; |
|
134 |
} |
|
135 |
|
|
136 |
div.error { |
|
137 |
color: #f00; |
|
138 |
} |
b/src/gr/grnet/pithos/web/public/pithos.html | ||
---|---|---|
43 | 43 |
return false; |
44 | 44 |
} |
45 | 45 |
</script> |
46 |
<script type="text/javascript" src="sha1.js"></script> |
|
47 | 46 |
<script type="text/javascript" language="javascript" src="lytebox.js"></script> |
48 | 47 |
<link rel="stylesheet" href="lytebox.css" type="text/css" media="screen" /> </head> |
49 | 48 |
<body> |
/dev/null | ||
---|---|---|
1 |
/* |
|
2 |
* A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined |
|
3 |
* in FIPS PUB 180-1 |
|
4 |
* Version 2.1a Copyright Paul Johnston 2000 - 2002. |
|
5 |
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet |
|
6 |
* Distributed under the BSD License |
|
7 |
* See http://pajhome.org.uk/crypt/md5 for details. |
|
8 |
*/ |
|
9 |
|
|
10 |
/* |
|
11 |
* Configurable variables. You may need to tweak these to be compatible with |
|
12 |
* the server-side, but the defaults work in most cases. |
|
13 |
*/ |
|
14 |
var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */ |
|
15 |
var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */ |
|
16 |
var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */ |
|
17 |
|
|
18 |
/* |
|
19 |
* These are the functions you'll usually want to call |
|
20 |
* They take string arguments and return either hex or base-64 encoded strings |
|
21 |
*/ |
|
22 |
function hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));} |
|
23 |
function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));} |
|
24 |
function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));} |
|
25 |
function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));} |
|
26 |
function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));} |
|
27 |
function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));} |
|
28 |
|
|
29 |
/* |
|
30 |
* Perform a simple self-test to see if the VM is working |
|
31 |
*/ |
|
32 |
function sha1_vm_test() |
|
33 |
{ |
|
34 |
return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d"; |
|
35 |
} |
|
36 |
|
|
37 |
/* |
|
38 |
* Calculate the SHA-1 of an array of big-endian words, and a bit length |
|
39 |
*/ |
|
40 |
function core_sha1(x, len) |
|
41 |
{ |
|
42 |
/* append padding */ |
|
43 |
x[len >> 5] |= 0x80 << (24 - len % 32); |
|
44 |
x[((len + 64 >> 9) << 4) + 15] = len; |
|
45 |
|
|
46 |
var w = Array(80); |
|
47 |
var a = 1732584193; |
|
48 |
var b = -271733879; |
|
49 |
var c = -1732584194; |
|
50 |
var d = 271733878; |
|
51 |
var e = -1009589776; |
|
52 |
|
|
53 |
for(var i = 0; i < x.length; i += 16) |
|
54 |
{ |
|
55 |
var olda = a; |
|
56 |
var oldb = b; |
|
57 |
var oldc = c; |
|
58 |
var oldd = d; |
|
59 |
var olde = e; |
|
60 |
|
|
61 |
for(var j = 0; j < 80; j++) |
|
62 |
{ |
|
63 |
if(j < 16) w[j] = x[i + j]; |
|
64 |
else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1); |
|
65 |
var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)), |
|
66 |
safe_add(safe_add(e, w[j]), sha1_kt(j))); |
|
67 |
e = d; |
|
68 |
d = c; |
|
69 |
c = rol(b, 30); |
|
70 |
b = a; |
|
71 |
a = t; |
|
72 |
} |
|
73 |
|
|
74 |
a = safe_add(a, olda); |
|
75 |
b = safe_add(b, oldb); |
|
76 |
c = safe_add(c, oldc); |
|
77 |
d = safe_add(d, oldd); |
|
78 |
e = safe_add(e, olde); |
|
79 |
} |
|
80 |
return Array(a, b, c, d, e); |
|
81 |
|
|
82 |
} |
|
83 |
|
|
84 |
/* |
|
85 |
* Perform the appropriate triplet combination function for the current |
|
86 |
* iteration |
|
87 |
*/ |
|
88 |
function sha1_ft(t, b, c, d) |
|
89 |
{ |
|
90 |
if(t < 20) return (b & c) | ((~b) & d); |
|
91 |
if(t < 40) return b ^ c ^ d; |
|
92 |
if(t < 60) return (b & c) | (b & d) | (c & d); |
|
93 |
return b ^ c ^ d; |
|
94 |
} |
|
95 |
|
|
96 |
/* |
|
97 |
* Determine the appropriate additive constant for the current iteration |
|
98 |
*/ |
|
99 |
function sha1_kt(t) |
|
100 |
{ |
|
101 |
return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 : |
|
102 |
(t < 60) ? -1894007588 : -899497514; |
|
103 |
} |
|
104 |
|
|
105 |
/* |
|
106 |
* Calculate the HMAC-SHA1 of a key and some data |
|
107 |
*/ |
|
108 |
function core_hmac_sha1(key, data) |
|
109 |
{ |
|
110 |
var bkey = str2binb(key); |
|
111 |
if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz); |
|
112 |
|
|
113 |
var ipad = Array(16), opad = Array(16); |
|
114 |
for(var i = 0; i < 16; i++) |
|
115 |
{ |
|
116 |
ipad[i] = bkey[i] ^ 0x36363636; |
|
117 |
opad[i] = bkey[i] ^ 0x5C5C5C5C; |
|
118 |
} |
|
119 |
|
|
120 |
var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz); |
|
121 |
return core_sha1(opad.concat(hash), 512 + 160); |
|
122 |
} |
|
123 |
|
|
124 |
/* |
|
125 |
* Add integers, wrapping at 2^32. This uses 16-bit operations internally |
|
126 |
* to work around bugs in some JS interpreters. |
|
127 |
*/ |
|
128 |
function safe_add(x, y) |
|
129 |
{ |
|
130 |
var lsw = (x & 0xFFFF) + (y & 0xFFFF); |
|
131 |
var msw = (x >> 16) + (y >> 16) + (lsw >> 16); |
|
132 |
return (msw << 16) | (lsw & 0xFFFF); |
|
133 |
} |
|
134 |
|
|
135 |
/* |
|
136 |
* Bitwise rotate a 32-bit number to the left. |
|
137 |
*/ |
|
138 |
function rol(num, cnt) |
|
139 |
{ |
|
140 |
return (num << cnt) | (num >>> (32 - cnt)); |
|
141 |
} |
|
142 |
|
|
143 |
/* |
|
144 |
* Convert an 8-bit or 16-bit string to an array of big-endian words |
|
145 |
* In 8-bit function, characters >255 have their hi-byte silently ignored. |
|
146 |
*/ |
|
147 |
function str2binb(str) |
|
148 |
{ |
|
149 |
var bin = Array(); |
|
150 |
var mask = (1 << chrsz) - 1; |
|
151 |
for(var i = 0; i < str.length * chrsz; i += chrsz) |
|
152 |
bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32); |
|
153 |
return bin; |
|
154 |
} |
|
155 |
|
|
156 |
/* |
|
157 |
* Convert an array of big-endian words to a string |
|
158 |
*/ |
|
159 |
function binb2str(bin) |
|
160 |
{ |
|
161 |
var str = ""; |
|
162 |
var mask = (1 << chrsz) - 1; |
|
163 |
for(var i = 0; i < bin.length * 32; i += chrsz) |
|
164 |
str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask); |
|
165 |
return str; |
|
166 |
} |
|
167 |
|
|
168 |
/* |
|
169 |
* Convert an array of big-endian words to a hex string. |
|
170 |
*/ |
|
171 |
function binb2hex(binarray) |
|
172 |
{ |
|
173 |
var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; |
|
174 |
var str = ""; |
|
175 |
for(var i = 0; i < binarray.length * 4; i++) |
|
176 |
{ |
|
177 |
str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) + |
|
178 |
hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF); |
|
179 |
} |
|
180 |
return str; |
|
181 |
} |
|
182 |
|
|
183 |
/* |
|
184 |
* Convert an array of big-endian words to a base-64 string |
|
185 |
*/ |
|
186 |
function binb2b64(binarray) |
|
187 |
{ |
|
188 |
var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; |
|
189 |
var str = ""; |
|
190 |
for(var i = 0; i < binarray.length * 4; i += 3) |
|
191 |
{ |
|
192 |
var triplet = (((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16) |
|
193 |
| (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 ) |
|
194 |
| ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF); |
|
195 |
for(var j = 0; j < 4; j++) |
|
196 |
{ |
|
197 |
if(i * 8 + j * 6 > binarray.length * 32) str += b64pad; |
|
198 |
else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F); |
|
199 |
} |
|
200 |
} |
|
201 |
return str; |
|
202 |
} |
Also available in: Unified diff