cpython/Modules/_sre.c at 3.5 · python/cpython · GitHub

Repository navigation

History

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

* Secret Labs' Regular Expression Engine

* regular expression matching engine

* partial history:

* 1999-10-24 fl created (based on existing template matcher code)

* 2000-03-06 fl first alpha, sort of

* 2000-08-01 fl fixes for 1.6b1

* 2000-08-07 fl use PyOS_CheckStack() if available

* 2000-09-20 fl added expand method

* 2001-03-20 fl lots of fixes for 2.1b2

* 2001-04-15 fl export copyright as Python attribute, not global

* 2001-04-28 fl added __copy__ methods (work in progress)

* 2001-05-14 fl fixes for 1.5.2 compatibility

* 2001-07-01 fl added BIGCHARSET support (from Martin von Loewis)

* 2001-10-18 fl fixed group reset issue (from Matthew Mueller)

* 2001-10-20 fl added split primitive; reenable unicode for 1.6/2.0/2.1

* 2001-10-21 fl added sub/subn primitive

* 2001-10-24 fl added finditer primitive (for 2.2 only)

* 2001-12-07 fl fixed memory leak in sub/subn (Guido van Rossum)

* 2002-11-09 fl fixed empty sub/subn return type

* 2003-04-18 mvl fully support 4-byte codes

* 2003-10-17 gn implemented non recursive scheme

* 2013-02-04 mrab added fullmatch primitive

* This version of the SRE library can be redistributed under CNRI's

* Python 1.6 license. For any other use, please contact Secret Labs

* AB (info@pythonware.com).

* Portions of this engine have been developed in cooperation with

* CNRI. Hewlett-Packard provided funding for 1.6 integration and

* other compatibility work.

static char copyright[] =

#define PY_SSIZE_T_CLEAN

#include "Python.h"

#include "structmember.h" /* offsetof */

#include "sre.h"

#define SRE_CODE_BITS (8 * sizeof(SRE_CODE))

#include <ctype.h>

/* name of this module, minus the leading underscore */

#if !defined(SRE_MODULE)

#define SRE_MODULE "sre"

#endif

#define SRE_PY_MODULE "re"

/* defining this one enables tracing */

#undef VERBOSE

/* -------------------------------------------------------------------- */

/* optional features */

/* enables fast searching */

#define USE_FAST_SEARCH

/* enables copy/deepcopy handling (work in progress) */

#undef USE_BUILTIN_COPY

/* -------------------------------------------------------------------- */

#if defined(_MSC_VER)

#pragma optimize("agtw", on) /* doesn't seem to make much difference... */

#pragma warning(disable: 4710) /* who cares if functions are not inlined ;-) */

/* fastest possible local call under MSVC */

#define LOCAL(type) static __inline type __fastcall

#elif defined(USE_INLINE)

#define LOCAL(type) static inline type

#else

#define LOCAL(type) static type

#endif

/* error codes */

#define SRE_ERROR_ILLEGAL -1 /* illegal opcode */

#define SRE_ERROR_STATE -2 /* illegal state */

#define SRE_ERROR_RECURSION_LIMIT -3 /* runaway recursion */

#define SRE_ERROR_MEMORY -9 /* out of memory */

#define SRE_ERROR_INTERRUPTED -10 /* signal handler raised exception */

#if defined(VERBOSE)

#define TRACE(v) printf v

#else

#define TRACE(v)

#endif

/* -------------------------------------------------------------------- */

/* search engine state */

#define SRE_IS_DIGIT(ch)\

((ch) < 128 && Py_ISDIGIT(ch))

#define SRE_IS_SPACE(ch)\

((ch) < 128 && Py_ISSPACE(ch))

#define SRE_IS_LINEBREAK(ch)\

((ch) == '\n')

#define SRE_IS_ALNUM(ch)\

((ch) < 128 && Py_ISALNUM(ch))

#define SRE_IS_WORD(ch)\

((ch) < 128 && (Py_ISALNUM(ch) || (ch) == '_'))

static unsigned int sre_lower(unsigned int ch)

{

return ((ch) < 128 ? Py_TOLOWER(ch) : ch);

}

static unsigned int sre_upper(unsigned int ch)

{

return ((ch) < 128 ? Py_TOUPPER(ch) : ch);

}

/* locale-specific character predicates */

/* !(c & ~N) == (c < N+1) for any unsigned c, this avoids

* warnings when c's type supports only numbers < N+1 */

#define SRE_LOC_IS_ALNUM(ch) (!((ch) & ~255) ? isalnum((ch)) : 0)

#define SRE_LOC_IS_WORD(ch) (SRE_LOC_IS_ALNUM((ch)) || (ch) == '_')

static unsigned int sre_lower_locale(unsigned int ch)

{

return ((ch) < 256 ? (unsigned int)tolower((ch)) : ch);

}

static unsigned int sre_upper_locale(unsigned int ch)

{

return ((ch) < 256 ? (unsigned int)toupper((ch)) : ch);

}

/* unicode-specific character predicates */

#define SRE_UNI_IS_DIGIT(ch) Py_UNICODE_ISDECIMAL(ch)

#define SRE_UNI_IS_SPACE(ch) Py_UNICODE_ISSPACE(ch)

#define SRE_UNI_IS_LINEBREAK(ch) Py_UNICODE_ISLINEBREAK(ch)

#define SRE_UNI_IS_ALNUM(ch) Py_UNICODE_ISALNUM(ch)

#define SRE_UNI_IS_WORD(ch) (SRE_UNI_IS_ALNUM(ch) || (ch) == '_')

static unsigned int sre_lower_unicode(unsigned int ch)

{

return (unsigned int) Py_UNICODE_TOLOWER(ch);

}

static unsigned int sre_upper_unicode(unsigned int ch)

{

return (unsigned int) Py_UNICODE_TOUPPER(ch);

}

LOCAL(int)

sre_category(SRE_CODE category, unsigned int ch)

{

switch (category) {

case SRE_CATEGORY_DIGIT:

return SRE_IS_DIGIT(ch);

case SRE_CATEGORY_NOT_DIGIT:

return !SRE_IS_DIGIT(ch);

case SRE_CATEGORY_SPACE:

return SRE_IS_SPACE(ch);

case SRE_CATEGORY_NOT_SPACE:

return !SRE_IS_SPACE(ch);

case SRE_CATEGORY_WORD:

return SRE_IS_WORD(ch);

case SRE_CATEGORY_NOT_WORD:

return !SRE_IS_WORD(ch);

case SRE_CATEGORY_LINEBREAK:

return SRE_IS_LINEBREAK(ch);

case SRE_CATEGORY_NOT_LINEBREAK:

return !SRE_IS_LINEBREAK(ch);

case SRE_CATEGORY_LOC_WORD:

return SRE_LOC_IS_WORD(ch);

case SRE_CATEGORY_LOC_NOT_WORD:

return !SRE_LOC_IS_WORD(ch);

case SRE_CATEGORY_UNI_DIGIT:

return SRE_UNI_IS_DIGIT(ch);

case SRE_CATEGORY_UNI_NOT_DIGIT:

return !SRE_UNI_IS_DIGIT(ch);

case SRE_CATEGORY_UNI_SPACE:

return SRE_UNI_IS_SPACE(ch);

case SRE_CATEGORY_UNI_NOT_SPACE:

return !SRE_UNI_IS_SPACE(ch);

case SRE_CATEGORY_UNI_WORD:

return SRE_UNI_IS_WORD(ch);

case SRE_CATEGORY_UNI_NOT_WORD:

return !SRE_UNI_IS_WORD(ch);

case SRE_CATEGORY_UNI_LINEBREAK:

return SRE_UNI_IS_LINEBREAK(ch);

case SRE_CATEGORY_UNI_NOT_LINEBREAK:

return !SRE_UNI_IS_LINEBREAK(ch);

}

return 0;

}

/* helpers */

static void

data_stack_dealloc(SRE_STATE* state)

{

if (state->data_stack) {

PyMem_FREE(state->data_stack);

state->data_stack = NULL;

}

state->data_stack_size = state->data_stack_base = 0;

}

static int

data_stack_grow(SRE_STATE* state, Py_ssize_t size)

{

Py_ssize_t minsize, cursize;

minsize = state->data_stack_base+size;

cursize = state->data_stack_size;

if (cursize < minsize) {

void* stack;

cursize = minsize+minsize/4+1024;

TRACE(("allocate/grow stack %" PY_FORMAT_SIZE_T "d\n", cursize));

stack = PyMem_REALLOC(state->data_stack, cursize);

if (!stack) {

data_stack_dealloc(state);

return SRE_ERROR_MEMORY;

}

state->data_stack = (char *)stack;

state->data_stack_size = cursize;

}

return 0;

}

/* generate 8-bit version */

#define SRE_CHAR Py_UCS1

#define SIZEOF_SRE_CHAR 1

#define SRE(F) sre_ucs1_##F

#include "sre_lib.h"

/* generate 16-bit unicode version */

#define SRE_CHAR Py_UCS2

#define SIZEOF_SRE_CHAR 2

#define SRE(F) sre_ucs2_##F

#include "sre_lib.h"

/* generate 32-bit unicode version */

#define SRE_CHAR Py_UCS4

#define SIZEOF_SRE_CHAR 4

#define SRE(F) sre_ucs4_##F

#include "sre_lib.h"

/* -------------------------------------------------------------------- */

/* factories and destructors */

/* see sre.h for object declarations */

static PyObject*pattern_new_match(PatternObject*, SRE_STATE*, Py_ssize_t);

static PyObject *pattern_scanner(PatternObject *, PyObject *, Py_ssize_t, Py_ssize_t);

/*[clinic input]

module _sre

class _sre.SRE_Pattern "PatternObject *" "&Pattern_Type"

class _sre.SRE_Match "MatchObject *" "&Match_Type"

class _sre.SRE_Scanner "ScannerObject *" "&Scanner_Type"

[clinic start generated code]*/

/*[clinic end generated code: output=da39a3ee5e6b4b0d input=b0230ec19a0deac8]*/

static PyTypeObject Pattern_Type;

static PyTypeObject Match_Type;

static PyTypeObject Scanner_Type;

/*[clinic input]

_sre.getcodesize -> int

[clinic start generated code]*/

static int

_sre_getcodesize_impl(PyObject *module)

/*[clinic end generated code: output=e0db7ce34a6dd7b1 input=bd6f6ecf4916bb2b]*/

{

return sizeof(SRE_CODE);

}

/*[clinic input]

_sre.getlower -> int

character: int

flags: int

[clinic start generated code]*/

static int

_sre_getlower_impl(PyObject *module, int character, int flags)

/*[clinic end generated code: output=47eebc4c1214feb5 input=087d2f1c44bbca6f]*/

{

if (flags & SRE_FLAG_LOCALE)

return sre_lower_locale(character);

if (flags & SRE_FLAG_UNICODE)

return sre_lower_unicode(character);

return sre_lower(character);

}

LOCAL(void)

state_reset(SRE_STATE* state)

{

/* FIXME: dynamic! */

/*memset(state->mark, 0, sizeof(*state->mark) * SRE_MARK_SIZE);*/

state->lastmark = -1;

state->lastindex = -1;

state->repeat = NULL;

data_stack_dealloc(state);

}

static void*

getstring(PyObject* string, Py_ssize_t* p_length,

int* p_isbytes, int* p_charsize,

Py_buffer *view)

{

/* given a python object, return a data pointer, a length (in

characters), and a character size. return NULL if the object

is not a string (or not compatible) */

/* Unicode objects do not support the buffer API. So, get the data

directly instead. */

if (PyUnicode_Check(string)) {

if (PyUnicode_READY(string) == -1)

return NULL;

*p_length = PyUnicode_GET_LENGTH(string);

*p_charsize = PyUnicode_KIND(string);

*p_isbytes = 0;

return PyUnicode_DATA(string);

}

/* get pointer to byte string buffer */

if (PyObject_GetBuffer(string, view, PyBUF_SIMPLE) != 0) {

PyErr_SetString(PyExc_TypeError, "expected string or bytes-like object");

return NULL;

}

*p_length = view->len;

*p_charsize = 1;

*p_isbytes = 1;

if (view->buf == NULL) {

PyErr_SetString(PyExc_ValueError, "Buffer is NULL");

PyBuffer_Release(view);

view->buf = NULL;

return NULL;

}

return view->buf;

}

LOCAL(PyObject*)

state_init(SRE_STATE* state, PatternObject* pattern, PyObject* string,

Py_ssize_t start, Py_ssize_t end)

{

/* prepare state object */

Py_ssize_t length;

int isbytes, charsize;

void* ptr;

memset(state, 0, sizeof(SRE_STATE));

state->mark = PyMem_New(void *, pattern->groups * 2);

if (!state->mark) {

PyErr_NoMemory();

goto err;

}

state->lastmark = -1;

state->lastindex = -1;

state->buffer.buf = NULL;

ptr = getstring(string, &length, &isbytes, &charsize, &state->buffer);

if (!ptr)

goto err;

if (isbytes && pattern->isbytes == 0) {

PyErr_SetString(PyExc_TypeError,

"cannot use a string pattern on a bytes-like object");

goto err;

}

if (!isbytes && pattern->isbytes > 0) {

PyErr_SetString(PyExc_TypeError,

"cannot use a bytes pattern on a string-like object");

goto err;

}

/* adjust boundaries */

if (start < 0)

start = 0;

else if (start > length)

start = length;

if (end < 0)

end = 0;

else if (end > length)

end = length;

state->isbytes = isbytes;

state->charsize = charsize;

state->beginning = ptr;

state->start = (void*) ((char*) ptr + start * state->charsize);

state->end = (void*) ((char*) ptr + end * state->charsize);

Py_INCREF(string);

state->string = string;

state->pos = start;

state->endpos = end;

if (pattern->flags & SRE_FLAG_LOCALE) {

state->lower = sre_lower_locale;

state->upper = sre_upper_locale;

}

else if (pattern->flags & SRE_FLAG_UNICODE) {

state->lower = sre_lower_unicode;

state->upper = sre_upper_unicode;

}

else {

state->lower = sre_lower;

state->upper = sre_upper;

}

return string;

err:

PyMem_Del(state->mark);

state->mark = NULL;

if (state->buffer.buf)

PyBuffer_Release(&state->buffer);

return NULL;

}

LOCAL(void)

state_fini(SRE_STATE* state)

{

if (state->buffer.buf)

PyBuffer_Release(&state->buffer);

Py_XDECREF(state->string);

data_stack_dealloc(state);

PyMem_Del(state->mark);

state->mark = NULL;

}

/* calculate offset from start of string */

#define STATE_OFFSET(state, member)\

(((char*)(member) - (char*)(state)->beginning) / (state)->charsize)

LOCAL(PyObject*)

getslice(int isbytes, const void *ptr,

PyObject* string, Py_ssize_t start, Py_ssize_t end)

{

if (isbytes) {

if (PyBytes_CheckExact(string) &&

start == 0 && end == PyBytes_GET_SIZE(string)) {

Py_INCREF(string);

return string;

}

return PyBytes_FromStringAndSize(

(const char *)ptr + start, end - start);

}

else {

return PyUnicode_Substring(string, start, end);

}

LOCAL(PyObject*)

state_getslice(SRE_STATE* state, Py_ssize_t index, PyObject* string, int empty)

{

Py_ssize_t i, j;

index = (index - 1) * 2;

if (string == Py_None || index >= state->lastmark || !state->mark[index] || !state->mark[index+1]) {

if (empty)

/* want empty string */

i = j = 0;

else {

Py_INCREF(Py_None);

return Py_None;

}

} else {

i = STATE_OFFSET(state, state->mark[index]);

j = STATE_OFFSET(state, state->mark[index+1]);

}

return getslice(state->isbytes, state->beginning, string, i, j);

}

static void

pattern_error(Py_ssize_t status)

{

switch (status) {

case SRE_ERROR_RECURSION_LIMIT:

/* This error code seems to be unused. */

PyErr_SetString(

PyExc_RecursionError,

"maximum recursion limit exceeded"

);

break;

case SRE_ERROR_MEMORY:

PyErr_NoMemory();

break;

case SRE_ERROR_INTERRUPTED:

/* An exception has already been raised, so let it fly */

break;

default:

/* other error codes indicate compiler/engine bugs */

PyErr_SetString(

PyExc_RuntimeError,

"internal error in regular expression engine"

);

}

static void

pattern_dealloc(PatternObject* self)

{

if (self->weakreflist != NULL)

PyObject_ClearWeakRefs((PyObject *) self);

Py_XDECREF(self->pattern);

Py_XDECREF(self->groupindex);

Py_XDECREF(self->indexgroup);

PyObject_DEL(self);

}

LOCAL(Py_ssize_t)

sre_match(SRE_STATE* state, SRE_CODE* pattern, int match_all)

{

if (state->charsize == 1)

return sre_ucs1_match(state, pattern, match_all);

if (state->charsize == 2)

return sre_ucs2_match(state, pattern, match_all);

assert(state->charsize == 4);

return sre_ucs4_match(state, pattern, match_all);

}

LOCAL(Py_ssize_t)

sre_search(SRE_STATE* state, SRE_CODE* pattern)

{

if (state->charsize == 1)

return sre_ucs1_search(state, pattern);

if (state->charsize == 2)

return sre_ucs2_search(state, pattern);

assert(state->charsize == 4);

return sre_ucs4_search(state, pattern);

}

static PyObject *

fix_string_param(PyObject *string, PyObject *string2, const char *oldname)

{

if (string2 != NULL) {

if (string != NULL) {

PyErr_Format(PyExc_TypeError,

"Argument given by name ('%s') and position (1)",

oldname);

return NULL;

}

if (PyErr_WarnFormat(PyExc_DeprecationWarning, 1,

"The '%s' keyword parameter name is deprecated. "

"Use 'string' instead.", oldname) < 0)

return NULL;

return string2;

}

if (string == NULL) {

PyErr_SetString(PyExc_TypeError,

"Required argument 'string' (pos 1) not found");

return NULL;

}

return string;

}

/*[clinic input]

_sre.SRE_Pattern.match

string: object = NULL

pos: Py_ssize_t = 0

endpos: Py_ssize_t(c_default="PY_SSIZE_T_MAX") = sys.maxsize

pattern: object = NULL

Matches zero or more characters at the beginning of the string.

[clinic start generated code]*/

static PyObject *

_sre_SRE_Pattern_match_impl(PatternObject *self, PyObject *string,

Py_ssize_t pos, Py_ssize_t endpos,

PyObject *pattern)

/*[clinic end generated code: output=74b4b1da3bb2d84e input=3d079aa99979b81d]*/

{

SRE_STATE state;

Py_ssize_t status;

PyObject *match;

string = fix_string_param(string, pattern, "pattern");

if (!string)

return NULL;

if (!state_init(&state, (PatternObject *)self, string, pos, endpos))

return NULL;

state.ptr = state.start;

TRACE(("|%p|%p|MATCH\n", PatternObject_GetCode(self), state.ptr));

status = sre_match(&state, PatternObject_GetCode(self), 0);

TRACE(("|%p|%p|END\n", PatternObject_GetCode(self), state.ptr));

if (PyErr_Occurred()) {

state_fini(&state);

return NULL;

}

match = pattern_new_match(self, &state, status);

state_fini(&state);

return match;

}

/*[clinic input]

_sre.SRE_Pattern.fullmatch

string: object = NULL

pos: Py_ssize_t = 0

endpos: Py_ssize_t(c_default="PY_SSIZE_T_MAX") = sys.maxsize

pattern: object = NULL

Matches against all of the string

[clinic start generated code]*/

static PyObject *

_sre_SRE_Pattern_fullmatch_impl(PatternObject *self, PyObject *string,

Py_ssize_t pos, Py_ssize_t endpos,

PyObject *pattern)

/*[clinic end generated code: output=1c98bc5da744ea94 input=d4228606cc12580f]*/

{

SRE_STATE state;

Py_ssize_t status;

PyObject *match;

string = fix_string_param(string, pattern, "pattern");

if (!string)

return NULL;

if (!state_init(&state, self, string, pos, endpos))

return NULL;

state.ptr = state.start;

TRACE(("|%p|%p|FULLMATCH\n", PatternObject_GetCode(self), state.ptr));

status = sre_match(&state, PatternObject_GetCode(self), 1);

TRACE(("|%p|%p|END\n", PatternObject_GetCode(self), state.ptr));

if (PyErr_Occurred()) {

state_fini(&state);

return NULL;

}

match = pattern_new_match(self, &state, status);

state_fini(&state);

return match;

}

/*[clinic input]

_sre.SRE_Pattern.search

string: object = NULL

pos: Py_ssize_t = 0

endpos: Py_ssize_t(c_default="PY_SSIZE_T_MAX") = sys.maxsize

pattern: object = NULL

Scan through string looking for a match, and return a corresponding match object instance.

Return None if no position in the string matches.

[clinic start generated code]*/

static PyObject *

_sre_SRE_Pattern_search_impl(PatternObject *self, PyObject *string,

Py_ssize_t pos, Py_ssize_t endpos,

PyObject *pattern)

/*[clinic end generated code: output=3839394a18e5ea4f input=dab42720f4be3a4b]*/

{

SRE_STATE state;

Py_ssize_t status;

PyObject *match;

string = fix_string_param(string, pattern, "pattern");

if (!string)

return NULL;

if (!state_init(&state, self, string, pos, endpos))

return NULL;

TRACE(("|%p|%p|SEARCH\n", PatternObject_GetCode(self), state.ptr));

status = sre_search(&state, PatternObject_GetCode(self));

TRACE(("|%p|%p|END\n", PatternObject_GetCode(self), state.ptr));

if (PyErr_Occurred()) {

state_fini(&state);

return NULL;

}

match = pattern_new_match(self, &state, status);

state_fini(&state);

return match;

}

static PyObject*

call(char* module, char* function, PyObject* args)

{

PyObject* name;

PyObject* mod;

PyObject* func;

PyObject* result;

if (!args)

return NULL;

name = PyUnicode_FromString(module);

if (!name)

return NULL;

mod = PyImport_Import(name);

Py_DECREF(name);

if (!mod)

return NULL;

func = PyObject_GetAttrString(mod, function);

Py_DECREF(mod);

if (!func)

return NULL;

result = PyObject_CallObject(func, args);

Py_DECREF(func);

Py_DECREF(args);

return result;

}

#ifdef USE_BUILTIN_COPY

static int

deepcopy(PyObject** object, PyObject* memo)

{

PyObject* copy;

copy = call(

"copy", "deepcopy",

PyTuple_Pack(2, *object, memo)

);

if (!copy)

return 0;

Py_SETREF(*object, copy);

return 1; /* success */

}

#endif

/*[clinic input]

_sre.SRE_Pattern.findall

string: object = NULL

pos: Py_ssize_t = 0

endpos: Py_ssize_t(c_default="PY_SSIZE_T_MAX") = sys.maxsize

source: object = NULL

Return a list of all non-overlapping matches of pattern in string.

[clinic start generated code]*/

static PyObject *

_sre_SRE_Pattern_findall_impl(PatternObject *self, PyObject *string,

Py_ssize_t pos, Py_ssize_t endpos,

PyObject *source)

/*[clinic end generated code: output=51295498b300639d input=df688355c056b9de]*/

{

SRE_STATE state;

PyObject* list;

Py_ssize_t status;

Py_ssize_t i, b, e;

string = fix_string_param(string, source, "source");

if (!string)

return NULL;

if (!state_init(&state, self, string, pos, endpos))

return NULL;

list = PyList_New(0);

if (!list) {

state_fini(&state);

return NULL;

}

while (state.start <= state.end) {

PyObject* item;

state_reset(&state);

state.ptr = state.start;

status = sre_search(&state, PatternObject_GetCode(self));

if (PyErr_Occurred())

goto error;

if (status <= 0) {

if (status == 0)

break;

pattern_error(status);

goto error;

}

/* don't bother to build a match object */

switch (self->groups) {

case 0:

b = STATE_OFFSET(&state, state.start);

e = STATE_OFFSET(&state, state.ptr);

item = getslice(state.isbytes, state.beginning,

string, b, e);

if (!item)

goto error;

break;

case 1:

item = state_getslice(&state, 1, string, 1);

if (!item)

goto error;

break;

default:

item = PyTuple_New(self->groups);

if (!item)

goto error;

for (i = 0; i < self->groups; i++) {

PyObject* o = state_getslice(&state, i+1, string, 1);

if (!o) {

Py_DECREF(item);

goto error;

}

PyTuple_SET_ITEM(item, i, o);

}

break;

}

status = PyList_Append(list, item);

Py_DECREF(item);

if (status < 0)

goto error;

if (state.ptr == state.start)

state.start = (void*) ((char*) state.ptr + state.charsize);

else

state.start = state.ptr;

}

state_fini(&state);

return list;

error:

Py_DECREF(list);

state_fini(&state);

return NULL;

}

/*[clinic input]

_sre.SRE_Pattern.finditer

string: object

pos: Py_ssize_t = 0

endpos: Py_ssize_t(c_default="PY_SSIZE_T_MAX") = sys.maxsize

Return an iterator over all non-overlapping matches for the RE pattern in string.

For each match, the iterator returns a match object.

[clinic start generated code]*/

static PyObject *

_sre_SRE_Pattern_finditer_impl(PatternObject *self, PyObject *string,

Py_ssize_t pos, Py_ssize_t endpos)

/*[clinic end generated code: output=0bbb1a0aeb38bb14 input=612aab69e9fe08e4]*/

{

PyObject* scanner;

PyObject* search;

PyObject* iterator;

scanner = pattern_scanner(self, string, pos, endpos);

if (!scanner)

return NULL;

search = PyObject_GetAttrString(scanner, "search");

Py_DECREF(scanner);

if (!search)

return NULL;

iterator = PyCallIter_New(search, Py_None);

Py_DECREF(search);

return iterator;

}

/*[clinic input]

_sre.SRE_Pattern.scanner

string: object

pos: Py_ssize_t = 0

endpos: Py_ssize_t(c_default="PY_SSIZE_T_MAX") = sys.maxsize

[clinic start generated code]*/

static PyObject *

_sre_SRE_Pattern_scanner_impl(PatternObject *self, PyObject *string,

Py_ssize_t pos, Py_ssize_t endpos)

/*[clinic end generated code: output=54ea548aed33890b input=3aacdbde77a3a637]*/

{

return pattern_scanner(self, string, pos, endpos);

}

/*[clinic input]

_sre.SRE_Pattern.split

string: object = NULL

maxsplit: Py_ssize_t = 0

source: object = NULL

Split string by the occurrences of pattern.

[clinic start generated code]*/

static PyObject *

_sre_SRE_Pattern_split_impl(PatternObject *self, PyObject *string,

Py_ssize_t maxsplit, PyObject *source)

/*[clinic end generated code: output=20bac2ff55b9f84c input=41e0b2e35e599d7b]*/

{

SRE_STATE state;

PyObject* list;

PyObject* item;

Py_ssize_t status;

Py_ssize_t n;

Py_ssize_t i;

void* last;

string = fix_string_param(string, source, "source");

if (!string)

return NULL;

assert(self->codesize != 0);

if (self->code[0] != SRE_OP_INFO || self->code[3] == 0) {

if (self->code[0] == SRE_OP_INFO && self->code[4] == 0) {

PyErr_SetString(PyExc_ValueError,

"split() requires a non-empty pattern match.");

return NULL;

}

if (PyErr_WarnEx(PyExc_FutureWarning,

"split() requires a non-empty pattern match.",

1) < 0)

return NULL;

}

if (!state_init(&state, self, string, 0, PY_SSIZE_T_MAX))

return NULL;

list = PyList_New(0);

if (!list) {

state_fini(&state);

return NULL;

}

n = 0;

last = state.start;

while (!maxsplit || n < maxsplit) {

state_reset(&state);

state.ptr = state.start;

status = sre_search(&state, PatternObject_GetCode(self));

if (PyErr_Occurred())

goto error;

if (status <= 0) {

if (status == 0)

break;

pattern_error(status);

goto error;

}

if (state.start == state.ptr) {

if (last == state.end || state.ptr == state.end)

break;

/* skip one character */

state.start = (void*) ((char*) state.ptr + state.charsize);

continue;

View remainder of file in raw view

cpython/Modules/_sre.c at 3.5 · python/cpython · GitHub

Repository navigation

Expand file tree

Breadcrumbs

_sre.c

Latest commit

History

Breadcrumbs

_sre.c

File metadata and controls