msgpack/python/msgpack/unpack_template.h at java-0.5.1 · WanderWalker/msgpack · GitHub

Repository navigation

History

385 lines (334 loc) · 10.2 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

* MessagePack unpacking routine template

* Licensed under the Apache License, Version 2.0 (the "License");

* you may not use this file except in compliance with the License.

* You may obtain a copy of the License at

* http://www.apache.org/licenses/LICENSE-2.0

* Unless required by applicable law or agreed to in writing, software

* distributed under the License is distributed on an "AS IS" BASIS,

* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.

* See the License for the specific language governing permissions and

* limitations under the License.

#ifndef msgpack_unpack_func

#error msgpack_unpack_func template is not defined

#endif

#ifndef msgpack_unpack_callback

#error msgpack_unpack_callback template is not defined

#endif

#ifndef msgpack_unpack_struct

#error msgpack_unpack_struct template is not defined

#endif

#ifndef msgpack_unpack_struct_decl

#define msgpack_unpack_struct_decl(name) msgpack_unpack_struct(name)

#endif

#ifndef msgpack_unpack_object

#error msgpack_unpack_object type is not defined

#endif

#ifndef msgpack_unpack_user

#error msgpack_unpack_user type is not defined

#endif

#ifndef USE_CASE_RANGE

#if !defined(_MSC_VER)

#define USE_CASE_RANGE

#endif

msgpack_unpack_struct_decl(_stack) {

msgpack_unpack_object obj;

size_t count;

unsigned int ct;

union {

size_t curr;

msgpack_unpack_object map_key;

};

msgpack_unpack_struct_decl(_context) {

msgpack_unpack_user user;

unsigned int cs;

unsigned int trail;

unsigned int top;

msgpack_unpack_struct(_stack) stack[MSGPACK_MAX_STACK_SIZE];

};

msgpack_unpack_func(void, _init)(msgpack_unpack_struct(_context)* ctx)

{

ctx->cs = CS_HEADER;

ctx->trail = 0;

ctx->top = 0;

ctx->stack[0].obj = msgpack_unpack_callback(_root)(&ctx->user);

}

msgpack_unpack_func(msgpack_unpack_object, _data)(msgpack_unpack_struct(_context)* ctx)

{

return (ctx)->stack[0].obj;

}

msgpack_unpack_func(int, _execute)(msgpack_unpack_struct(_context)* ctx, const char* data, size_t len, size_t* off)

{

assert(len >= *off);

const unsigned char* p = (unsigned char*)data + *off;

const unsigned char* const pe = (unsigned char*)data + len;

const void* n = NULL;

unsigned int trail = ctx->trail;

unsigned int cs = ctx->cs;

unsigned int top = ctx->top;

msgpack_unpack_struct(_stack)* stack = ctx->stack;

msgpack_unpack_user* user = &ctx->user;

msgpack_unpack_object obj;

msgpack_unpack_struct(_stack)* c = NULL;

int ret;

#define push_simple_value(func) \

if(msgpack_unpack_callback(func)(user, &obj) < 0) { goto _failed; } \

goto _push

#define push_fixed_value(func, arg) \

if(msgpack_unpack_callback(func)(user, arg, &obj) < 0) { goto _failed; } \

goto _push

#define push_variable_value(func, base, pos, len) \

if(msgpack_unpack_callback(func)(user, \

(const char*)base, (const char*)pos, len, &obj) < 0) { goto _failed; } \

goto _push

#define again_fixed_trail(_cs, trail_len) \

trail = trail_len; \

cs = _cs; \

goto _fixed_trail_again

#define again_fixed_trail_if_zero(_cs, trail_len, ifzero) \

trail = trail_len; \

if(trail == 0) { goto ifzero; } \

cs = _cs; \

goto _fixed_trail_again

#define start_container(func, count_, ct_) \

if(msgpack_unpack_callback(func)(user, count_, &stack[top].obj) < 0) { goto _failed; } \

if((count_) == 0) { obj = stack[top].obj; goto _push; } \

if(top >= MSGPACK_MAX_STACK_SIZE) { goto _failed; } \

stack[top].ct = ct_; \

stack[top].curr = 0; \

stack[top].count = count_; \

/*printf("container %d count %d stack %d\n",stack[top].obj,count_,top);*/ \

/*printf("stack push %d\n", top);*/ \

++top; \

goto _header_again

#define NEXT_CS(p) \

((unsigned int)*p & 0x1f)

#define PTR_CAST_8(ptr) (*(uint8_t*)ptr)

#define PTR_CAST_16(ptr) _msgpack_be16(*(uint16_t*)ptr)

#define PTR_CAST_32(ptr) _msgpack_be32(*(uint32_t*)ptr)

#define PTR_CAST_64(ptr) _msgpack_be64(*(uint64_t*)ptr)

#ifdef USE_CASE_RANGE

#define SWITCH_RANGE_BEGIN switch(*p) {

#define SWITCH_RANGE(FROM, TO) case FROM ... TO:

#define SWITCH_RANGE_DEFAULT default:

#define SWITCH_RANGE_END }

#else

#define SWITCH_RANGE_BEGIN { if(0) {

#define SWITCH_RANGE(FROM, TO) } else if(FROM <= *p && *p <= TO) {

#define SWITCH_RANGE_DEFAULT } else {

#define SWITCH_RANGE_END } }

#endif

if(p == pe) { goto _out; }

do {

switch(cs) {

case CS_HEADER:

SWITCH_RANGE_BEGIN

SWITCH_RANGE(0x00, 0x7f) // Positive Fixnum

push_fixed_value(_uint8, *(uint8_t*)p);

SWITCH_RANGE(0xe0, 0xff) // Negative Fixnum

push_fixed_value(_int8, *(int8_t*)p);

SWITCH_RANGE(0xc0, 0xdf) // Variable

switch(*p) {

case 0xc0: // nil

push_simple_value(_nil);

//case 0xc1: // string

// again_terminal_trail(NEXT_CS(p), p+1);

case 0xc2: // false

push_simple_value(_false);

case 0xc3: // true

push_simple_value(_true);

//case 0xc4:

//case 0xc5:

//case 0xc6:

//case 0xc7:

//case 0xc8:

//case 0xc9:

case 0xca: // float

case 0xcb: // double

case 0xcc: // unsigned int 8

case 0xcd: // unsigned int 16

case 0xce: // unsigned int 32

case 0xcf: // unsigned int 64

case 0xd0: // signed int 8

case 0xd1: // signed int 16

case 0xd2: // signed int 32

case 0xd3: // signed int 64

again_fixed_trail(NEXT_CS(p), 1 << (((unsigned int)*p) & 0x03));

//case 0xd4:

//case 0xd5:

//case 0xd6: // big integer 16

//case 0xd7: // big integer 32

//case 0xd8: // big float 16

//case 0xd9: // big float 32

case 0xda: // raw 16

case 0xdb: // raw 32

case 0xdc: // array 16

case 0xdd: // array 32

case 0xde: // map 16

case 0xdf: // map 32

again_fixed_trail(NEXT_CS(p), 2 << (((unsigned int)*p) & 0x01));

default:

goto _failed;

}

SWITCH_RANGE(0xa0, 0xbf) // FixRaw

again_fixed_trail_if_zero(ACS_RAW_VALUE, ((unsigned int)*p & 0x1f), _raw_zero);

SWITCH_RANGE(0x90, 0x9f) // FixArray

start_container(_array, ((unsigned int)*p) & 0x0f, CT_ARRAY_ITEM);

SWITCH_RANGE(0x80, 0x8f) // FixMap

start_container(_map, ((unsigned int)*p) & 0x0f, CT_MAP_KEY);

SWITCH_RANGE_DEFAULT

goto _failed;

SWITCH_RANGE_END

// end CS_HEADER

_fixed_trail_again:

++p;

default:

if((size_t)(pe - p) < trail) { goto _out; }

n = p; p += trail - 1;

switch(cs) {

//case CS_

case CS_FLOAT: {

union { uint32_t num; char buf[4]; } f;

f.num = PTR_CAST_32(n); // FIXME

push_fixed_value(_float, *((float*)f.buf)); }

case CS_DOUBLE: {

union { uint64_t num; char buf[8]; } f;

f.num = PTR_CAST_64(n); // FIXME

push_fixed_value(_double, *((double*)f.buf)); }

case CS_UINT_8:

push_fixed_value(_uint8, (uint8_t)PTR_CAST_8(n));

case CS_UINT_16:

push_fixed_value(_uint16, (uint16_t)PTR_CAST_16(n));

case CS_UINT_32:

push_fixed_value(_uint32, (uint32_t)PTR_CAST_32(n));

case CS_UINT_64:

push_fixed_value(_uint64, (uint64_t)PTR_CAST_64(n));

case CS_INT_8:

push_fixed_value(_int8, (int8_t)PTR_CAST_8(n));

case CS_INT_16:

push_fixed_value(_int16, (int16_t)PTR_CAST_16(n));

case CS_INT_32:

push_fixed_value(_int32, (int32_t)PTR_CAST_32(n));

case CS_INT_64:

push_fixed_value(_int64, (int64_t)PTR_CAST_64(n));

//case CS_

//case CS_BIG_INT_16:

// again_fixed_trail_if_zero(ACS_BIG_INT_VALUE, (uint16_t)PTR_CAST_16(n), _big_int_zero);

//case CS_BIG_INT_32:

// again_fixed_trail_if_zero(ACS_BIG_INT_VALUE, (uint32_t)PTR_CAST_32(n), _big_int_zero);

//case ACS_BIG_INT_VALUE:

//_big_int_zero:

// // FIXME

// push_variable_value(_big_int, data, n, trail);

//case CS_BIG_FLOAT_16:

// again_fixed_trail_if_zero(ACS_BIG_FLOAT_VALUE, (uint16_t)PTR_CAST_16(n), _big_float_zero);

//case CS_BIG_FLOAT_32:

// again_fixed_trail_if_zero(ACS_BIG_FLOAT_VALUE, (uint32_t)PTR_CAST_32(n), _big_float_zero);

//case ACS_BIG_FLOAT_VALUE:

//_big_float_zero:

// // FIXME

// push_variable_value(_big_float, data, n, trail);

case CS_RAW_16:

again_fixed_trail_if_zero(ACS_RAW_VALUE, (uint16_t)PTR_CAST_16(n), _raw_zero);

case CS_RAW_32:

again_fixed_trail_if_zero(ACS_RAW_VALUE, (uint32_t)PTR_CAST_32(n), _raw_zero);

case ACS_RAW_VALUE:

_raw_zero:

push_variable_value(_raw, data, n, trail);

case CS_ARRAY_16:

start_container(_array, (uint16_t)PTR_CAST_16(n), CT_ARRAY_ITEM);

case CS_ARRAY_32:

/* FIXME security guard */

start_container(_array, (uint32_t)PTR_CAST_32(n), CT_ARRAY_ITEM);

case CS_MAP_16:

start_container(_map, (uint16_t)PTR_CAST_16(n), CT_MAP_KEY);

case CS_MAP_32:

/* FIXME security guard */

start_container(_map, (uint32_t)PTR_CAST_32(n), CT_MAP_KEY);

default:

goto _failed;

}

_push:

if(top == 0) { goto _finish; }

c = &stack[top-1];

switch(c->ct) {

case CT_ARRAY_ITEM:

if(msgpack_unpack_callback(_array_item)(user, c->curr, &c->obj, obj) < 0) { goto _failed; }

if(++c->curr == c->count) {

msgpack_unpack_callback(_array_end)(user, &c->obj);

obj = c->obj;

--top;

/*printf("stack pop %d\n", top);*/

goto _push;

}

goto _header_again;

case CT_MAP_KEY:

c->map_key = obj;

c->ct = CT_MAP_VALUE;

goto _header_again;

case CT_MAP_VALUE:

if(msgpack_unpack_callback(_map_item)(user, &c->obj, c->map_key, obj) < 0) { goto _failed; }

if(--c->count == 0) {

msgpack_unpack_callback(_map_end)(user, &c->obj);

obj = c->obj;

--top;

/*printf("stack pop %d\n", top);*/

goto _push;

}

c->ct = CT_MAP_KEY;

goto _header_again;

default:

goto _failed;

}

_header_again:

cs = CS_HEADER;

++p;

} while(p != pe);

goto _out;

_finish:

stack[0].obj = obj;

++p;

ret = 1;

/*printf("-- finish --\n"); */

goto _end;

_failed:

/*printf("** FAILED **\n"); */

ret = -1;

goto _end;

_out:

ret = 0;

goto _end;

_end:

ctx->cs = cs;

ctx->trail = trail;

ctx->top = top;

*off = p - (const unsigned char*)data;

return ret;

}

#undef msgpack_unpack_func

#undef msgpack_unpack_callback

#undef msgpack_unpack_struct

#undef msgpack_unpack_object

#undef msgpack_unpack_user

#undef push_simple_value

#undef push_fixed_value

#undef push_variable_value

#undef again_fixed_trail

#undef again_fixed_trail_if_zero

#undef start_container

#undef NEXT_CS

#undef PTR_CAST_8

#undef PTR_CAST_16

#undef PTR_CAST_32

#undef PTR_CAST_64

msgpack/python/msgpack/unpack_template.h at java-0.5.1 · WanderWalker/msgpack · GitHub

Repository navigation

Expand file tree

Breadcrumbs

unpack_template.h

Latest commit

History

Breadcrumbs

unpack_template.h

File metadata and controls