抖音小程序C端
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

843 lines
26 KiB

  1. !(function () {
  2. // alignment pattern
  3. var adelta = [
  4. 0, 11, 15, 19, 23, 27, 31,
  5. 16, 18, 20, 22, 24, 26, 28, 20, 22, 24, 24, 26, 28, 28, 22, 24, 24,
  6. 26, 26, 28, 28, 24, 24, 26, 26, 26, 28, 28, 24, 26, 26, 26, 28, 28
  7. ];
  8. // version block
  9. var vpat = [
  10. 0xc94, 0x5bc, 0xa99, 0x4d3, 0xbf6, 0x762, 0x847, 0x60d,
  11. 0x928, 0xb78, 0x45d, 0xa17, 0x532, 0x9a6, 0x683, 0x8c9,
  12. 0x7ec, 0xec4, 0x1e1, 0xfab, 0x08e, 0xc1a, 0x33f, 0xd75,
  13. 0x250, 0x9d5, 0x6f0, 0x8ba, 0x79f, 0xb0b, 0x42e, 0xa64,
  14. 0x541, 0xc69
  15. ];
  16. // final format bits with mask: level << 3 | mask
  17. var fmtword = [
  18. 0x77c4, 0x72f3, 0x7daa, 0x789d, 0x662f, 0x6318, 0x6c41, 0x6976, //L
  19. 0x5412, 0x5125, 0x5e7c, 0x5b4b, 0x45f9, 0x40ce, 0x4f97, 0x4aa0, //M
  20. 0x355f, 0x3068, 0x3f31, 0x3a06, 0x24b4, 0x2183, 0x2eda, 0x2bed, //Q
  21. 0x1689, 0x13be, 0x1ce7, 0x19d0, 0x0762, 0x0255, 0x0d0c, 0x083b //H
  22. ];
  23. // 4 per version: number of blocks 1,2; data width; ecc width
  24. var eccblocks = [
  25. 1, 0, 19, 7, 1, 0, 16, 10, 1, 0, 13, 13, 1, 0, 9, 17,
  26. 1, 0, 34, 10, 1, 0, 28, 16, 1, 0, 22, 22, 1, 0, 16, 28,
  27. 1, 0, 55, 15, 1, 0, 44, 26, 2, 0, 17, 18, 2, 0, 13, 22,
  28. 1, 0, 80, 20, 2, 0, 32, 18, 2, 0, 24, 26, 4, 0, 9, 16,
  29. 1, 0, 108, 26, 2, 0, 43, 24, 2, 2, 15, 18, 2, 2, 11, 22,
  30. 2, 0, 68, 18, 4, 0, 27, 16, 4, 0, 19, 24, 4, 0, 15, 28,
  31. 2, 0, 78, 20, 4, 0, 31, 18, 2, 4, 14, 18, 4, 1, 13, 26,
  32. 2, 0, 97, 24, 2, 2, 38, 22, 4, 2, 18, 22, 4, 2, 14, 26,
  33. 2, 0, 116, 30, 3, 2, 36, 22, 4, 4, 16, 20, 4, 4, 12, 24,
  34. 2, 2, 68, 18, 4, 1, 43, 26, 6, 2, 19, 24, 6, 2, 15, 28,
  35. 4, 0, 81, 20, 1, 4, 50, 30, 4, 4, 22, 28, 3, 8, 12, 24,
  36. 2, 2, 92, 24, 6, 2, 36, 22, 4, 6, 20, 26, 7, 4, 14, 28,
  37. 4, 0, 107, 26, 8, 1, 37, 22, 8, 4, 20, 24, 12, 4, 11, 22,
  38. 3, 1, 115, 30, 4, 5, 40, 24, 11, 5, 16, 20, 11, 5, 12, 24,
  39. 5, 1, 87, 22, 5, 5, 41, 24, 5, 7, 24, 30, 11, 7, 12, 24,
  40. 5, 1, 98, 24, 7, 3, 45, 28, 15, 2, 19, 24, 3, 13, 15, 30,
  41. 1, 5, 107, 28, 10, 1, 46, 28, 1, 15, 22, 28, 2, 17, 14, 28,
  42. 5, 1, 120, 30, 9, 4, 43, 26, 17, 1, 22, 28, 2, 19, 14, 28,
  43. 3, 4, 113, 28, 3, 11, 44, 26, 17, 4, 21, 26, 9, 16, 13, 26,
  44. 3, 5, 107, 28, 3, 13, 41, 26, 15, 5, 24, 30, 15, 10, 15, 28,
  45. 4, 4, 116, 28, 17, 0, 42, 26, 17, 6, 22, 28, 19, 6, 16, 30,
  46. 2, 7, 111, 28, 17, 0, 46, 28, 7, 16, 24, 30, 34, 0, 13, 24,
  47. 4, 5, 121, 30, 4, 14, 47, 28, 11, 14, 24, 30, 16, 14, 15, 30,
  48. 6, 4, 117, 30, 6, 14, 45, 28, 11, 16, 24, 30, 30, 2, 16, 30,
  49. 8, 4, 106, 26, 8, 13, 47, 28, 7, 22, 24, 30, 22, 13, 15, 30,
  50. 10, 2, 114, 28, 19, 4, 46, 28, 28, 6, 22, 28, 33, 4, 16, 30,
  51. 8, 4, 122, 30, 22, 3, 45, 28, 8, 26, 23, 30, 12, 28, 15, 30,
  52. 3, 10, 117, 30, 3, 23, 45, 28, 4, 31, 24, 30, 11, 31, 15, 30,
  53. 7, 7, 116, 30, 21, 7, 45, 28, 1, 37, 23, 30, 19, 26, 15, 30,
  54. 5, 10, 115, 30, 19, 10, 47, 28, 15, 25, 24, 30, 23, 25, 15, 30,
  55. 13, 3, 115, 30, 2, 29, 46, 28, 42, 1, 24, 30, 23, 28, 15, 30,
  56. 17, 0, 115, 30, 10, 23, 46, 28, 10, 35, 24, 30, 19, 35, 15, 30,
  57. 17, 1, 115, 30, 14, 21, 46, 28, 29, 19, 24, 30, 11, 46, 15, 30,
  58. 13, 6, 115, 30, 14, 23, 46, 28, 44, 7, 24, 30, 59, 1, 16, 30,
  59. 12, 7, 121, 30, 12, 26, 47, 28, 39, 14, 24, 30, 22, 41, 15, 30,
  60. 6, 14, 121, 30, 6, 34, 47, 28, 46, 10, 24, 30, 2, 64, 15, 30,
  61. 17, 4, 122, 30, 29, 14, 46, 28, 49, 10, 24, 30, 24, 46, 15, 30,
  62. 4, 18, 122, 30, 13, 32, 46, 28, 48, 14, 24, 30, 42, 32, 15, 30,
  63. 20, 4, 117, 30, 40, 7, 47, 28, 43, 22, 24, 30, 10, 67, 15, 30,
  64. 19, 6, 118, 30, 18, 31, 47, 28, 34, 34, 24, 30, 20, 61, 15, 30
  65. ];
  66. // Galois field log table
  67. var glog = [
  68. 0xff, 0x00, 0x01, 0x19, 0x02, 0x32, 0x1a, 0xc6, 0x03, 0xdf, 0x33, 0xee, 0x1b, 0x68, 0xc7, 0x4b,
  69. 0x04, 0x64, 0xe0, 0x0e, 0x34, 0x8d, 0xef, 0x81, 0x1c, 0xc1, 0x69, 0xf8, 0xc8, 0x08, 0x4c, 0x71,
  70. 0x05, 0x8a, 0x65, 0x2f, 0xe1, 0x24, 0x0f, 0x21, 0x35, 0x93, 0x8e, 0xda, 0xf0, 0x12, 0x82, 0x45,
  71. 0x1d, 0xb5, 0xc2, 0x7d, 0x6a, 0x27, 0xf9, 0xb9, 0xc9, 0x9a, 0x09, 0x78, 0x4d, 0xe4, 0x72, 0xa6,
  72. 0x06, 0xbf, 0x8b, 0x62, 0x66, 0xdd, 0x30, 0xfd, 0xe2, 0x98, 0x25, 0xb3, 0x10, 0x91, 0x22, 0x88,
  73. 0x36, 0xd0, 0x94, 0xce, 0x8f, 0x96, 0xdb, 0xbd, 0xf1, 0xd2, 0x13, 0x5c, 0x83, 0x38, 0x46, 0x40,
  74. 0x1e, 0x42, 0xb6, 0xa3, 0xc3, 0x48, 0x7e, 0x6e, 0x6b, 0x3a, 0x28, 0x54, 0xfa, 0x85, 0xba, 0x3d,
  75. 0xca, 0x5e, 0x9b, 0x9f, 0x0a, 0x15, 0x79, 0x2b, 0x4e, 0xd4, 0xe5, 0xac, 0x73, 0xf3, 0xa7, 0x57,
  76. 0x07, 0x70, 0xc0, 0xf7, 0x8c, 0x80, 0x63, 0x0d, 0x67, 0x4a, 0xde, 0xed, 0x31, 0xc5, 0xfe, 0x18,
  77. 0xe3, 0xa5, 0x99, 0x77, 0x26, 0xb8, 0xb4, 0x7c, 0x11, 0x44, 0x92, 0xd9, 0x23, 0x20, 0x89, 0x2e,
  78. 0x37, 0x3f, 0xd1, 0x5b, 0x95, 0xbc, 0xcf, 0xcd, 0x90, 0x87, 0x97, 0xb2, 0xdc, 0xfc, 0xbe, 0x61,
  79. 0xf2, 0x56, 0xd3, 0xab, 0x14, 0x2a, 0x5d, 0x9e, 0x84, 0x3c, 0x39, 0x53, 0x47, 0x6d, 0x41, 0xa2,
  80. 0x1f, 0x2d, 0x43, 0xd8, 0xb7, 0x7b, 0xa4, 0x76, 0xc4, 0x17, 0x49, 0xec, 0x7f, 0x0c, 0x6f, 0xf6,
  81. 0x6c, 0xa1, 0x3b, 0x52, 0x29, 0x9d, 0x55, 0xaa, 0xfb, 0x60, 0x86, 0xb1, 0xbb, 0xcc, 0x3e, 0x5a,
  82. 0xcb, 0x59, 0x5f, 0xb0, 0x9c, 0xa9, 0xa0, 0x51, 0x0b, 0xf5, 0x16, 0xeb, 0x7a, 0x75, 0x2c, 0xd7,
  83. 0x4f, 0xae, 0xd5, 0xe9, 0xe6, 0xe7, 0xad, 0xe8, 0x74, 0xd6, 0xf4, 0xea, 0xa8, 0x50, 0x58, 0xaf
  84. ];
  85. // Galios field exponent table
  86. var gexp = [
  87. 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1d, 0x3a, 0x74, 0xe8, 0xcd, 0x87, 0x13, 0x26,
  88. 0x4c, 0x98, 0x2d, 0x5a, 0xb4, 0x75, 0xea, 0xc9, 0x8f, 0x03, 0x06, 0x0c, 0x18, 0x30, 0x60, 0xc0,
  89. 0x9d, 0x27, 0x4e, 0x9c, 0x25, 0x4a, 0x94, 0x35, 0x6a, 0xd4, 0xb5, 0x77, 0xee, 0xc1, 0x9f, 0x23,
  90. 0x46, 0x8c, 0x05, 0x0a, 0x14, 0x28, 0x50, 0xa0, 0x5d, 0xba, 0x69, 0xd2, 0xb9, 0x6f, 0xde, 0xa1,
  91. 0x5f, 0xbe, 0x61, 0xc2, 0x99, 0x2f, 0x5e, 0xbc, 0x65, 0xca, 0x89, 0x0f, 0x1e, 0x3c, 0x78, 0xf0,
  92. 0xfd, 0xe7, 0xd3, 0xbb, 0x6b, 0xd6, 0xb1, 0x7f, 0xfe, 0xe1, 0xdf, 0xa3, 0x5b, 0xb6, 0x71, 0xe2,
  93. 0xd9, 0xaf, 0x43, 0x86, 0x11, 0x22, 0x44, 0x88, 0x0d, 0x1a, 0x34, 0x68, 0xd0, 0xbd, 0x67, 0xce,
  94. 0x81, 0x1f, 0x3e, 0x7c, 0xf8, 0xed, 0xc7, 0x93, 0x3b, 0x76, 0xec, 0xc5, 0x97, 0x33, 0x66, 0xcc,
  95. 0x85, 0x17, 0x2e, 0x5c, 0xb8, 0x6d, 0xda, 0xa9, 0x4f, 0x9e, 0x21, 0x42, 0x84, 0x15, 0x2a, 0x54,
  96. 0xa8, 0x4d, 0x9a, 0x29, 0x52, 0xa4, 0x55, 0xaa, 0x49, 0x92, 0x39, 0x72, 0xe4, 0xd5, 0xb7, 0x73,
  97. 0xe6, 0xd1, 0xbf, 0x63, 0xc6, 0x91, 0x3f, 0x7e, 0xfc, 0xe5, 0xd7, 0xb3, 0x7b, 0xf6, 0xf1, 0xff,
  98. 0xe3, 0xdb, 0xab, 0x4b, 0x96, 0x31, 0x62, 0xc4, 0x95, 0x37, 0x6e, 0xdc, 0xa5, 0x57, 0xae, 0x41,
  99. 0x82, 0x19, 0x32, 0x64, 0xc8, 0x8d, 0x07, 0x0e, 0x1c, 0x38, 0x70, 0xe0, 0xdd, 0xa7, 0x53, 0xa6,
  100. 0x51, 0xa2, 0x59, 0xb2, 0x79, 0xf2, 0xf9, 0xef, 0xc3, 0x9b, 0x2b, 0x56, 0xac, 0x45, 0x8a, 0x09,
  101. 0x12, 0x24, 0x48, 0x90, 0x3d, 0x7a, 0xf4, 0xf5, 0xf7, 0xf3, 0xfb, 0xeb, 0xcb, 0x8b, 0x0b, 0x16,
  102. 0x2c, 0x58, 0xb0, 0x7d, 0xfa, 0xe9, 0xcf, 0x83, 0x1b, 0x36, 0x6c, 0xd8, 0xad, 0x47, 0x8e, 0x00
  103. ];
  104. // Working buffers:
  105. // data input and ecc append, image working buffer, fixed part of image, run lengths for badness
  106. var strinbuf = [], eccbuf = [], qrframe = [], framask = [], rlens = [];
  107. // Control values - width is based on version, last 4 are from table.
  108. var version, width, neccblk1, neccblk2, datablkw, eccblkwid;
  109. var ecclevel = 2;
  110. // set bit to indicate cell in qrframe is immutable. symmetric around diagonal
  111. function setmask(x, y) {
  112. var bt;
  113. if (x > y) {
  114. bt = x;
  115. x = y;
  116. y = bt;
  117. }
  118. // y*y = 1+3+5...
  119. bt = y;
  120. bt *= y;
  121. bt += y;
  122. bt >>= 1;
  123. bt += x;
  124. framask[bt] = 1;
  125. }
  126. // enter alignment pattern - black to qrframe, white to mask (later black frame merged to mask)
  127. function putalign(x, y) {
  128. var j;
  129. qrframe[x + width * y] = 1;
  130. for (j = -2; j < 2; j++) {
  131. qrframe[(x + j) + width * (y - 2)] = 1;
  132. qrframe[(x - 2) + width * (y + j + 1)] = 1;
  133. qrframe[(x + 2) + width * (y + j)] = 1;
  134. qrframe[(x + j + 1) + width * (y + 2)] = 1;
  135. }
  136. for (j = 0; j < 2; j++) {
  137. setmask(x - 1, y + j);
  138. setmask(x + 1, y - j);
  139. setmask(x - j, y - 1);
  140. setmask(x + j, y + 1);
  141. }
  142. }
  143. //========================================================================
  144. // Reed Solomon error correction
  145. // exponentiation mod N
  146. function modnn(x) {
  147. while (x >= 255) {
  148. x -= 255;
  149. x = (x >> 8) + (x & 255);
  150. }
  151. return x;
  152. }
  153. var genpoly = [];
  154. // Calculate and append ECC data to data block. Block is in strinbuf, indexes to buffers given.
  155. function appendrs(data, dlen, ecbuf, eclen) {
  156. var i, j, fb;
  157. for (i = 0; i < eclen; i++)
  158. strinbuf[ecbuf + i] = 0;
  159. for (i = 0; i < dlen; i++) {
  160. fb = glog[strinbuf[data + i] ^ strinbuf[ecbuf]];
  161. if (fb != 255) /* fb term is non-zero */
  162. for (j = 1; j < eclen; j++)
  163. strinbuf[ecbuf + j - 1] = strinbuf[ecbuf + j] ^ gexp[modnn(fb + genpoly[eclen - j])];
  164. else
  165. for (j = ecbuf; j < ecbuf + eclen; j++)
  166. strinbuf[j] = strinbuf[j + 1];
  167. strinbuf[ecbuf + eclen - 1] = fb == 255 ? 0 : gexp[modnn(fb + genpoly[0])];
  168. }
  169. }
  170. //========================================================================
  171. // Frame data insert following the path rules
  172. // check mask - since symmetrical use half.
  173. function ismasked(x, y) {
  174. var bt;
  175. if (x > y) {
  176. bt = x;
  177. x = y;
  178. y = bt;
  179. }
  180. bt = y;
  181. bt += y * y;
  182. bt >>= 1;
  183. bt += x;
  184. return framask[bt];
  185. }
  186. //========================================================================
  187. // Apply the selected mask out of the 8.
  188. function applymask(m) {
  189. var x, y, r3x, r3y;
  190. switch (m) {
  191. case 0:
  192. for (y = 0; y < width; y++)
  193. for (x = 0; x < width; x++)
  194. if (!((x + y) & 1) && !ismasked(x, y))
  195. qrframe[x + y * width] ^= 1;
  196. break;
  197. case 1:
  198. for (y = 0; y < width; y++)
  199. for (x = 0; x < width; x++)
  200. if (!(y & 1) && !ismasked(x, y))
  201. qrframe[x + y * width] ^= 1;
  202. break;
  203. case 2:
  204. for (y = 0; y < width; y++)
  205. for (r3x = 0, x = 0; x < width; x++ , r3x++) {
  206. if (r3x == 3)
  207. r3x = 0;
  208. if (!r3x && !ismasked(x, y))
  209. qrframe[x + y * width] ^= 1;
  210. }
  211. break;
  212. case 3:
  213. for (r3y = 0, y = 0; y < width; y++ , r3y++) {
  214. if (r3y == 3)
  215. r3y = 0;
  216. for (r3x = r3y, x = 0; x < width; x++ , r3x++) {
  217. if (r3x == 3)
  218. r3x = 0;
  219. if (!r3x && !ismasked(x, y))
  220. qrframe[x + y * width] ^= 1;
  221. }
  222. }
  223. break;
  224. case 4:
  225. for (y = 0; y < width; y++)
  226. for (r3x = 0, r3y = ((y >> 1) & 1), x = 0; x < width; x++ , r3x++) {
  227. if (r3x == 3) {
  228. r3x = 0;
  229. r3y = !r3y;
  230. }
  231. if (!r3y && !ismasked(x, y))
  232. qrframe[x + y * width] ^= 1;
  233. }
  234. break;
  235. case 5:
  236. for (r3y = 0, y = 0; y < width; y++ , r3y++) {
  237. if (r3y == 3)
  238. r3y = 0;
  239. for (r3x = 0, x = 0; x < width; x++ , r3x++) {
  240. if (r3x == 3)
  241. r3x = 0;
  242. if (!((x & y & 1) + !(!r3x | !r3y)) && !ismasked(x, y))
  243. qrframe[x + y * width] ^= 1;
  244. }
  245. }
  246. break;
  247. case 6:
  248. for (r3y = 0, y = 0; y < width; y++ , r3y++) {
  249. if (r3y == 3)
  250. r3y = 0;
  251. for (r3x = 0, x = 0; x < width; x++ , r3x++) {
  252. if (r3x == 3)
  253. r3x = 0;
  254. if (!(((x & y & 1) + (r3x && (r3x == r3y))) & 1) && !ismasked(x, y))
  255. qrframe[x + y * width] ^= 1;
  256. }
  257. }
  258. break;
  259. case 7:
  260. for (r3y = 0, y = 0; y < width; y++ , r3y++) {
  261. if (r3y == 3)
  262. r3y = 0;
  263. for (r3x = 0, x = 0; x < width; x++ , r3x++) {
  264. if (r3x == 3)
  265. r3x = 0;
  266. if (!(((r3x && (r3x == r3y)) + ((x + y) & 1)) & 1) && !ismasked(x, y))
  267. qrframe[x + y * width] ^= 1;
  268. }
  269. }
  270. break;
  271. }
  272. return;
  273. }
  274. // Badness coefficients.
  275. var N1 = 3, N2 = 3, N3 = 40, N4 = 10;
  276. // Using the table of the length of each run, calculate the amount of bad image
  277. // - long runs or those that look like finders; called twice, once each for X and Y
  278. function badruns(length) {
  279. var i;
  280. var runsbad = 0;
  281. for (i = 0; i <= length; i++)
  282. if (rlens[i] >= 5)
  283. runsbad += N1 + rlens[i] - 5;
  284. // BwBBBwB as in finder
  285. for (i = 3; i < length - 1; i += 2)
  286. if (rlens[i - 2] == rlens[i + 2]
  287. && rlens[i + 2] == rlens[i - 1]
  288. && rlens[i - 1] == rlens[i + 1]
  289. && rlens[i - 1] * 3 == rlens[i]
  290. // white around the black pattern? Not part of spec
  291. && (rlens[i - 3] == 0 // beginning
  292. || i + 3 > length // end
  293. || rlens[i - 3] * 3 >= rlens[i] * 4 || rlens[i + 3] * 3 >= rlens[i] * 4)
  294. )
  295. runsbad += N3;
  296. return runsbad;
  297. }
  298. // Calculate how bad the masked image is - blocks, imbalance, runs, or finders.
  299. function badcheck() {
  300. var x, y, h, b, b1;
  301. var thisbad = 0;
  302. var bw = 0;
  303. // blocks of same color.
  304. for (y = 0; y < width - 1; y++)
  305. for (x = 0; x < width - 1; x++)
  306. if ((qrframe[x + width * y] && qrframe[(x + 1) + width * y]
  307. && qrframe[x + width * (y + 1)] && qrframe[(x + 1) + width * (y + 1)]) // all black
  308. || !(qrframe[x + width * y] || qrframe[(x + 1) + width * y]
  309. || qrframe[x + width * (y + 1)] || qrframe[(x + 1) + width * (y + 1)])) // all white
  310. thisbad += N2;
  311. // X runs
  312. for (y = 0; y < width; y++) {
  313. rlens[0] = 0;
  314. for (h = b = x = 0; x < width; x++) {
  315. if ((b1 = qrframe[x + width * y]) == b)
  316. rlens[h]++;
  317. else
  318. rlens[++h] = 1;
  319. b = b1;
  320. bw += b ? 1 : -1;
  321. }
  322. thisbad += badruns(h);
  323. }
  324. // black/white imbalance
  325. if (bw < 0)
  326. bw = -bw;
  327. var big = bw;
  328. var count = 0;
  329. big += big << 2;
  330. big <<= 1;
  331. while (big > width * width)
  332. big -= width * width, count++;
  333. thisbad += count * N4;
  334. // Y runs
  335. for (x = 0; x < width; x++) {
  336. rlens[0] = 0;
  337. for (h = b = y = 0; y < width; y++) {
  338. if ((b1 = qrframe[x + width * y]) == b)
  339. rlens[h]++;
  340. else
  341. rlens[++h] = 1;
  342. b = b1;
  343. }
  344. thisbad += badruns(h);
  345. }
  346. return thisbad;
  347. }
  348. function genframe(instring) {
  349. var x, y, k, t, v, i, j, m;
  350. // find the smallest version that fits the string
  351. t = instring.length;
  352. version = 0;
  353. do {
  354. version++;
  355. k = (ecclevel - 1) * 4 + (version - 1) * 16;
  356. neccblk1 = eccblocks[k++];
  357. neccblk2 = eccblocks[k++];
  358. datablkw = eccblocks[k++];
  359. eccblkwid = eccblocks[k];
  360. k = datablkw * (neccblk1 + neccblk2) + neccblk2 - 3 + (version <= 9);
  361. if (t <= k)
  362. break;
  363. } while (version < 40);
  364. // FIXME - insure that it fits insted of being truncated
  365. width = 17 + 4 * version;
  366. // allocate, clear and setup data structures
  367. v = datablkw + (datablkw + eccblkwid) * (neccblk1 + neccblk2) + neccblk2;
  368. for (t = 0; t < v; t++)
  369. eccbuf[t] = 0;
  370. strinbuf = instring.slice(0);
  371. for (t = 0; t < width * width; t++)
  372. qrframe[t] = 0;
  373. for (t = 0; t < (width * (width + 1) + 1) / 2; t++)
  374. framask[t] = 0;
  375. // insert finders - black to frame, white to mask
  376. for (t = 0; t < 3; t++) {
  377. k = 0;
  378. y = 0;
  379. if (t == 1)
  380. k = (width - 7);
  381. if (t == 2)
  382. y = (width - 7);
  383. qrframe[(y + 3) + width * (k + 3)] = 1;
  384. for (x = 0; x < 6; x++) {
  385. qrframe[(y + x) + width * k] = 1;
  386. qrframe[y + width * (k + x + 1)] = 1;
  387. qrframe[(y + 6) + width * (k + x)] = 1;
  388. qrframe[(y + x + 1) + width * (k + 6)] = 1;
  389. }
  390. for (x = 1; x < 5; x++) {
  391. setmask(y + x, k + 1);
  392. setmask(y + 1, k + x + 1);
  393. setmask(y + 5, k + x);
  394. setmask(y + x + 1, k + 5);
  395. }
  396. for (x = 2; x < 4; x++) {
  397. qrframe[(y + x) + width * (k + 2)] = 1;
  398. qrframe[(y + 2) + width * (k + x + 1)] = 1;
  399. qrframe[(y + 4) + width * (k + x)] = 1;
  400. qrframe[(y + x + 1) + width * (k + 4)] = 1;
  401. }
  402. }
  403. // alignment blocks
  404. if (version > 1) {
  405. t = adelta[version];
  406. y = width - 7;
  407. for (; ;) {
  408. x = width - 7;
  409. while (x > t - 3) {
  410. putalign(x, y);
  411. if (x < t)
  412. break;
  413. x -= t;
  414. }
  415. if (y <= t + 9)
  416. break;
  417. y -= t;
  418. putalign(6, y);
  419. putalign(y, 6);
  420. }
  421. }
  422. // single black
  423. qrframe[8 + width * (width - 8)] = 1;
  424. // timing gap - mask only
  425. for (y = 0; y < 7; y++) {
  426. setmask(7, y);
  427. setmask(width - 8, y);
  428. setmask(7, y + width - 7);
  429. }
  430. for (x = 0; x < 8; x++) {
  431. setmask(x, 7);
  432. setmask(x + width - 8, 7);
  433. setmask(x, width - 8);
  434. }
  435. // reserve mask-format area
  436. for (x = 0; x < 9; x++)
  437. setmask(x, 8);
  438. for (x = 0; x < 8; x++) {
  439. setmask(x + width - 8, 8);
  440. setmask(8, x);
  441. }
  442. for (y = 0; y < 7; y++)
  443. setmask(8, y + width - 7);
  444. // timing row/col
  445. for (x = 0; x < width - 14; x++)
  446. if (x & 1) {
  447. setmask(8 + x, 6);
  448. setmask(6, 8 + x);
  449. }
  450. else {
  451. qrframe[(8 + x) + width * 6] = 1;
  452. qrframe[6 + width * (8 + x)] = 1;
  453. }
  454. // version block
  455. if (version > 6) {
  456. t = vpat[version - 7];
  457. k = 17;
  458. for (x = 0; x < 6; x++)
  459. for (y = 0; y < 3; y++ , k--)
  460. if (1 & (k > 11 ? version >> (k - 12) : t >> k)) {
  461. qrframe[(5 - x) + width * (2 - y + width - 11)] = 1;
  462. qrframe[(2 - y + width - 11) + width * (5 - x)] = 1;
  463. }
  464. else {
  465. setmask(5 - x, 2 - y + width - 11);
  466. setmask(2 - y + width - 11, 5 - x);
  467. }
  468. }
  469. // sync mask bits - only set above for white spaces, so add in black bits
  470. for (y = 0; y < width; y++)
  471. for (x = 0; x <= y; x++)
  472. if (qrframe[x + width * y])
  473. setmask(x, y);
  474. // convert string to bitstream
  475. // 8 bit data to QR-coded 8 bit data (numeric or alphanum, or kanji not supported)
  476. v = strinbuf.length;
  477. // string to array
  478. for (i = 0; i < v; i++)
  479. eccbuf[i] = strinbuf.charCodeAt(i);
  480. strinbuf = eccbuf.slice(0);
  481. // calculate max string length
  482. x = datablkw * (neccblk1 + neccblk2) + neccblk2;
  483. if (v >= x - 2) {
  484. v = x - 2;
  485. if (version > 9)
  486. v--;
  487. }
  488. // shift and repack to insert length prefix
  489. i = v;
  490. if (version > 9) {
  491. strinbuf[i + 2] = 0;
  492. strinbuf[i + 3] = 0;
  493. while (i--) {
  494. t = strinbuf[i];
  495. strinbuf[i + 3] |= 255 & (t << 4);
  496. strinbuf[i + 2] = t >> 4;
  497. }
  498. strinbuf[2] |= 255 & (v << 4);
  499. strinbuf[1] = v >> 4;
  500. strinbuf[0] = 0x40 | (v >> 12);
  501. }
  502. else {
  503. strinbuf[i + 1] = 0;
  504. strinbuf[i + 2] = 0;
  505. while (i--) {
  506. t = strinbuf[i];
  507. strinbuf[i + 2] |= 255 & (t << 4);
  508. strinbuf[i + 1] = t >> 4;
  509. }
  510. strinbuf[1] |= 255 & (v << 4);
  511. strinbuf[0] = 0x40 | (v >> 4);
  512. }
  513. // fill to end with pad pattern
  514. i = v + 3 - (version < 10);
  515. while (i < x) {
  516. strinbuf[i++] = 0xec;
  517. // buffer has room if (i == x) break;
  518. strinbuf[i++] = 0x11;
  519. }
  520. // calculate and append ECC
  521. // calculate generator polynomial
  522. genpoly[0] = 1;
  523. for (i = 0; i < eccblkwid; i++) {
  524. genpoly[i + 1] = 1;
  525. for (j = i; j > 0; j--)
  526. genpoly[j] = genpoly[j]
  527. ? genpoly[j - 1] ^ gexp[modnn(glog[genpoly[j]] + i)] : genpoly[j - 1];
  528. genpoly[0] = gexp[modnn(glog[genpoly[0]] + i)];
  529. }
  530. for (i = 0; i <= eccblkwid; i++)
  531. genpoly[i] = glog[genpoly[i]]; // use logs for genpoly[] to save calc step
  532. // append ecc to data buffer
  533. k = x;
  534. y = 0;
  535. for (i = 0; i < neccblk1; i++) {
  536. appendrs(y, datablkw, k, eccblkwid);
  537. y += datablkw;
  538. k += eccblkwid;
  539. }
  540. for (i = 0; i < neccblk2; i++) {
  541. appendrs(y, datablkw + 1, k, eccblkwid);
  542. y += datablkw + 1;
  543. k += eccblkwid;
  544. }
  545. // interleave blocks
  546. y = 0;
  547. for (i = 0; i < datablkw; i++) {
  548. for (j = 0; j < neccblk1; j++)
  549. eccbuf[y++] = strinbuf[i + j * datablkw];
  550. for (j = 0; j < neccblk2; j++)
  551. eccbuf[y++] = strinbuf[(neccblk1 * datablkw) + i + (j * (datablkw + 1))];
  552. }
  553. for (j = 0; j < neccblk2; j++)
  554. eccbuf[y++] = strinbuf[(neccblk1 * datablkw) + i + (j * (datablkw + 1))];
  555. for (i = 0; i < eccblkwid; i++)
  556. for (j = 0; j < neccblk1 + neccblk2; j++)
  557. eccbuf[y++] = strinbuf[x + i + j * eccblkwid];
  558. strinbuf = eccbuf;
  559. // pack bits into frame avoiding masked area.
  560. x = y = width - 1;
  561. k = v = 1; // up, minus
  562. /* inteleaved data and ecc codes */
  563. m = (datablkw + eccblkwid) * (neccblk1 + neccblk2) + neccblk2;
  564. for (i = 0; i < m; i++) {
  565. t = strinbuf[i];
  566. for (j = 0; j < 8; j++ , t <<= 1) {
  567. if (0x80 & t)
  568. qrframe[x + width * y] = 1;
  569. do { // find next fill position
  570. if (v)
  571. x--;
  572. else {
  573. x++;
  574. if (k) {
  575. if (y != 0)
  576. y--;
  577. else {
  578. x -= 2;
  579. k = !k;
  580. if (x == 6) {
  581. x--;
  582. y = 9;
  583. }
  584. }
  585. }
  586. else {
  587. if (y != width - 1)
  588. y++;
  589. else {
  590. x -= 2;
  591. k = !k;
  592. if (x == 6) {
  593. x--;
  594. y -= 8;
  595. }
  596. }
  597. }
  598. }
  599. v = !v;
  600. } while (ismasked(x, y));
  601. }
  602. }
  603. // save pre-mask copy of frame
  604. strinbuf = qrframe.slice(0);
  605. t = 0; // best
  606. y = 30000; // demerit
  607. // for instead of while since in original arduino code
  608. // if an early mask was "good enough" it wouldn't try for a better one
  609. // since they get more complex and take longer.
  610. for (k = 0; k < 8; k++) {
  611. applymask(k); // returns black-white imbalance
  612. x = badcheck();
  613. if (x < y) { // current mask better than previous best?
  614. y = x;
  615. t = k;
  616. }
  617. if (t == 7)
  618. break; // don't increment i to a void redoing mask
  619. qrframe = strinbuf.slice(0); // reset for next pass
  620. }
  621. if (t != k) // redo best mask - none good enough, last wasn't t
  622. applymask(t);
  623. // add in final mask/ecclevel bytes
  624. y = fmtword[t + ((ecclevel - 1) << 3)];
  625. // low byte
  626. for (k = 0; k < 8; k++ , y >>= 1)
  627. if (y & 1) {
  628. qrframe[(width - 1 - k) + width * 8] = 1;
  629. if (k < 6)
  630. qrframe[8 + width * k] = 1;
  631. else
  632. qrframe[8 + width * (k + 1)] = 1;
  633. }
  634. // high byte
  635. for (k = 0; k < 7; k++ , y >>= 1)
  636. if (y & 1) {
  637. qrframe[8 + width * (width - 7 + k)] = 1;
  638. if (k)
  639. qrframe[(6 - k) + width * 8] = 1;
  640. else
  641. qrframe[7 + width * 8] = 1;
  642. }
  643. return qrframe;
  644. }
  645. var _canvas = null;
  646. var api = {
  647. get ecclevel() {
  648. return ecclevel;
  649. },
  650. set ecclevel(val) {
  651. ecclevel = val;
  652. },
  653. get size() {
  654. return _size;
  655. },
  656. set size(val) {
  657. _size = val
  658. },
  659. get canvas() {
  660. return _canvas;
  661. },
  662. set canvas(el) {
  663. _canvas = el;
  664. },
  665. getFrame: function (string) {
  666. return genframe(string);
  667. },
  668. //这里的utf16to8(str)是对Text中的字符串进行转码,让其支持中文
  669. utf16to8: function (str) {
  670. var out, i, len, c;
  671. out = "";
  672. len = str.length;
  673. for (i = 0; i < len; i++) {
  674. c = str.charCodeAt(i);
  675. if ((c >= 0x0001) && (c <= 0x007F)) {
  676. out += str.charAt(i);
  677. } else if (c > 0x07FF) {
  678. out += String.fromCharCode(0xE0 | ((c >> 12) & 0x0F));
  679. out += String.fromCharCode(0x80 | ((c >> 6) & 0x3F));
  680. out += String.fromCharCode(0x80 | ((c >> 0) & 0x3F));
  681. } else {
  682. out += String.fromCharCode(0xC0 | ((c >> 6) & 0x1F));
  683. out += String.fromCharCode(0x80 | ((c >> 0) & 0x3F));
  684. }
  685. }
  686. return out;
  687. },
  688. /**
  689. * 新增$this参数,传入组件的this,兼容在组件中生成
  690. */
  691. draw: function (str, canvas, cavW, cavH,cb,$this, ecc) {
  692. var that = this;
  693. ecclevel = ecc || ecclevel;
  694. canvas = canvas || _canvas;
  695. if (!canvas) {
  696. console.warn('No canvas provided to draw QR code in!')
  697. return;
  698. }
  699. var size = Math.min(cavW, cavH);
  700. str = that.utf16to8(str);//增加中文显示
  701. var frame = that.getFrame(str),
  702. // 组件中生成qrcode需要绑定this
  703. ctx = tt.createCanvasContext(canvas,$this),
  704. px = Math.round(size / (width + 8));
  705. var roundedSize = px * (width + 8),
  706. offset = Math.floor((size - roundedSize) / 2);
  707. size = roundedSize;
  708. ctx.clearRect(0, 0, cavW, cavW);
  709. ctx.setFillStyle('#ffffff')
  710. ctx.fillRect(0, 0, cavW, cavW);
  711. ctx.setFillStyle('#000000');
  712. for (var i = 0; i < width; i++) {
  713. for (var j = 0; j < width; j++) {
  714. if (frame[j * width + i]) {
  715. ctx.fillRect(px * (4 + i) + offset, px * (4 + j) + offset, px, px);
  716. }
  717. }
  718. }
  719. ctx.draw(true, function () {
  720. // 判断绘制方法,判断手机类型
  721. let brand = "";
  722. tt.getSystemInfo({
  723. success:function(res){
  724. console.log(res.brand)
  725. brand = res.brand;
  726. }
  727. })
  728. if (brand == 'iPhone') {
  729. tt.canvasToTempFilePath({
  730. x: 0,
  731. y: 0,
  732. width: cavW,
  733. height: cavH,
  734. destWidth: cavW,
  735. destHeight: cavH,
  736. canvasId: canvas,
  737. fail: function (res) {
  738. console.log(res)
  739. },
  740. success: function (res) {
  741. if (cb) {
  742. cb(res.tempFilePath);
  743. };
  744. }
  745. })
  746. } else {
  747. // 延迟加载
  748. setTimeout(function () {
  749. tt.canvasToTempFilePath({
  750. x: 0,
  751. y: 0,
  752. width: cavW,
  753. height: cavH,
  754. destWidth: cavW,
  755. destHeight: cavH,
  756. canvasId: canvas,
  757. fail: function (res) {
  758. console.log(res)
  759. },
  760. success: function (res) {
  761. if (cb) {
  762. cb(res.tempFilePath);
  763. };
  764. }
  765. })
  766. }, 1000)
  767. }
  768. });
  769. }
  770. }
  771. module.exports = { api }
  772. // exports.draw = api;
  773. })();