☰

LeproGRavatar

Adds gravatars @ leprosorium.ru

  1. // ==UserScript==
  2. // @name           LeproGRavatar
  3. // @namespace      11748
  4. // @description    Adds gravatars @ leprosorium.ru
  5. // @include        https://leprosorium.ru/
  6. // @include        https://leprosorium.ru/*
  7. // @include        https://*.leprosorium.ru/*
  8. // @exclude        https://leprosorium.ru/users/*/comments/
  9. // @version 0.0.2.20180921
  10. // ==/UserScript==
  11.  
  12. // md5 function from http://pajhome.org.uk/crypt/md5/
  13.  
  14. /*
  15.      * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
  16.      * Digest Algorithm, as defined in RFC 1321.
  17.      * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
  18.      * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
  19.      * Distributed under the BSD License
  20.      * See http://pajhome.org.uk/crypt/md5 for more info.
  21.      */
  22.  
  23. /*
  24.      * Configurable variables. You may need to tweak these to be compatible with
  25.      * the server-side, but the defaults work in most cases.
  26.      */
  27. var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase        */
  28. var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance   */
  29. var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode      */
  30.  
  31. /*
  32.      * These are the functions you'll usually want to call
  33.      * They take string arguments and return either hex or base-64 encoded strings
  34.      */
  35. function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}
  36. function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));}
  37. function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));}
  38. function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); }
  39. function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); }
  40. function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); }
  41.  
  42. /*
  43.      * Perform a simple self-test to see if the VM is working
  44.      */
  45. function md5_vm_test()
  46. {
  47.     return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";
  48. }
  49.  
  50. /*
  51.      * Calculate the MD5 of an array of little-endian words, and a bit length
  52.      */
  53. function core_md5(x, len)
  54. {
  55.     /* append padding */
  56.     x[len >> 5] |= 0x80 << ((len) % 32);
  57.     x[(((len + 64) >>> 9) << 4) + 14] = len;
  58.  
  59.     var a =  1732584193;
  60.     var b = -271733879;
  61.     var c = -1732584194;
  62.     var d =  271733878;
  63.  
  64.     for(var i = 0; i < x.length; i += 16)
  65.     {
  66.         var olda = a;
  67.         var oldb = b;
  68.         var oldc = c;
  69.         var oldd = d;
  70.  
  71.         a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
  72.         d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
  73.         c = md5_ff(c, d, a, b, x[i+ 2], 17,  606105819);
  74.         b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
  75.         a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
  76.         d = md5_ff(d, a, b, c, x[i+ 5], 12,  1200080426);
  77.         c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
  78.         b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
  79.         a = md5_ff(a, b, c, d, x[i+ 8], 7 ,  1770035416);
  80.         d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
  81.         c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
  82.         b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
  83.         a = md5_ff(a, b, c, d, x[i+12], 7 ,  1804603682);
  84.         d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
  85.         c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
  86.         b = md5_ff(b, c, d, a, x[i+15], 22,  1236535329);
  87.  
  88.         a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
  89.         d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
  90.         c = md5_gg(c, d, a, b, x[i+11], 14,  643717713);
  91.         b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
  92.         a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
  93.         d = md5_gg(d, a, b, c, x[i+10], 9 ,  38016083);
  94.         c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
  95.         b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
  96.         a = md5_gg(a, b, c, d, x[i+ 9], 5 ,  568446438);
  97.         d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
  98.         c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
  99.         b = md5_gg(b, c, d, a, x[i+ 8], 20,  1163531501);
  100.         a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
  101.         d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
  102.         c = md5_gg(c, d, a, b, x[i+ 7], 14,  1735328473);
  103.         b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
  104.  
  105.         a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
  106.         d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
  107.         c = md5_hh(c, d, a, b, x[i+11], 16,  1839030562);
  108.         b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
  109.         a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
  110.         d = md5_hh(d, a, b, c, x[i+ 4], 11,  1272893353);
  111.         c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
  112.         b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
  113.         a = md5_hh(a, b, c, d, x[i+13], 4 ,  681279174);
  114.         d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
  115.         c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
  116.         b = md5_hh(b, c, d, a, x[i+ 6], 23,  76029189);
  117.         a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
  118.         d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
  119.         c = md5_hh(c, d, a, b, x[i+15], 16,  530742520);
  120.         b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
  121.  
  122.         a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
  123.         d = md5_ii(d, a, b, c, x[i+ 7], 10,  1126891415);
  124.         c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
  125.         b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
  126.         a = md5_ii(a, b, c, d, x[i+12], 6 ,  1700485571);
  127.         d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
  128.         c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
  129.         b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
  130.         a = md5_ii(a, b, c, d, x[i+ 8], 6 ,  1873313359);
  131.         d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
  132.         c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
  133.         b = md5_ii(b, c, d, a, x[i+13], 21,  1309151649);
  134.         a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
  135.         d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
  136.         c = md5_ii(c, d, a, b, x[i+ 2], 15,  718787259);
  137.         b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
  138.  
  139.         a = safe_add(a, olda);
  140.         b = safe_add(b, oldb);
  141.         c = safe_add(c, oldc);
  142.         d = safe_add(d, oldd);
  143.     }
  144.     return Array(a, b, c, d);
  145.  
  146. }
  147.  
  148. /*
  149.      * These functions implement the four basic operations the algorithm uses.
  150.      */
  151. function md5_cmn(q, a, b, x, s, t)
  152. {
  153.     return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
  154. }
  155. function md5_ff(a, b, c, d, x, s, t)
  156. {
  157.     return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
  158. }
  159. function md5_gg(a, b, c, d, x, s, t)
  160. {
  161.     return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
  162. }
  163. function md5_hh(a, b, c, d, x, s, t)
  164. {
  165.     return md5_cmn(b ^ c ^ d, a, b, x, s, t);
  166. }
  167. function md5_ii(a, b, c, d, x, s, t)
  168. {
  169.     return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
  170. }
  171.  
  172. /*
  173.      * Calculate the HMAC-MD5, of a key and some data
  174.      */
  175. function core_hmac_md5(key, data)
  176. {
  177.     var bkey = str2binl(key);
  178.     if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz);
  179.  
  180.     var ipad = Array(16), opad = Array(16);
  181.     for(var i = 0; i < 16; i++)
  182.     {
  183.         ipad[i] = bkey[i] ^ 0x36363636;
  184.         opad[i] = bkey[i] ^ 0x5C5C5C5C;
  185.     }
  186.  
  187.     var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);
  188.     return core_md5(opad.concat(hash), 512 + 128);
  189. }
  190.  
  191. /*
  192.      * Add integers, wrapping at 2^32. This uses 16-bit operations internally
  193.      * to work around bugs in some JS interpreters.
  194.      */
  195. function safe_add(x, y)
  196. {
  197.     var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  198.     var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  199.     return (msw << 16) | (lsw & 0xFFFF);
  200. }
  201.  
  202. /*
  203.      * Bitwise rotate a 32-bit number to the left.
  204.      */
  205. function bit_rol(num, cnt)
  206. {
  207.     return (num << cnt) | (num >>> (32 - cnt));
  208. }
  209.  
  210. /*
  211.      * Convert a string to an array of little-endian words
  212.      * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
  213.      */
  214. function str2binl(str)
  215. {
  216.     var bin = Array();
  217.     var mask = (1 << chrsz) - 1;
  218.     for(var i = 0; i < str.length * chrsz; i += chrsz)
  219.         bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32);
  220.     return bin;
  221. }
  222.  
  223. /*
  224.      * Convert an array of little-endian words to a string
  225.      */
  226. function binl2str(bin)
  227. {
  228.     var str = "";
  229.     var mask = (1 << chrsz) - 1;
  230.     for(var i = 0; i < bin.length * 32; i += chrsz)
  231.         str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask);
  232.     return str;
  233. }
  234.  
  235. /*
  236.      * Convert an array of little-endian words to a hex string.
  237.      */
  238. function binl2hex(binarray)
  239. {
  240.     var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
  241.     var str = "";
  242.     for(var i = 0; i < binarray.length * 4; i++)
  243.     {
  244.         str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +
  245.             hex_tab.charAt((binarray[i>>2] >> ((i%4)*8  )) & 0xF);
  246.     }
  247.     return str;
  248. }
  249.  
  250. /*
  251.      * Convert an array of little-endian words to a base-64 string
  252.      */
  253. function binl2b64(binarray)
  254. {
  255.     var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  256.     var str = "";
  257.     for(var i = 0; i < binarray.length * 4; i += 3)
  258.     {
  259.         var triplet = (((binarray[i   >> 2] >> 8 * ( i   %4)) & 0xFF) << 16)
  260.         | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )
  261.         |  ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);
  262.         for(var j = 0; j < 4; j++)
  263.         {
  264.             if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
  265.             else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
  266.         }
  267.     }
  268.     return str;
  269. }
  270.  
  271. function appendUserGravatar()
  272. {
  273.     var defav = "404";
  274.  
  275.     // one path to rule them all
  276.     var links = document.evaluate(
  277.         "//div[@class='c_i']//div[@class='ddi']//a[@class='c_user']",
  278.         document, null, XPathResult.UNORDERED_NODE_SNAPSHOT_TYPE, null);
  279.  
  280.     var hasharr = [];
  281.     var hash = '';
  282.     var useGM = typeof GM_getValue === "function";
  283.  
  284.     for (var i = 0; i < links.snapshotLength; i++)
  285.     {
  286.         var linkh = links.snapshotItem(i);
  287.         var username = linkh.textContent;
  288.         if (username === undefined) username = linkh.innerText;
  289.  
  290.         var ufullname = username.toLowerCase()+"@gmail.com";
  291.         if (useGM) {
  292.             hash = GM_getValue(ufullname);
  293.             if (!hash) {
  294.                 hash = hex_md5(ufullname);
  295.                 GM_setValue(ufullname, hash);
  296.             }
  297.         } else {
  298.             hash = hasharr[ufullname];
  299.             if (!hash) {
  300.                 hash = hex_md5(ufullname);
  301.                 hasharr[ufullname] = hash;
  302.             }
  303.         }
  304.  
  305.         var gravElement = document.createElement('img');
  306.         gravElement.setAttribute('src',"https://www.gravatar.com/avatar/"+ hash +".jpg?d="+ defav +"&s=32&r=x");
  307.         gravElement.setAttribute('style','z-index:1;position:absolute;left:-72px;bottom:6px;');
  308.         gravElement.setAttribute('alt','');
  309.         linkh.parentNode.insertBefore(gravElement, linkh);
  310.     }
  311.  
  312. };
  313.  
  314. appendUserGravatar();