Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
P
postgres-lambda-diff
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Jakob Huber
postgres-lambda-diff
Commits
b1b246ab
Commit
b1b246ab
authored
27 years ago
by
Vadim B. Mikheev
Browse files
Options
Downloads
Patches
Plain Diff
New nodeGroup.c code uses own copy of first tuple in a group.
Free memory after comparison in nodeUnique.c
parent
3d18ca70
No related branches found
No related tags found
No related merge requests found
Changes
2
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
src/backend/executor/nodeGroup.c
+58
-85
58 additions, 85 deletions
src/backend/executor/nodeGroup.c
src/backend/executor/nodeUnique.c
+8
-3
8 additions, 3 deletions
src/backend/executor/nodeUnique.c
with
66 additions
and
88 deletions
src/backend/executor/nodeGroup.c
+
58
−
85
View file @
b1b246ab
...
...
@@ -13,7 +13,7 @@
* columns. (ie. tuples from the same group are consecutive)
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/executor/nodeGroup.c,v 1.1
6
1998/02/1
0
1
6:02:58 momjian
Exp $
* $Header: /cvsroot/pgsql/src/backend/executor/nodeGroup.c,v 1.1
7
1998/02/1
8
1
2:40:43 vadim
Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -31,7 +31,7 @@
static
TupleTableSlot
*
ExecGroupEveryTuple
(
Group
*
node
);
static
TupleTableSlot
*
ExecGroupOneTuple
(
Group
*
node
);
static
bool
sameGroup
(
Tuple
TableSlot
*
oldslot
,
Tuple
TableSlot
*
newslot
,
sameGroup
(
Heap
Tuple
oldslot
,
Heap
Tuple
newslot
,
int
numCols
,
AttrNumber
*
grpColIdx
,
TupleDesc
tupdesc
);
/* ---------------------------------------
...
...
@@ -71,8 +71,8 @@ ExecGroupEveryTuple(Group *node)
ExprContext
*
econtext
;
HeapTuple
outerTuple
=
NULL
;
Tuple
TableSlot
*
outerslot
,
*
last
slot
;
Heap
Tuple
firsttuple
;
TupleTableSlot
*
outer
slot
;
ProjectionInfo
*
projInfo
;
TupleTableSlot
*
resultSlot
;
...
...
@@ -90,18 +90,14 @@ ExecGroupEveryTuple(Group *node)
econtext
=
grpstate
->
csstate
.
cstate
.
cs_ExprContext
;
if
(
grpstate
->
grp_useLastTuple
)
/* if we haven't returned first tuple of new group yet ... */
if
(
grpstate
->
grp_useFirstTuple
)
{
grpstate
->
grp_useFirstTuple
=
FALSE
;
/*
* we haven't returned last tuple yet because it is not of the
* same group
*/
grpstate
->
grp_useLastTuple
=
FALSE
;
ExecStoreTuple
(
grpstate
->
grp_lastSlot
->
val
,
ExecStoreTuple
(
grpstate
->
grp_firstTuple
,
grpstate
->
csstate
.
css_ScanTupleSlot
,
grpstate
->
grp_lastSlot
->
ttc_b
uffer
,
InvalidB
uffer
,
false
);
}
else
...
...
@@ -115,29 +111,28 @@ ExecGroupEveryTuple(Group *node)
return
NULL
;
}
/* ----------------
* Compare with last tuple and see if this tuple is of
firsttuple
=
grpstate
->
grp_firstTuple
;
/* this should occur on the first call only */
if
(
firsttuple
==
NULL
)
{
grpstate
->
grp_firstTuple
=
heap_copytuple
(
outerTuple
);
}
else
{
/*
* Compare with first tuple and see if this tuple is of
* the same group.
* ----------------
*/
lastslot
=
grpstate
->
csstate
.
css_ScanTupleSlot
;
if
(
lastslot
->
val
!=
NULL
&&
(
!
sameGroup
(
lastslot
,
outerslot
,
if
(
!
sameGroup
(
firsttuple
,
outerslot
->
val
,
node
->
numCols
,
node
->
grpColIdx
,
ExecGetScanType
(
&
grpstate
->
csstate
)))
)
ExecGetScanType
(
&
grpstate
->
csstate
)))
{
/* ExecGetResultType(&grpstate->csstate.cstate)))) {*/
grpstate
->
grp_useLastTuple
=
TRUE
;
/* save it for next time */
grpstate
->
grp_lastSlot
=
outerslot
;
grpstate
->
grp_useFirstTuple
=
TRUE
;
pfree
(
firsttuple
);
grpstate
->
grp_firstTuple
=
heap_copytuple
(
outerTuple
);
/*
* signifies the end of the group
*/
return
NULL
;
return
NULL
;
/* signifies the end of the group */
}
}
ExecStoreTuple
(
outerTuple
,
...
...
@@ -172,8 +167,8 @@ ExecGroupOneTuple(Group *node)
ExprContext
*
econtext
;
HeapTuple
outerTuple
=
NULL
;
Tuple
TableSlot
*
outerslot
,
*
last
slot
;
Heap
Tuple
firsttuple
;
TupleTableSlot
*
outer
slot
;
ProjectionInfo
*
projInfo
;
TupleTableSlot
*
resultSlot
;
...
...
@@ -191,15 +186,9 @@ ExecGroupOneTuple(Group *node)
econtext
=
node
->
grpstate
->
csstate
.
cstate
.
cs_ExprContext
;
if
(
grpstate
->
grp_useLastTuple
)
{
grpstate
->
grp_useLastTuple
=
FALSE
;
ExecStoreTuple
(
grpstate
->
grp_lastSlot
->
val
,
grpstate
->
csstate
.
css_ScanTupleSlot
,
grpstate
->
grp_lastSlot
->
ttc_buffer
,
false
);
}
else
firsttuple
=
grpstate
->
grp_firstTuple
;
/* this should occur on the first call only */
if
(
firsttuple
==
NULL
)
{
outerslot
=
ExecProcNode
(
outerPlan
(
node
),
(
Plan
*
)
node
);
if
(
outerslot
)
...
...
@@ -209,12 +198,8 @@ ExecGroupOneTuple(Group *node)
grpstate
->
grp_done
=
TRUE
;
return
NULL
;
}
ExecStoreTuple
(
outerTuple
,
grpstate
->
csstate
.
css_ScanTupleSlot
,
outerslot
->
ttc_buffer
,
false
);
grpstate
->
grp_firstTuple
=
firsttuple
=
heap_copytuple
(
outerTuple
);
}
lastslot
=
grpstate
->
csstate
.
css_ScanTupleSlot
;
/*
* find all tuples that belong to a group
...
...
@@ -225,49 +210,21 @@ ExecGroupOneTuple(Group *node)
outerTuple
=
(
outerslot
)
?
outerslot
->
val
:
NULL
;
if
(
!
HeapTupleIsValid
(
outerTuple
))
{
/*
* we have at least one tuple (lastslot) if we reach here
*/
grpstate
->
grp_done
=
TRUE
;
/* return lastslot */
break
;
}
/* ----------------
* Compare with
la
st tuple and see if this tuple is of
* Compare with
fir
st tuple and see if this tuple is of
* the same group.
* ----------------
*/
if
((
!
sameGroup
(
lastslot
,
outerslot
,
if
((
!
sameGroup
(
firsttuple
,
outerslot
->
val
,
node
->
numCols
,
node
->
grpColIdx
,
ExecGetScanType
(
&
grpstate
->
csstate
))))
{
/* ExecGetResultType(&grpstate->csstate.cstate)))) {*/
grpstate
->
grp_useLastTuple
=
TRUE
;
/* save it for next time */
grpstate
->
grp_lastSlot
=
outerslot
;
/* return lastslot */
break
;
}
ExecStoreTuple
(
outerTuple
,
grpstate
->
csstate
.
css_ScanTupleSlot
,
outerslot
->
ttc_buffer
,
false
);
lastslot
=
grpstate
->
csstate
.
css_ScanTupleSlot
;
}
ExecStoreTuple
(
lastslot
->
val
,
grpstate
->
csstate
.
css_ScanTupleSlot
,
lastslot
->
ttc_buffer
,
false
);
/* ----------------
* form a projection tuple, store it in the result tuple
* slot and return it.
...
...
@@ -275,9 +232,20 @@ ExecGroupOneTuple(Group *node)
*/
projInfo
=
grpstate
->
csstate
.
cstate
.
cs_ProjInfo
;
econtext
->
ecxt_scantuple
=
lastslot
;
ExecStoreTuple
(
firsttuple
,
grpstate
->
csstate
.
css_ScanTupleSlot
,
InvalidBuffer
,
false
);
econtext
->
ecxt_scantuple
=
grpstate
->
csstate
.
css_ScanTupleSlot
;
resultSlot
=
ExecProject
(
projInfo
,
&
isDone
);
/* save outerTuple if we are not done yet */
if
(
!
grpstate
->
grp_done
)
{
pfree
(
firsttuple
);
grpstate
->
grp_firstTuple
=
heap_copytuple
(
outerTuple
);
}
return
resultSlot
;
}
...
...
@@ -304,7 +272,7 @@ ExecInitGroup(Group *node, EState *estate, Plan *parent)
*/
grpstate
=
makeNode
(
GroupState
);
node
->
grpstate
=
grpstate
;
grpstate
->
grp_use
La
stTuple
=
FALSE
;
grpstate
->
grp_use
Fir
stTuple
=
FALSE
;
grpstate
->
grp_done
=
FALSE
;
/*
...
...
@@ -370,6 +338,11 @@ ExecEndGroup(Group *node)
/* clean up tuple table */
ExecClearTuple
(
grpstate
->
csstate
.
css_ScanTupleSlot
);
if
(
grpstate
->
grp_firstTuple
!=
NULL
)
{
pfree
(
grpstate
->
grp_firstTuple
);
grpstate
->
grp_firstTuple
=
NULL
;
}
}
/*****************************************************************************
...
...
@@ -380,8 +353,8 @@ ExecEndGroup(Group *node)
* code swiped from nodeUnique.c
*/
static
bool
sameGroup
(
Tuple
TableSlot
*
oldslot
,
Tuple
TableSlot
*
newslot
,
sameGroup
(
Heap
Tuple
oldtuple
,
Heap
Tuple
newtuple
,
int
numCols
,
AttrNumber
*
grpColIdx
,
TupleDesc
tupdesc
)
...
...
@@ -401,12 +374,12 @@ sameGroup(TupleTableSlot *oldslot,
att
=
grpColIdx
[
i
];
typoutput
=
typtoout
((
Oid
)
tupdesc
->
attrs
[
att
-
1
]
->
atttypid
);
attr1
=
heap_getattr
(
old
slot
->
val
,
attr1
=
heap_getattr
(
old
tuple
,
att
,
tupdesc
,
&
isNull1
);
attr2
=
heap_getattr
(
new
slot
->
val
,
attr2
=
heap_getattr
(
new
tuple
,
att
,
tupdesc
,
&
isNull2
);
...
...
This diff is collapsed.
Click to expand it.
src/backend/executor/nodeUnique.c
+
8
−
3
View file @
b1b246ab
...
...
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/executor/nodeUnique.c,v 1.1
4
1998/02/1
0
1
6:03:03 momjian
Exp $
* $Header: /cvsroot/pgsql/src/backend/executor/nodeUnique.c,v 1.1
5
1998/02/1
8
1
2:40:44 vadim
Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -208,8 +208,13 @@ ExecUnique(Unique *node)
* use strcmp for comparison
*/
if
(
strcmp
(
val1
,
val2
)
==
0
)
/* they are equal */
{
pfree
(
val1
);
pfree
(
val2
);
continue
;
else
}
pfree
(
val1
);
pfree
(
val2
);
break
;
}
else
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment