These should have been included in
421892a19 as these shadowed variable
warnings can also be fixed by adjusting the scope of the shadowed variable
to put the declaration for it in an inner scope.
This is part of the same effort as
f01592f91.
By my count, this takes the warning count from 114 down to 106.
Author: David Rowley and Justin Pryzby
Discussion: https://postgr.es/m/CAApHDvrwLGBP%2BYw9vriayyf%3DXR4uPWP5jr6cQhP9au_kaDUhbA%40mail.gmail.com
size;
Buffer nbuf;
Page npage;
- SpGistLeafTuple it;
OffsetNumber r = InvalidOffsetNumber,
startOffset = InvalidOffsetNumber;
bool replaceDead = false;
{
for (i = 0; i < nDelete; i++)
{
+ SpGistLeafTuple it;
+
it = (SpGistLeafTuple) PageGetItem(current->page,
PageGetItemId(current->page, toDelete[i]));
Assert(it->tupstate == SPGIST_LIVE);
PartitionDesc partdesc = RelationGetPartitionDesc(rel, true);
List *idxs = NIL;
List *childTbls = NIL;
- ListCell *l;
int i;
MemoryContext oldcxt,
perChildCxt;
for (i = 0; i < partdesc->nparts; i++)
{
Oid indexOnChild = InvalidOid;
+ ListCell *l;
ListCell *l2;
CreateTrigStmt *childStmt;
Relation childTbl;
ExecParallelHashIncreaseNumBatches(HashJoinTable hashtable)
{
ParallelHashJoinState *pstate = hashtable->parallel_state;
- int i;
Assert(BarrierPhase(&pstate->build_barrier) == PHJ_BUILD_HASHING_INNER);
ExecParallelHashTableSetCurrentBatch(hashtable, 0);
/* Are any of the new generation of batches exhausted? */
- for (i = 0; i < hashtable->nbatch; ++i)
+ for (int i = 0; i < hashtable->nbatch; ++i)
{
ParallelHashJoinBatch *batch = hashtable->batches[i].shared;
Query *parse = root->parse;
List *sets;
int maxref = 0;
- ListCell *lc;
ListCell *lc_set;
grouping_sets_data *gd = palloc0(sizeof(grouping_sets_data));
if (!bms_is_empty(gd->unsortable_refs))
{
List *sortable_sets = NIL;
+ ListCell *lc;
foreach(lc, parse->groupingSets)
{
int vector_no,
lexeme_no;
LexemeHashKey hash_key;
- TrackItem *item;
/*
* We want statistics_target * 10 lexemes in the MCELEM array. This
curentryptr = ARRPTR(vector);
for (j = 0; j < vector->size; j++)
{
+ TrackItem *item;
bool found;
/*
int nonnull_cnt = samplerows - null_cnt;
int i;
TrackItem **sort_table;
+ TrackItem *item;
int track_len;
int cutoff_freq;
int minfreq,
int *prev;
int *curr;
int *s_char_len = NULL;
- int i,
- j;
+ int j;
const char *y;
/*
* To transform the first i characters of s into the first 0 characters of
* t, we must perform i deletions.
*/
- for (i = START_COLUMN; i < STOP_COLUMN; i++)
+ for (int i = START_COLUMN; i < STOP_COLUMN; i++)
prev[i] = i * del_c;
/* Loop through rows of the notional array */
int *temp;
const char *x = source;
int y_char_len = n != tlen + 1 ? pg_mblen(y) : 1;
+ int i;
#ifdef LEVENSHTEIN_LESS_EQUAL
ConsiderSplitContext context;
OffsetNumber i,
maxoff;
- RangeType *range,
- *left_range = NULL,
+ RangeType *left_range = NULL,
*right_range = NULL;
int common_entries_count;
NonEmptyRange *by_lower,
*/
for (i = FirstOffsetNumber; i <= maxoff; i = OffsetNumberNext(i))
{
+ RangeType *range;
RangeBound lower,
upper;
bool empty;
*/
for (i = 0; i < common_entries_count; i++)
{
+ RangeType *range;
int idx = common_entries[i].index;
range = DatumGetRangeTypeP(entryvec->vector[idx].key);
ArrayType *arr;
char *enabled;
Datum datum;
- bool isnull;
bool ndistinct_enabled;
bool dependencies_enabled;
bool mcv_enabled;
if (!columns_only)
{
+ bool isnull;
+
nsp = get_namespace_name_or_temp(statextrec->stxnamespace);
appendStringInfo(&buf, "CREATE STATISTICS %s",
quote_qualified_identifier(nsp,