mirror of
https://git.postgresql.org/git/postgresql.git
synced 2025-02-11 19:20:40 +08:00
The basic rule we follow here is to always first include 'postgres.h' or 'postgres_fe.h' whichever is applicable, then system header includes and then Postgres header includes. In this, we also follow that all the Postgres header includes are in order based on their ASCII value. We generally follow these rules, but the code has deviated in many places. This commit makes it consistent just for contrib modules. The later commits will enforce similar rules in other parts of code. Author: Vignesh C Reviewed-by: Amit Kapila Discussion: https://postgr.es/m/CALDaNm2Sznv8RR6Ex-iJO6xAdsxgWhCoETkaYX=+9DW3q0QCfA@mail.gmail.com
45 lines
1.1 KiB
C
45 lines
1.1 KiB
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* blcost.c
|
|
* Cost estimate function for bloom indexes.
|
|
*
|
|
* Copyright (c) 2016-2019, PostgreSQL Global Development Group
|
|
*
|
|
* IDENTIFICATION
|
|
* contrib/bloom/blcost.c
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#include "postgres.h"
|
|
|
|
#include "bloom.h"
|
|
#include "fmgr.h"
|
|
#include "utils/selfuncs.h"
|
|
|
|
/*
|
|
* Estimate cost of bloom index scan.
|
|
*/
|
|
void
|
|
blcostestimate(PlannerInfo *root, IndexPath *path, double loop_count,
|
|
Cost *indexStartupCost, Cost *indexTotalCost,
|
|
Selectivity *indexSelectivity, double *indexCorrelation,
|
|
double *indexPages)
|
|
{
|
|
IndexOptInfo *index = path->indexinfo;
|
|
GenericCosts costs;
|
|
|
|
MemSet(&costs, 0, sizeof(costs));
|
|
|
|
/* We have to visit all index tuples anyway */
|
|
costs.numIndexTuples = index->tuples;
|
|
|
|
/* Use generic estimate */
|
|
genericcostestimate(root, path, loop_count, &costs);
|
|
|
|
*indexStartupCost = costs.indexStartupCost;
|
|
*indexTotalCost = costs.indexTotalCost;
|
|
*indexSelectivity = costs.indexSelectivity;
|
|
*indexCorrelation = costs.indexCorrelation;
|
|
*indexPages = costs.numIndexPages;
|
|
}
|