Lines Matching defs:s
185 var s = encode_utf8(pass);
188 if (s.length == 1) {
189 s += s;
193 for (i = 0; i < s.length; i += 2) {
194 md5_update(s.charCodeAt(i));
200 for (i = 1; i < s.length; i += 2) {
201 md5_update(s.charCodeAt(i));
722 // per Rijndael's spec
741 // Rijndael's round functions...
1270 L'Ecuyer's two-sequence generator with a Bays-Durham shuffle
1271 on the back-end. Schrage's algorithm is used to perform
1284 // Schrage's modular multiplication algorithm
1345 function LEcuyer(s) {
1349 this.gen1 = this.gen2 = (s & 0x7FFFFFFF);
1529 function jcFF(a, b, c, d, x, s, ac) {
1531 a = rotateLeft(a, s);
1536 function jcGG(a, b, c, d, x, s, ac) {
1538 a = rotateLeft(a, s);
1543 function jcHH(a, b, c, d, x, s, ac) {
1545 a = rotateLeft(a, s);
1550 function jcII(a, b, c, d, x, s, ac) {
1552 a = rotateLeft(a, s);
1752 function disarm_hex(s) {
1757 if ((i = s.indexOf(hexSentinel)) >= 0) {
1758 s = s.substring(i + hexSentinel.length, s.length);
1760 if ((i = s.indexOf(hexEndSentinel)) >= 0) {
1761 s = s.substring(0, i);
1766 for (i = 0; i < s.length; i++) {
1767 var c = s.charAt(i);
1793 // Output next codegroup, flushing current line if it's full
1873 function disarm_codegroup(s) {
1877 dcgs = s;
2011 function disarm_base64(s) {
2016 if ((j = s.indexOf(base64sent)) >= 0) {
2017 s = s.substring(j + base64sent.length, s.length);
2019 if ((j = s.indexOf(base64esent)) >= 0) {
2020 s = s.substring(0, j);
2026 while (i < s.length) {
2027 if (base64code.indexOf(s.charAt(i)) != -1) {
2037 while (i < s.length) {
2039 if (i >= s.length) {
2046 c = base64code.indexOf(s.charAt(i));
2049 } else if (s.charAt(i) == "=") {
2052 } else if (s.substring(i, i + base64esent.length) == base64esent) {
2053 //dump("s.substring(i, i + base64esent.length)", s.substring(i, i + base64esent.length));
2055 i = s.length;
2058 //dump("s.substring(i, i + base64esent.length)", s.substring(i, i + base64esent.length));
2088 function unicode_to_utf8(s) {
2090 for (var n = 0; n < s.length; n++) {
2091 var c = s.charCodeAt(n);
2116 var s = "", i = 0, b1, b2;
2121 s += String.fromCharCode(b1);
2125 s += String.fromCharCode(((b1 & 0x1F) << 6) | (b2 & 0x3F));
2130 s += String.fromCharCode(((b1 & 0xF) << 12) |
2135 return s;
2154 function encode_utf8(s) {
2157 for (i = 0; i < s.length; i++) {
2158 if ((s.charCodeAt(i) == 0x9D) || (s.charCodeAt(i) > 0xFF)) {
2164 return s;
2166 return String.fromCharCode(0x9D) + unicode_to_utf8(s);
2175 it's guaranteed to contain only 8 bit
2178 function decode_utf8(s) {
2179 if ((s.length > 0) && (s.charCodeAt(0) == 0x9D)) {
2180 return utf8_to_unicode(s.substring(1));
2182 return s;