8000 Remove tabs after spaces in C comments · larkly/postgres-docker@2616a5d · GitHub
[go: up one dir, main page]
Skip to content

Commit 2616a5d

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 e0070a6 commit 2616a5d

File tree

623 files changed

+3206
-3206
lines changed

Some content is hidden

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

623 files changed

+3206
-3206
lines changed

‎contrib/btree_gist/btree_interval.c

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

9494
/*
9595
* INTERVALSIZE should be the actual size-on-disk of an Interval, as shown
96-
* in pg_type. This might be less than sizeof(Interval) if the compiler
96+
* in pg_type. This might be less than sizeof(Interval) if the compiler
9797
* insists on adding alignment padding at the end of the struct.
9898
*/
9999
#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
@@ -1987,7 +1987,7 @@ get_tuple_of_interest(Relation rel, int *pkattnums, int pknumatts, char **src_pk
19871987
* Build sql statement to look up tuple of interest, ie, the one matching
19881988
* src_pkattvals. We used to use "SELECT *" here, but it's simpler to
19891989
* generate a result tuple that matches the table's physical structure,
1990-
* with NULLs for any dropped columns. Otherwise we have to deal with two
1990+
* with NULLs for any dropped columns. Otherwise we have to deal with two
19911991
* different tupdescs and everything's very confusing.
19921992
*/
19931993
appendStringInfoString(&buf, "SELECT ");
@@ -2213,7 +2213,7 @@ dblink_security_check(PGconn *conn, remoteConn *rconn)
22132213
}
22142214

22152215
/*
2216-
* For non-superusers, insist that the connstr specify a password. This
2216+
* For non-superusers, insist that the connstr specify a password. This
22172217
* prevents a password from being picked up from .pgpass, a service file,
22182218
* the environment, etc. We don't want the postgres user's passwords
22192219
* 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
@@ -518,7 +518,7 @@ estimate_costs(PlannerInfo *root, RelOptInfo *baserel,
518518

519519
/*
520520
* Now estimate the number of rows returned by the scan after applying the
521-
* baserestrictinfo quals. This is pretty bogus too, since the planner
521+
* baserestrictinfo quals. This is pretty bogus too, since the planner
522522
* will have no stats about the relation, but it's better than nothing.
523523
*/
524524
nrows = ntuples *
@@ -534,7 +534,7 @@ estimate_costs(PlannerInfo *root, RelOptInfo *baserel,
534534
baserel->rows = nrows;
535535

536536
/*
537-
* Now estimate costs. We estimate costs almost the same way as
537+
* Now estimate costs. We estimate costs almost the same way as
538538
* cost_seqscan(), thus assuming that I/O costs are equivalent to a
539539
* regular table file of the same size. However, we take per-tuple CPU
540540
* costs as 10x of a seqscan, to account for the cost of parsing records.

‎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 @@ lev 10000 enshtein_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 futher 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
@@ -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
@@ -948,7 +948,7 @@ pgss_memsize(void)
948948
* caller must hold an exclusive lock on pgss->lock
949949
*
950950
* Note: despite needing exclusive lock, it's not an error for the target
951-
* entry to already exist. This is because pgss_store releases and
951+
* entry to already exist. This is because pgss_store releases and
952952
* reacquires lock after failing to find a match; so someone else could
953953
* have made the entry while we waited to get exclusive lock.
954954
*/

‎contrib/pg_trgm/trgm_gist.c

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

202202
/*
203203
* Store both the strategy number and extracted trigrams in cache, because
204-
* trigram extraction is relatively CPU-expensive. We must include
204+
* trigram extraction is relatively CPU-expensive. We must include
205205
* strategy number because trigram extraction depends on strategy.
206206
*/
207207
if (cache == NULL || strategy != *((StrategyNumber *) cache) ||

‎contrib/pg_upgrade/controldata.c

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

‎contrib/pg_upgrade/dump.c

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

‎contrib/pg_upgrade/exec.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -147,7 +147,7 @@ win32_check_directory_write_permissions(void)
147147
*
148148
* This function validates the given cluster directory - we search for a
149149
* small set of subdirectories that we expect to find in a valid $PGDATA
150-
* directory. If any of the subdirectories are missing (or secured against
150+
* directory. If any of the subdirectories are missing (or secured against
151151
* us) we display an error message and exit()
152152
*
153153
*/
@@ -187,7 +187,7 @@ check_data_dir(const char *pg_data)
187187
* check_bin_dir()
188188
*
189189
* This function searches for the executables that we expect to find
190-
* in the binaries directory. If we find that a required executable
190+
* in the binaries directory. If we find that a required executable
191191
* is missing (or secured against us), we display an error message and
192192
* exit().
193193
*/

‎contrib/pg_upgrade/page.c

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

‎contrib/pg_upgrade/pg_upgrade.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,7 @@
1818
* FYI, while pg_class.oid and pg_class.relfilenode are intially 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.

‎contrib/pg_upgrade/relfilenode.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -79,7 +79,7 @@ transfer_all_new_dbs(DbInfoArr *old_db_arr,
7979
/*
8080
* get_pg_database_relfilenode()
8181
*
82-
* Retrieves the relfilenode for a few system-catalog tables. We need these
82+
* Retrieves the relfilenode for a few system-catalog tables. We need these
8383
* relfilenodes later in the upgrade process.
8484
*/
8585
void

‎contrib/pg_upgrade/util.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -266,7 +266,7 @@ pg_putenv(const char *var, const char *val)
266266

267267
/*
268268
* Do not free envstr because it becomes part of the environment on
269-
* some operating systems. See port/unsetenv.c::unsetenv.
269+
* some operating systems. See port/unsetenv.c::unsetenv.
270270
*/
271271
#else
272272
SetEnvironmentVariableA(var, val);

‎contrib/pgcrypto/crypt-des.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -29,7 +29,7 @@
2929
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
3030
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
3131
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32-
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
32+
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
3333
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3434
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3535
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)

‎contrib/pgcrypto/crypt-gensalt.c

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99
* entirely in crypt_blowfish.c.
1010
*
1111
* Put bcrypt generator also here as crypt-blowfish.c
12-
* may not be compiled always. -- marko
12+
* may not be compiled always. -- marko
1313
*/
1414

1515
#include "postgres.h"

‎contrib/pgcrypto/fortuna.c

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@
1717
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
1818
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1919
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20-
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20+
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
2121
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2222
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2323
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
@@ -53,7 +53,7 @@
5353

5454
/*
5555
* There is some confusion about whether and how to carry forward
56-
* the state of the pools. Seems like original Fortuna does not
56+
* the state of the pools. Seems like original Fortuna does not
5757
* do it, resetting hash after each request. I guess expecting
5858
* feeding to happen more often that requesting. This is absolutely
5959
* unsuitable for pgcrypto, as nothing asynchronous happens here.
@@ -77,7 +77,7 @@
7777
* How many pools.
7878
*
7979
* Original Fortuna uses 32 pools, that means 32'th pool is
80-
* used not earlier than in 13th year. This is a waste in
80+
* used not earlier than in 13th year. This is a waste in
8181
* pgcrypto, as we have very low-frequancy seeding. Here
8282
* is preferable to have all entropy usable in reasonable time.
8383
*
@@ -296,7 +296,7 @@ reseed(FState *st)
296296
}
297297

298298
/*
299-
* Pick a random pool. This uses key bytes as random source.
299+
* Pick a random pool. This uses key bytes as random source.
300300
*/
301301
static unsigned
302302
get_rand_pool(FState *st)

‎contrib/pgcrypto/fortuna.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@
1717
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
1818
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1919
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20-
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20+
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
2121
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2222
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2323
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)

0 commit comments

Comments
 (0)
0