cpython/Python/compile.c at 3.14 · python/cpython · GitHub

History

1757 lines (1586 loc) · 50.8 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

* This file compiles an abstract syntax tree (AST) into Python bytecode.

* The primary entry point is _PyAST_Compile(), which returns a

* PyCodeObject. The compiler makes several passes to build the code

* object:

* 1. Checks for future statements. See future.c

* 2. Builds a symbol table. See symtable.c.

* 3. Generate an instruction sequence. See compiler_mod() in this file, which

* calls functions from codegen.c.

* 4. Generate a control flow graph and run optimizations on it. See flowgraph.c.

* 5. Assemble the basic blocks into final code. See optimize_and_assemble() in

* this file, and assembler.c.

#include "Python.h"

#include "pycore_ast.h" // PyAST_Check()

#include "pycore_code.h"

#include "pycore_compile.h"

#include "pycore_flowgraph.h" // _PyCfg_FromInstructionSequence()

#include "pycore_pystate.h" // _Py_GetConfig()

#include "pycore_runtime.h" // _Py_ID()

#include "pycore_setobject.h" // _PySet_NextEntry()

#include "pycore_stats.h"

#include "pycore_unicodeobject.h" // _PyUnicode_EqualToASCIIString()

#include "cpython/code.h"

#include <stdbool.h>

#undef SUCCESS

#undef ERROR

#define SUCCESS 0

#define ERROR -1

#define RETURN_IF_ERROR(X) \

do { \

if ((X) == -1) { \

return ERROR; \

} \

} while (0)

typedef _Py_SourceLocation location;

typedef _PyJumpTargetLabel jump_target_label;

typedef _PyInstructionSequence instr_sequence;

typedef struct _PyCfgBuilder cfg_builder;

typedef _PyCompile_FBlockInfo fblockinfo;

typedef enum _PyCompile_FBlockType fblocktype;

/* The following items change on entry and exit of code blocks.

They must be saved and restored when returning to a block.

struct compiler_unit {

PySTEntryObject *u_ste;

int u_scope_type;

PyObject *u_private; /* for private name mangling */

PyObject *u_static_attributes; /* for class: attributes accessed via self.X */

PyObject *u_deferred_annotations; /* AnnAssign nodes deferred to the end of compilation */

PyObject *u_conditional_annotation_indices; /* indices of annotations that are conditionally executed (or -1 for unconditional annotations) */

long u_next_conditional_annotation_index; /* index of the next conditional annotation */

instr_sequence *u_instr_sequence; /* codegen output */

instr_sequence *u_stashed_instr_sequence; /* temporarily stashed parent instruction sequence */

int u_nfblocks;

int u_in_inlined_comp;

int u_in_conditional_block;

_PyCompile_FBlockInfo u_fblock[CO_MAXBLOCKS];

_PyCompile_CodeUnitMetadata u_metadata;

};

/* This struct captures the global state of a compilation.

The u pointer points to the current compilation unit, while units

for enclosing blocks are stored in c_stack. The u and c_stack are

managed by _PyCompile_EnterScope() and _PyCompile_ExitScope().

Note that we don't track recursion levels during compilation - the

task of detecting and rejecting excessive levels of nesting is

handled by the symbol analysis pass.

typedef struct _PyCompiler {

PyObject *c_filename;

struct symtable *c_st;

_PyFutureFeatures c_future; /* module's __future__ */

PyCompilerFlags c_flags;

int c_optimize; /* optimization level */

int c_interactive; /* true if in interactive mode */

PyObject *c_const_cache; /* Python dict holding all constants,

including names tuple */

struct compiler_unit *u; /* compiler state for current block */

PyObject *c_stack; /* Python list holding compiler_unit ptrs */

bool c_save_nested_seqs; /* if true, construct recursive instruction sequences

* (including instructions for nested code objects)

int c_disable_warning;

} compiler;

static int

compiler_setup(compiler *c, mod_ty mod, PyObject *filename,

PyCompilerFlags *flags, int optimize, PyArena *arena)

{

PyCompilerFlags local_flags = _PyCompilerFlags_INIT;

c->c_const_cache = PyDict_New();

if (!c->c_const_cache) {

return ERROR;

}

c->c_stack = PyList_New(0);

if (!c->c_stack) {

return ERROR;

}

c->c_filename = Py_NewRef(filename);

if (!_PyFuture_FromAST(mod, filename, &c->c_future)) {

return ERROR;

}

if (!flags) {

flags = &local_flags;

}

int merged = c->c_future.ff_features | flags->cf_flags;

c->c_future.ff_features = merged;

flags->cf_flags = merged;

c->c_flags = *flags;

c->c_optimize = (optimize == -1) ? _Py_GetConfig()->optimization_level : optimize;

c->c_save_nested_seqs = false;

if (!_PyAST_Preprocess(mod, arena, filename, c->c_optimize, merged, 0, 1)) {

return ERROR;

}

c->c_st = _PySymtable_Build(mod, filename, &c->c_future);

if (c->c_st == NULL) {

if (!PyErr_Occurred()) {

PyErr_SetString(PyExc_SystemError, "no symtable");

}

return ERROR;

}

return SUCCESS;

}

static void

compiler_free(compiler *c)

{

if (c->c_st) {

_PySymtable_Free(c->c_st);

}

Py_XDECREF(c->c_filename);

Py_XDECREF(c->c_const_cache);

Py_XDECREF(c->c_stack);

PyMem_Free(c);

}

static compiler*

new_compiler(mod_ty mod, PyObject *filename, PyCompilerFlags *pflags,

int optimize, PyArena *arena)

{

compiler *c = PyMem_Calloc(1, sizeof(compiler));

if (c == NULL) {

PyErr_NoMemory();

return NULL;

}

if (compiler_setup(c, mod, filename, pflags, optimize, arena) < 0) {

compiler_free(c);

return NULL;

}

return c;

}

static void

compiler_unit_free(struct compiler_unit *u)

{

Py_CLEAR(u->u_instr_sequence);

Py_CLEAR(u->u_stashed_instr_sequence);

Py_CLEAR(u->u_ste);

Py_CLEAR(u->u_metadata.u_name);

Py_CLEAR(u->u_metadata.u_qualname);

Py_CLEAR(u->u_metadata.u_consts);

Py_CLEAR(u->u_metadata.u_names);

Py_CLEAR(u->u_metadata.u_varnames);

Py_CLEAR(u->u_metadata.u_freevars);

Py_CLEAR(u->u_metadata.u_cellvars);

Py_CLEAR(u->u_metadata.u_fasthidden);

Py_CLEAR(u->u_private);

Py_CLEAR(u->u_static_attributes);

Py_CLEAR(u->u_deferred_annotations);

Py_CLEAR(u->u_conditional_annotation_indices);

PyMem_Free(u);

}

#define CAPSULE_NAME "compile.c compiler unit"

int

_PyCompile_MaybeAddStaticAttributeToClass(compiler *c, expr_ty e)

{

assert(e->kind == Attribute_kind);

expr_ty attr_value = e->v.Attribute.value;

if (attr_value->kind != Name_kind ||

e->v.Attribute.ctx != Store ||

!_PyUnicode_EqualToASCIIString(attr_value->v.Name.id, "self"))

{

return SUCCESS;

}

Py_ssize_t stack_size = PyList_GET_SIZE(c->c_stack);

for (Py_ssize_t i = stack_size - 1; i >= 0; i--) {

PyObject *capsule = PyList_GET_ITEM(c->c_stack, i);

struct compiler_unit *u = (struct compiler_unit *)PyCapsule_GetPointer(

capsule, CAPSULE_NAME);

assert(u);

if (u->u_scope_type == COMPILE_SCOPE_CLASS) {

assert(u->u_static_attributes);

RETURN_IF_ERROR(PySet_Add(u->u_static_attributes, e->v.Attribute.attr));

break;

}

return SUCCESS;

}

static int

compiler_set_qualname(compiler *c)

{

Py_ssize_t stack_size;

struct compiler_unit *u = c->u;

PyObject *name, *base;

base = NULL;

stack_size = PyList_GET_SIZE(c->c_stack);

assert(stack_size >= 1);

if (stack_size > 1) {

int scope, force_global = 0;

struct compiler_unit *parent;

PyObject *mangled, *capsule;

capsule = PyList_GET_ITEM(c->c_stack, stack_size - 1);

parent = (struct compiler_unit *)PyCapsule_GetPointer(capsule, CAPSULE_NAME);

assert(parent);

if (parent->u_scope_type == COMPILE_SCOPE_ANNOTATIONS) {

/* The parent is an annotation scope, so we need to

look at the grandparent. */

if (stack_size == 2) {

// If we're immediately within the module, we can skip

// the rest and just set the qualname to be the same as name.

u->u_metadata.u_qualname = Py_NewRef(u->u_metadata.u_name);

return SUCCESS;

}

capsule = PyList_GET_ITEM(c->c_stack, stack_size - 2);

parent = (struct compiler_unit *)PyCapsule_GetPointer(capsule, CAPSULE_NAME);

assert(parent);

}

if (u->u_scope_type == COMPILE_SCOPE_FUNCTION

|| u->u_scope_type == COMPILE_SCOPE_ASYNC_FUNCTION

|| u->u_scope_type == COMPILE_SCOPE_CLASS) {

assert(u->u_metadata.u_name);

mangled = _Py_Mangle(parent->u_private, u->u_metadata.u_name);

if (!mangled) {

return ERROR;

}

scope = _PyST_GetScope(parent->u_ste, mangled);

Py_DECREF(mangled);

RETURN_IF_ERROR(scope);

assert(scope != GLOBAL_IMPLICIT);

if (scope == GLOBAL_EXPLICIT)

force_global = 1;

}

if (!force_global) {

if (parent->u_scope_type == COMPILE_SCOPE_FUNCTION

|| parent->u_scope_type == COMPILE_SCOPE_ASYNC_FUNCTION

|| parent->u_scope_type == COMPILE_SCOPE_LAMBDA)

{

_Py_DECLARE_STR(dot_locals, ".<locals>");

base = PyUnicode_Concat(parent->u_metadata.u_qualname,

&_Py_STR(dot_locals));

if (base == NULL) {

return ERROR;

}

else {

base = Py_NewRef(parent->u_metadata.u_qualname);

}

if (base != NULL) {

name = PyUnicode_Concat(base, _Py_LATIN1_CHR('.'));

Py_DECREF(base);

if (name == NULL) {

return ERROR;

}

PyUnicode_Append(&name, u->u_metadata.u_name);

if (name == NULL) {

return ERROR;

}

else {

name = Py_NewRef(u->u_metadata.u_name);

}

u->u_metadata.u_qualname = name;

return SUCCESS;

}

/* Merge const *o* and return constant key object.

* If recursive, insert all elements if o is a tuple or frozen set.

static PyObject*

const_cache_insert(PyObject *const_cache, PyObject *o, bool recursive)

{

assert(PyDict_CheckExact(const_cache));

// None and Ellipsis are immortal objects, and key is the singleton.

// No need to merge object and key.

if (o == Py_None || o == Py_Ellipsis) {

return o;

}

PyObject *key = _PyCode_ConstantKey(o);

if (key == NULL) {

return NULL;

}

PyObject *t;

int res = PyDict_SetDefaultRef(const_cache, key, key, &t);

if (res != 0) {

// o was not inserted into const_cache. t is either the existing value

// or NULL (on error).

Py_DECREF(key);

return t;

}

Py_DECREF(t);

if (!recursive) {

return key;

}

// We registered o in const_cache.

// When o is a tuple or frozenset, we want to merge its

// items too.

if (PyTuple_CheckExact(o)) {

Py_ssize_t len = PyTuple_GET_SIZE(o);

for (Py_ssize_t i = 0; i < len; i++) {

PyObject *item = PyTuple_GET_ITEM(o, i);

PyObject *u = const_cache_insert(const_cache, item, recursive);

if (u == NULL) {

Py_DECREF(key);

return NULL;

}

// See _PyCode_ConstantKey()

PyObject *v; // borrowed

if (PyTuple_CheckExact(u)) {

v = PyTuple_GET_ITEM(u, 1);

}

else {

v = u;

}

if (v != item) {

PyTuple_SET_ITEM(o, i, Py_NewRef(v));

Py_DECREF(item);

}

Py_DECREF(u);

}

else if (PyFrozenSet_CheckExact(o)) {

// *key* is tuple. And its first item is frozenset of

// constant keys.

// See _PyCode_ConstantKey() for detail.

assert(PyTuple_CheckExact(key));

assert(PyTuple_GET_SIZE(key) == 2);

Py_ssize_t len = PySet_GET_SIZE(o);

if (len == 0) { // empty frozenset should not be re-created.

return key;

}

PyObject *tuple = PyTuple_New(len);

if (tuple == NULL) {

Py_DECREF(key);

return NULL;

}

Py_ssize_t i = 0, pos = 0;

PyObject *item;

Py_hash_t hash;

while (_PySet_NextEntry(o, &pos, &item, &hash)) {

PyObject *k = const_cache_insert(const_cache, item, recursive);

if (k == NULL) {

Py_DECREF(tuple);

Py_DECREF(key);

return NULL;

}

PyObject *u;

if (PyTuple_CheckExact(k)) {

u = Py_NewRef(PyTuple_GET_ITEM(k, 1));

Py_DECREF(k);

}

else {

u = k;

}

PyTuple_SET_ITEM(tuple, i, u); // Steals reference of u.

i++;

}

// Instead of rewriting o, we create new frozenset and embed in the

// key tuple. Caller should get merged frozenset from the key tuple.

PyObject *new = PyFrozenSet_New(tuple);

Py_DECREF(tuple);

if (new == NULL) {

Py_DECREF(key);

return NULL;

}

assert(PyTuple_GET_ITEM(key, 1) == o);

Py_DECREF(o);

PyTuple_SET_ITEM(key, 1, new);

}

return key;

}

static PyObject*

merge_consts_recursive(PyObject *const_cache, PyObject *o)

{

return const_cache_insert(const_cache, o, true);

}

Py_ssize_t

_PyCompile_DictAddObj(PyObject *dict, PyObject *o)

{

PyObject *v;

Py_ssize_t arg;

if (PyDict_GetItemRef(dict, o, &v) < 0) {

return ERROR;

}

if (!v) {

arg = PyDict_GET_SIZE(dict);

v = PyLong_FromSsize_t(arg);

if (!v) {

return ERROR;

}

if (PyDict_SetItem(dict, o, v) < 0) {

Py_DECREF(v);

return ERROR;

}

else

arg = PyLong_AsLong(v);

Py_DECREF(v);

return arg;

}

Py_ssize_t

_PyCompile_AddConst(compiler *c, PyObject *o)

{

PyObject *key = merge_consts_recursive(c->c_const_cache, o);

if (key == NULL) {

return ERROR;

}

Py_ssize_t arg = _PyCompile_DictAddObj(c->u->u_metadata.u_consts, key);

Py_DECREF(key);

return arg;

}

static PyObject *

list2dict(PyObject *list)

{

Py_ssize_t i, n;

PyObject *v, *k;

PyObject *dict = PyDict_New();

if (!dict) return NULL;

n = PyList_Size(list);

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

v = PyLong_FromSsize_t(i);

if (!v) {

Py_DECREF(dict);

return NULL;

}

k = PyList_GET_ITEM(list, i);

if (PyDict_SetItem(dict, k, v) < 0) {

Py_DECREF(v);

Py_DECREF(dict);

return NULL;

}

Py_DECREF(v);

}

return dict;

}

/* Return new dict containing names from src that match scope(s).

src is a symbol table dictionary. If the scope of a name matches

either scope_type or flag is set, insert it into the new dict. The

values are integers, starting at offset and increasing by one for

each key.

static PyObject *

dictbytype(PyObject *src, int scope_type, int flag, Py_ssize_t offset)

{

Py_ssize_t i = offset, num_keys, key_i;

PyObject *k, *v, *dest = PyDict_New();

PyObject *sorted_keys;

assert(offset >= 0);

if (dest == NULL)

return NULL;

/* Sort the keys so that we have a deterministic order on the indexes

saved in the returned dictionary. These indexes are used as indexes

into the free and cell var storage. Therefore if they aren't

deterministic, then the generated bytecode is not deterministic.

sorted_keys = PyDict_Keys(src);

if (sorted_keys == NULL) {

Py_DECREF(dest);

return NULL;

}

if (PyList_Sort(sorted_keys) != 0) {

Py_DECREF(sorted_keys);

Py_DECREF(dest);

return NULL;

}

num_keys = PyList_GET_SIZE(sorted_keys);

for (key_i = 0; key_i < num_keys; key_i++) {

k = PyList_GET_ITEM(sorted_keys, key_i);

v = PyDict_GetItemWithError(src, k);

if (!v) {

if (!PyErr_Occurred()) {

PyErr_SetObject(PyExc_KeyError, k);

}

Py_DECREF(sorted_keys);

Py_DECREF(dest);

return NULL;

}

long vi = PyLong_AsLong(v);

if (vi == -1 && PyErr_Occurred()) {

Py_DECREF(sorted_keys);

Py_DECREF(dest);

return NULL;

}

if (SYMBOL_TO_SCOPE(vi) == scope_type || vi & flag) {

PyObject *item = PyLong_FromSsize_t(i);

if (item == NULL) {

Py_DECREF(sorted_keys);

Py_DECREF(dest);

return NULL;

}

i++;

if (PyDict_SetItem(dest, k, item) < 0) {

Py_DECREF(sorted_keys);

Py_DECREF(item);

Py_DECREF(dest);

return NULL;

}

Py_DECREF(item);

}

Py_DECREF(sorted_keys);

return dest;

}

int

_PyCompile_EnterScope(compiler *c, identifier name, int scope_type,

void *key, int lineno, PyObject *private,

_PyCompile_CodeUnitMetadata *umd)

{

struct compiler_unit *u;

u = (struct compiler_unit *)PyMem_Calloc(1, sizeof(struct compiler_unit));

if (!u) {

PyErr_NoMemory();

return ERROR;

}

u->u_scope_type = scope_type;

if (umd != NULL) {

u->u_metadata = *umd;

}

else {

u->u_metadata.u_argcount = 0;

u->u_metadata.u_posonlyargcount = 0;

u->u_metadata.u_kwonlyargcount = 0;

}

u->u_ste = _PySymtable_Lookup(c->c_st, key);

if (!u->u_ste) {

compiler_unit_free(u);

return ERROR;

}

u->u_metadata.u_name = Py_NewRef(name);

u->u_metadata.u_varnames = list2dict(u->u_ste->ste_varnames);

if (!u->u_metadata.u_varnames) {

compiler_unit_free(u);

return ERROR;

}

u->u_metadata.u_cellvars = dictbytype(u->u_ste->ste_symbols, CELL, DEF_COMP_CELL, 0);

if (!u->u_metadata.u_cellvars) {

compiler_unit_free(u);

return ERROR;

}

if (u->u_ste->ste_needs_class_closure) {

/* Cook up an implicit __class__ cell. */

Py_ssize_t res;

assert(u->u_scope_type == COMPILE_SCOPE_CLASS);

res = _PyCompile_DictAddObj(u->u_metadata.u_cellvars, &_Py_ID(__class__));

if (res < 0) {

compiler_unit_free(u);

return ERROR;

}

if (u->u_ste->ste_needs_classdict) {

/* Cook up an implicit __classdict__ cell. */

Py_ssize_t res;

assert(u->u_scope_type == COMPILE_SCOPE_CLASS);

res = _PyCompile_DictAddObj(u->u_metadata.u_cellvars, &_Py_ID(__classdict__));

if (res < 0) {

compiler_unit_free(u);

return ERROR;

}

if (u->u_ste->ste_has_conditional_annotations) {

/* Cook up an implicit __conditional_annotations__ cell */

Py_ssize_t res;

assert(u->u_scope_type == COMPILE_SCOPE_CLASS || u->u_scope_type == COMPILE_SCOPE_MODULE);

res = _PyCompile_DictAddObj(u->u_metadata.u_cellvars, &_Py_ID(__conditional_annotations__));

if (res < 0) {

compiler_unit_free(u);

return ERROR;

}

u->u_metadata.u_freevars = dictbytype(u->u_ste->ste_symbols, FREE, DEF_FREE_CLASS,

PyDict_GET_SIZE(u->u_metadata.u_cellvars));

if (!u->u_metadata.u_freevars) {

compiler_unit_free(u);

return ERROR;

}

u->u_metadata.u_fasthidden = PyDict_New();

if (!u->u_metadata.u_fasthidden) {

compiler_unit_free(u);

return ERROR;

}

u->u_nfblocks = 0;

u->u_in_inlined_comp = 0;

u->u_metadata.u_firstlineno = lineno;

u->u_metadata.u_consts = PyDict_New();

if (!u->u_metadata.u_consts) {

compiler_unit_free(u);

return ERROR;

}

u->u_metadata.u_names = PyDict_New();

if (!u->u_metadata.u_names) {

compiler_unit_free(u);

return ERROR;

}

u->u_deferred_annotations = NULL;

u->u_conditional_annotation_indices = NULL;

u->u_next_conditional_annotation_index = 0;

if (scope_type == COMPILE_SCOPE_CLASS) {

u->u_static_attributes = PySet_New(0);

if (!u->u_static_attributes) {

compiler_unit_free(u);

return ERROR;

}

else {

u->u_static_attributes = NULL;

}

u->u_instr_sequence = (instr_sequence*)_PyInstructionSequence_New();

if (!u->u_instr_sequence) {

compiler_unit_free(u);

return ERROR;

}

u->u_stashed_instr_sequence = NULL;

/* Push the old compiler_unit on the stack. */

if (c->u) {

PyObject *capsule = PyCapsule_New(c->u, CAPSULE_NAME, NULL);

if (!capsule || PyList_Append(c->c_stack, capsule) < 0) {

Py_XDECREF(capsule);

compiler_unit_free(u);

return ERROR;

}

Py_DECREF(capsule);

if (private == NULL) {

private = c->u->u_private;

}

u->u_private = Py_XNewRef(private);

c->u = u;

if (scope_type != COMPILE_SCOPE_MODULE) {

RETURN_IF_ERROR(compiler_set_qualname(c));

}

return SUCCESS;

}

void

_PyCompile_ExitScope(compiler *c)

{

// Don't call PySequence_DelItem() with an exception raised

PyObject *exc = PyErr_GetRaisedException();

instr_sequence *nested_seq = NULL;

if (c->c_save_nested_seqs) {

nested_seq = c->u->u_instr_sequence;

Py_INCREF(nested_seq);

}

compiler_unit_free(c->u);

/* Restore c->u to the parent unit. */

Py_ssize_t n = PyList_GET_SIZE(c->c_stack) - 1;

if (n >= 0) {

PyObject *capsule = PyList_GET_ITEM(c->c_stack, n);

c->u = (struct compiler_unit *)PyCapsule_GetPointer(capsule, CAPSULE_NAME);

assert(c->u);

/* we are deleting from a list so this really shouldn't fail */

if (PySequence_DelItem(c->c_stack, n) < 0) {

PyErr_FormatUnraisable("Exception ignored while removing "

"the last compiler stack item");

}

if (nested_seq != NULL) {

if (_PyInstructionSequence_AddNested(c->u->u_instr_sequence, nested_seq) < 0) {

PyErr_FormatUnraisable("Exception ignored while appending "

"nested instruction sequence");

}

else {

c->u = NULL;

}

Py_XDECREF(nested_seq);

PyErr_SetRaisedException(exc);

}

* Frame block handling functions

int

_PyCompile_PushFBlock(compiler *c, location loc,

fblocktype t, jump_target_label block_label,

jump_target_label exit, void *datum)

{

fblockinfo *f;

if (c->u->u_nfblocks >= CO_MAXBLOCKS) {

return _PyCompile_Error(c, loc, "too many statically nested blocks");

}

f = &c->u->u_fblock[c->u->u_nfblocks++];

f->fb_type = t;

f->fb_block = block_label;

f->fb_loc = loc;

f->fb_exit = exit;

f->fb_datum = datum;

if (t == COMPILE_FBLOCK_FINALLY_END) {

c->c_disable_warning++;

}

return SUCCESS;

}

void

_PyCompile_PopFBlock(compiler *c, fblocktype t, jump_target_label block_label)

{

struct compiler_unit *u = c->u;

assert(u->u_nfblocks > 0);

u->u_nfblocks--;

assert(u->u_fblock[u->u_nfblocks].fb_type == t);

assert(SAME_JUMP_TARGET_LABEL(u->u_fblock[u->u_nfblocks].fb_block, block_label));

if (t == COMPILE_FBLOCK_FINALLY_END) {

c->c_disable_warning--;

}

fblockinfo *

_PyCompile_TopFBlock(compiler *c)

{

if (c->u->u_nfblocks == 0) {

return NULL;

}

return &c->u->u_fblock[c->u->u_nfblocks - 1];

}

void

_PyCompile_DeferredAnnotations(compiler *c,

PyObject **deferred_annotations,

PyObject **conditional_annotation_indices)

{

*deferred_annotations = Py_XNewRef(c->u->u_deferred_annotations);

*conditional_annotation_indices = Py_XNewRef(c->u->u_conditional_annotation_indices);

}

static location

start_location(asdl_stmt_seq *stmts)

{

if (asdl_seq_LEN(stmts) > 0) {

/* Set current line number to the line number of first statement.

* This way line number for SETUP_ANNOTATIONS will always

* coincide with the line number of first "real" statement in module.

* If body is empty, then lineno will be set later in the assembly stage.

stmt_ty st = (stmt_ty)asdl_seq_GET(stmts, 0);

return SRC_LOCATION_FROM_AST(st);

}

return (const _Py_SourceLocation){1, 1, 0, 0};

}

static int

compiler_codegen(compiler *c, mod_ty mod)

{

RETURN_IF_ERROR(_PyCodegen_EnterAnonymousScope(c, mod));

assert(c->u->u_scope_type == COMPILE_SCOPE_MODULE);

switch (mod->kind) {

case Module_kind: {

asdl_stmt_seq *stmts = mod->v.Module.body;

RETURN_IF_ERROR(_PyCodegen_Module(c, start_location(stmts), stmts, false));

break;

}

case Interactive_kind: {

c->c_interactive = 1;

asdl_stmt_seq *stmts = mod->v.Interactive.body;

RETURN_IF_ERROR(_PyCodegen_Module(c, start_location(stmts), stmts, true));

break;

}

case Expression_kind: {

RETURN_IF_ERROR(_PyCodegen_Expression(c, mod->v.Expression.body));

break;

}

default: {

PyErr_Format(PyExc_SystemError,

"module kind %d should not be possible",

mod->kind);

return ERROR;

}}

return SUCCESS;

}

static PyCodeObject *

compiler_mod(compiler *c, mod_ty mod)

{

PyCodeObject *co = NULL;

int addNone = mod->kind != Expression_kind;

assert(c->u == NULL);

if (compiler_codegen(c, mod) < 0) {

goto finally;

}

co = _PyCompile_OptimizeAndAssemble(c, addNone);

finally:

if (c->u != NULL) {

_PyCompile_ExitScope(c);

}

return co;

}

int

_PyCompile_GetRefType(compiler *c, PyObject *name)

{

if (c->u->u_scope_type == COMPILE_SCOPE_CLASS &&

(_PyUnicode_EqualToASCIIString(name, "__class__") ||

_PyUnicode_EqualToASCIIString(name, "__classdict__") ||

_PyUnicode_EqualToASCIIString(name, "__conditional_annotations__"))) {

return CELL;

}

PySTEntryObject *ste = c->u->u_ste;

int scope = _PyST_GetScope(ste, name);

if (scope == 0) {

PyErr_Format(PyExc_SystemError,

"_PyST_GetScope(name=%R) failed: "

"unknown scope in unit %S (%R); "

"symbols: %R; locals: %R; "

"globals: %R",

name,

c->u->u_metadata.u_name, ste->ste_id,

ste->ste_symbols, c->u->u_metadata.u_varnames,

c->u->u_metadata.u_names);

return ERROR;

}

return scope;

}

static int

dict_lookup_arg(PyObject *dict, PyObject *name)

{

PyObject *v = PyDict_GetItemWithError(dict, name);

if (v == NULL) {

return ERROR;

}

return PyLong_AsLong(v);

}

int

_PyCompile_LookupCellvar(compiler *c, PyObject *name)

{

assert(c->u->u_metadata.u_cellvars);

return dict_lookup_arg(c->u->u_metadata.u_cellvars, name);

}

int

_PyCompile_LookupArg(compiler *c, PyCodeObject *co, PyObject *name)

{

/* Special case: If a class contains a method with a

* free variable that has the same name as a method,

* the name will be considered free *and* local in the

* class. It should be handled by the closure, as

* well as by the normal name lookup logic.

int reftype = _PyCompile_GetRefType(c, name);

if (reftype == -1) {

return ERROR;

}

int arg;

if (reftype == CELL) {

arg = dict_lookup_arg(c->u->u_metadata.u_cellvars, name);

}

else {

arg = dict_lookup_arg(c->u->u_metadata.u_freevars, name);

}

if (arg == -1 && !PyErr_Occurred()) {

PyObject *freevars = _PyCode_GetFreevars(co);

if (freevars == NULL) {

PyErr_Clear();

}

PyErr_Format(PyExc_SystemError,

"compiler_lookup_arg(name=%R) with reftype=%d failed in %S; "

"freevars of code %S: %R",

name,

reftype,

c->u->u_metadata.u_name,

co->co_name,

freevars);

Py_XDECREF(freevars);

return ERROR;

}

return arg;

}

PyObject *

_PyCompile_StaticAttributesAsTuple(compiler *c)

{

assert(c->u->u_static_attributes);

PyObject *static_attributes_unsorted = PySequence_List(c->u->u_static_attributes);

if (static_attributes_unsorted == NULL) {

return NULL;

}

if (PyList_Sort(static_attributes_unsorted) != 0) {

Py_DECREF(static_attributes_unsorted);

return NULL;

}

PyObject *static_attributes = PySequence_Tuple(static_attributes_unsorted);

Py_DECREF(static_attributes_unsorted);

return static_attributes;

}

int

_PyCompile_ResolveNameop(compiler *c, PyObject *mangled, int scope,

_PyCompile_optype *optype, Py_ssize_t *arg)

{

PyObject *dict = c->u->u_metadata.u_names;

*optype = COMPILE_OP_NAME;

assert(scope >= 0);

switch (scope) {

case FREE:

dict = c->u->u_metadata.u_freevars;

*optype = COMPILE_OP_DEREF;

break;

case CELL:

dict = c->u->u_metadata.u_cellvars;

*optype = COMPILE_OP_DEREF;

break;

case LOCAL:

if (_PyST_IsFunctionLike(c->u->u_ste)) {

*optype = COMPILE_OP_FAST;

}

else {

PyObject *item;

RETURN_IF_ERROR(PyDict_GetItemRef(c->u->u_metadata.u_fasthidden, mangled,

&item));

if (item == Py_True) {

*optype = COMPILE_OP_FAST;

}

Py_XDECREF(item);

}

break;

case GLOBAL_IMPLICIT:

if (_PyST_IsFunctionLike(c->u->u_ste)) {

View remainder of file in raw view

cpython/Python/compile.c at 3.14 · python/cpython · GitHub

Uh oh!

Uh oh!

cpython/Python/compile.c at 3.14 · python/cpython · GitHub

Uh oh!

Uh oh!

Expand file tree

Breadcrumbs

compile.c

Latest commit

History

Breadcrumbs

compile.c

File metadata and controls