upload.js 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487
  1. (function () {
  2. // 请参考demo的index.js中的initQiniu()方法,若在使用处对options进行了赋值,则此处config不需要赋默认值。init(options) 即updateConfigWithOptions(options),会对config进行赋值
  3. var config = {
  4. // bucket 所在区域。ECN, SCN, NCN, NA, ASG,分别对应七牛云的:华东,华南,华北,北美,新加坡 5 个区域
  5. qiniuRegion: '',
  6. // 七牛云bucket 外链前缀,外链在下载资源时用到
  7. qiniuBucketURLPrefix: '',
  8. // 获取uptoken方法三选一即可,执行优先级为:uptoken > uptokenURL > uptokenFunc。三选一,剩下两个置空。推荐使用uptokenURL,详情请见 README.md
  9. // 由其他程序生成七牛云uptoken,然后直接写入uptoken
  10. qiniuUploadToken: '',
  11. // 从指定 url 通过 HTTP GET 获取 uptoken,返回的格式必须是 json 且包含 uptoken 字段,例如: {"uptoken": "0MLvWPnyy..."}
  12. qiniuUploadTokenURL: '',
  13. // uptokenFunc 这个属性的值可以是一个用来生成uptoken的函数,详情请见 README.md
  14. qiniuUploadTokenFunction: function () { },
  15. // qiniuShouldUseQiniuFileName 如果是 true,则文件的 key 由 qiniu 服务器分配(全局去重)。如果是 false,则文件的 key 使用微信自动生成的 filename。出于初代sdk用户升级后兼容问题的考虑,默认是 false。
  16. // 微信自动生成的 filename较长,导致fileURL较长。推荐使用{qiniuShouldUseQiniuFileName: true} + "通过fileURL下载文件时,自定义下载名" 的组合方式。
  17. // 自定义上传key 需要两个条件:1. 此处shouldUseQiniuFileName值为false。 2. 通过修改qiniuUploader.upload方法传入的options参数,可以进行自定义key。(请不要直接在sdk中修改options参数,修改方法请见demo的index.js)
  18. // 通过fileURL下载文件时,自定义下载名,请参考:七牛云“对象存储 > 产品手册 > 下载资源 > 下载设置 > 自定义资源下载名”(https://developer.qiniu.com/kodo/manual/1659/download-setting)。本sdk在README.md的"常见问题"板块中,有"通过fileURL下载文件时,自定义下载名"使用样例。
  19. qiniuShouldUseQiniuFileName: false
  20. }
  21. // init(options) 将七牛云相关配置初始化进本sdk
  22. // 在整个程序生命周期中,只需要 init(options); 一次即可
  23. // 如果需要变更七牛云配置,再次调用 init(options); 即可
  24. function init(options) {
  25. updateConfigWithOptions(options);
  26. }
  27. // 更新七牛云配置
  28. function updateConfigWithOptions(options) {
  29. if (options.region) {
  30. config.qiniuRegion = options.region;
  31. } else {
  32. console.error('qiniu uploader need your bucket region');
  33. }
  34. if (options.uptoken) {
  35. config.qiniuUploadToken = options.uptoken;
  36. } else if (options.uptokenURL) {
  37. config.qiniuUploadTokenURL = options.uptokenURL;
  38. } else if (options.uptokenFunc) {
  39. config.qiniuUploadTokenFunction = options.uptokenFunc;
  40. }
  41. if (options.domain) {
  42. config.qiniuBucketURLPrefix = options.domain;
  43. }
  44. config.qiniuShouldUseQiniuFileName = options.shouldUseQiniuFileName
  45. }
  46. // 正式上传的前置方法,做预处理,应用七牛云配置
  47. function upload(filePath, success, fail, options, progress, cancelTask) {
  48. if (null == filePath) {
  49. console.error('qiniu uploader need filePath to upload');
  50. return;
  51. }
  52. if (options) {
  53. updateConfigWithOptions(options);
  54. }
  55. if (config.qiniuUploadToken) {
  56. doUpload(filePath, success, fail, options, progress, cancelTask);
  57. } else if (config.qiniuUploadTokenURL) {
  58. getQiniuToken(function () {
  59. doUpload(filePath, success, fail, options, progress, cancelTask);
  60. });
  61. } else if (config.qiniuUploadTokenFunction) {
  62. config.qiniuUploadToken = config.qiniuUploadTokenFunction();
  63. if (null == config.qiniuUploadToken && config.qiniuUploadToken.length > 0) {
  64. console.error('qiniu UploadTokenFunction result is null, please check the return value');
  65. return
  66. }
  67. doUpload(filePath, success, fail, options, progress, cancelTask);
  68. } else {
  69. console.error('qiniu uploader need one of [uptoken, uptokenURL, uptokenFunc]');
  70. return;
  71. }
  72. }
  73. // 正式上传
  74. function doUpload(filePath, success, fail, options, progress, cancelTask) {
  75. if (null == config.qiniuUploadToken && config.qiniuUploadToken.length > 0) {
  76. console.error('qiniu UploadToken is null, please check the init config or networking');
  77. return
  78. }
  79. var url = uploadURLFromRegionCode(config.qiniuRegion);
  80. if (filePath.indexOf('//') != -1) {
  81. var fileName = filePath.split('//')[1];
  82. } else {
  83. var fileName = hex_md5(filePath);
  84. }
  85. // 自定义上传key(即自定义上传文件名)。通过修改qiniuUploader.upload方法传入的options参数,可以进行自定义文件名称。如果options非空,则使用options中的key作为fileName
  86. if (options && options.key) {
  87. fileName = options.key;
  88. }
  89. var formData = {
  90. 'token': config.qiniuUploadToken
  91. };
  92. // qiniuShouldUseQiniuFileName 如果是 true,则文件的 key 由 qiniu 服务器分配(全局去重)。如果是 false,则文件的 key 使用微信自动生成的 filename。出于初代sdk用户升级后兼容问题的考虑,默认是 false。
  93. if (!config.qiniuShouldUseQiniuFileName) {
  94. formData['key'] = fileName
  95. }
  96. var source = 'h5';
  97. //#ifdef APP-PLUS
  98. source = 'app';
  99. //#endif
  100. if (source == 'app') {
  101. var uploader = plus.uploader.createUpload(url,{},function(up,state){
  102. if( state== 200) {
  103. var res = JSON.parse(up.responseText);
  104. if (success) {
  105. success(res);
  106. }
  107. } else {
  108. if (fail) {
  109. fail(state);
  110. }
  111. }
  112. });
  113. var num = 0;
  114. var uploadInfo = {};
  115. var uploadChangeInfo = function(upload, status) {
  116. if (upload.state == 3) {
  117. var count = (upload.uploadedSize / upload.totalSize)*100;
  118. count = parseInt(count);
  119. if (num != count) {
  120. num = count;
  121. if (num % 10 == 0) {
  122. uploadInfo.progress = num;
  123. progress && progress(uploadInfo);
  124. }
  125. }
  126. }
  127. };
  128. uploader.addEventListener("statechanged", uploadChangeInfo, false);
  129. uploader.addData("key", fileName);
  130. uploader.addData("token",config.qiniuUploadToken);
  131. uploader.addFile(filePath,{"key":"file"});
  132. uploader.start();
  133. } else {
  134. var uploadTask = uni.uploadFile({
  135. url: url,
  136. filePath: filePath,
  137. name: 'file',
  138. formData: formData,
  139. success: function (res) {
  140. var dataString = res.data
  141. // // this if case is a compatibility with wechat server returned a charcode, but was fixed
  142. // if(res.data.hasOwnProperty('type') && res.data.type === 'Buffer'){
  143. // dataString = String.fromCharCode.apply(null, res.data.data)
  144. // }
  145. try {
  146. var dataObject = JSON.parse(dataString);
  147. // 拼接fileURL
  148. var fileURL = config.qiniuBucketURLPrefix + '/' + dataObject.key;
  149. dataObject.fileURL = fileURL;
  150. // imageURL字段和fileURL字段重复,但本sdk不做删除,因为在最初版本使用的是imageURL。直接删除可能导致原有用户升级至新版sdk后出现异常。
  151. dataObject.imageURL = fileURL;
  152. console.log(dataObject);
  153. if (success) {
  154. success(dataObject);
  155. }
  156. } catch (e) {
  157. console.log('parse JSON failed, origin String is: ' + dataString)
  158. if (fail) {
  159. fail(e);
  160. }
  161. }
  162. },
  163. fail: function (error) {
  164. console.error(error);
  165. if (fail) {
  166. fail(error);
  167. }
  168. }
  169. })
  170. // 文件上传进度
  171. uploadTask.onProgressUpdate((res) => {
  172. progress && progress(res)
  173. })
  174. // 中断文件上传
  175. cancelTask && cancelTask(() => {
  176. uploadTask.abort()
  177. })
  178. }
  179. }
  180. // 获取七牛云uptoken, url为后端服务器获取七牛云uptoken接口
  181. function getQiniuToken(callback) {
  182. uni.request({
  183. url: config.qiniuUploadTokenURL,
  184. success: function (res) {
  185. var token = res.data.uptoken;
  186. if (token && token.length > 0) {
  187. config.qiniuUploadToken = token;
  188. if (callback) {
  189. callback();
  190. }
  191. } else {
  192. console.error('qiniuUploader cannot get your token, please check the uptokenURL or server')
  193. }
  194. },
  195. fail: function (error) {
  196. console.error('qiniu UploadToken is null, please check the init config or networking: ' + error);
  197. }
  198. })
  199. }
  200. // 选择七牛云文件上传接口,文件向匹配的接口中传输。ECN, SCN, NCN, NA, ASG,分别对应七牛云的:华东,华南,华北,北美,新加坡 5 个区域
  201. function uploadURLFromRegionCode(code) {
  202. var uploadURL = null;
  203. switch (code) {
  204. case 'ECN': uploadURL = 'https://up.qiniup.com'; break;
  205. case 'NCN': uploadURL = 'https://up-z1.qiniup.com'; break;
  206. case 'SCN': uploadURL = 'https://up-z2.qiniup.com'; break;
  207. case 'NA': uploadURL = 'https://up-na0.qiniup.com'; break;
  208. case 'ASG': uploadURL = 'https://up-as0.qiniup.com'; break;
  209. default: console.error('please make the region is with one of [ECN, SCN, NCN, NA, ASG]');
  210. }
  211. return uploadURL;
  212. }
  213. /*
  214. * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
  215. * Digest Algorithm, as defined in RFC 1321.
  216. * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
  217. * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
  218. * Distributed under the BSD License
  219. * See http://pajhome.org.uk/crypt/md5 for more info.
  220. */
  221. /*
  222. * Configurable variables. You may need to tweak these to be compatible with
  223. * the server-side, but the defaults work in most cases.
  224. */
  225. var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
  226. var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
  227. var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
  228. /*
  229. * These are the functions you'll usually want to call
  230. * They take string arguments and return either hex or base-64 encoded strings
  231. */
  232. function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}
  233. function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));}
  234. function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));}
  235. function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); }
  236. function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); }
  237. function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); }
  238. /*
  239. * Perform a simple self-test to see if the VM is working
  240. */
  241. function md5_vm_test()
  242. {
  243. return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";
  244. }
  245. /*
  246. * Calculate the MD5 of an array of little-endian words, and a bit length
  247. */
  248. function core_md5(x, len)
  249. {
  250. /* append padding */
  251. x[len >> 5] |= 0x80 << ((len) % 32);
  252. x[(((len + 64) >>> 9) << 4) + 14] = len;
  253. var a = 1732584193;
  254. var b = -271733879;
  255. var c = -1732584194;
  256. var d = 271733878;
  257. for(var i = 0; i < x.length; i += 16)
  258. {
  259. var olda = a;
  260. var oldb = b;
  261. var oldc = c;
  262. var oldd = d;
  263. a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
  264. d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
  265. c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
  266. b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
  267. a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
  268. d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
  269. c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
  270. b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
  271. a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
  272. d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
  273. c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
  274. b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
  275. a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
  276. d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
  277. c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
  278. b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);
  279. a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
  280. d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
  281. c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);
  282. b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
  283. a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
  284. d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
  285. c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
  286. b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
  287. a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
  288. d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
  289. c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
  290. b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
  291. a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
  292. d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
  293. c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
  294. b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
  295. a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
  296. d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
  297. c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
  298. b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
  299. a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
  300. d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
  301. c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
  302. b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
  303. a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
  304. d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
  305. c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
  306. b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
  307. a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
  308. d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
  309. c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);
  310. b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
  311. a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
  312. d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
  313. c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
  314. b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
  315. a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
  316. d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
  317. c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
  318. b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
  319. a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
  320. d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
  321. c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
  322. b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
  323. a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
  324. d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
  325. c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
  326. b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
  327. a = safe_add(a, olda);
  328. b = safe_add(b, oldb);
  329. c = safe_add(c, oldc);
  330. d = safe_add(d, oldd);
  331. }
  332. return Array(a, b, c, d);
  333. }
  334. /*
  335. * These functions implement the four basic operations the algorithm uses.
  336. */
  337. function md5_cmn(q, a, b, x, s, t)
  338. {
  339. return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
  340. }
  341. function md5_ff(a, b, c, d, x, s, t)
  342. {
  343. return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
  344. }
  345. function md5_gg(a, b, c, d, x, s, t)
  346. {
  347. return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
  348. }
  349. function md5_hh(a, b, c, d, x, s, t)
  350. {
  351. return md5_cmn(b ^ c ^ d, a, b, x, s, t);
  352. }
  353. function md5_ii(a, b, c, d, x, s, t)
  354. {
  355. return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
  356. }
  357. /*
  358. * Calculate the HMAC-MD5, of a key and some data
  359. */
  360. function core_hmac_md5(key, data)
  361. {
  362. var bkey = str2binl(key);
  363. if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz);
  364. var ipad = Array(16), opad = Array(16);
  365. for(var i = 0; i < 16; i++)
  366. {
  367. ipad[i] = bkey[i] ^ 0x36363636;
  368. opad[i] = bkey[i] ^ 0x5C5C5C5C;
  369. }
  370. var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);
  371. return core_md5(opad.concat(hash), 512 + 128);
  372. }
  373. /*
  374. * Add integers, wrapping at 2^32. This uses 16-bit operations internally
  375. * to work around bugs in some JS interpreters.
  376. */
  377. function safe_add(x, y)
  378. {
  379. var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  380. var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  381. return (msw << 16) | (lsw & 0xFFFF);
  382. }
  383. /*
  384. * Bitwise rotate a 32-bit number to the left.
  385. */
  386. function bit_rol(num, cnt)
  387. {
  388. return (num << cnt) | (num >>> (32 - cnt));
  389. }
  390. /*
  391. * Convert a string to an array of little-endian words
  392. * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
  393. */
  394. function str2binl(str)
  395. {
  396. var bin = Array();
  397. var mask = (1 << chrsz) - 1;
  398. for(var i = 0; i < str.length * chrsz; i += chrsz)
  399. bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32);
  400. return bin;
  401. }
  402. /*
  403. * Convert an array of little-endian words to a string
  404. */
  405. function binl2str(bin)
  406. {
  407. var str = "";
  408. var mask = (1 << chrsz) - 1;
  409. for(var i = 0; i < bin.length * 32; i += chrsz)
  410. str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask);
  411. return str;
  412. }
  413. /*
  414. * Convert an array of little-endian words to a hex string.
  415. */
  416. function binl2hex(binarray)
  417. {
  418. var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
  419. var str = "";
  420. for(var i = 0; i < binarray.length * 4; i++)
  421. {
  422. str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +
  423. hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);
  424. }
  425. return str;
  426. }
  427. /*
  428. * Convert an array of little-endian words to a base-64 string
  429. */
  430. function binl2b64(binarray)
  431. {
  432. var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  433. var str = "";
  434. for(var i = 0; i < binarray.length * 4; i += 3)
  435. {
  436. var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16)
  437. | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )
  438. | ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);
  439. for(var j = 0; j < 4; j++)
  440. {
  441. if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
  442. else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
  443. }
  444. }
  445. return str;
  446. }
  447. module.exports = {
  448. init: init,
  449. upload: upload,
  450. }
  451. })();