msgpack-javascript/msgpack.codec.js at master · lfdoherty/msgpack-javascript · GitHub

History

419 lines (390 loc) · 18 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

399

400

401

402

403

404

405

406

407

408

409

410

411

412

413

414

415

416

417

418

419

/*!{id:msgpack.codec.js,ver:1.05,license:"MIT",author:"uupaa.js@gmail.com"}*/

// === msgpack ===

// MessagePack -> http://msgpack.sourceforge.net/

this.msgpack || (function(globalScope) {

globalScope.msgpack = {

pack: msgpackpack, // msgpack.pack(data:Mix,

// toString:Boolean = false):ByteArray/ByteString/false

// [1][mix to String] msgpack.pack({}, true) -> "..."

// [2][mix to ByteArray] msgpack.pack({}) -> [...]

unpack: msgpackunpack // msgpack.unpack(data:BinaryString/ByteArray):Mix

// [1][String to mix] msgpack.unpack("...") -> {}

// [2][ByteArray to mix] msgpack.unpack([...]) -> {}

};

var _bin2num = {}, // BinaryStringToNumber { "\00": 0, ... "\ff": 255 }

_num2bin = {}, // NumberToBinaryString { 0: "\00", ... 255: "\ff" }

_buf = [], // decode buffer

_idx = 0, // decode buffer[index]

_error = 0, // msgpack.pack() error code. 1 = CYCLIC_REFERENCE_ERROR

_isArray = Array.isArray || (function(mix) {

return Object.prototype.toString.call(mix) === "[object Array]";

}),

_toString = String.fromCharCode, // CharCode/ByteArray to String

_MAX_DEPTH = 512;

// msgpack.pack

function msgpackpack(data, // @param Mix:

toString) { // @param Boolean(= false):

// @return ByteArray/BinaryString/false:

// false is error return

// [1][mix to String] msgpack.pack({}, true) -> "..."

// [2][mix to ByteArray] msgpack.pack({}) -> [...]

_error = 0;

var byteArray = encode([], data, 0);

return _error ? false

: toString ? byteArrayToByteString(byteArray)

: byteArray;

}

// msgpack.unpack

function msgpackunpack(data) { // @param BinaryString/ByteArray:

// @return Mix/undefined:

// undefined is error return

// [1][String to mix] msgpack.unpack("...") -> {}

// [2][ByteArray to mix] msgpack.unpack([...]) -> {}

_buf = typeof data === "string" ? toByteArray(data) : data;

_idx = -1;

return decode(); // mix or undefined

}

// inner - encoder

function encode(rv, // @param ByteArray: result

mix, // @param Mix: source data

depth) { // @param Number: depth

var size, i, iz, c, pos, // for UTF8.encode, Array.encode, Hash.encode

high, low, sign, exp, frac; // for IEEE754

if (mix == null) { // null or undefined -> 0xc0 ( null )

rv.push(0xc0);

} else if (mix === false) { // false -> 0xc2 ( false )

rv.push(0xc2);

} else if (mix === true) { // true -> 0xc3 ( true )

rv.push(0xc3);

} else {

switch (typeof mix) {

case "number":

if (mix !== mix) { // isNaN

rv.push(0xcb, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff); // quiet NaN

} else if (mix === Infinity) {

rv.push(0xcb, 0x7f, 0xf0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00); // positive infinity

} else if (Math.floor(mix) === mix) { // int or uint

if (mix < 0) {

// int

if (mix >= -32) { // negative fixnum

rv.push(0xe0 + mix + 32);

} else if (mix > -0x80) {

rv.push(0xd0, mix + 0x100);

} else if (mix > -0x8000) {

mix += 0x10000;

rv.push(0xd1, mix >> 8, mix & 0xff);

} else if (mix > -0x80000000) {

mix += 0x100000000;

rv.push(0xd2, mix >>> 24, (mix >> 16) & 0xff,

(mix >> 8) & 0xff, mix & 0xff);

} else {

high = Math.floor(mix / 0x100000000);

low = mix & 0xffffffff;

rv.push(0xd3, (high >> 24) & 0xff, (high >> 16) & 0xff,

(high >> 8) & 0xff, high & 0xff,

(low >> 24) & 0xff, (low >> 16) & 0xff,

(low >> 8) & 0xff, low & 0xff);

}

} else {

// uint

if (mix < 0x80) {

rv.push(mix); // positive fixnum

} else if (mix < 0x100) { // uint 8

rv.push(0xcc, mix);

} else if (mix < 0x10000) { // uint 16

rv.push(0xcd, mix >> 8, mix & 0xff);

} else if (mix < 0x100000000) { // uint 32

rv.push(0xce, mix >>> 24, (mix >> 16) & 0xff,

(mix >> 8) & 0xff, mix & 0xff);

} else {

high = Math.floor(mix / 0x100000000);

low = mix & 0xffffffff;

rv.push(0xcf, (high >> 24) & 0xff, (high >> 16) & 0xff,

(high >> 8) & 0xff, high & 0xff,

(low >> 24) & 0xff, (low >> 16) & 0xff,

(low >> 8) & 0xff, low & 0xff);

}

} else { // double

// THX!! @edvakf

// http://javascript.g.hatena.ne.jp/edvakf/20101128/1291000731

sign = mix < 0;

sign && (mix *= -1);

// add offset 1023 to ensure positive

// 0.6931471805599453 = Math.LN2;

exp = ((Math.log(mix) / 0.6931471805599453) + 1023) | 0;

// shift 52 - (exp - 1023) bits to make integer part exactly 53 bits,

// then throw away trash less than decimal point

frac = mix * Math.pow(2, 52 + 1023 - exp);

// S+-Exp(11)--++-----------------Fraction(52bits)-----------------------+

// || || |

// v+----------++--------------------------------------------------------+

// 00000000|00000000|00000000|00000000|00000000|00000000|00000000|00000000

// 6 5 55 4 4 3 2 1 8 0

// 3 6 21 8 0 2 4 6

// +----------high(32bits)-----------+ +----------low(32bits)------------+

// | | | |

// +---------------------------------+ +---------------------------------+

// 3 2 21 1 8 0

// 1 4 09 6

low = frac & 0xffffffff;

sign && (exp |= 0x800);

high = ((frac / 0x100000000) & 0xfffff) | (exp << 20);

rv.push(0xcb, (high >> 24) & 0xff, (high >> 16) & 0xff,

(high >> 8) & 0xff, high & 0xff,

(low >> 24) & 0xff, (low >> 16) & 0xff,

(low >> 8) & 0xff, low & 0xff);

}

break;

case "string":

// http://d.hatena.ne.jp/uupaa/20101128

iz = mix.length;

pos = rv.length; // keep rewrite position

rv.push(0); // placeholder

// utf8.encode

for (i = 0; i < iz; ++i) {

c = mix.charCodeAt(i);

if (c < 0x80) { // ASCII(0x00 ~ 0x7f)

rv.push(c & 0x7f);

} else if (c < 0x0800) {

rv.push(((c >>> 6) & 0x1f) | 0xc0, (c & 0x3f) | 0x80);

} else if (c < 0x10000) {

rv.push(((c >>> 12) & 0x0f) | 0xe0,

((c >>> 6) & 0x3f) | 0x80, (c & 0x3f) | 0x80);

}

size = rv.length - pos - 1;

if (size < 32) {

rv[pos] = 0xa0 + size; // rewrite

} else if (size < 0x10000) { // 16

rv.splice(pos, 1, 0xda, size >> 8, size & 0xff);

} else if (size < 0x100000000) { // 32

rv.splice(pos, 1, 0xdb,

size >>> 24, (size >> 16) & 0xff,

(size >> 8) & 0xff, size & 0xff);

}

break;

default: // array or hash

if (++depth >= _MAX_DEPTH) {

_error = 1; // CYCLIC_REFERENCE_ERROR

return rv = []; // clear

}

if (_isArray(mix)) {

size = mix.length;

if (size < 16) {

rv.push(0x90 + size);

} else if (size < 0x10000) { // 16

rv.push(0xdc, size >> 8, size & 0xff);

} else if (size < 0x100000000) { // 32

rv.push(0xdd, size >>> 24, (size >> 16) & 0xff,

(size >> 8) & 0xff, size & 0xff);

}

for (i = 0; i < size; ++i) {

encode(rv, mix[i], depth);

}

} else { // hash

// http://d.hatena.ne.jp/uupaa/20101129

pos = rv.length; // keep rewrite position

rv.push(0); // placeholder

size = 0;

for (i in mix) {

++size;

encode(rv, i, depth);

encode(rv, mix[i], depth);

}

if (size < 16) {

rv[pos] = 0x80 + size; // rewrite

} else if (size < 0x10000) { // 16

rv.splice(pos, 1, 0xde, size >> 8, size & 0xff);

} else if (size < 0x100000000) { // 32

rv.splice(pos, 1, 0xdf,

size >>> 24, (size >> 16) & 0xff,

(size >> 8) & 0xff, size & 0xff);

}

return rv;

}

// inner - decoder

function decode() { // @return Mix:

var size, i, iz, c, num = 0,

sign, exp, frac, ary, key, hash,

buf = _buf, type = buf[++_idx];

if (type >= 0xe0) { // Negative FixNum (111x xxxx) (-32 ~ -1)

return type - 0x100;

}

if (type < 0xc0) {

if (type < 0x80) { // Positive FixNum (0xxx xxxx) (0 ~ 127)

return type;

}

if (type < 0x90) { // FixMap (1000 xxxx)

num = type - 0x80;

type = 0x80;

} else if (type < 0xa0) { // FixArray (1001 xxxx)

num = type - 0x90;

type = 0x90;

} else { // if (type < 0xc0) { // FixRaw (101x xxxx)

num = type - 0xa0;

type = 0xa0;

}

switch (type) {

case 0xc0: return null;

case 0xc2: return false;

case 0xc3: return true;

case 0xca: // float

num = buf[++_idx] * 0x1000000 + (buf[++_idx] << 16) +

(buf[++_idx] << 8) + buf[++_idx];

sign = num & 0x80000000; // 1bit

exp = (num >> 23) & 0xff; // 8bits

frac = num & 0x7fffff; // 23bits

if (!num || num === 0x80000000) { // 0.0 or -0.0

return 0;

}

if (exp === 0xff) { // NaN or Infinity

return frac ? NaN : Infinity;

}

return (sign ? -1 : 1) *

(frac | 0x800000) * Math.pow(2, exp - 127 - 23); // 127: bias

case 0xcb: // double

num = buf[++_idx] * 0x1000000 + (buf[++_idx] << 16) +

(buf[++_idx] << 8) + buf[++_idx];

sign = num & 0x80000000; // 1bit

exp = (num >> 20) & 0x7ff; // 11bits

frac = num & 0xfffff; // 52bits - 32bits (high word)

if (!num || num === 0x80000000) { // 0.0 or -0.0

_idx += 4;

return 0;

}

if (exp === 0x7ff) { // NaN or Infinity

_idx += 4;

return frac ? NaN : Infinity;

}

num = buf[++_idx] * 0x1000000 + (buf[++_idx] << 16) +

(buf[++_idx] << 8) + buf[++_idx];

return (sign ? -1 : 1) *

((frac | 0x100000) * Math.pow(2, exp - 1023 - 20) // 1023: bias

+ num * Math.pow(2, exp - 1023 - 52));

// 0xcf: uint64, 0xce: uint32, 0xcd: uint16

case 0xcf: num = buf[++_idx] * 0x1000000 + (buf[++_idx] << 16) +

(buf[++_idx] << 8) + buf[++_idx];

return num * 0x100000000 +

buf[++_idx] * 0x1000000 + (buf[++_idx] << 16) +

(buf[++_idx] << 8) + buf[++_idx];

case 0xce: num += buf[++_idx] * 0x1000000 + (buf[++_idx] << 16);

case 0xcd: num += buf[++_idx] << 8;

case 0xcc: return num + buf[++_idx];

// 0xd3: int64, 0xd2: int32, 0xd1: int16, 0xd0: int8

case 0xd3: num = buf[++_idx];

if (num & 0x80) { // sign -> avoid overflow

return ((num ^ 0xff) * 0x100000000000000 +

(buf[++_idx] ^ 0xff) * 0x1000000000000 +

(buf[++_idx] ^ 0xff) * 0x10000000000 +

(buf[++_idx] ^ 0xff) * 0x100000000 +

(buf[++_idx] ^ 0xff) * 0x1000000 +

(buf[++_idx] ^ 0xff) * 0x10000 +

(buf[++_idx] ^ 0xff) * 0x100 +

(buf[++_idx] ^ 0xff) + 1) * -1;

}

return num * 0x100000000000000 +

buf[++_idx] * 0x1000000000000 +

buf[++_idx] * 0x10000000000 +

buf[++_idx] * 0x100000000 +

buf[++_idx] * 0x1000000 +

buf[++_idx] * 0x10000 +

buf[++_idx] * 0x100 +

buf[++_idx];

case 0xd2: num = buf[++_idx] * 0x1000000 + (buf[++_idx] << 16) +

(buf[++_idx] << 8) + buf[++_idx];

return num < 0x80000000 ? num : num - 0x100000000; // 0x80000000 * 2

case 0xd1: num = (buf[++_idx] << 8) + buf[++_idx];

return num < 0x8000 ? num : num - 0x10000; // 0x8000 * 2

case 0xd0: num = buf[++_idx];

return num < 0x80 ? num : num - 0x100; // 0x80 * 2

// 0xdb: raw32, 0xda: raw16, 0xa0: raw ( string )

case 0xdb: num += buf[++_idx] * 0x1000000 + (buf[++_idx] << 16);

case 0xda: num += (buf[++_idx] << 8) + buf[++_idx];

case 0xa0: // utf8.decode

for (ary = [], i = _idx, iz = i + num; i < iz; ) {

c = buf[++i]; // lead byte

ary.push(c < 0x80 ? c : // ASCII(0x00 ~ 0x7f)

c < 0xe0 ? ((c & 0x1f) << 6 | (buf[++i] & 0x3f)) :

((c & 0x0f) << 12 | (buf[++i] & 0x3f) << 6

| (buf[++i] & 0x3f)));

}

_idx = i;

return ary.length < 10240 ? _toString.apply(null, ary)

: byteArrayToByteString(ary);

// 0xdf: map32, 0xde: map16, 0x80: map

case 0xdf: num += buf[++_idx] * 0x1000000 + (buf[++_idx] << 16);

case 0xde: num += (buf[++_idx] << 8) + buf[++_idx];

case 0x80: hash = {};

while (num--) {

// make key/value pair

key = decode();

hash[key] = decode();

}

return hash;

// 0xdd: array32, 0xdc: array16, 0x90: array

case 0xdd: num += buf[++_idx] * 0x1000000 + (buf[++_idx] << 16);

case 0xdc: num += (buf[++_idx] << 8) + buf[++_idx];

case 0x90: ary = [];

while (num--) {

ary.push(decode());

}

return ary;

}

return;

}

// inner - byteArray To ByteString

function byteArrayToByteString(byteArray) { // @param ByteArray

// @return String

// http://d.hatena.ne.jp/uupaa/20101128

try {

return _toString.apply(this, byteArray); // toString

} catch(err) {

; // avoid "Maximum call stack size exceeded"

}

var rv = [], i = 0, iz = byteArray.length, num2bin = _num2bin;

for (; i < iz; ++i) {

rv[i] = num2bin[byteArray[i]];

}

return rv.join("");

}

// inner - BinaryString To ByteArray

function toByteArray(data) { // @param BinaryString: "\00\01"

// @return ByteArray: [0x00, 0x01]

var rv = [], bin2num = _bin2num, remain,

ary = data.split(""),

i = -1, iz;

iz = ary.length;

remain = iz % 8;

while (remain--) {

++i;

rv[i] = bin2num[ary[i]];

}

remain = iz >> 3;

while (remain--) {

rv.push(bin2num[ary[++i]], bin2num[ary[++i]],

bin2num[ary[++i]], bin2num[ary[++i]],

bin2num[ary[++i]], bin2num[ary[++i]]);

}

return rv;

}

// --- init ---

(function() {

var i = 0, v;

for (; i < 0x100; ++i) {

v = _toString(i);

_bin2num[v] = i; // "\00" -> 0x00

_num2bin[i] = v; // 0 -> "\00"

}

// http://twitter.com/edvakf/statuses/15576483807

for (i = 0x80; i < 0x100; ++i) { // [Webkit][Gecko]

_bin2num[_toString(0xf700 + i)] = i; // "\f780" -> 0x80

}

})();

})(this);

msgpack-javascript/msgpack.codec.js at master · lfdoherty/msgpack-javascript · GitHub

Expand file tree

Breadcrumbs

msgpack.codec.js

Latest commit

History

Breadcrumbs

msgpack.codec.js

File metadata and controls