Skip to content

Commit 1d033d3

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 d65ecdf commit 1d033d3

File tree

600 files changed

+2999
-2999
lines changed

Some content is hidden

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

600 files changed

+2999
-2999
lines changed

‎contrib/btree_gist/btree_interval.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -85,7 +85,7 @@ intr2num(const Interval *i)
8585

8686
/*
8787
* INTERVALSIZE should be the actual size-on-disk of an Interval, as shown
88-
* in pg_type. This might be less than sizeof(Interval) if the compiler
88+
* in pg_type. This might be less than sizeof(Interval) if the compiler
8989
* insists on adding alignment padding at the end of the struct.
9090
*/
9191
#define INTERVALSIZE 16

‎contrib/cube/cube.c

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

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

‎contrib/dblink/dblink.c

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

22382238
/*
2239-
* For non-superusers, insist that the connstr specify a password. This
2239+
* For non-superusers, insist that the connstr specify a password. This
22402240
* prevents a password from being picked up from .pgpass, a service file,
22412241
* the environment, etc. We don't want the postgres user's passwords
22422242
* 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/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/intarray/_int_gist.c

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

489489
/*
490-
* Now split up the regions between the two seeds. An important property
490+
* Now split up the regions between the two seeds. An important property
491491
* of this split algorithm is that the split vector v has the indices of
492492
* items to be split in order in its left and right vectors. We exploit
493493
* this property by doing a merge in the code that actually splits the
@@ -505,7 +505,7 @@ g_int_picksplit(PG_FUNCTION_ARGS)
505505

506506
/*
507507
* If we've already decided where to place this item, just put it on
508-
* the right list. Otherwise, we need to figure out which page needs
508+
* the right list. Otherwise, we need to figure out which page needs
509509
* the least enlargement in order to store the item.
510510
*/
511511

‎contrib/ltree/ltree_op.c

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

‎contrib/oid2name/oid2name.c

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

432432
/*
433-
* Dump all databases. There are no system objects to worry about.
433+
* Dump all databases. There are no system objects to worry about.
434434
*/
435435
void
436436
sql_exec_dumpalldbs(PGconn *conn, struct options * opts)

‎contrib/pg_archivecleanup/pg_archivecleanup.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -102,7 +102,7 @@ CleanupPriorWALFiles(void)
102102
{
103103
/*
104104
* We ignore the timeline part of the XLOG segment identifiers in
105-
* deciding whether a segment is still needed. This ensures that
105+
* deciding whether a segment is still needed. This ensures that
106106
* we won't prematurely remove a segment from a parent timeline.
107107
* We could probably be a little more proactive about removing
108108
* segments of non-parent timelines, but that would be a whole lot

‎contrib/pg_stat_statements/pg_stat_statements.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -916,7 +916,7 @@ pgss_memsize(void)
916916
* caller must hold an exclusive lock on pgss->lock
917917
*
918918
* Note: despite needing exclusive lock, it's not an error for the target
919-
* entry to already exist. This is because pgss_store releases and
919+
* entry to already exist. This is because pgss_store releases and
920920
* reacquires lock after failing to find a match; so someone else could
921921
* have made the entry while we waited to get exclusive lock.
922922
*/

0 commit comments

Comments
 (0)