Skip to content

Commit 0b44914

Browse files
bmomjianbmomjian
committed
Remove tabs after spaces in C comments
This was not changed in HEAD, but will be done later as part of a pgindent run. Future pgindent runs will also do this. Report by Tom Lane Backpatch through all supported branches, but not HEAD
1 parent 17b04a1 commit 0b44914

File tree

670 files changed

+3546
-3546
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

670 files changed

+3546
-3546
lines changed

‎contrib/btree_gist/btree_interval.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -95,7 +95,7 @@ gbt_intv_dist(const void *a, const void *b)
9595

9696
/*
9797
* INTERVALSIZE should be the actual size-on-disk of an Interval, as shown
98-
* in pg_type. This might be less than sizeof(Interval) if the compiler
98+
* in pg_type. This might be less than sizeof(Interval) if the compiler
9999
* insists on adding alignment padding at the end of the struct.
100100
*/
101101
#define INTERVALSIZE 16

‎contrib/cube/cube.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -563,7 +563,7 @@ g_cube_picksplit(PG_FUNCTION_ARGS)
563563
rt_cube_size(datum_r, &size_r);
564564

565565
/*
566-
* Now split up the regions between the two seeds. An important property
566+
* Now split up the regions between the two seeds. An important property
567567
* of this split algorithm is that the split vector v has the indices of
568568
* items to be split in order in its left and right vectors. We exploit
569569
* this property by doing a merge in the code that actually splits the
@@ -579,7 +579,7 @@ g_cube_picksplit(PG_FUNCTION_ARGS)
579579
{
580580
/*
581581
* If we've already decided where to place this item, just put it on
582-
* the right list. Otherwise, we need to figure out which page needs
582+
* the right list. Otherwise, we need to figure out which page needs
583583
* the least enlargement in order to store the item.
584584
*/
585585

‎contrib/dblink/dblink.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2320,7 +2320,7 @@ get_tuple_of_interest(Relation rel, int *pkattnums, int pknumatts, char **src_pk
23202320
* Build sql statement to look up tuple of interest, ie, the one matching
23212321
* src_pkattvals. We used to use "SELECT *" here, but it's simpler to
23222322
* generate a result tuple that matches the table's physical structure,
2323-
* with NULLs for any dropped columns. Otherwise we have to deal with two
2323+
* with NULLs for any dropped columns. Otherwise we have to deal with two
23242324
* different tupdescs and everything's very confusing.
23252325
*/
23262326
appendStringInfoString(&buf, "SELECT ");
@@ -2546,7 +2546,7 @@ dblink_security_check(PGconn *conn, remoteConn *rconn)
25462546
}
25472547

25482548
/*
2549-
* For non-superusers, insist that the connstr specify a password. This
2549+
* For non-superusers, insist that the connstr specify a password. This
25502550
* prevents a password from being picked up from .pgpass, a service file,
25512551
* the environment, etc. We don't want the postgres user's passwords
25522552
* to be accessible to non-superusers.

‎contrib/earthdistance/earthdistance.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -91,7 +91,7 @@ geo_distance_internal(Point *pt1, Point *pt2)
9191
* distance between the points in miles on earth's surface
9292
*
9393
* If float8 is passed-by-value, the oldstyle version-0 calling convention
94-
* is unportable, so we use version-1. However, if it's passed-by-reference,
94+
* is unportable, so we use version-1. However, if it's passed-by-reference,
9595
* continue to use oldstyle. This is just because we'd like earthdistance
9696
* to serve as a canary for any unintentional breakage of version-0 functions
9797
* with float8 results.

‎contrib/file_fdw/file_fdw.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -747,7 +747,7 @@ estimate_size(PlannerInfo *root, RelOptInfo *baserel,
747747
* planner's idea of the relation width; which is bogus if not all
748748
* columns are being read, not to mention that the text representation
749749
* of a row probably isn't the same size as its internal
750-
* representation. Possibly we could do something better, but the
750+
* representation. Possibly we could do something better, but the
751751
* real answer to anyone who complains is "ANALYZE" ...
752752
*/
753753
int tuple_width;
@@ -812,7 +812,7 @@ estimate_costs(PlannerInfo *root, RelOptInfo *baserel,
812812
* which must have at least targrows entries.
813813
* The actual number of rows selected is returned as the function result.
814814
* We also count the total number of rows in the file and return it into
815-
* *totalrows. Note that *totaldeadrows is always set to 0.
815+
* *totalrows. Note that *totaldeadrows is always set to 0.
816816
*
817817
* Note that the returned list of rows is not always in order by physical
818818
* position in the file. Therefore, correlation estimates derived later

‎contrib/fuzzystrmatch/levenshtein.c

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -50,7 +50,7 @@ static int levenshtein_internal(text *s, text *t,
5050
* array.
5151
*
5252
* If max_d >= 0, we only need to provide an accurate answer when that answer
53-
* is less than or equal to the bound. From any cell in the matrix, there is
53+
* is less than or equal to the bound. From any cell in the matrix, there is
5454
* theoretical "minimum residual distance" from that cell to the last column
5555
* of the final row. This minimum residual distance is zero when the
5656
* untransformed portions of the strings are of equal length (because we might
@@ -141,7 +141,7 @@ levenshtein_internal(text *s, text *t,
141141
stop_column = m + 1;
142142

143143
/*
144-
* If max_d >= 0, determine whether the bound is impossibly tight. If so,
144+
* If max_d >= 0, determine whether the bound is impossibly tight. If so,
145145
* return max_d + 1 immediately. Otherwise, determine whether it's tight
146146
* enough to limit the computation we must perform. If so, figure out
147147
* initial stop column.
@@ -168,7 +168,7 @@ levenshtein_internal(text *s, text *t,
168168
* need to fill in. If the string is growing, the theoretical
169169
* minimum distance already incorporates the cost of deleting the
170170
* number of characters necessary to make the two strings equal in
171-
* length. Each additional deletion forces another insertion, so
171+
* length. Each additional deletion forces another insertion, so
172172
* the best-case total cost increases by ins_c + del_c. If the
173173
* string is shrinking, the minimum theoretical cost assumes no
174174
* excess deletions; that is, we're starting no further right than
@@ -246,7 +246,7 @@ levenshtein_internal(text *s, text *t,
246246
/*
247247
* The main loop fills in curr, but curr[0] needs a special case: to
248248
* transform the first 0 characters of s into the first j characters
249-
* of t, we must perform j insertions. However, if start_column > 0,
249+
* of t, we must perform j insertions. However, if start_column > 0,
250250
* this special case does not apply.
251251
*/
252252
if (start_column == 0)

‎contrib/hstore/hstore.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212
* HEntry: there is one of these for each key _and_ value in an hstore
1313
*
1414
* the position offset points to the _end_ so that we can get the length
15-
* by subtraction from the previous entry. the ISFIRST flag lets us tell
15+
* by subtraction from the previous entry. the ISFIRST flag lets us tell
1616
* whether there is a previous entry.
1717
*/
1818
typedef struct

‎contrib/hstore/hstore_gin.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,7 @@
1313
/*
1414
* When using a GIN index for hstore, we choose to index both keys and values.
1515
* The storage format is "text" values, with K, V, or N prepended to the string
16-
* to indicate key, value, or null values. (As of 9.1 it might be better to
16+
* to indicate key, value, or null values. (As of 9.1 it might be better to
1717
* store null values as nulls, but we'll keep it this way for on-disk
1818
* compatibility.)
1919
*/
@@ -168,7 +168,7 @@ gin_consistent_hstore(PG_FUNCTION_ARGS)
168168
{
169169
/*
170170
* Index doesn't have information about correspondence of keys and
171-
* values, so we need recheck. However, if not all the keys are
171+
* values, so we need recheck. However, if not all the keys are
172172
* present, we can fail at once.
173173
*/
174174
*recheck = true;

‎contrib/intarray/_int_bool.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -355,7 +355,7 @@ gin_bool_consistent(QUERYTYPE *query, bool *check)
355355
return FALSE;
356356

357357
/*
358-
* Set up data for checkcondition_gin. This must agree with the query
358+
* Set up data for checkcondition_gin. This must agree with the query
359359
* extraction code in ginint4_queryextract.
360360
*/
361361
gcv.first = items;

‎contrib/intarray/_int_gist.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -482,7 +482,7 @@ g_int_picksplit(PG_FUNCTION_ARGS)
482482
qsort((void *) costvector, maxoff, sizeof(SPLITCOST), comparecost);
483483

484484
/*
485-
* Now split up the regions between the two seeds. An important property
485+
* Now split up the regions between the two seeds. An important property
486486
* of this split algorithm is that the split vector v has the indices of
487487
* items to be split in order in its left and right vectors. We exploit
488488
* this property by doing a merge in the code that actually splits the
@@ -500,7 +500,7 @@ g_int_picksplit(PG_FUNCTION_ARGS)
500500

501501
/*
502502
* If we've already decided where to place this item, just put it on
503-
* the right list. Otherwise, we need to figure out which page needs
503+
* the right list. Otherwise, we need to figure out which page needs
504504
* the least enlargement in order to store the item.
505505
*/
506506

‎contrib/intarray/_int_tool.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -184,7 +184,7 @@ rt__int_size(ArrayType *a, float *size)
184184
*size = (float) ARRNELEMS(a);
185185
}
186186

187-
/* Sort the given data (len >= 2). Return true if any duplicates found */
187+
/* Sort the given data (len >= 2). Return true if any duplicates found */
188188
bool
189189
isort(int4 *a, int len)
190190
{
@@ -196,7 +196,7 @@ isort(int4 *a, int len)
196196
bool r = FALSE;
197197

198198
/*
199-
* We use a simple insertion sort. While this is O(N^2) in the worst
199+
* We use a simple insertion sort. While this is O(N^2) in the worst
200200
* case, it's quite fast if the input is already sorted or nearly so.
201201
* Also, for not-too-large inputs it's faster than more complex methods
202202
* anyhow.

‎contrib/ltree/ltree_op.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -611,7 +611,7 @@ ltreeparentsel(PG_FUNCTION_ARGS)
611611
/*
612612
* If the histogram is large enough, see what fraction of it the
613613
* constant is "<@" to, and assume that's representative of the
614-
* non-MCV population. Otherwise use the default selectivity for the
614+
* non-MCV population. Otherwise use the default selectivity for the
615615
* non-MCV population.
616616
*/
617617
selec = histogram_selectivity(&vardata, &contproc,

‎contrib/oid2name/oid2name.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -446,7 +446,7 @@ sql_exec(PGconn *conn, const char *todo, bool quiet)
446446
}
447447

448448
/*
449-
* Dump all databases. There are no system objects to worry about.
449+
* Dump all databases. There are no system objects to worry about.
450450
*/
451451
void
452452
sql_exec_dumpalldbs(PGconn *conn, struct options * opts)

‎contrib/pg_archivecleanup/pg_archivecleanup.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -124,7 +124,7 @@ CleanupPriorWALFiles(void)
124124

125125
/*
126126
* We ignore the timeline part of the XLOG segment identifiers in
127-
* deciding whether a segment is still needed. This ensures that
127+
* deciding whether a segment is still needed. This ensures that
128128
* we won't prematurely remove a segment from a parent timeline.
129129
* We could probably be a little more proactive about removing
130130
* segments of non-parent timelines, but that would be a whole lot
@@ -151,7 +151,7 @@ CleanupPriorWALFiles(void)
151151
{
152152
/*
153153
* Prints the name of the file to be removed and skips the
154-
* actual removal. The regular printout is so that the
154+
* actual removal. The regular printout is so that the
155155
* user can pipe the output into some other program.
156156
*/
157157
printf("%s\n", WALFilePath);

‎contrib/pg_stat_statements/pg_stat_statements.c

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* Track statement execution times across a whole database cluster.
55
*
66
* Execution costs are totalled for each distinct source query, and kept in
7-
* a shared hashtable. (We track only as many distinct queries as will fit
7+
* a shared hashtable. (We track only as many distinct queries as will fit
88
* in the designated amount of shared memory.)
99
*
1010
* As of Postgres 9.2, this module normalizes query entries. Normalization
@@ -15,7 +15,7 @@
1515
*
1616
* Normalization is implemented by fingerprinting queries, selectively
1717
* serializing those fields of each query tree's nodes that are judged to be
18-
* essential to the query. This is referred to as a query jumble. This is
18+
* essential to the query. This is referred to as a query jumble. This is
1919
* distinct from a regular serialization in that various extraneous
2020
* information is ignored as irrelevant or not essential to the query, such
2121
* as the collations of Vars and, most notably, the values of constants.
@@ -1228,7 +1228,7 @@ pgss_memsize(void)
12281228
* would be difficult to demonstrate this even under artificial conditions.)
12291229
*
12301230
* Note: despite needing exclusive lock, it's not an error for the target
1231-
* entry to already exist. This is because pgss_store releases and
1231+
* entry to already exist. This is because pgss_store releases and
12321232
* reacquires lock after failing to find a match; so someone else could
12331233
* have made the entry while we waited to get exclusive lock.
12341234
*/
@@ -1487,7 +1487,7 @@ JumbleRangeTable(pgssJumbleState *jstate, List *rtable)
14871487
*
14881488
* Note: the reason we don't simply use expression_tree_walker() is that the
14891489
* point of that function is to support tree walkers that don't care about
1490-
* most tree node types, but here we care about all types. We should complain
1490+
* most tree node types, but here we care about all types. We should complain
14911491
* about any unrecognized node type.
14921492
*/
14931493
static void
@@ -2009,7 +2009,7 @@ generate_normalized_query(pgssJumbleState *jstate, const char *query,
20092009
* a problem.
20102010
*
20112011
* Duplicate constant pointers are possible, and will have their lengths
2012-
* marked as '-1', so that they are later ignored. (Actually, we assume the
2012+
* marked as '-1', so that they are later ignored. (Actually, we assume the
20132013
* lengths were initialized as -1 to start with, and don't change them here.)
20142014
*
20152015
* N.B. There is an assumption that a '-' character at a Const location begins
@@ -2078,7 +2078,7 @@ fill_in_constant_lengths(pgssJumbleState *jstate, const char *query)
20782078
* adjustment of location to that of the leading '-'
20792079
* operator in the event of a negative constant. It is
20802080
* also useful for our purposes to start from the minus
2081-
* symbol. In this way, queries like "select * from foo
2081+
* symbol. In this way, queries like "select * from foo
20822082
* where bar = 1" and "select * from foo where bar = -2"
20832083
* will have identical normalized query strings.
20842084
*/

‎contrib/pg_trgm/trgm_gist.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -196,7 +196,7 @@ gtrgm_consistent(PG_FUNCTION_ARGS)
196196

197197
/*
198198
* Store both the strategy number and extracted trigrams in cache, because
199-
* trigram extraction is relatively CPU-expensive. We must include
199+
* trigram extraction is relatively CPU-expensive. We must include
200200
* strategy number because trigram extraction depends on strategy.
201201
*
202202
* The cached structure contains the strategy number, then the input query

‎contrib/pg_upgrade/controldata.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@
2727
* pg_control data. pg_resetxlog cannot be run while the server is running
2828
* so we use pg_controldata; pg_controldata doesn't provide all the fields
2929
* we need to actually perform the upgrade, but it provides enough for
30-
* check mode. We do not implement pg_resetxlog -n because it is hard to
30+
* check mode. We do not implement pg_resetxlog -n because it is hard to
3131
* return valid xid data for a running server.
3232
*/
3333
void

‎contrib/pg_upgrade/dump.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -37,7 +37,7 @@ generate_old_dump(void)
3737
* split_old_dump
3838
*
3939
* This function splits pg_dumpall output into global values and
40-
* database creation, and per-db schemas. This allows us to create
40+
* database creation, and per-db schemas. This allows us to create
4141
* the support functions between restoring these two parts of the
4242
* dump. We split on the first "\connect " after a CREATE ROLE
4343
* username match; this is where the per-db restore starts.

‎contrib/pg_upgrade/exec.c

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -210,7 +210,7 @@ win32_check_directory_write_permissions(void)
210210
int fd;
211211

212212
/*
213-
* We open a file we would normally create anyway. We do this even in
213+
* We open a file we would normally create anyway. We do this even in
214214
* 'check' mode, which isn't ideal, but this is the best we can do.
215215
*/
216216
if ((fd = open(GLOBALS_DUMP_FILE, O_RDWR | O_CREAT, S_IRUSR | S_IWUSR)) < 0)
@@ -227,7 +227,7 @@ win32_check_directory_write_permissions(void)
227227
*
228228
* This function validates the given cluster directory - we search for a
229229
* small set of subdirectories that we expect to find in a valid $PGDATA
230-
* directory. If any of the subdirectories are missing (or secured against
230+
* directory. If any of the subdirectories are missing (or secured against
231231
* us) we display an error message and exit()
232232
*
233233
*/
@@ -267,7 +267,7 @@ check_data_dir(const char *pg_data)
267267
* check_bin_dir()
268268
*
269269
* This function searches for the executables that we expect to find
270-
* in the binaries directory. If we find that a required executable
270+
* in the binaries directory. If we find that a required executable
271271
* is missing (or secured against us), we display an error message and
272272
* exit().
273273
*/

‎contrib/pg_upgrade/function.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -297,7 +297,7 @@ check_loadable_libraries(void)
297297
* plpython2u language was created with library name plpython2.so as a
298298
* symbolic link to plpython.so. In Postgres 9.1, only the
299299
* plpython2.so library was created, and both plpythonu and plpython2u
300-
* pointing to it. For this reason, any reference to library name
300+
* pointing to it. For this reason, any reference to library name
301301
* "plpython" in an old PG <= 9.1 cluster must look for "plpython2" in
302302
* the new cluster.
303303
*

‎contrib/pg_upgrade/option.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -357,7 +357,7 @@ adjust_data_dir(ClusterInfo *cluster)
357357

358358
/*
359359
* We don't have a data directory yet, so we can't check the PG version,
360-
* so this might fail --- only works for PG 9.2+. If this fails,
360+
* so this might fail --- only works for PG 9.2+. If this fails,
361361
* pg_upgrade will fail anyway because the data files will not be found.
362362
*/
363363
snprintf(cmd, sizeof(cmd), "\"%s/postmaster\" -D \"%s\" -C data_directory",

‎contrib/pg_upgrade/page.c

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -30,11 +30,11 @@ static pageCnvCtx *loadConverterPlugin(
3030
* the PageLayoutVersion of the new cluster. If the versions differ, this
3131
* function loads a converter plugin and returns a pointer to a pageCnvCtx
3232
* object (in *result) that knows how to convert pages from the old format
33-
* to the new format. If the versions are identical, this function just
33+
* to the new format. If the versions are identical, this function just
3434
* returns a NULL pageCnvCtx pointer to indicate that page-by-page conversion
3535
* is not required.
3636
*
37-
* If successful this function sets *result and returns NULL. If an error
37+
* If successful this function sets *result and returns NULL. If an error
3838
* occurs, this function returns an error message in the form of an null-terminated
3939
* string.
4040
*/
@@ -124,7 +124,7 @@ getPageVersion(uint16 *version, const char *pathName)
124124
* This function loads a page-converter plugin library and grabs a
125125
* pointer to each of the (interesting) functions provided by that
126126
* plugin. The name of the plugin library is derived from the given
127-
* newPageVersion and oldPageVersion. If a plugin is found, this
127+
* newPageVersion and oldPageVersion. If a plugin is found, this
128128
* function returns a pointer to a pageCnvCtx object (which will contain
129129
* a collection of plugin function pointers). If the required plugin
130130
* is not found, this function returns NULL.

‎contrib/pg_upgrade/pg_upgrade.c

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,7 @@
1818
* FYI, while pg_class.oid and pg_class.relfilenode are initially the same
1919
* in a cluster, but they can diverge due to CLUSTER, REINDEX, or VACUUM
2020
* FULL. The new cluster will have matching pg_class.oid and
21-
* pg_class.relfilenode values and be based on the old oid value. This can
21+
* pg_class.relfilenode values and be based on the old oid value. This can
2222
* cause the old and new pg_class.relfilenode values to differ. In summary,
2323
* old and new pg_class.oid and new pg_class.relfilenode will have the
2424
* same value, and old pg_class.relfilenode might differ.
@@ -127,7 +127,7 @@ main(int argc, char **argv)
127127

128128
/*
129129
* Most failures happen in create_new_objects(), which has completed at
130-
* this point. We do this here because it is just before linking, which
130+
* this point. We do this here because it is just before linking, which
131131
* will link the old and new cluster data files, preventing the old
132132
* cluster from being safely started once the new cluster is started.
133133
*/
@@ -252,8 +252,8 @@ prepare_new_databases(void)
252252

253253
/*
254254
* Install support functions in the global-object restore database to
255-
* preserve pg_authid.oid. pg_dumpall uses 'template0' as its template
256-
* database so objects we add into 'template1' are not propogated. They
255+
* preserve pg_authid.oid. pg_dumpall uses 'template0' as its template
256+
* database so objects we add into 'template1' are not propogated. They
257257
* are removed on pg_upgrade exit.
258258
*/
259259
install_support_functions_in_new_db("template1");

0 commit comments

Comments
 (0)