sqlcipher/src/json.c at master · strixcode/sqlcipher · GitHub

History

2699 lines (2575 loc) · 77.7 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

420

421

422

423

424

425

426

427

428

429

430

431

432

433

434

435

436

437

438

439

440

441

442

443

444

445

446

447

448

449

450

451

452

453

454

455

456

457

458

459

460

461

462

463

464

465

466

467

468

469

470

471

472

473

474

475

476

477

478

479

480

481

482

483

484

485

486

487

488

489

490

491

492

493

494

495

496

497

498

499

500

501

502

503

504

505

506

507

508

509

510

511

512

513

514

515

516

517

518

519

520

521

522

523

524

525

526

527

528

529

530

531

532

533

534

535

536

537

538

539

540

541

542

543

544

545

546

547

548

549

550

551

552

553

554

555

556

557

558

559

560

561

562

563

564

565

566

567

568

569

570

571

572

573

574

575

576

577

578

579

580

581

582

583

584

585

586

587

588

589

590

591

592

593

594

595

596

597

598

599

600

601

602

603

604

605

606

607

608

609

610

611

612

613

614

615

616

617

618

619

620

621

622

623

624

625

626

627

628

629

630

631

632

633

634

635

636

637

638

639

640

641

642

643

644

645

646

647

648

649

650

651

652

653

654

655

656

657

658

659

660

661

662

663

664

665

666

667

668

669

670

671

672

673

674

675

676

677

678

679

680

681

682

683

684

685

686

687

688

689

690

691

692

693

694

695

696

697

698

699

700

701

702

703

704

705

706

707

708

709

710

711

712

713

714

715

716

717

718

719

720

721

722

723

724

725

726

727

728

729

730

731

732

733

734

735

736

737

738

739

740

741

742

743

744

745

746

747

748

749

750

751

752

753

754

755

756

757

758

759

760

761

762

763

764

765

766

767

768

769

770

771

772

773

774

775

776

777

778

779

780

781

782

783

784

785

786

787

788

789

790

791

792

793

794

795

796

797

798

799

800

801

802

803

804

805

806

807

808

809

810

811

812

813

814

815

816

817

818

819

820

821

822

823

824

825

826

827

828

829

830

831

832

833

834

835

836

837

838

839

840

841

842

843

844

845

846

847

848

849

850

851

852

853

854

855

856

857

858

859

860

861

862

863

864

865

866

867

868

869

870

871

872

873

874

875

876

877

878

879

880

881

882

883

884

885

886

887

888

889

890

891

892

893

894

895

896

897

898

899

900

901

902

903

904

905

906

907

908

909

910

911

912

913

914

915

916

917

918

919

920

921

922

923

924

925

926

927

928

929

930

931

932

933

934

935

936

937

938

939

940

941

942

943

944

945

946

947

948

949

950

951

952

953

954

955

956

957

958

959

960

961

962

963

964

965

966

967

968

969

970

971

972

973

974

975

976

977

978

979

980

981

982

983

984

985

986

987

988

989

990

991

992

993

994

995

996

997

998

999

1000

** 2015-08-12

** The author disclaims copyright to this source code. In place of

** a legal notice, here is a blessing:

** May you do good and not evil.

** May you find forgiveness for yourself and forgive others.

** May you share freely, never taking more than you give.

******************************************************************************

** This SQLite JSON functions.

** This file began as an extension in ext/misc/json1.c in 2015. That

** extension proved so useful that it has now been moved into the core.

** For the time being, all JSON is stored as pure text. (We might add

** a JSONB type in the future which stores a binary encoding of JSON in

** a BLOB, but there is no support for JSONB in the current implementation.

** This implementation parses JSON text at 250 MB/s, so it is hard to see

** how JSONB might improve on that.)

#ifndef SQLITE_OMIT_JSON

#include "sqliteInt.h"

** Growing our own isspace() routine this way is twice as fast as

** the library isspace() function, resulting in a 7% overall performance

** increase for the parser. (Ubuntu14.10 gcc 4.8.4 x64 with -Os).

static const char jsonIsSpace[] = {

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0,

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,

1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,

};

#define fast_isspace(x) (jsonIsSpace[(unsigned char)x])

#if !defined(SQLITE_DEBUG) && !defined(SQLITE_COVERAGE_TEST)

# define VVA(X)

#else

# define VVA(X) X

#endif

/* Objects */

typedef struct JsonString JsonString;

typedef struct JsonNode JsonNode;

typedef struct JsonParse JsonParse;

/* An instance of this object represents a JSON string

** under construction. Really, this is a generic string accumulator

** that can be and is used to create strings other than JSON.

struct JsonString {

sqlite3_context *pCtx; /* Function context - put error messages here */

char *zBuf; /* Append JSON content here */

u64 nAlloc; /* Bytes of storage available in zBuf[] */

u64 nUsed; /* Bytes of zBuf[] currently used */

u8 bStatic; /* True if zBuf is static space */

u8 bErr; /* True if an error has been encountered */

char zSpace[100]; /* Initial static space */

};

/* JSON type values

#define JSON_NULL 0

#define JSON_TRUE 1

#define JSON_FALSE 2

#define JSON_INT 3

#define JSON_REAL 4

#define JSON_STRING 5

#define JSON_ARRAY 6

#define JSON_OBJECT 7

/* The "subtype" set for JSON values */

#define JSON_SUBTYPE 74 /* Ascii for "J" */

** Names of the various JSON types:

static const char * const jsonType[] = {

"null", "true", "false", "integer", "real", "text", "array", "object"

};

/* Bit values for the JsonNode.jnFlag field

#define JNODE_RAW 0x01 /* Content is raw, not JSON encoded */

#define JNODE_ESCAPE 0x02 /* Content is text with \ escapes */

#define JNODE_REMOVE 0x04 /* Do not output */

#define JNODE_REPLACE 0x08 /* Replace with JsonNode.u.iReplace */

#define JNODE_PATCH 0x10 /* Patch with JsonNode.u.pPatch */

#define JNODE_APPEND 0x20 /* More ARRAY/OBJECT entries at u.iAppend */

#define JNODE_LABEL 0x40 /* Is a label of an object */

/* A single node of parsed JSON

struct JsonNode {

u8 eType; /* One of the JSON_ type values */

u8 jnFlags; /* JNODE flags */

u8 eU; /* Which union element to use */

u32 n; /* Bytes of content, or number of sub-nodes */

union {

const char *zJContent; /* 1: Content for INT, REAL, and STRING */

u32 iAppend; /* 2: More terms for ARRAY and OBJECT */

u32 iKey; /* 3: Key for ARRAY objects in json_tree() */

u32 iReplace; /* 4: Replacement content for JNODE_REPLACE */

JsonNode *pPatch; /* 5: Node chain of patch for JNODE_PATCH */

} u;

};

/* A completely parsed JSON string

struct JsonParse {

u32 nNode; /* Number of slots of aNode[] used */

u32 nAlloc; /* Number of slots of aNode[] allocated */

JsonNode *aNode; /* Array of nodes containing the parse */

const char *zJson; /* Original JSON string */

u32 *aUp; /* Index of parent of each node */

u8 oom; /* Set to true if out of memory */

u8 nErr; /* Number of errors seen */

u16 iDepth; /* Nesting depth */

int nJson; /* Length of the zJson string in bytes */

u32 iHold; /* Replace cache line with the lowest iHold value */

};

** Maximum nesting depth of JSON for this implementation.

** This limit is needed to avoid a stack overflow in the recursive

** descent parser. A depth of 2000 is far deeper than any sane JSON

** should go.

#define JSON_MAX_DEPTH 2000

/**************************************************************************

** Utility routines for dealing with JsonString objects

**************************************************************************/

/* Set the JsonString object to an empty string

static void jsonZero(JsonString *p){

p->zBuf = p->zSpace;

p->nAlloc = sizeof(p->zSpace);

p->nUsed = 0;

p->bStatic = 1;

}

/* Initialize the JsonString object

static void jsonInit(JsonString *p, sqlite3_context *pCtx){

p->pCtx = pCtx;

p->bErr = 0;

jsonZero(p);

}

/* Free all allocated memory and reset the JsonString object back to its

** initial state.

static void jsonReset(JsonString *p){

if( !p->bStatic ) sqlite3_free(p->zBuf);

jsonZero(p);

}

/* Report an out-of-memory (OOM) condition

static void jsonOom(JsonString *p){

p->bErr = 1;

sqlite3_result_error_nomem(p->pCtx);

jsonReset(p);

}

/* Enlarge pJson->zBuf so that it can hold at least N more bytes.

** Return zero on success. Return non-zero on an OOM error

static int jsonGrow(JsonString *p, u32 N){

u64 nTotal = N<p->nAlloc ? p->nAlloc*2 : p->nAlloc+N+10;

char *zNew;

if( p->bStatic ){

if( p->bErr ) return 1;

zNew = sqlite3_malloc64(nTotal);

if( zNew==0 ){

jsonOom(p);

return SQLITE_NOMEM;

}

memcpy(zNew, p->zBuf, (size_t)p->nUsed);

p->zBuf = zNew;

p->bStatic = 0;

}else{

zNew = sqlite3_realloc64(p->zBuf, nTotal);

if( zNew==0 ){

jsonOom(p);

return SQLITE_NOMEM;

}

p->zBuf = zNew;

}

p->nAlloc = nTotal;

return SQLITE_OK;

}

/* Append N bytes from zIn onto the end of the JsonString string.

static void jsonAppendRaw(JsonString *p, const char *zIn, u32 N){

if( N==0 ) return;

if( (N+p->nUsed >= p->nAlloc) && jsonGrow(p,N)!=0 ) return;

memcpy(p->zBuf+p->nUsed, zIn, N);

p->nUsed += N;

}

/* Append formatted text (not to exceed N bytes) to the JsonString.

static void jsonPrintf(int N, JsonString *p, const char *zFormat, ...){

va_list ap;

if( (p->nUsed + N >= p->nAlloc) && jsonGrow(p, N) ) return;

va_start(ap, zFormat);

sqlite3_vsnprintf(N, p->zBuf+p->nUsed, zFormat, ap);

va_end(ap);

p->nUsed += (int)strlen(p->zBuf+p->nUsed);

}

/* Append a single character

static void jsonAppendChar(JsonString *p, char c){

if( p->nUsed>=p->nAlloc && jsonGrow(p,1)!=0 ) return;

p->zBuf[p->nUsed++] = c;

}

/* Append a comma separator to the output buffer, if the previous

** character is not '[' or '{'.

static void jsonAppendSeparator(JsonString *p){

char c;

if( p->nUsed==0 ) return;

c = p->zBuf[p->nUsed-1];

if( c!='[' && c!='{' ) jsonAppendChar(p, ',');

}

/* Append the N-byte string in zIn to the end of the JsonString string

** under construction. Enclose the string in "..." and escape

** any double-quotes or backslash characters contained within the

** string.

static void jsonAppendString(JsonString *p, const char *zIn, u32 N){

u32 i;

if( zIn==0 || ((N+p->nUsed+2 >= p->nAlloc) && jsonGrow(p,N+2)!=0) ) return;

p->zBuf[p->nUsed++] = '"';

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

unsigned char c = ((unsigned const char*)zIn)[i];

if( c=='"' || c=='\\' ){

json_simple_escape:

if( (p->nUsed+N+3-i > p->nAlloc) && jsonGrow(p,N+3-i)!=0 ) return;

p->zBuf[p->nUsed++] = '\\';

}else if( c<=0x1f ){

static const char aSpecial[] = {

0, 0, 0, 0, 0, 0, 0, 0, 'b', 't', 'n', 0, 'f', 'r', 0, 0,

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

};

assert( sizeof(aSpecial)==32 );

assert( aSpecial['\b']=='b' );

assert( aSpecial['\f']=='f' );

assert( aSpecial['\n']=='n' );

assert( aSpecial['\r']=='r' );

assert( aSpecial['\t']=='t' );

if( aSpecial[c] ){

c = aSpecial[c];

goto json_simple_escape;

}

if( (p->nUsed+N+7+i > p->nAlloc) && jsonGrow(p,N+7-i)!=0 ) return;

p->zBuf[p->nUsed++] = '\\';

p->zBuf[p->nUsed++] = 'u';

p->zBuf[p->nUsed++] = '0';

p->zBuf[p->nUsed++] = '0' + (c>>4);

c = "0123456789abcdef"[c&0xf];

}

p->zBuf[p->nUsed++] = c;

}

p->zBuf[p->nUsed++] = '"';

assert( p->nUsed<p->nAlloc );

}

** Append a function parameter value to the JSON string under

** construction.

static void jsonAppendValue(

JsonString *p, /* Append to this JSON string */

sqlite3_value *pValue /* Value to append */

){

switch( sqlite3_value_type(pValue) ){

case SQLITE_NULL: {

jsonAppendRaw(p, "null", 4);

break;

}

case SQLITE_INTEGER:

case SQLITE_FLOAT: {

const char *z = (const char*)sqlite3_value_text(pValue);

u32 n = (u32)sqlite3_value_bytes(pValue);

jsonAppendRaw(p, z, n);

break;

}

case SQLITE_TEXT: {

const char *z = (const char*)sqlite3_value_text(pValue);

u32 n = (u32)sqlite3_value_bytes(pValue);

if( sqlite3_value_subtype(pValue)==JSON_SUBTYPE ){

jsonAppendRaw(p, z, n);

}else{

jsonAppendString(p, z, n);

}

break;

}

default: {

if( p->bErr==0 ){

sqlite3_result_error(p->pCtx, "JSON cannot hold BLOB values", -1);

p->bErr = 2;

jsonReset(p);

}

break;

}

/* Make the JSON in p the result of the SQL function.

static void jsonResult(JsonString *p){

if( p->bErr==0 ){

sqlite3_result_text64(p->pCtx, p->zBuf, p->nUsed,

p->bStatic ? SQLITE_TRANSIENT : sqlite3_free,

SQLITE_UTF8);

jsonZero(p);

}

assert( p->bStatic );

}

/**************************************************************************

** Utility routines for dealing with JsonNode and JsonParse objects

**************************************************************************/

** Return the number of consecutive JsonNode slots need to represent

** the parsed JSON at pNode. The minimum answer is 1. For ARRAY and

** OBJECT types, the number might be larger.

** Appended elements are not counted. The value returned is the number

** by which the JsonNode counter should increment in order to go to the

** next peer value.

static u32 jsonNodeSize(JsonNode *pNode){

return pNode->eType>=JSON_ARRAY ? pNode->n+1 : 1;

}

** Reclaim all memory allocated by a JsonParse object. But do not

** delete the JsonParse object itself.

static void jsonParseReset(JsonParse *pParse){

sqlite3_free(pParse->aNode);

pParse->aNode = 0;

pParse->nNode = 0;

pParse->nAlloc = 0;

sqlite3_free(pParse->aUp);

pParse->aUp = 0;

}

** Free a JsonParse object that was obtained from sqlite3_malloc().

static void jsonParseFree(JsonParse *pParse){

jsonParseReset(pParse);

sqlite3_free(pParse);

}

** Convert the JsonNode pNode into a pure JSON string and

** append to pOut. Subsubstructure is also included. Return

** the number of JsonNode objects that are encoded.

static void jsonRenderNode(

JsonNode *pNode, /* The node to render */

JsonString *pOut, /* Write JSON here */

sqlite3_value **aReplace /* Replacement values */

){

assert( pNode!=0 );

if( pNode->jnFlags & (JNODE_REPLACE|JNODE_PATCH) ){

if( (pNode->jnFlags & JNODE_REPLACE)!=0 && ALWAYS(aReplace!=0) ){

assert( pNode->eU==4 );

jsonAppendValue(pOut, aReplace[pNode->u.iReplace]);

return;

}

assert( pNode->eU==5 );

pNode = pNode->u.pPatch;

}

switch( pNode->eType ){

default: {

assert( pNode->eType==JSON_NULL );

jsonAppendRaw(pOut, "null", 4);

break;

}

case JSON_TRUE: {

jsonAppendRaw(pOut, "true", 4);

break;

}

case JSON_FALSE: {

jsonAppendRaw(pOut, "false", 5);

break;

}

case JSON_STRING: {

if( pNode->jnFlags & JNODE_RAW ){

assert( pNode->eU==1 );

jsonAppendString(pOut, pNode->u.zJContent, pNode->n);

break;

}

/* no break */ deliberate_fall_through

}

case JSON_REAL:

case JSON_INT: {

assert( pNode->eU==1 );

jsonAppendRaw(pOut, pNode->u.zJContent, pNode->n);

break;

}

case JSON_ARRAY: {

u32 j = 1;

jsonAppendChar(pOut, '[');

for(;;){

while( j<=pNode->n ){

if( (pNode[j].jnFlags & JNODE_REMOVE)==0 ){

jsonAppendSeparator(pOut);

jsonRenderNode(&pNode[j], pOut, aReplace);

}

j += jsonNodeSize(&pNode[j]);

}

if( (pNode->jnFlags & JNODE_APPEND)==0 ) break;

assert( pNode->eU==2 );

pNode = &pNode[pNode->u.iAppend];

j = 1;

}

jsonAppendChar(pOut, ']');

break;

}

case JSON_OBJECT: {

u32 j = 1;

jsonAppendChar(pOut, '{');

for(;;){

while( j<=pNode->n ){

if( (pNode[j+1].jnFlags & JNODE_REMOVE)==0 ){

jsonAppendSeparator(pOut);

jsonRenderNode(&pNode[j], pOut, aReplace);

jsonAppendChar(pOut, ':');

jsonRenderNode(&pNode[j+1], pOut, aReplace);

}

j += 1 + jsonNodeSize(&pNode[j+1]);

}

if( (pNode->jnFlags & JNODE_APPEND)==0 ) break;

assert( pNode->eU==2 );

pNode = &pNode[pNode->u.iAppend];

j = 1;

}

jsonAppendChar(pOut, '}');

break;

}

** Return a JsonNode and all its descendents as a JSON string.

static void jsonReturnJson(

JsonNode *pNode, /* Node to return */

sqlite3_context *pCtx, /* Return value for this function */

sqlite3_value **aReplace /* Array of replacement values */

){

JsonString s;

jsonInit(&s, pCtx);

jsonRenderNode(pNode, &s, aReplace);

jsonResult(&s);

sqlite3_result_subtype(pCtx, JSON_SUBTYPE);

}

** Translate a single byte of Hex into an integer.

** This routine only works if h really is a valid hexadecimal

** character: 0..9a..fA..F

static u8 jsonHexToInt(int h){

assert( (h>='0' && h<='9') || (h>='a' && h<='f') || (h>='A' && h<='F') );

#ifdef SQLITE_EBCDIC

h += 9*(1&~(h>>4));

#else

h += 9*(1&(h>>6));

#endif

return (u8)(h & 0xf);

}

** Convert a 4-byte hex string into an integer

static u32 jsonHexToInt4(const char *z){

u32 v;

assert( sqlite3Isxdigit(z[0]) );

assert( sqlite3Isxdigit(z[1]) );

assert( sqlite3Isxdigit(z[2]) );

assert( sqlite3Isxdigit(z[3]) );

v = (jsonHexToInt(z[0])<<12)

+ (jsonHexToInt(z[1])<<8)

+ (jsonHexToInt(z[2])<<4)

+ jsonHexToInt(z[3]);

return v;

}

** Make the JsonNode the return value of the function.

static void jsonReturn(

JsonNode *pNode, /* Node to return */

sqlite3_context *pCtx, /* Return value for this function */

sqlite3_value **aReplace /* Array of replacement values */

){

switch( pNode->eType ){

default: {

assert( pNode->eType==JSON_NULL );

sqlite3_result_null(pCtx);

break;

}

case JSON_TRUE: {

sqlite3_result_int(pCtx, 1);

break;

}

case JSON_FALSE: {

sqlite3_result_int(pCtx, 0);

break;

}

case JSON_INT: {

sqlite3_int64 i = 0;

const char *z;

assert( pNode->eU==1 );

z = pNode->u.zJContent;

if( z[0]=='-' ){ z++; }

while( z[0]>='0' && z[0]<='9' ){

unsigned v = *(z++) - '0';

if( i>=LARGEST_INT64/10 ){

if( i>LARGEST_INT64/10 ) goto int_as_real;

if( z[0]>='0' && z[0]<='9' ) goto int_as_real;

if( v==9 ) goto int_as_real;

if( v==8 ){

if( pNode->u.zJContent[0]=='-' ){

sqlite3_result_int64(pCtx, SMALLEST_INT64);

goto int_done;

}else{

goto int_as_real;

}

i = i*10 + v;

}

if( pNode->u.zJContent[0]=='-' ){ i = -i; }

sqlite3_result_int64(pCtx, i);

int_done:

break;

int_as_real: ; /* no break */ deliberate_fall_through

}

case JSON_REAL: {

double r;

#ifdef SQLITE_AMALGAMATION

const char *z;

assert( pNode->eU==1 );

z = pNode->u.zJContent;

sqlite3AtoF(z, &r, sqlite3Strlen30(z), SQLITE_UTF8);

#else

assert( pNode->eU==1 );

r = strtod(pNode->u.zJContent, 0);

#endif

sqlite3_result_double(pCtx, r);

break;

}

case JSON_STRING: {

#if 0 /* Never happens because JNODE_RAW is only set by json_set(),

** json_insert() and json_replace() and those routines do not

** call jsonReturn() */

if( pNode->jnFlags & JNODE_RAW ){

assert( pNode->eU==1 );

sqlite3_result_text(pCtx, pNode->u.zJContent, pNode->n,

SQLITE_TRANSIENT);

}else

#endif

assert( (pNode->jnFlags & JNODE_RAW)==0 );

if( (pNode->jnFlags & JNODE_ESCAPE)==0 ){

/* JSON formatted without any backslash-escapes */

assert( pNode->eU==1 );

sqlite3_result_text(pCtx, pNode->u.zJContent+1, pNode->n-2,

SQLITE_TRANSIENT);

}else{

/* Translate JSON formatted string into raw text */

u32 i;

u32 n = pNode->n;

const char *z;

char *zOut;

u32 j;

assert( pNode->eU==1 );

z = pNode->u.zJContent;

zOut = sqlite3_malloc( n+1 );

if( zOut==0 ){

sqlite3_result_error_nomem(pCtx);

break;

}

for(i=1, j=0; i<n-1; i++){

char c = z[i];

if( c!='\\' ){

zOut[j++] = c;

}else{

c = z[++i];

if( c=='u' ){

u32 v = jsonHexToInt4(z+i+1);

i += 4;

if( v==0 ) break;

if( v<=0x7f ){

zOut[j++] = (char)v;

}else if( v<=0x7ff ){

zOut[j++] = (char)(0xc0 | (v>>6));

zOut[j++] = 0x80 | (v&0x3f);

}else{

u32 vlo;

if( (v&0xfc00)==0xd800

&& i<n-6

&& z[i+1]=='\\'

&& z[i+2]=='u'

&& ((vlo = jsonHexToInt4(z+i+3))&0xfc00)==0xdc00

){

/* We have a surrogate pair */

v = ((v&0x3ff)<<10) + (vlo&0x3ff) + 0x10000;

i += 6;

zOut[j++] = 0xf0 | (v>>18);

zOut[j++] = 0x80 | ((v>>12)&0x3f);

zOut[j++] = 0x80 | ((v>>6)&0x3f);

zOut[j++] = 0x80 | (v&0x3f);

}else{

zOut[j++] = 0xe0 | (v>>12);

zOut[j++] = 0x80 | ((v>>6)&0x3f);

zOut[j++] = 0x80 | (v&0x3f);

}

}else{

if( c=='b' ){

c = '\b';

}else if( c=='f' ){

c = '\f';

}else if( c=='n' ){

c = '\n';

}else if( c=='r' ){

c = '\r';

}else if( c=='t' ){

c = '\t';

}

zOut[j++] = c;

}

zOut[j] = 0;

sqlite3_result_text(pCtx, zOut, j, sqlite3_free);

}

break;

}

case JSON_ARRAY:

case JSON_OBJECT: {

jsonReturnJson(pNode, pCtx, aReplace);

break;

}

/* Forward reference */

static int jsonParseAddNode(JsonParse*,u32,u32,const char*);

** A macro to hint to the compiler that a function should not be

** inlined.

#if defined(__GNUC__)

# define JSON_NOINLINE __attribute__((noinline))

#elif defined(_MSC_VER) && _MSC_VER>=1310

# define JSON_NOINLINE __declspec(noinline)

#else

# define JSON_NOINLINE

#endif

static JSON_NOINLINE int jsonParseAddNodeExpand(

JsonParse *pParse, /* Append the node to this object */

u32 eType, /* Node type */

u32 n, /* Content size or sub-node count */

const char *zContent /* Content */

){

u32 nNew;

JsonNode *pNew;

assert( pParse->nNode>=pParse->nAlloc );

if( pParse->oom ) return -1;

nNew = pParse->nAlloc*2 + 10;

pNew = sqlite3_realloc64(pParse->aNode, sizeof(JsonNode)*nNew);

if( pNew==0 ){

pParse->oom = 1;

return -1;

}

pParse->nAlloc = nNew;

pParse->aNode = pNew;

assert( pParse->nNode<pParse->nAlloc );

return jsonParseAddNode(pParse, eType, n, zContent);

}

** Create a new JsonNode instance based on the arguments and append that

** instance to the JsonParse. Return the index in pParse->aNode[] of the

** new node, or -1 if a memory allocation fails.

static int jsonParseAddNode(

JsonParse *pParse, /* Append the node to this object */

u32 eType, /* Node type */

u32 n, /* Content size or sub-node count */

const char *zContent /* Content */

){

JsonNode *p;

if( pParse->aNode==0 || pParse->nNode>=pParse->nAlloc ){

return jsonParseAddNodeExpand(pParse, eType, n, zContent);

}

p = &pParse->aNode[pParse->nNode];

p->eType = (u8)eType;

p->jnFlags = 0;

VVA( p->eU = zContent ? 1 : 0 );

p->n = n;

p->u.zJContent = zContent;

return pParse->nNode++;

}

** Return true if z[] begins with 4 (or more) hexadecimal digits

static int jsonIs4Hex(const char *z){

int i;

for(i=0; i<4; i++) if( !sqlite3Isxdigit(z[i]) ) return 0;

return 1;

}

** Parse a single JSON value which begins at pParse->zJson[i]. Return the

** index of the first character past the end of the value parsed.

** Return negative for a syntax error. Special cases: return -2 if the

** first non-whitespace character is '}' and return -3 if the first

** non-whitespace character is ']'.

static int jsonParseValue(JsonParse *pParse, u32 i){

char c;

u32 j;

int iThis;

int x;

JsonNode *pNode;

const char *z = pParse->zJson;

while( fast_isspace(z[i]) ){ i++; }

if( (c = z[i])=='{' ){

/* Parse object */

iThis = jsonParseAddNode(pParse, JSON_OBJECT, 0, 0);

if( iThis<0 ) return -1;

for(j=i+1;;j++){

while( fast_isspace(z[j]) ){ j++; }

if( ++pParse->iDepth > JSON_MAX_DEPTH ) return -1;

x = jsonParseValue(pParse, j);

if( x<0 ){

pParse->iDepth--;

if( x==(-2) && pParse->nNode==(u32)iThis+1 ) return j+1;

return -1;

}

if( pParse->oom ) return -1;

pNode = &pParse->aNode[pParse->nNode-1];

if( pNode->eType!=JSON_STRING ) return -1;

pNode->jnFlags |= JNODE_LABEL;

j = x;

while( fast_isspace(z[j]) ){ j++; }

if( z[j]!=':' ) return -1;

j++;

x = jsonParseValue(pParse, j);

pParse->iDepth--;

if( x<0 ) return -1;

j = x;

while( fast_isspace(z[j]) ){ j++; }

c = z[j];

if( c==',' ) continue;

if( c!='}' ) return -1;

break;

}

pParse->aNode[iThis].n = pParse->nNode - (u32)iThis - 1;

return j+1;

}else if( c=='[' ){

/* Parse array */

iThis = jsonParseAddNode(pParse, JSON_ARRAY, 0, 0);

if( iThis<0 ) return -1;

memset(&pParse->aNode[iThis].u, 0, sizeof(pParse->aNode[iThis].u));

for(j=i+1;;j++){

while( fast_isspace(z[j]) ){ j++; }

if( ++pParse->iDepth > JSON_MAX_DEPTH ) return -1;

x = jsonParseValue(pParse, j);

pParse->iDepth--;

if( x<0 ){

if( x==(-3) && pParse->nNode==(u32)iThis+1 ) return j+1;

return -1;

}

j = x;

while( fast_isspace(z[j]) ){ j++; }

c = z[j];

if( c==',' ) continue;

if( c!=']' ) return -1;

break;

}

pParse->aNode[iThis].n = pParse->nNode - (u32)iThis - 1;

return j+1;

}else if( c=='"' ){

/* Parse string */

u8 jnFlags = 0;

j = i+1;

for(;;){

c = z[j];

if( (c & ~0x1f)==0 ){

/* Control characters are not allowed in strings */

return -1;

}

if( c=='\\' ){

c = z[++j];

if( c=='"' || c=='\\' || c=='/' || c=='b' || c=='f'

|| c=='n' || c=='r' || c=='t'

|| (c=='u' && jsonIs4Hex(z+j+1)) ){

jnFlags = JNODE_ESCAPE;

}else{

return -1;

}

}else if( c=='"' ){

break;

}

j++;

}

jsonParseAddNode(pParse, JSON_STRING, j+1-i, &z[i]);

if( !pParse->oom ) pParse->aNode[pParse->nNode-1].jnFlags = jnFlags;

return j+1;

}else if( c=='n'

&& strncmp(z+i,"null",4)==0

&& !sqlite3Isalnum(z[i+4]) ){

jsonParseAddNode(pParse, JSON_NULL, 0, 0);

return i+4;

}else if( c=='t'

&& strncmp(z+i,"true",4)==0

&& !sqlite3Isalnum(z[i+4]) ){

jsonParseAddNode(pParse, JSON_TRUE, 0, 0);

return i+4;

}else if( c=='f'

&& strncmp(z+i,"false",5)==0

&& !sqlite3Isalnum(z[i+5]) ){

jsonParseAddNode(pParse, JSON_FALSE, 0, 0);

return i+5;

}else if( c=='-' || (c>='0' && c<='9') ){

/* Parse number */

u8 seenDP = 0;

u8 seenE = 0;

assert( '-' < '0' );

if( c<='0' ){

j = c=='-' ? i+1 : i;

if( z[j]=='0' && z[j+1]>='0' && z[j+1]<='9' ) return -1;

}

j = i+1;

for(;; j++){

c = z[j];

if( c>='0' && c<='9' ) continue;

if( c=='.' ){

if( z[j-1]=='-' ) return -1;

if( seenDP ) return -1;

seenDP = 1;

continue;

}

if( c=='e' || c=='E' ){

if( z[j-1]<'0' ) return -1;

if( seenE ) return -1;

seenDP = seenE = 1;

c = z[j+1];

if( c=='+' || c=='-' ){

j++;

c = z[j+1];

}

if( c<'0' || c>'9' ) return -1;

continue;

}

break;

}

if( z[j-1]<'0' ) return -1;

jsonParseAddNode(pParse, seenDP ? JSON_REAL : JSON_INT,

j - i, &z[i]);

return j;

}else if( c=='}' ){

return -2; /* End of {...} */

}else if( c==']' ){

return -3; /* End of [...] */

}else if( c==0 ){

return 0; /* End of file */

}else{

return -1; /* Syntax error */

}

** Parse a complete JSON string. Return 0 on success or non-zero if there

** are any errors. If an error occurs, free all memory associated with

** pParse.

** pParse is uninitialized when this routine is called.

static int jsonParse(

JsonParse *pParse, /* Initialize and fill this JsonParse object */

sqlite3_context *pCtx, /* Report errors here */

const char *zJson /* Input JSON text to be parsed */

){

int i;

memset(pParse, 0, sizeof(*pParse));

if( zJson==0 ) return 1;

pParse->zJson = zJson;

i = jsonParseValue(pParse, 0);

if( pParse->oom ) i = -1;

if( i>0 ){

assert( pParse->iDepth==0 );

while( fast_isspace(zJson[i]) ) i++;

if( zJson[i] ) i = -1;

}

if( i<=0 ){

if( pCtx!=0 ){

if( pParse->oom ){

sqlite3_result_error_nomem(pCtx);

}else{

sqlite3_result_error(pCtx, "malformed JSON", -1);

}

jsonParseReset(pParse);

return 1;

}

return 0;

}

/* Mark node i of pParse as being a child of iParent. Call recursively

** to fill in all the descendants of node i.

static void jsonParseFillInParentage(JsonParse *pParse, u32 i, u32 iParent){

JsonNode *pNode = &pParse->aNode[i];

u32 j;

pParse->aUp[i] = iParent;

switch( pNode->eType ){

case JSON_ARRAY: {

for(j=1; j<=pNode->n; j += jsonNodeSize(pNode+j)){

jsonParseFillInParentage(pParse, i+j, i);

}

break;

}

case JSON_OBJECT: {

for(j=1; j<=pNode->n; j += jsonNodeSize(pNode+j+1)+1){

pParse->aUp[i+j] = i;

jsonParseFillInParentage(pParse, i+j+1, i);

}

break;

}

default: {

break;

}

** Compute the parentage of all nodes in a completed parse.

static int jsonParseFindParents(JsonParse *pParse){

u32 *aUp;

assert( pParse->aUp==0 );

aUp = pParse->aUp = sqlite3_malloc64( sizeof(u32)*pParse->nNode );

if( aUp==0 ){

pParse->oom = 1;

return SQLITE_NOMEM;

}

jsonParseFillInParentage(pParse, 0, 0);

return SQLITE_OK;

}

** Magic number used for the JSON parse cache in sqlite3_get_auxdata()

View remainder of file in raw view

sqlcipher/src/json.c at master · strixcode/sqlcipher · GitHub

Expand file tree

Breadcrumbs

json.c

Latest commit

History

Breadcrumbs

json.c

File metadata and controls