-
-
Notifications
You must be signed in to change notification settings - Fork 221
/
Copy pathdml_iters.go
752 lines (659 loc) · 20.9 KB
/
dml_iters.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
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
// Copyright 2023-2024 Dolthub, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package rowexec
import (
"fmt"
"io"
"sync"
"github.com/dolthub/go-mysql-server/sql"
"github.com/dolthub/go-mysql-server/sql/expression"
"github.com/dolthub/go-mysql-server/sql/plan"
"github.com/dolthub/go-mysql-server/sql/transform"
"github.com/dolthub/go-mysql-server/sql/types"
"github.com/dolthub/vitess/go/mysql"
)
const TriggerSavePointPrefix = "__go_mysql_server_trigger_savepoint__"
type triggerRollbackIter struct {
child sql.RowIter
savePointName string
}
func AddTriggerRollbackIter(ctx *sql.Context, qFlags *sql.QueryFlags, iter sql.RowIter) sql.RowIter {
if !qFlags.IsSet(sql.QFlagTrigger) {
return iter
}
transSess, isTransSess := ctx.Session.(sql.TransactionSession)
if !isTransSess {
return iter
}
ctx.GetLogger().Tracef("TriggerRollback creating savepoint: %s", TriggerSavePointPrefix)
if err := transSess.CreateSavepoint(ctx, ctx.GetTransaction(), TriggerSavePointPrefix); err != nil {
ctx.GetLogger().WithError(err).Errorf("CreateSavepoint failed")
}
return &triggerRollbackIter{
child: iter,
savePointName: TriggerSavePointPrefix,
}
}
func (t *triggerRollbackIter) Next(ctx *sql.Context) (row sql.Row, returnErr error) {
childRow, err := t.child.Next(ctx)
ts, ok := ctx.Session.(sql.TransactionSession)
if !ok {
return nil, fmt.Errorf("expected a sql.TransactionSession, but got %T", ctx.Session)
}
// Rollback if error occurred
if err != nil && err != io.EOF {
if err := ts.RollbackToSavepoint(ctx, ctx.GetTransaction(), t.savePointName); err != nil {
ctx.GetLogger().WithError(err).Errorf("Unexpected error when calling RollbackToSavePoint during triggerRollbackIter.Next()")
}
if err := ts.ReleaseSavepoint(ctx, ctx.GetTransaction(), t.savePointName); err != nil {
ctx.GetLogger().WithError(err).Errorf("Unexpected error when calling ReleaseSavepoint during triggerRollbackIter.Next()")
} else {
t.savePointName = ""
}
}
return childRow, err
}
func (t *triggerRollbackIter) Close(ctx *sql.Context) error {
ts, ok := ctx.Session.(sql.TransactionSession)
if !ok {
return fmt.Errorf("expected a sql.TransactionSession, but got %T", ctx.Session)
}
if len(t.savePointName) != 0 {
if err := ts.ReleaseSavepoint(ctx, ctx.GetTransaction(), t.savePointName); err != nil {
ctx.GetLogger().WithError(err).Errorf("Unexpected error when calling ReleaseSavepoint during triggerRollbackIter.Close()")
}
t.savePointName = ""
}
return t.child.Close(ctx)
}
// triggerBlockIter is the sql.RowIter for TRIGGER BEGIN/END blocks, which operate differently than normal blocks.
type triggerBlockIter struct {
statements []sql.Node
row sql.Row
once *sync.Once
b *BaseBuilder
}
var _ sql.RowIter = (*triggerBlockIter)(nil)
// Next implements the sql.RowIter interface.
func (i *triggerBlockIter) Next(ctx *sql.Context) (sql.Row, error) {
run := false
i.once.Do(func() {
run = true
})
if !run {
return nil, io.EOF
}
row := i.row
for _, s := range i.statements {
subIter, err := i.b.buildNodeExec(ctx, s, row)
if err != nil {
return nil, err
}
for {
newRow, err := subIter.Next(ctx)
if err == io.EOF {
err := subIter.Close(ctx)
if err != nil {
return nil, err
}
break
} else if err != nil {
_ = subIter.Close(ctx)
return nil, err
}
// We only return the result of a trigger block statement in certain cases, specifically when we are setting the
// value of new.field, so that the wrapping iterator can use it for the insert / update. Otherwise, this iterator
// always returns its input row.
if shouldUseTriggerStatementForReturnRow(s) {
row = newRow[len(newRow)/2:]
}
}
}
return row, nil
}
// shouldUseTriggerStatementForReturnRow returns whether the statement has Set node that contains GetField expression,
// which means whether there is column value update. The Set node can be inside other nodes, so need to inspect all nodes
// of the given node.
func shouldUseTriggerStatementForReturnRow(stmt sql.Node) bool {
hasSetField := false
transform.Inspect(stmt, func(n sql.Node) bool {
switch logic := n.(type) {
case *plan.Set:
for _, expr := range logic.Exprs {
sql.Inspect(expr.(*expression.SetField).LeftChild, func(e sql.Expression) bool {
if _, ok := e.(*expression.GetField); ok {
hasSetField = true
return false
}
return true
})
}
}
return true
})
return hasSetField
}
// Close implements the sql.RowIter interface.
func (i *triggerBlockIter) Close(*sql.Context) error {
return nil
}
type triggerIter struct {
child sql.RowIter
executionLogic sql.Node
triggerTime plan.TriggerTime
triggerEvent plan.TriggerEvent
ctx *sql.Context
b *BaseBuilder
}
// prependRowInPlanForTriggerExecution returns a transformation function that prepends the row given to any row source in a query
// plan. Any source of rows, as well as any node that alters the schema of its children, will be wrapped so that its
// result rows are prepended with the row given.
func prependRowInPlanForTriggerExecution(row sql.Row) func(c transform.Context) (sql.Node, transform.TreeIdentity, error) {
return func(c transform.Context) (sql.Node, transform.TreeIdentity, error) {
switch n := c.Node.(type) {
case *plan.Project:
// Only prepend rows for projects that aren't the input to inserts and other triggers
switch c.Parent.(type) {
case *plan.InsertInto, *plan.Into, *plan.TriggerExecutor, *plan.DeclareCursor, *plan.Project:
return n, transform.SameTree, nil
default:
return plan.NewPrependNode(n, row), transform.NewTree, nil
}
case *plan.ResolvedTable, *plan.IndexedTableAccess:
return plan.NewPrependNode(n, row), transform.NewTree, nil
case *plan.Call:
newNode, same, err := transform.NodeWithCtx(n.Procedure, prependRowForTriggerExecutionSelector, prependRowInPlanForTriggerExecution(row))
if err != nil {
return nil, transform.SameTree, err
}
if same {
return n, transform.SameTree, nil
}
return n.WithProcedure(newNode.(*plan.Procedure)), transform.NewTree, nil
case *plan.InsertInto:
newNode, same, err := transform.NodeWithCtx(n.Source, prependRowForTriggerExecutionSelector, prependRowInPlanForTriggerExecution(row))
if err != nil {
return nil, transform.SameTree, err
}
if same {
return n, transform.SameTree, nil
}
return n.WithSource(newNode), transform.NewTree, nil
case *plan.SubqueryAlias:
newNode, same, err := transform.NodeWithCtx(n.Child, prependRowForTriggerExecutionSelector, prependRowInPlanForTriggerExecution(row))
if err != nil {
return nil, transform.SameTree, err
}
if same {
return n, transform.SameTree, nil
}
return n.WithChild(newNode), transform.NewTree, nil
default:
return n, transform.SameTree, nil
}
}
}
func prependRowForTriggerExecutionSelector(ctx transform.Context) bool {
switch p := ctx.Parent.(type) {
case *plan.TriggerExecutor:
// don't nest prepends
return !(p.Right() == ctx.Node)
default:
return true
}
}
func (t *triggerIter) Next(ctx *sql.Context) (row sql.Row, returnErr error) {
childRow, err := t.child.Next(ctx)
if err != nil {
return nil, err
}
// Wrap the execution logic with the current child row before executing it.
logic, _, err := transform.NodeWithCtx(t.executionLogic, prependRowForTriggerExecutionSelector, prependRowInPlanForTriggerExecution(childRow))
if err != nil {
return nil, err
}
// We don't do anything interesting with this subcontext yet, but it's a good idea to cancel it independently of the
// parent context if something goes wrong in trigger execution.
ctx, cancelFunc := t.ctx.NewSubContext()
defer cancelFunc()
logicIter, err := t.b.buildNodeExec(ctx, logic, childRow)
if err != nil {
return nil, err
}
defer func() {
err := logicIter.Close(t.ctx)
if returnErr == nil {
returnErr = err
}
}()
var logicRow sql.Row
for {
row, err := logicIter.Next(ctx)
if err == io.EOF {
break
}
if err != nil {
return nil, err
}
logicRow = row
}
// For some logic statements, we want to return the result of the logic operation as our row, e.g. a Set that alters
// the fields of the new row
if ok, returnRow := shouldUseLogicResult(logic, logicRow); ok {
return returnRow, nil
}
return childRow, nil
}
func shouldUseLogicResult(logic sql.Node, row sql.Row) (bool, sql.Row) {
switch logic := logic.(type) {
// TODO: are there other statement types that we should use here?
case *plan.Set:
hasSetField := false
for _, expr := range logic.Exprs {
sql.Inspect(expr.(*expression.SetField).LeftChild, func(e sql.Expression) bool {
if _, ok := e.(*expression.GetField); ok {
hasSetField = true
return false
}
return true
})
}
return hasSetField, row[len(row)/2:]
case *plan.TriggerBeginEndBlock:
hasSetField := false
transform.Inspect(logic, func(n sql.Node) bool {
set, ok := n.(*plan.Set)
if !ok {
return true
}
for _, expr := range set.Exprs {
sql.Inspect(expr.(*expression.SetField).LeftChild, func(e sql.Expression) bool {
if _, ok := e.(*expression.GetField); ok {
hasSetField = true
return false
}
return true
})
}
return !hasSetField
})
return hasSetField, row
default:
return false, nil
}
}
func (t *triggerIter) Close(ctx *sql.Context) error {
return t.child.Close(ctx)
}
type accumulatorRowHandler interface {
handleRowUpdate(row sql.Row) error
okResult() types.OkResult
}
// TODO: Extend this to UPDATE IGNORE JOIN
type updateIgnoreAccumulatorRowHandler interface {
accumulatorRowHandler
handleRowUpdateWithIgnore(row sql.Row, ignore bool) error
}
type insertRowHandler struct {
rowsAffected int
lastInsertId uint64
updatedAutoIncrementValue bool
lastInsertIdGetter func(row sql.Row) int64
}
func (i *insertRowHandler) handleRowUpdate(row sql.Row) error {
i.rowsAffected++
if !i.updatedAutoIncrementValue {
i.updatedAutoIncrementValue = true
if i.lastInsertIdGetter != nil {
i.lastInsertId = uint64(i.lastInsertIdGetter(row))
}
}
return nil
}
func (i *insertRowHandler) getLastInsertId() uint64 {
return i.lastInsertId
}
func (i *insertRowHandler) okResult() types.OkResult {
return types.OkResult{
RowsAffected: uint64(i.rowsAffected),
}
}
type replaceRowHandler struct {
rowsAffected int
}
func (r *replaceRowHandler) handleRowUpdate(row sql.Row) error {
r.rowsAffected++
// If a row was deleted as well as inserted, increment the counter again. A row was deleted if at least one column in
// the first half of the row is non-null.
for i := 0; i < len(row)/2; i++ {
if row[i] != nil {
r.rowsAffected++
break
}
}
return nil
}
func (r *replaceRowHandler) okResult() types.OkResult {
return types.NewOkResult(r.rowsAffected)
}
type onDuplicateUpdateHandler struct {
rowsAffected int
schema sql.Schema
clientFoundRowsCapability bool
}
func (o *onDuplicateUpdateHandler) handleRowUpdate(row sql.Row) error {
// See https://dev.mysql.com/doc/refman/8.0/en/insert-on-duplicate.html for row count semantics
// If a row was inserted, increment by 1
if len(row) == len(o.schema) {
o.rowsAffected++
return nil
}
// Otherwise (a row was updated), increment by 2 if the row changed, 0 if not
oldRow := row[:len(row)/2]
newRow := row[len(row)/2:]
if equals, err := oldRow.Equals(newRow, o.schema); err == nil {
if equals {
// Ig the CLIENT_FOUND_ROWS capabilities flag is set, increment by 1 if a row stays the same.
if o.clientFoundRowsCapability {
o.rowsAffected++
}
} else {
o.rowsAffected += 2
}
} else {
o.rowsAffected++
}
return nil
}
func (o *onDuplicateUpdateHandler) okResult() types.OkResult {
return types.NewOkResult(o.rowsAffected)
}
type updateRowHandler struct {
rowsMatched int
rowsAffected int
schema sql.Schema
clientFoundRowsCapability bool
}
func (u *updateRowHandler) handleRowUpdate(row sql.Row) error {
u.rowsMatched++
oldRow := row[:len(row)/2]
newRow := row[len(row)/2:]
if equals, err := oldRow.Equals(newRow, u.schema); err == nil {
if !equals {
u.rowsAffected++
}
} else {
return err
}
return nil
}
func (u *updateRowHandler) handleRowUpdateWithIgnore(row sql.Row, ignore bool) error {
if !ignore {
return u.handleRowUpdate(row)
}
u.rowsMatched++
return nil
}
func (u *updateRowHandler) okResult() types.OkResult {
affected := u.rowsAffected
if u.clientFoundRowsCapability {
affected = u.rowsMatched
}
return types.OkResult{
RowsAffected: uint64(affected),
Info: plan.UpdateInfo{
Matched: u.rowsMatched,
Updated: u.rowsAffected,
Warnings: 0,
},
}
}
func (u *updateRowHandler) RowsMatched() int64 {
return int64(u.rowsMatched)
}
// updateJoinRowHandler handles row update count for all UPDATEs that use a JOIN.
type updateJoinRowHandler struct {
rowsMatched int
rowsAffected int
joinSchema sql.Schema
tableMap map[string]sql.Schema // Needs to only be the tables that can be updated.
updaterMap map[string]sql.RowUpdater
}
// handleRowMatched is called when an update join's source returns a row
func (u *updateJoinRowHandler) handleRowMatched() {
u.rowsMatched += 1
}
func (u *updateJoinRowHandler) handleRowUpdate(row sql.Row) error {
oldJoinRow := row[:len(row)/2]
newJoinRow := row[len(row)/2:]
tableToOldRow := plan.SplitRowIntoTableRowMap(oldJoinRow, u.joinSchema)
tableToNewRow := plan.SplitRowIntoTableRowMap(newJoinRow, u.joinSchema)
for tableName, _ := range u.updaterMap {
tableOldRow := tableToOldRow[tableName]
tableNewRow := tableToNewRow[tableName]
if equals, err := tableOldRow.Equals(tableNewRow, u.tableMap[tableName]); err == nil {
if !equals {
u.rowsAffected++
}
} else {
return err
}
}
return nil
}
func (u *updateJoinRowHandler) okResult() types.OkResult {
return types.OkResult{
RowsAffected: uint64(u.rowsAffected),
Info: plan.UpdateInfo{
Matched: u.rowsMatched,
Updated: u.rowsAffected,
Warnings: 0,
},
}
}
func (u *updateJoinRowHandler) RowsMatched() int64 {
return int64(u.rowsMatched)
}
type deleteRowHandler struct {
rowsAffected int
}
func (u *deleteRowHandler) handleRowUpdate(row sql.Row) error {
u.rowsAffected++
return nil
}
func (u *deleteRowHandler) okResult() types.OkResult {
return types.NewOkResult(u.rowsAffected)
}
type accumulatorIter struct {
iter sql.RowIter
once sync.Once
updateRowHandler accumulatorRowHandler
}
func getRowHandler(clientFoundRowsToggled bool, iter sql.RowIter) accumulatorRowHandler {
switch i := iter.(type) {
case *plan.TableEditorIter:
return getRowHandler(clientFoundRowsToggled, i.InnerIter())
case *plan.CheckpointingTableEditorIter:
return getRowHandler(clientFoundRowsToggled, i.InnerIter())
case *ProjectIter:
return getRowHandler(clientFoundRowsToggled, i.childIter)
case *triggerIter:
return getRowHandler(clientFoundRowsToggled, i.child)
case *blockIter:
return getRowHandler(clientFoundRowsToggled, i.repIter)
case *updateIter:
// it's possible that there's an updateJoinIter that's not the immediate child of updateIter
rowHandler := getRowHandler(clientFoundRowsToggled, i.childIter)
if rowHandler != nil {
return rowHandler
}
sch := i.schema
// special case for foreign keys; plan.ForeignKeyHandler.Schema() returns original schema
if fkHandler, isFk := i.updater.(*plan.ForeignKeyHandler); isFk {
sch = fkHandler.Sch
}
return &updateRowHandler{schema: sch, clientFoundRowsCapability: clientFoundRowsToggled}
case *updateJoinIter:
rowHandler := &updateJoinRowHandler{
joinSchema: i.joinSchema,
tableMap: plan.RecreateTableSchemaFromJoinSchema(i.joinSchema),
updaterMap: i.updaters,
}
i.accumulator = rowHandler
return rowHandler
case *insertIter:
if i.replacer != nil {
return &replaceRowHandler{}
}
if i.updater != nil {
return &onDuplicateUpdateHandler{schema: i.schema, clientFoundRowsCapability: clientFoundRowsToggled}
}
return &insertRowHandler{
lastInsertIdGetter: i.getAutoIncVal,
}
case *deleteIter:
return &deleteRowHandler{}
default:
return nil
}
}
func AddAccumulatorIter(ctx *sql.Context, iter sql.RowIter) (sql.RowIter, sql.Schema) {
switch i := iter.(type) {
case sql.MutableRowIter:
childIter := i.GetChildIter()
childIter, sch := AddAccumulatorIter(ctx, childIter)
return i.WithChildIter(childIter), sch
case *plan.TableEditorIter:
// If the TableEditorIter has RETURNING expressions, then we do NOT actually add the accumulatorIter
innerIter := i.InnerIter()
if insertIter, ok := innerIter.(*insertIter); ok && len(insertIter.returnExprs) > 0 {
return insertIter, insertIter.returnSchema
}
return defaultAccumulatorIter(ctx, iter)
default:
return defaultAccumulatorIter(ctx, iter)
}
}
// defaultAccumulatorIter returns the default accumulator iter for a DML node
func defaultAccumulatorIter(ctx *sql.Context, iter sql.RowIter) (sql.RowIter, sql.Schema) {
clientFoundRowsToggled := (ctx.Client().Capabilities & mysql.CapabilityClientFoundRows) > 0
rowHandler := getRowHandler(clientFoundRowsToggled, iter)
if rowHandler == nil {
return iter, nil
}
return &accumulatorIter{
iter: iter,
updateRowHandler: rowHandler,
}, types.OkResultSchema
}
func (a *accumulatorIter) Next(ctx *sql.Context) (r sql.Row, err error) {
run := false
a.once.Do(func() {
run = true
})
if !run {
return nil, io.EOF
}
// We close our child iterator before returning any results. In
// particular, the LOAD DATA source iterator needs to be closed before
// results are returned.
defer func() {
cerr := a.iter.Close(ctx)
if err == nil {
err = cerr
}
}()
for {
row, err := a.iter.Next(ctx)
igErr, isIg := err.(sql.IgnorableError)
select {
case <-ctx.Done():
return nil, ctx.Err()
default:
}
if err == io.EOF {
// TODO: The information flow here is pretty gnarly. We
// set some session variables based on the result, and
// we actually use a session variable to set
// InsertID. This should be improved.
// UPDATE statements also set FoundRows to the number of rows that
// matched the WHERE clause, same as a SELECT.
if ma, ok := a.updateRowHandler.(matchingAccumulator); ok {
ctx.SetLastQueryInfoInt(sql.FoundRows, ma.RowsMatched())
}
res := a.updateRowHandler.okResult() // TODO: Should add warnings here
// For some update accumulators, we don't accurately track the last insert ID in the handler and need to set
// it manually in the result by getting it from the session. This doesn't work correctly in all cases and needs
// to be fixed. See comment in buildRowUpdateAccumulator in rowexec/dml.go
switch rowHandler := a.updateRowHandler.(type) {
case *onDuplicateUpdateHandler, *replaceRowHandler:
lastInsertId := ctx.Session.GetLastQueryInfoInt(sql.LastInsertId)
res.InsertID = uint64(lastInsertId)
case *insertRowHandler:
res.InsertID = rowHandler.lastInsertId
}
// By definition, ROW_COUNT() is equal to RowsAffected.
ctx.SetLastQueryInfoInt(sql.RowCount, int64(res.RowsAffected))
return sql.NewRow(res), nil
} else if isIg {
if ui, ok := a.updateRowHandler.(updateIgnoreAccumulatorRowHandler); ok {
err = ui.handleRowUpdateWithIgnore(igErr.OffendingRow, true)
if err != nil {
return nil, err
}
}
} else if err != nil {
return nil, err
} else {
err = a.updateRowHandler.handleRowUpdate(row)
if err != nil {
return nil, err
}
}
}
}
func (a *accumulatorIter) Close(ctx *sql.Context) error {
return nil
}
type matchingAccumulator interface {
RowsMatched() int64
}
type updateSourceIter struct {
childIter sql.RowIter
updateExprs []sql.Expression
tableSchema sql.Schema
ignore bool
}
func (u *updateSourceIter) Next(ctx *sql.Context) (sql.Row, error) {
oldRow, err := u.childIter.Next(ctx)
if err != nil {
return nil, err
}
newRow, err := applyUpdateExpressionsWithIgnore(ctx, u.updateExprs, u.tableSchema, oldRow, u.ignore)
if err != nil {
return nil, err
}
// Reduce the row to the length of the schema. The length can differ when some update values come from an outer
// scope, which will be the first N values in the row.
// TODO: handle this in the analyzer instead?
expectedSchemaLen := len(u.tableSchema)
if expectedSchemaLen < len(oldRow) {
oldRow = oldRow[len(oldRow)-expectedSchemaLen:]
newRow = newRow[len(newRow)-expectedSchemaLen:]
}
return oldRow.Append(newRow), nil
}
func (u *updateSourceIter) Close(ctx *sql.Context) error {
return u.childIter.Close(ctx)
}