postgres_vectorization_test/vectorized_aggregates.c at master · citusdata/postgres_vectorization_test · GitHub

History

1523 lines (1307 loc) · 43.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

#include "postgres.h"

#include "cstore_fdw.h"

#include "vectorized_aggregates.h"

#include "access/htup_details.h"

#include "access/sysattr.h"

#include "access/transam.h"

#include "access/xact.h"

#include "catalog/namespace.h"

#include "catalog/objectaccess.h"

#include "catalog/pg_aggregate.h"

#include "catalog/pg_proc.h"

#include "catalog/pg_type.h"

#include "commands/trigger.h"

#include "executor/execdebug.h"

#include "executor/executor.h"

#include "executor/nodeAgg.h"

#include "foreign/fdwapi.h"

#include "mb/pg_wchar.h"

#include "miscadmin.h"

#include "nodes/nodeFuncs.h"

#include "optimizer/clauses.h"

#include "optimizer/tlist.h"

#include "parser/parse_agg.h"

#include "parser/parse_coerce.h"

#include "parser/parsetree.h"

#include "storage/bufmgr.h"

#include "storage/lmgr.h"

#include "tcop/utility.h"

#include "utils/acl.h"

#include "utils/builtins.h"

#include "utils/hsearch.h"

#include "utils/lsyscache.h"

#include "utils/memutils.h"

#include "utils/snapmgr.h"

#include "utils/syscache.h"

#include "utils/tqual.h"

#include "utils/tuplesort.h"

#include "utils/datum.h"

#include "utils/typcache.h"

* AggStatePerAggData - per-aggregate working state for the Agg scan

typedef struct AggStatePerAggData

{

* These values are set up during ExecInitAgg() and do not change

* thereafter:

/* Links to Aggref expr and state nodes this working state is for */

AggrefExprState *aggrefstate;

Aggref *aggref;

/* number of input arguments for aggregate function proper */

int numArguments;

/* number of inputs including ORDER BY expressions */

int numInputs;

/* Oids of transfer functions */

Oid transfn_oid;

Oid finalfn_oid; /* may be InvalidOid */

* fmgr lookup data for transfer functions --- only valid when

* corresponding oid is not InvalidOid. Note in particular that fn_strict

* flags are kept here.

FmgrInfo transfn;

FmgrInfo finalfn;

/* Input collation derived for aggregate */

Oid aggCollation;

/* number of sorting columns */

int numSortCols;

/* number of sorting columns to consider in DISTINCT comparisons */

/* (this is either zero or the same as numSortCols) */

int numDistinctCols;

/* deconstructed sorting information (arrays of length numSortCols) */

AttrNumber *sortColIdx;

Oid *sortOperators;

Oid *sortCollations;

bool *sortNullsFirst;

* fmgr lookup data for input columns' equality operators --- only

* set/used when aggregate has DISTINCT flag. Note that these are in

* order of sort column index, not parameter index.

FmgrInfo *equalfns; /* array of length numDistinctCols */

* initial value from pg_aggregate entry

Datum initValue;

bool initValueIsNull;

* We need the len and byval info for the agg's input, result, and

* transition data types in order to know how to copy/delete values.

* Note that the info for the input type is used only when handling

* DISTINCT aggs with just one argument, so there is only one input type.

int16 inputtypeLen,

resulttypeLen,

transtypeLen;

bool inputtypeByVal,

resulttypeByVal,

transtypeByVal;

* Stuff for evaluation of inputs. We used to just use ExecEvalExpr, but

* with the addition of ORDER BY we now need at least a slot for passing

* data to the sort object, which requires a tupledesc, so we might as

* well go whole hog and use ExecProject too.

TupleDesc evaldesc; /* descriptor of input tuples */

ProjectionInfo *evalproj; /* projection machinery */

* Slots for holding the evaluated input arguments. These are set up

* during ExecInitAgg() and then used for each input row.

TupleTableSlot *evalslot; /* current input tuple */

TupleTableSlot *uniqslot; /* used for multi-column DISTINCT */

* These values are working state that is initialized at the start of an

* input tuple group and updated for each input tuple.

* For a simple (non DISTINCT/ORDER BY) aggregate, we just feed the input

* values straight to the transition function. If it's DISTINCT or

* requires ORDER BY, we pass the input values into a Tuplesort object;

* then at completion of the input tuple group, we scan the sorted values,

* eliminate duplicates if needed, and run the transition function on the

* rest.

Tuplesortstate *sortstate; /* sort object, if DISTINCT or ORDER BY */

} AggStatePerAggData;

* AggStatePerGroupData - per-aggregate-per-group working state

* These values are working state that is initialized at the start of

* an input tuple group and updated for each input tuple.

* In AGG_PLAIN and AGG_SORTED modes, we have a single array of these

* structs (pointed to by aggstate->pergroup); we re-use the array for

* each input group, if it's AGG_SORTED mode. In AGG_HASHED mode, the

* hash table contains an array of these structs for each tuple group.

* Logically, the sortstate field belongs in this struct, but we do not

* keep it here for space reasons: we don't support DISTINCT aggregates

* in AGG_HASHED mode, so there's no reason to use up a pointer field

* in every entry of the hashtable.

typedef struct AggStatePerGroupData

{

Datum transValue; /* current transition value */

bool transValueIsNull;

bool noTransValue; /* true if transValue not set yet */

* Note: noTransValue initially has the same value as transValueIsNull,

* and if true both are cleared to false at the same time. They are not

* the same though: if transfn later returns a NULL, we want to keep that

* NULL and not auto-replace it with a later input value. Only the first

* non-NULL input will be auto-substituted.

} AggStatePerGroupData;

* To implement hashed aggregation, we need a hashtable that stores a

* representative tuple and an array of AggStatePerGroup structs for each

* distinct set of GROUP BY column values. We compute the hash key from

* the GROUP BY columns.

typedef struct AggHashEntryData *AggHashEntry;

typedef struct AggHashEntryData

{

TupleHashEntryData shared; /* common header for hash table entries */

/* per-aggregate transition status array - must be last! */

AggStatePerGroupData pergroup[1]; /* VARIABLE LENGTH ARRAY */

} AggHashEntryData; /* VARIABLE LENGTH STRUCT */

typedef struct AggregationHashEntry

{

Datum key;

Datum value;

} AggregationHashEntry;

typedef enum VectorizedAggType

{

VAT_GROUP_BY_COUNT,

VAT_GROUP_BY_SUM

} VectorizedAggType;

static void initialize_aggregates(AggState *aggstate,

AggStatePerAgg peragg,

AggStatePerGroup pergroup);

static void process_ordered_aggregate_single(AggState *aggstate,

AggStatePerAgg peraggstate,

AggStatePerGroup pergroupstate);

static void process_ordered_aggregate_multi(AggState *aggstate,

AggStatePerAgg peraggstate,

AggStatePerGroup pergroupstate);

static void advance_transition_function(AggState *aggstate,

AggStatePerAgg peraggstate,

AggStatePerGroup pergroupstate,

FunctionCallInfoData *fcinfo);

static void finalize_aggregate(AggState *aggstate,

AggStatePerAgg peraggstate,

AggStatePerGroup pergroupstate,

Datum *resultVal,

bool *resultIsNull);

static void ExecutePlanVectorized(EState *estate,

PlanState *planstate,

CmdType operation,

bool sendTuples,

long numberTuples,

ScanDirection direction,

DestReceiver *dest);

static void advance_aggregates_vectorized(AggState *aggstate,

AggStatePerGroup pergroup);

static void advance_transition_function_vectorized(AggState *aggstate,

AggStatePerAgg peraggstate,

AggStatePerGroup pergroupstate,

FunctionCallInfoData *fcinfo);

static TupleTableSlot *agg_retrieve_hash_vectorized(AggState *aggstate);

static TupleTableSlot *agg_retrieve_direct_vectorized(AggState *aggstate);

int CompareHashKeyStrings(const void *key1, const void *key2, Size keysize);

/* is it a group by query */

static Var *CurrentKeyVar = NULL;

static Var *CurrentValueVar = NULL;

static HTAB *CurrentAggregationHash = NULL;

static HASH_SEQ_STATUS CurrentHashSeqStatus;

static VectorizedAggType CurrentVectorizedAggType = VAT_GROUP_BY_COUNT;

static FmgrInfo *CurrentHashFunction = NULL;

static FmgrInfo *CurrentEqualityFunction = NULL;

static uint32 VectorizedHashTableHash(const void *key, Size keysize);

static int VectorizedHashTableMatch(const void *key1, const void *key2, Size keySize);

* Initialize all aggregates for a new group of input values.

* When called, CurrentMemoryContext should be the per-query context.

static void

initialize_aggregates(AggState *aggstate,

AggStatePerAgg peragg,

AggStatePerGroup pergroup)

{

int aggno;

for (aggno = 0; aggno < aggstate->numaggs; aggno++)

{

AggStatePerAgg peraggstate = &peragg[aggno];

AggStatePerGroup pergroupstate = &pergroup[aggno];

* Start a fresh sort operation for each DISTINCT/ORDER BY aggregate.

if (peraggstate->numSortCols > 0)

{

* In case of rescan, maybe there could be an uncompleted sort

* operation? Clean it up if so.

if (peraggstate->sortstate)

tuplesort_end(peraggstate->sortstate);

* We use a plain Datum sorter when there's a single input column;

* otherwise sort the full tuple. (See comments for

* process_ordered_aggregate_single.)

peraggstate->sortstate =

(peraggstate->numInputs == 1) ?

tuplesort_begin_datum(peraggstate->evaldesc->attrs[0]->atttypid,

peraggstate->sortOperators[0],

peraggstate->sortCollations[0],

peraggstate->sortNullsFirst[0],

work_mem, false) :

tuplesort_begin_heap(peraggstate->evaldesc,

peraggstate->numSortCols,

peraggstate->sortColIdx,

peraggstate->sortOperators,

peraggstate->sortCollations,

peraggstate->sortNullsFirst,

work_mem, false);

}

* (Re)set transValue to the initial value.

* Note that when the initial value is pass-by-ref, we must copy it

* (into the aggcontext) since we will pfree the transValue later.

if (peraggstate->initValueIsNull)

pergroupstate->transValue = peraggstate->initValue;

else

{

MemoryContext oldContext;

oldContext = MemoryContextSwitchTo(aggstate->aggcontext);

pergroupstate->transValue = datumCopy(peraggstate->initValue,

peraggstate->transtypeByVal,

peraggstate->transtypeLen);

MemoryContextSwitchTo(oldContext);

}

pergroupstate->transValueIsNull = peraggstate->initValueIsNull;

* If the initial value for the transition state doesn't exist in the

* pg_aggregate table then we will let the first non-NULL value

* returned from the outer procNode become the initial value. (This is

* useful for aggregates like max() and min().) The noTransValue flag

* signals that we still need to do this.

pergroupstate->noTransValue = peraggstate->initValueIsNull;

}

* Run the transition function for a DISTINCT or ORDER BY aggregate

* with only one input. This is called after we have completed

* entering all the input values into the sort object. We complete the

* sort, read out the values in sorted order, and run the transition

* function on each value (applying DISTINCT if appropriate).

* Note that the strictness of the transition function was checked when

* entering the values into the sort, so we don't check it again here;

* we just apply standard SQL DISTINCT logic.

* The one-input case is handled separately from the multi-input case

* for performance reasons: for single by-value inputs, such as the

* common case of count(distinct id), the tuplesort_getdatum code path

* is around 300% faster. (The speedup for by-reference types is less

* but still noticeable.)

* When called, CurrentMemoryContext should be the per-query context.

static void

process_ordered_aggregate_single(AggState *aggstate,

AggStatePerAgg peraggstate,

AggStatePerGroup pergroupstate)

{

Datum oldVal = (Datum) 0;

bool oldIsNull = true;

bool haveOldVal = false;

MemoryContext workcontext = aggstate->tmpcontext->ecxt_per_tuple_memory;

MemoryContext oldContext;

bool isDistinct = (peraggstate->numDistinctCols > 0);

Datum *newVal;

bool *isNull;

FunctionCallInfoData fcinfo;

Assert(peraggstate->numDistinctCols < 2);

tuplesort_performsort(peraggstate->sortstate);

/* Load the column into argument 1 (arg 0 will be transition value) */

newVal = fcinfo.arg + 1;

isNull = fcinfo.argnull + 1;

* Note: if input type is pass-by-ref, the datums returned by the sort are

* freshly palloc'd in the per-query context, so we must be careful to

* pfree them when they are no longer needed.

while (tuplesort_getdatum(peraggstate->sortstate, true,

newVal, isNull))

{

* Clear and select the working context for evaluation of the equality

* function and transition function.

MemoryContextReset(workcontext);

oldContext = MemoryContextSwitchTo(workcontext);

* If DISTINCT mode, and not distinct from prior, skip it.

* Note: we assume equality functions don't care about collation.

if (isDistinct &&

haveOldVal &&

((oldIsNull && *isNull) ||

(!oldIsNull && !*isNull &&

DatumGetBool(FunctionCall2(&peraggstate->equalfns[0],

oldVal, *newVal)))))

{

/* equal to prior, so forget this one */

if (!peraggstate->inputtypeByVal && !*isNull)

pfree(DatumGetPointer(*newVal));

}

else

{

advance_transition_function(aggstate, peraggstate, pergroupstate,

&fcinfo);

/* forget the old value, if any */

if (!oldIsNull && !peraggstate->inputtypeByVal)

pfree(DatumGetPointer(oldVal));

/* and remember the new one for subsequent equality checks */

oldVal = *newVal;

oldIsNull = *isNull;

haveOldVal = true;

}

MemoryContextSwitchTo(oldContext);

}

if (!oldIsNull && !peraggstate->inputtypeByVal)

pfree(DatumGetPointer(oldVal));

tuplesort_end(peraggstate->sortstate);

peraggstate->sortstate = NULL;

}

* Run the transition function for a DISTINCT or ORDER BY aggregate

* with more than one input. This is called after we have completed

* entering all the input values into the sort object. We complete the

* sort, read out the values in sorted order, and run the transition

* function on each value (applying DISTINCT if appropriate).

* When called, CurrentMemoryContext should be the per-query context.

static void

process_ordered_aggregate_multi(AggState *aggstate,

AggStatePerAgg peraggstate,

AggStatePerGroup pergroupstate)

{

MemoryContext workcontext = aggstate->tmpcontext->ecxt_per_tuple_memory;

FunctionCallInfoData fcinfo;

TupleTableSlot *slot1 = peraggstate->evalslot;

TupleTableSlot *slot2 = peraggstate->uniqslot;

int numArguments = peraggstate->numArguments;

int numDistinctCols = peraggstate->numDistinctCols;

bool haveOldValue = false;

int i;

tuplesort_performsort(peraggstate->sortstate);

ExecClearTuple(slot1);

if (slot2)

ExecClearTuple(slot2);

while (tuplesort_gettupleslot(peraggstate->sortstate, true, slot1))

{

* Extract the first numArguments as datums to pass to the transfn.

* (This will help execTuplesMatch too, so do it immediately.)

slot_getsomeattrs(slot1, numArguments);

if (numDistinctCols == 0 ||

!haveOldValue ||

!execTuplesMatch(slot1, slot2,

numDistinctCols,

peraggstate->sortColIdx,

peraggstate->equalfns,

workcontext))

{

/* Load values into fcinfo */

/* Start from 1, since the 0th arg will be the transition value */

for (i = 0; i < numArguments; i++)

{

fcinfo.arg[i + 1] = slot1->tts_values[i];

fcinfo.argnull[i + 1] = slot1->tts_isnull[i];

}

advance_transition_function(aggstate, peraggstate, pergroupstate,

&fcinfo);

if (numDistinctCols > 0)

{

/* swap the slot pointers to retain the current tuple */

TupleTableSlot *tmpslot = slot2;

slot2 = slot1;

slot1 = tmpslot;

haveOldValue = true;

}

/* Reset context each time, unless execTuplesMatch did it for us */

if (numDistinctCols == 0)

MemoryContextReset(workcontext);

ExecClearTuple(slot1);

}

if (slot2)

ExecClearTuple(slot2);

tuplesort_end(peraggstate->sortstate);

peraggstate->sortstate = NULL;

}

* Given new input value(s), advance the transition function of an aggregate.

* The new values (and null flags) have been preloaded into argument positions

* 1 and up in fcinfo, so that we needn't copy them again to pass to the

* transition function. No other fields of fcinfo are assumed valid.

* It doesn't matter which memory context this is called in.

static void

advance_transition_function(AggState *aggstate,

AggStatePerAgg peraggstate,

AggStatePerGroup pergroupstate,

FunctionCallInfoData *fcinfo)

{

int numArguments = peraggstate->numArguments;

MemoryContext oldContext;

Datum newVal;

int i;

if (peraggstate->transfn.fn_strict)

{

* For a strict transfn, nothing happens when there's a NULL input; we

* just keep the prior transValue.

for (i = 1; i <= numArguments; i++)

{

if (fcinfo->argnull[i])

return;

}

if (pergroupstate->noTransValue)

{

* transValue has not been initialized. This is the first non-NULL

* input value. We use it as the initial value for transValue. (We

* already checked that the agg's input type is binary-compatible

* with its transtype, so straight copy here is OK.)

* We must copy the datum into aggcontext if it is pass-by-ref. We

* do not need to pfree the old transValue, since it's NULL.

oldContext = MemoryContextSwitchTo(aggstate->aggcontext);

pergroupstate->transValue = datumCopy(fcinfo->arg[1],

peraggstate->transtypeByVal,

peraggstate->transtypeLen);

pergroupstate->transValueIsNull = false;

pergroupstate->noTransValue = false;

MemoryContextSwitchTo(oldContext);

return;

}

if (pergroupstate->transValueIsNull)

{

* Don't call a strict function with NULL inputs. Note it is

* possible to get here despite the above tests, if the transfn is

* strict *and* returned a NULL on a prior cycle. If that happens

* we will propagate the NULL all the way to the end.

return;

}

/* We run the transition functions in per-input-tuple memory context */

oldContext = MemoryContextSwitchTo(aggstate->tmpcontext->ecxt_per_tuple_memory);

* OK to call the transition function

InitFunctionCallInfoData(*fcinfo, &(peraggstate->transfn),

numArguments + 1,

peraggstate->aggCollation,

(void *) aggstate, NULL);

fcinfo->arg[0] = pergroupstate->transValue;

fcinfo->argnull[0] = pergroupstate->transValueIsNull;

newVal = FunctionCallInvoke(fcinfo);

* If pass-by-ref datatype, must copy the new value into aggcontext and

* pfree the prior transValue. But if transfn returned a pointer to its

* first input, we don't need to do anything.

if (!peraggstate->transtypeByVal &&

DatumGetPointer(newVal) != DatumGetPointer(pergroupstate->transValue))

{

if (!fcinfo->isnull)

{

MemoryContextSwitchTo(aggstate->aggcontext);

newVal = datumCopy(newVal,

peraggstate->transtypeByVal,

peraggstate->transtypeLen);

}

if (!pergroupstate->transValueIsNull)

pfree(DatumGetPointer(pergroupstate->transValue));

}

pergroupstate->transValue = newVal;

pergroupstate->transValueIsNull = fcinfo->isnull;

MemoryContextSwitchTo(oldContext);

}

* Compute the final value of one aggregate.

* The finalfunction will be run, and the result delivered, in the

* output-tuple context; caller's CurrentMemoryContext does not matter.

static void

finalize_aggregate(AggState *aggstate,

AggStatePerAgg peraggstate,

AggStatePerGroup pergroupstate,

Datum *resultVal, bool *resultIsNull)

{

MemoryContext oldContext;

oldContext = MemoryContextSwitchTo(aggstate->ss.ps.ps_ExprContext->ecxt_per_tuple_memory);

* Apply the agg's finalfn if one is provided, else return transValue.

if (OidIsValid(peraggstate->finalfn_oid))

{

FunctionCallInfoData fcinfo;

InitFunctionCallInfoData(fcinfo, &(peraggstate->finalfn), 1,

peraggstate->aggCollation,

(void *) aggstate, NULL);

fcinfo.arg[0] = pergroupstate->transValue;

fcinfo.argnull[0] = pergroupstate->transValueIsNull;

if (fcinfo.flinfo->fn_strict && pergroupstate->transValueIsNull)

{

/* don't call a strict function with NULL inputs */

*resultVal = (Datum) 0;

*resultIsNull = true;

}

else

{

*resultVal = FunctionCallInvoke(&fcinfo);

*resultIsNull = fcinfo.isnull;

}

else

{

*resultVal = pergroupstate->transValue;

*resultIsNull = pergroupstate->transValueIsNull;

}

* If result is pass-by-ref, make sure it is in the right context.

if (!peraggstate->resulttypeByVal && !*resultIsNull &&

!MemoryContextContains(CurrentMemoryContext,

DatumGetPointer(*resultVal)))

*resultVal = datumCopy(*resultVal,

peraggstate->resulttypeByVal,

peraggstate->resulttypeLen);

MemoryContextSwitchTo(oldContext);

}

* If the query is a supported one, use the vectorized execution,

* if not use the standard one.

void

vectorized_ExecutorRun(QueryDesc *queryDesc,

ScanDirection direction,

long count)

{

PlannedStmt *plannedstmt = queryDesc->plannedstmt;

struct Plan *planTree = plannedstmt->planTree;

bool groupByAggregate = false;

bool vectorizedExecution = false;

if ((planTree != NULL) && (planTree->type == T_Agg) &&

( planTree->lefttree != NULL) && (planTree->lefttree->type == T_ForeignScan))

{

vectorizedExecution = true;

}

if (vectorizedExecution && (((Agg *) planTree)->aggstrategy == AGG_HASHED))

{

groupByAggregate = true;

}

if (groupByAggregate)

{

TargetEntry *targetEntry1 = (TargetEntry *) linitial(planTree->targetlist);

TargetEntry *targetEntry2 = (TargetEntry *) lsecond(planTree->targetlist);

Expr *expr1 = targetEntry1->expr;

Expr *expr2 = targetEntry2->expr;

if (expr1->type == T_Var && expr2->type == T_Aggref)

{

Aggref *aggref = (Aggref *) expr2;

Oid aggregateFunctionId = aggref->aggfnoid;

List *aggregateArgumentList = aggref->args;

int32 aggregateArgumentCount = list_length(aggregateArgumentList);

TargetEntry *targetEntry = NULL;

/* look up the function name */

char *aggregateFunctionName = get_func_name(aggregateFunctionId);

if (aggregateFunctionName == NULL)

{

ereport(ERROR, (errmsg("cache lookup failed for function %u",

aggregateFunctionId)));

}

if (strncmp(aggregateFunctionName, "count", NAMEDATALEN) == 0)

{

CurrentVectorizedAggType = VAT_GROUP_BY_COUNT;

}

else if (strncmp(aggregateFunctionName, "sum", NAMEDATALEN) == 0)

{

CurrentVectorizedAggType = VAT_GROUP_BY_SUM;

}

else

{

ereport(ERROR, (errmsg("vectorization unsupported for \"%s\" "

"group by", aggregateFunctionName)));

}

* We also check for the argument count here. count(column) works,

* but count(*) returns 0 arguments. To make 0 arguments work, we

* need to rework the if / else nestings in vectorized group bys.

* For now, we only support count(column) group bys, and error out

* on count(*) group bys.

if (aggregateArgumentCount != 1)

{

ereport(ERROR, (errmsg("vectorized group by aggregate received "

"%d arguments, but supports only 1",

aggregateArgumentCount)));

}

/* set global key and value columns */

CurrentKeyVar = (Var *) expr1;

targetEntry = (TargetEntry *) linitial(aggregateArgumentList);

CurrentValueVar = (Var *) targetEntry->expr;

}

if (vectorizedExecution)

{

EState *estate = NULL;

CmdType operation = CMD_UNKNOWN;

DestReceiver *dest = NULL;

bool sendTuples = false;

MemoryContext oldcontext = NULL;

/* sanity checks */

Assert(queryDesc != NULL);

estate = queryDesc->estate;

Assert(estate != NULL);

Assert(!(estate->es_top_eflags & EXEC_FLAG_EXPLAIN_ONLY));

* Switch into per-query memory context

oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);

/* Allow instrumentation of Executor overall runtime */

if (queryDesc->totaltime)

{

InstrStartNode(queryDesc->totaltime);

}

* extract information from the query descriptor and the query feature.

operation = queryDesc->operation;

dest = queryDesc->dest;

* startup tuple receiver, if we will be emitting tuples

estate->es_processed = 0;

estate->es_lastoid = InvalidOid;

if ((operation == CMD_SELECT) || queryDesc->plannedstmt->hasReturning)

{

sendTuples = true;

}

if (sendTuples)

{

(*dest->rStartup) (dest, operation, queryDesc->tupDesc);

}

* run plan

if (!ScanDirectionIsNoMovement(direction))

{

ExecutePlanVectorized(estate, queryDesc->planstate, operation,

sendTuples, count, direction, dest);

}

* shutdown tuple receiver, if we started it

if (sendTuples)

{

(*dest->rShutdown) (dest);

}

if (queryDesc->totaltime)

{

InstrStopNode(queryDesc->totaltime, estate->es_processed);

}

MemoryContextSwitchTo(oldcontext);

}

else

{

standard_ExecutorRun(queryDesc, direction, count);

}

* Same as ExecutePlan. Instead of ExecProcNode we call ExecProcNodeVectorized.

static void

ExecutePlanVectorized(EState *estate, PlanState *planstate, CmdType operation,

bool sendTuples, long numberTuples, ScanDirection direction,

DestReceiver *dest)

{

TupleTableSlot *slot = NULL;

long current_tuple_count = 0;

* initialize local variables

current_tuple_count = 0;

* Set the direction.

estate->es_direction = direction;

* Loop until we've processed the proper number of tuples from the plan.

for (;;)

{

/* Reset the per-output-tuple exprcontext */

ResetPerTupleExprContext(estate);

* Execute the plan and obtain a tuple

slot = ExecProcNodeVectorized(planstate);

* if the tuple is null, then we assume there is nothing more to

* process so we just end the loop...

if (TupIsNull(slot))

break;

* If we have a junk filter, then project a new tuple with the junk

* removed.

* Store this new "clean" tuple in the junkfilter's resultSlot.

* (Formerly, we stored it back over the "dirty" tuple, which is WRONG

* because that tuple slot has the wrong descriptor.)

if (estate->es_junkFilter != NULL)

slot = ExecFilterJunk(estate->es_junkFilter, slot);

* If we are supposed to send the tuple somewhere, do so. (In

* practice, this is probably always the case at this point.)

if (sendTuples)

(*dest->receiveSlot) (slot, dest);

* Count tuples processed, if this is a SELECT. (For other operation

* types, the ModifyTable plan node must count the appropriate

* events.)

if (operation == CMD_SELECT)

(estate->es_processed)++;

* check our tuple count.. if we've processed the proper number then

* quit, else loop again and process more tuples. Zero numberTuples

* means no limit.

current_tuple_count++;

if (numberTuples && numberTuples == current_tuple_count)

break;

}

* Similar to ExecProcNode, but supports only T_AggState. Instead of ExecAgg

* we call ExecAggVectorized.

TupleTableSlot *

ExecProcNodeVectorized(PlanState *node)

{

TupleTableSlot *result = NULL;

CHECK_FOR_INTERRUPTS();

if (node->chgParam != NULL) /* something changed */

ExecReScan(node); /* let ReScan handle this */

if (node->instrument)

InstrStartNode(node->instrument);

switch (nodeTag(node))

{

case T_AggState:

result = ExecAggVectorized((AggState *) node);

break;

default:

elog(ERROR, "unrecognized node type: %d", (int) nodeTag(node));

result = NULL;

break;

}

if (node->instrument)

InstrStopNode(node->instrument, TupIsNull(result) ? 0.0 : 1.0);

return result;

}

* Similar to ExecAgg, but supports only plain aggregates. Instead of

* agg_retrieve_direct, we call agg_retrieve_direct_vectorized.

TupleTableSlot *

ExecAggVectorized(AggState *node)

{

* Check to see if we're still projecting out tuples from a previous agg

* tuple (because there is a function-returning-set in the projection

* expressions). If so, try to project another one.

if (node->ss.ps.ps_TupFromTlist)

{

TupleTableSlot *result;

ExprDoneCond isDone;

result = ExecProject(node->ss.ps.ps_ProjInfo, &isDone);

if (isDone == ExprMultipleResult)

return result;

/* Done with that source tuple... */

node->ss.ps.ps_TupFromTlist = false;

}

* Exit if nothing left to do. (We must do the ps_TupFromTlist check

* first, because in some cases agg_done gets set before we emit the final

* aggregate tuple, and we have to finish running SRFs for it.)

if (node->agg_done)

return NULL;

/* Dispatch based on strategy */

View remainder of file in raw view

postgres_vectorization_test/vectorized_aggregates.c at master · citusdata/postgres_vectorization_test · GitHub

Expand file tree

Breadcrumbs

vectorized_aggregates.c

Latest commit

History

Breadcrumbs

vectorized_aggregates.c

File metadata and controls