int
bms_member_index(Bitmapset *a, int x)
{
- int i;
int bitnum;
int wordnum;
int result = 0;
bitnum = BITNUM(x);
/* count bits in preceding words */
- for (i = 0; i < wordnum; i++)
+ for (int i = 0; i < wordnum; i++)
{
bitmapword w = a->words[i];
bms_next_member(const Bitmapset *a, int prevbit)
{
int nwords;
- int wordnum;
bitmapword mask;
Assert(bms_is_valid_set(a));
nwords = a->nwords;
prevbit++;
mask = (~(bitmapword) 0) << BITNUM(prevbit);
- for (wordnum = WORDNUM(prevbit); wordnum < nwords; wordnum++)
+ for (int wordnum = WORDNUM(prevbit); wordnum < nwords; wordnum++)
{
bitmapword w = a->words[wordnum];
int
bms_prev_member(const Bitmapset *a, int prevbit)
{
- int wordnum;
int ushiftbits;
bitmapword mask;
ushiftbits = BITS_PER_BITMAPWORD - (BITNUM(prevbit) + 1);
mask = (~(bitmapword) 0) >> ushiftbits;
- for (wordnum = WORDNUM(prevbit); wordnum >= 0; wordnum--)
+ for (int wordnum = WORDNUM(prevbit); wordnum >= 0; wordnum--)
{
bitmapword w = a->words[wordnum];
planstate_tree_walker_callback walker,
void *context)
{
- int j;
-
- for (j = 0; j < nplans; j++)
+ for (int j = 0; j < nplans; j++)
{
if (PSWALK(planstates[j]))
return true;
void
outDatum(StringInfo str, Datum value, int typlen, bool typbyval)
{
- Size length,
- i;
+ Size length;
char *s;
length = datumGetSize(value, typbyval, typlen);
{
s = (char *) (&value);
appendStringInfo(str, "%u [ ", (unsigned int) length);
- for (i = 0; i < (Size) sizeof(Datum); i++)
+ for (Size i = 0; i < (Size) sizeof(Datum); i++)
appendStringInfo(str, "%d ", (int) (s[i]));
appendStringInfoChar(str, ']');
}
else
{
appendStringInfo(str, "%u [ ", (unsigned int) length);
- for (i = 0; i < length; i++)
+ for (Size i = 0; i < length; i++)
appendStringInfo(str, "%d ", (int) (s[i]));
appendStringInfoChar(str, ']');
}
static void
_outForeignKeyOptInfo(StringInfo str, const ForeignKeyOptInfo *node)
{
- int i;
-
WRITE_NODE_TYPE("FOREIGNKEYOPTINFO");
WRITE_UINT_FIELD(con_relid);
WRITE_INT_FIELD(nmatched_ri);
/* for compactness, just print the number of matches per column: */
appendStringInfoString(str, " :eclass");
- for (i = 0; i < node->nkeys; i++)
+ for (int i = 0; i < node->nkeys; i++)
appendStringInfo(str, " %d", (node->eclass[i] != NULL));
appendStringInfoString(str, " :rinfos");
- for (i = 0; i < node->nkeys; i++)
+ for (int i = 0; i < node->nkeys; i++)
appendStringInfo(str, " %d", list_length(node->rinfos[i]));
}
Size
EstimateParamListSpace(ParamListInfo paramLI)
{
- int i;
Size sz = sizeof(int);
if (paramLI == NULL || paramLI->numParams <= 0)
return sz;
- for (i = 0; i < paramLI->numParams; i++)
+ for (int i = 0; i < paramLI->numParams; i++)
{
ParamExternData *prm;
ParamExternData prmdata;
SerializeParamList(ParamListInfo paramLI, char **start_address)
{
int nparams;
- int i;
/* Write number of parameters. */
if (paramLI == NULL || paramLI->numParams <= 0)
*start_address += sizeof(int);
/* Write each parameter in turn. */
- for (i = 0; i < nparams; i++)
+ for (int i = 0; i < nparams; i++)
{
ParamExternData *prm;
ParamExternData prmdata;
Datum
readDatum(bool typbyval)
{
- Size length,
- i;
+ Size length;
int tokenLength;
const char *token;
Datum res;
elog(ERROR, "byval datum but length = %zu", length);
res = (Datum) 0;
s = (char *) (&res);
- for (i = 0; i < (Size) sizeof(Datum); i++)
+ for (Size i = 0; i < (Size) sizeof(Datum); i++)
{
token = pg_strtok(&tokenLength);
s[i] = (char) atoi(token);
else
{
s = (char *) palloc(length);
- for (i = 0; i < length; i++)
+ for (Size i = 0; i < length; i++)
{
token = pg_strtok(&tokenLength);
s[i] = (char) atoi(token);
{
BlockNumber currblk = InvalidBlockNumber;
PagetableEntry *page = NULL; /* only valid when currblk is valid */
- int i;
Assert(tbm->iterating == TBM_NOT_ITERATING);
- for (i = 0; i < ntids; i++)
+ for (int i = 0; i < ntids; i++)
{
BlockNumber blk = ItemPointerGetBlockNumber(tids + i);
OffsetNumber off = ItemPointerGetOffsetNumber(tids + i);
tbm_union_page(TIDBitmap *a, const PagetableEntry *bpage)
{
PagetableEntry *apage;
- int wordnum;
if (bpage->ischunk)
{
/* Scan b's chunk, mark each indicated page lossy in a */
- for (wordnum = 0; wordnum < WORDS_PER_CHUNK; wordnum++)
+ for (int wordnum = 0; wordnum < WORDS_PER_CHUNK; wordnum++)
{
bitmapword w = bpage->words[wordnum];
else
{
/* Both pages are exact, merge at the bit level */
- for (wordnum = 0; wordnum < WORDS_PER_PAGE; wordnum++)
+ for (int wordnum = 0; wordnum < WORDS_PER_PAGE; wordnum++)
apage->words[wordnum] |= bpage->words[wordnum];
apage->recheck |= bpage->recheck;
}
tbm_intersect_page(TIDBitmap *a, PagetableEntry *apage, const TIDBitmap *b)
{
const PagetableEntry *bpage;
- int wordnum;
if (apage->ischunk)
{
/* Scan each bit in chunk, try to clear */
bool candelete = true;
- for (wordnum = 0; wordnum < WORDS_PER_CHUNK; wordnum++)
+ for (int wordnum = 0; wordnum < WORDS_PER_CHUNK; wordnum++)
{
bitmapword w = apage->words[wordnum];
{
/* Both pages are exact, merge at the bit level */
Assert(!bpage->ischunk);
- for (wordnum = 0; wordnum < WORDS_PER_PAGE; wordnum++)
+ for (int wordnum = 0; wordnum < WORDS_PER_PAGE; wordnum++)
{
apage->words[wordnum] &= bpage->words[wordnum];
if (apage->words[wordnum] != 0)
uint32 max_offsets)
{
PagetableEntry *page = iteritem->internal_page;
- int wordnum;
int ntuples = 0;
- for (wordnum = 0; wordnum < WORDS_PER_PAGE; wordnum++)
+ for (int wordnum = 0; wordnum < WORDS_PER_PAGE; wordnum++)
{
bitmapword w = page->words[wordnum];