NotificationsYou must be signed in to change notification settings
Fork6
Star31

Commit04e15c6

committed

Remove tabs after spaces in C comments

This was not changed in HEAD, but will be done later as part of apgindent run. Future pgindent runs will also do this.Report by Tom LaneBackpatch through all supported branches, but not HEAD

1 parent41fdcf7 commit04e15c6Copy full SHA for 04e15c6

File tree

699 files changed

+3823

-3823

lines changed

contrib
- btree_gist
  - btree_interval.c
- cube
  - cube.c
- dblink
  - dblink.c
- earthdistance
  - earthdistance.c
- file_fdw
  - file_fdw.c
- fuzzystrmatch
  - levenshtein.c
- hstore
  - hstore.h
  - hstore_gin.c
- intarray
  - _int_bool.c
  - _int_gist.c
  - _int_tool.c
- ltree
  - ltree_op.c
- oid2name
  - oid2name.c
- pg_archivecleanup
  - pg_archivecleanup.c
- pg_stat_statements
  - pg_stat_statements.c
- pg_trgm
  - trgm_gin.c
  - trgm_gist.c
  - trgm_regexp.c
- pg_upgrade
  - controldata.c
  - dump.c
  - exec.c
  - function.c
  - option.c
  - page.c
  - pg_upgrade.c
  - relfilenode.c
  - util.c
- pg_xlogdump
  - compat.c
- pgbench
  - pgbench.c
- pgcrypto
  - crypt-des.c
  - crypt-gensalt.c
  - fortuna.c
  - fortuna.h
  - imath.c
  - imath.h
  - internal-sha2.c
  - internal.c
  - mbuf.c
  - mbuf.h
  - md5.c
  - md5.h
  - openssl.c
  - pgcrypto.c
  - pgcrypto.h
  - pgp-armor.c
  - pgp-cfb.c
  - pgp-compress.c
  - pgp-decrypt.c
  - pgp-encrypt.c
  - pgp-info.c
  - pgp-mpi-internal.c
  - pgp-mpi-openssl.c
  - pgp-mpi.c
  - pgp-pgsql.c
  - pgp-pubdec.c
  - pgp-pubenc.c
  - pgp-pubkey.c
  - pgp-s2k.c
  - pgp.c
  - pgp.h
  - px-crypt.c
  - px-crypt.h
  - px-hmac.c
  - px.c
  - px.h
  - random.c
  - rijndael.c
  - rijndael.h
  - sha1.c
  - sha1.h
  - sha2.c
  - sha2.h
- pgstattuple
  - pgstattuple.c
- postgres_fdw
  - connection.c
  - deparse.c
  - option.c
  - postgres_fdw.c
- sepgsql
  - label.c
  - uavc.c
- spi
  - timetravel.c
- sslinfo
  - sslinfo.c
- tcn
  - tcn.c
- worker_spi
  - worker_spi.c
- xml2
  - xpath.c
src
- backend
  - access
    - common
    - gin
    - gist
    - hash
    - heap
    - index
      - genam.c
      - indexam.c
    - nbtree
    - spgist
    - transam
  - bootstrap
    - bootstrap.c
  - catalog
    - aclchk.c
    - catalog.c
    - dependency.c
    - heap.c
    - index.c
    - indexing.c
    - namespace.c
    - objectaddress.c
    - pg_collation.c
    - pg_constraint.c
    - pg_db_role_setting.c
    - pg_depend.c
    - pg_enum.c
    - pg_largeobject.c
    - pg_operator.c
    - pg_proc.c
    - pg_shdepend.c
    - pg_type.c
    - storage.c
    - toasting.c
  - commands
    - aggregatecmds.c
    - alter.c
    - analyze.c
    - async.c
    - cluster.c
    - constraint.c
    - copy.c
    - createas.c
    - dbcommands.c
    - define.c
    - event_trigger.c
    - explain.c
    - extension.c
    - foreigncmds.c
    - functioncmds.c
    - indexcmds.c
    - matview.c
    - opclasscmds.c
    - operatorcmds.c
    - portalcmds.c
    - prepare.c
    - proclang.c
    - schemacmds.c
    - sequence.c
    - tablecmds.c
    - tablespace.c
    - trigger.c
    - typecmds.c
    - user.c
    - vacuum.c
    - vacuumlazy.c
    - variable.c
    - view.c
  - executor
    - execAmi.c
    - execCurrent.c
    - execJunk.c
    - execMain.c
    - execProcnode.c
    - execQual.c
    - execScan.c
    - execTuples.c
    - execUtils.c
    - functions.c
    - nodeAgg.c
    - nodeAppend.c
    - nodeBitmapHeapscan.c
    - nodeForeignscan.c
    - nodeFunctionscan.c
    - nodeHash.c
    - nodeHashjoin.c
    - nodeIndexonlyscan.c
    - nodeIndexscan.c
    - nodeLimit.c
    - nodeLockRows.c
    - nodeMaterial.c
    - nodeMergeAppend.c
    - nodeMergejoin.c
    - nodeModifyTable.c
    - nodeRecursiveunion.c
    - nodeSetOp.c
    - nodeSubplan.c
    - nodeSubqueryscan.c
    - nodeUnique.c
    - nodeValuesscan.c
    - nodeWindowAgg.c
    - nodeWorktablescan.c
    - spi.c
    - tstoreReceiver.c
  - lib
    - stringinfo.c
  - libpq
    - auth.c
    - be-secure.c
    - hba.c
    - md5.c
    - pqcomm.c
    - pqformat.c
  - main
    - main.c
  - nodes
    - bitmapset.c
    - copyfuncs.c
    - equalfuncs.c
    - list.c
    - nodeFuncs.c
    - outfuncs.c
    - params.c
    - read.c
    - readfuncs.c
    - tidbitmap.c
  - optimizer
    - geqo
      - geqo_eval.c
    - path
    - plan
    - prep
    - util
  - parser
    - analyze.c
    - kwlookup.c
    - parse_agg.c
    - parse_clause.c
    - parse_coerce.c
    - parse_collate.c
    - parse_cte.c
    - parse_expr.c
    - parse_func.c
    - parse_node.c
    - parse_oper.c
    - parse_param.c
    - parse_relation.c
    - parse_target.c
    - parse_type.c
    - parse_utilcmd.c
    - parser.c
  - port
    - darwin
      - system.c
    - dynloader
    - posix_sema.c
    - sysv_sema.c
    - sysv_shmem.c
    - unix_latch.c
    - win32
      - socket.c
    - win32_latch.c
    - win32_shmem.c
  - postmaster
    - autovacuum.c
    - bgwriter.c
    - checkpointer.c
    - fork_process.c
    - pgarch.c
    - pgstat.c
    - postmaster.c
    - startup.c
    - syslogger.c
    - walwriter.c
  - regex
    - regc_color.c
    - regc_cvec.c
    - regc_lex.c
    - regc_locale.c
    - regc_nfa.c
    - regc_pg_locale.c
    - regcomp.c
    - rege_dfa.c
    - regerror.c
    - regexec.c
    - regfree.c
    - regprefix.c
  - replication
    - basebackup.c
    - syncrep.c
    - walreceiver.c
    - walreceiverfuncs.c
    - walsender.c
  - rewrite
    - rewriteDefine.c
    - rewriteHandler.c
    - rewriteManip.c
    - rewriteSupport.c
  - storage
    - buffer
    - file
      - buffile.c
      - fd.c
    - freespace
      - freespace.c
      - fsmpage.c
    - ipc
    - large_object
      - inv_api.c
    - lmgr
    - page
      - bufpage.c
    - smgr
      - md.c
      - smgr.c
  - tcop
    - fastpath.c
    - postgres.c
    - pquery.c
    - utility.c
  - tsearch
    - ts_locale.c
    - ts_selfuncs.c
    - ts_typanalyze.c
    - ts_utils.c
    - wparser_def.c
  - utils
    - adt
    - cache
    - error
      - elog.c
    - fmgr
    - hash
      - dynahash.c
    - init
      - miscinit.c
      - postinit.c
    - mb
      - conversion_procs/euc_tw_and_big5
        big5.c
      - mbutils.c
      - wchar.c
      - wstrcmp.c
      - wstrncmp.c
    - misc
    - mmgr
    - resowner
      - resowner.c
    - sort
    - time
- bin
  - initdb
    - findtimezone.c
    - initdb.c
  - pg_controldata
    - pg_controldata.c
  - pg_ctl
    - pg_ctl.c
  - pg_dump
  - pg_resetxlog
    - pg_resetxlog.c
  - psql
  - scripts
    - common.c
- common
  - relpath.c
- include
  - access
    - attnum.h
    - genam.h
    - gin_private.h
    - gist.h
    - hash.h
    - heapam.h
    - heapam_xlog.h
    - htup.h
    - htup_details.h
    - itup.h
    - nbtree.h
    - reloptions.h
    - rmgrlist.h
    - skey.h
    - slru.h
    - spgist_private.h
    - transam.h
    - tupdesc.h
    - tupmacs.h
    - tuptoaster.h
    - xlog.h
    - xlog_internal.h
    - xlogdefs.h
  - c.h
  - catalog
    - catversion.h
    - dependency.h
    - genbki.h
    - namespace.h
    - objectaccess.h
    - pg_attrdef.h
    - pg_attribute.h
    - pg_authid.h
    - pg_constraint.h
    - pg_control.h
    - pg_db_role_setting.h
    - pg_default_acl.h
    - pg_description.h
    - pg_event_trigger.h
    - pg_largeobject.h
    - pg_opclass.h
    - pg_proc.h
    - pg_rewrite.h
    - pg_shdepend.h
    - pg_shdescription.h
    - pg_statistic.h
    - pg_trigger.h
    - pg_ts_dict.h
    - pg_ts_template.h
    - pg_type.h
  - commands
    - comment.h
    - vacuum.h
  - datatype
    - timestamp.h
  - executor
    - executor.h
    - hashjoin.h
    - spi_priv.h
    - tuptable.h
  - fmgr.h
  - funcapi.h
  - lib
    - ilist.h
    - stringinfo.h
  - libpq
    - libpq-be.h
    - pqcomm.h
  - mb
    - pg_wchar.h
  - miscadmin.h
  - nodes
    - execnodes.h
    - nodes.h
    - params.h
    - parsenodes.h
    - plannodes.h
    - primnodes.h
    - relation.h
    - tidbitmap.h
    - value.h
  - parser
    - gramparse.h
    - parse_node.h
    - scanner.h
  - pg_config_manual.h
  - pgstat.h
  - port
    - linux.h
    - win32.h
  - port.h
  - portability
    - instr_time.h
  - postgres.h
  - postgres_ext.h
  - postmaster
    - bgworker.h
    - syslogger.h
  - regex
    - regcustom.h
    - regex.h
    - regexport.h
    - regguts.h
  - replication
    - walreceiver.h
  - snowball
    - header.h
  - storage
    - barrier.h
    - block.h
    - buf_internals.h
    - bufpage.h
    - ipc.h
    - itemid.h
    - itemptr.h
    - large_object.h
    - lock.h
    - pg_sema.h
    - pg_shmem.h
    - pos.h
    - predicate_internals.h
    - proc.h
    - relfilenode.h
    - s_lock.h
    - sinval.h
    - sinvaladt.h
    - smgr.h
  - tcop
    - dest.h
    - tcopdebug.h
  - utils
    - acl.h
    - builtins.h
    - catcache.h
    - datetime.h
    - elog.h
    - guc.h
    - hsearch.h
    - inet.h
    - memutils.h
    - palloc.h
    - pg_crc.h
    - plancache.h
    - portal.h
    - rel.h
    - relcache.h
    - resowner.h
    - selfuncs.h
    - sortsupport.h
    - tqual.h
    - tuplesort.h
    - tuplestore.h
    - typcache.h
- interfaces
  - ecpg
    - include
      - sqlca.h
    - pgtypeslib
    - preproc
      - c_keywords.c
      - parser.c
    - test/expected
  - libpq
- pl
  - plperl
    - plperl.c
  - plpgsql/src
  - plpython
  - tcl
    - pltcl.c
- port
- test
  - isolation
    - isolationtester.c
  - regress
    - pg_regress.c
- timezone
  - localtime.c
  - pgtz.c
- tutorial
  - complex.c

Some content is hidden

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

699 files changed

+3823

-3823

lines changed

`‎contrib/btree_gist/btree_interval.c`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -95,7 +95,7 @@ gbt_intv_dist(const void a, const void b)`
`95`	`95`
`96`	`96`	`/*`
`97`	`97`	`* 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`
`99`	`99`	`* insists on adding alignment padding at the end of the struct.`
`100`	`100`	`*/`
`101`	`101`	`#defineINTERVALSIZE 16`

`‎contrib/cube/cube.c`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -561,7 +561,7 @@ g_cube_picksplit(PG_FUNCTION_ARGS)`
`561`	`561`	`rt_cube_size(datum_r,&size_r);`
`562`	`562`
`563`	`563`	`/*`
`564`		`- * Now split up the regions between the two seeds.An important property`
	`564`	`+ * Now split up the regions between the two seeds.An important property`
`565`	`565`	`* of this split algorithm is that the split vector v has the indices of`
`566`	`566`	`* items to be split in order in its left and right vectors. We exploit`
`567`	`567`	`* this property by doing a merge in the code that actually splits the`
`@@ -577,7 +577,7 @@ g_cube_picksplit(PG_FUNCTION_ARGS)`
`577`	`577`	`{`
`578`	`578`	`/*`
`579`	`579`	`* If we've already decided where to place this item, just put it on`
`580`		`- * the right list.Otherwise, we need to figure out which page needs`
	`580`	`+ * the right list.Otherwise, we need to figure out which page needs`
`581`	`581`	`* the least enlargement in order to store the item.`
`582`	`582`	`*/`
`583`	`583`

`‎contrib/dblink/dblink.c`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -2397,7 +2397,7 @@ get_tuple_of_interest(Relation rel, int pkattnums, int pknumatts, char *src_pk`
`2397`	`2397`	`* Build sql statement to look up tuple of interest, ie, the one matching`
`2398`	`2398`	`* src_pkattvals. We used to use "SELECT *" here, but it's simpler to`
`2399`	`2399`	`* generate a result tuple that matches the table's physical structure,`
`2400`		`- * with NULLs for any dropped columns.Otherwise we have to deal with two`
	`2400`	`+ * with NULLs for any dropped columns.Otherwise we have to deal with two`
`2401`	`2401`	`* different tupdescs and everything's very confusing.`
`2402`	`2402`	`*/`
`2403`	`2403`	`appendStringInfoString(&buf,"SELECT ");`
`@@ -2623,7 +2623,7 @@ dblink_security_check(PGconn conn, remoteConn rconn)`
`2623`	`2623`	`}`
`2624`	`2624`
`2625`	`2625`	`/*`
`2626`		`- * For non-superusers, insist that the connstr specify a password.This`
	`2626`	`+ * For non-superusers, insist that the connstr specify a password.This`
`2627`	`2627`	`* prevents a password from being picked up from .pgpass, a service file,`
`2628`	`2628`	`* the environment, etc. We don't want the postgres user's passwords`
`2629`	`2629`	`* to be accessible to non-superusers.`

`‎contrib/earthdistance/earthdistance.c`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -91,7 +91,7 @@ geo_distance_internal(Point pt1, Point pt2)`
`91`	`91`	`* distance between the points in miles on earth's surface`
`92`	`92`	`*`
`93`	`93`	`* 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,`
`95`	`95`	`* continue to use oldstyle. This is just because we'd like earthdistance`
`96`	`96`	`* to serve as a canary for any unintentional breakage of version-0 functions`
`97`	`97`	`* with float8 results.`

`‎contrib/file_fdw/file_fdw.c`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -478,7 +478,7 @@ fileGetForeignPaths(PlannerInfo *root,`
`478`	`478`	`&startup_cost,&total_cost);`
`479`	`479`
`480`	`480`	`/*`
`481`		`- * Create a ForeignPath node and add it as only possible path.We use the`
	`481`	`+ * Create a ForeignPath node and add it as only possible path.We use the`
`482`	`482`	`* fdw_private list of the path to carry the convert_selectively option;`
`483`	`483`	`* it will be propagated into the fdw_private list of the Plan node.`
`484`	`484`	`*/`
`@@ -891,7 +891,7 @@ estimate_size(PlannerInfo root, RelOptInfo baserel,`
`891`	`891`	`* planner's idea of the relation width; which is bogus if not all`
`892`	`892`	`* columns are being read, not to mention that the text representation`
`893`	`893`	`* of a row probably isn't the same size as its internal`
`894`		`- * representation.Possibly we could do something better, but the`
	`894`	`+ * representation.Possibly we could do something better, but the`
`895`	`895`	`* real answer to anyone who complains is "ANALYZE" ...`
`896`	`896`	`*/`
`897`	`897`	`inttuple_width;`
`@@ -956,7 +956,7 @@ estimate_costs(PlannerInfo root, RelOptInfo baserel,`
`956`	`956`	`* which must have at least targrows entries.`
`957`	`957`	`* The actual number of rows selected is returned as the function result.`
`958`	`958`	`* We also count the total number of rows in the file and return it into`
`959`		`- * totalrows.Note that totaldeadrows is always set to 0.`
	`959`	`+ * totalrows.Note that totaldeadrows is always set to 0.`
`960`	`960`	`*`
`961`	`961`	`* Note that the returned list of rows is not always in order by physical`
`962`	`962`	`* position in the file. Therefore, correlation estimates derived later`

`‎contrib/fuzzystrmatch/levenshtein.c`

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -50,7 +50,7 @@ static int levenshtein_internal(text s, text t,`
`50`	`50`	`* array.`
`51`	`51`	`*`
`52`	`52`	`* 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`
`54`	`54`	`* theoretical "minimum residual distance" from that cell to the last column`
`55`	`55`	`* of the final row. This minimum residual distance is zero when the`
`56`	`56`	`* untransformed portions of the strings are of equal length (because we might`
`@@ -141,7 +141,7 @@ levenshtein_internal(text s, text t,`
`141`	`141`	`stop_column=m+1;`
`142`	`142`
`143`	`143`	`/*`
`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,`
`145`	`145`	`* return max_d + 1 immediately. Otherwise, determine whether it's tight`
`146`	`146`	`* enough to limit the computation we must perform. If so, figure out`
`147`	`147`	`* initial stop column.`
`@@ -168,7 +168,7 @@ levenshtein_internal(text s, text t,`
`168`	`168`	`* need to fill in. If the string is growing, the theoretical`
`169`	`169`	`* minimum distance already incorporates the cost of deleting the`
`170`	`170`	`* 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`
`172`	`172`	`* the best-case total cost increases by ins_c + del_c. If the`
`173`	`173`	`* string is shrinking, the minimum theoretical cost assumes no`
`174`	`174`	`* excess deletions; that is, we're starting no further right than`
`@@ -246,7 +246,7 @@ levenshtein_internal(text s, text t,`
`246`	`246`	`/*`
`247`	`247`	`* The main loop fills in curr, but curr[0] needs a special case: to`
`248`	`248`	`* 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,`
`250`	`250`	`* this special case does not apply.`
`251`	`251`	`*/`
`252`	`252`	`if (start_column==0)`

`‎contrib/hstore/hstore.h`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -12,7 +12,7 @@`
`12`	`12`	`* HEntry: there is one of these for each key _and_ value in an hstore`
`13`	`13`	`*`
`14`	`14`	`* 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`
`16`	`16`	`* whether there is a previous entry.`
`17`	`17`	`*/`
`18`	`18`	`typedefstruct`

`‎contrib/hstore/hstore_gin.c`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -13,7 +13,7 @@`
`13`	`13`	`/*`
`14`	`14`	`* When using a GIN index for hstore, we choose to index both keys and values.`
`15`	`15`	`* 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`
`17`	`17`	`* store null values as nulls, but we'll keep it this way for on-disk`
`18`	`18`	`* compatibility.)`
`19`	`19`	`*/`
`@@ -168,7 +168,7 @@ gin_consistent_hstore(PG_FUNCTION_ARGS)`
`168`	`168`	`{`
`169`	`169`	`/*`
`170`	`170`	`* 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`
`172`	`172`	`* present, we can fail at once.`
`173`	`173`	`*/`
`174`	`174`	`*recheck= true;`

`‎contrib/intarray/_int_bool.c`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -353,7 +353,7 @@ gin_bool_consistent(QUERYTYPE query, bool check)`
`353`	`353`	`return FALSE;`
`354`	`354`
`355`	`355`	`/*`
`356`		`- * Set up data for checkcondition_gin.This must agree with the query`
	`356`	`+ * Set up data for checkcondition_gin.This must agree with the query`
`357`	`357`	`* extraction code in ginint4_queryextract.`
`358`	`358`	`*/`
`359`	`359`	`gcv.first=items;`

`‎contrib/intarray/_int_gist.c`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -480,7 +480,7 @@ g_int_picksplit(PG_FUNCTION_ARGS)`
`480`	`480`	`qsort((void*)costvector,maxoff,sizeof(SPLITCOST),comparecost);`
`481`	`481`
`482`	`482`	`/*`
`483`		`- * Now split up the regions between the two seeds.An important property`
	`483`	`+ * Now split up the regions between the two seeds.An important property`
`484`	`484`	`* of this split algorithm is that the split vector v has the indices of`
`485`	`485`	`* items to be split in order in its left and right vectors. We exploit`
`486`	`486`	`* this property by doing a merge in the code that actually splits the`
`@@ -498,7 +498,7 @@ g_int_picksplit(PG_FUNCTION_ARGS)`
`498`	`498`
`499`	`499`	`/*`
`500`	`500`	`* If we've already decided where to place this item, just put it on`
`501`		`- * the right list.Otherwise, we need to figure out which page needs`
	`501`	`+ * the right list.Otherwise, we need to figure out which page needs`
`502`	`502`	`* the least enlargement in order to store the item.`
`503`	`503`	`*/`
`504`	`504`

`‎contrib/intarray/_int_tool.c`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -184,7 +184,7 @@ rt__int_size(ArrayType a, float size)`
`184`	`184`	`*size= (float)ARRNELEMS(a);`
`185`	`185`	`}`
`186`	`186`
`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 */`
`188`	`188`	`bool`
`189`	`189`	`isort(int32*a,intlen)`
`190`	`190`	`{`
`@@ -196,7 +196,7 @@ isort(int32 *a, int len)`
`196`	`196`	`boolr= FALSE;`
`197`	`197`
`198`	`198`	`/*`
`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`
`200`	`200`	`* case, it's quite fast if the input is already sorted or nearly so.`
`201`	`201`	`* Also, for not-too-large inputs it's faster than more complex methods`
`202`	`202`	`* anyhow.`

`‎contrib/ltree/ltree_op.c`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -612,7 +612,7 @@ ltreeparentsel(PG_FUNCTION_ARGS)`
`612`	`612`	`/*`
`613`	`613`	`* If the histogram is large enough, see what fraction of it the`
`614`	`614`	`* 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`
`616`	`616`	`* non-MCV population.`
`617`	`617`	`*/`
`618`	`618`	`selec=histogram_selectivity(&vardata,&contproc,`

`‎contrib/oid2name/oid2name.c`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -413,7 +413,7 @@ sql_exec(PGconn conn, const char todo, bool quiet)`
`413`	`413`	`}`
`414`	`414`
`415`	`415`	`/*`
`416`		`- * Dump all databases.There are no system objects to worry about.`
	`416`	`+ * Dump all databases.There are no system objects to worry about.`
`417`	`417`	`*/`
`418`	`418`	`void`
`419`	`419`	`sql_exec_dumpalldbs(PGconnconn,structoptionsopts)`

`‎contrib/pg_archivecleanup/pg_archivecleanup.c`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -124,7 +124,7 @@ CleanupPriorWALFiles(void)`
`124`	`124`
`125`	`125`	`/*`
`126`	`126`	`* 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`
`128`	`128`	`* we won't prematurely remove a segment from a parent timeline.`
`129`	`129`	`* We could probably be a little more proactive about removing`
`130`	`130`	`* segments of non-parent timelines, but that would be a whole lot`
`@@ -151,7 +151,7 @@ CleanupPriorWALFiles(void)`
`151`	`151`	`{`
`152`	`152`	`/*`
`153`	`153`	`* 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`
`155`	`155`	`* user can pipe the output into some other program.`
`156`	`156`	`*/`
`157`	`157`	`printf("%s\n",WALFilePath);`

`‎contrib/pg_stat_statements/pg_stat_statements.c`

Lines changed: 6 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`	`*Track statement execution times across a whole database cluster.`
`5`	`5`	`*`
`6`	`6`	`* 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`
`8`	`8`	`* in the designated amount of shared memory.)`
`9`	`9`	`*`
`10`	`10`	`* As of Postgres 9.2, this module normalizes query entries. Normalization`
`@@ -15,7 +15,7 @@`
`15`	`15`	`*`
`16`	`16`	`* Normalization is implemented by fingerprinting queries, selectively`
`17`	`17`	`* 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`
`19`	`19`	`* distinct from a regular serialization in that various extraneous`
`20`	`20`	`* information is ignored as irrelevant or not essential to the query, such`
`21`	`21`	`* as the collations of Vars and, most notably, the values of constants.`
`@@ -1232,7 +1232,7 @@ pgss_memsize(void)`
`1232`	`1232`	`* would be difficult to demonstrate this even under artificial conditions.)`
`1233`	`1233`	`*`
`1234`	`1234`	`* Note: despite needing exclusive lock, it's not an error for the target`
`1235`		`- * entry to already exist.This is because pgss_store releases and`
	`1235`	`+ * entry to already exist.This is because pgss_store releases and`
`1236`	`1236`	`* reacquires lock after failing to find a match; so someone else could`
`1237`	`1237`	`* have made the entry while we waited to get exclusive lock.`
`1238`	`1238`	`*/`
`@@ -1491,7 +1491,7 @@ JumbleRangeTable(pgssJumbleState jstate, List rtable)`
`1491`	`1491`	`*`
`1492`	`1492`	`* Note: the reason we don't simply use expression_tree_walker() is that the`
`1493`	`1493`	`* point of that function is to support tree walkers that don't care about`
`1494`		`- * most tree node types, but here we care about all types.We should complain`
	`1494`	`+ * most tree node types, but here we care about all types.We should complain`
`1495`	`1495`	`* about any unrecognized node type.`
`1496`	`1496`	`*/`
`1497`	`1497`	`staticvoid`
`@@ -2013,7 +2013,7 @@ generate_normalized_query(pgssJumbleState jstate, const char query,`
`2013`	`2013`	`* a problem.`
`2014`	`2014`	`*`
`2015`	`2015`	`* Duplicate constant pointers are possible, and will have their lengths`
`2016`		`- * marked as '-1', so that they are later ignored.(Actually, we assume the`
	`2016`	`+ * marked as '-1', so that they are later ignored.(Actually, we assume the`
`2017`	`2017`	`* lengths were initialized as -1 to start with, and don't change them here.)`
`2018`	`2018`	`*`
`2019`	`2019`	`* N.B. There is an assumption that a '-' character at a Const location begins`
`@@ -2082,7 +2082,7 @@ fill_in_constant_lengths(pgssJumbleState jstate, const char query)`
`2082`	`2082`	`* adjustment of location to that of the leading '-'`
`2083`	`2083`	`* operator in the event of a negative constant. It is`
`2084`	`2084`	`* also useful for our purposes to start from the minus`
`2085`		`- * symbol.In this way, queries like "select * from foo`
	`2085`	`+ * symbol.In this way, queries like "select * from foo`
`2086`	`2086`	`* where bar = 1" and "select * from foo where bar = -2"`
`2087`	`2087`	`* will have identical normalized query strings.`
`2088`	`2088`	`*/`

`‎contrib/pg_trgm/trgm_gin.c`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -121,7 +121,7 @@ gin_extract_query_trgm(PG_FUNCTION_ARGS)`
`121`	`121`	`{`
`122`	`122`	`/*`
`123`	`123`	`* Successful regex processing: store NFA-like graph as`
`124`		`- * extra_data.GIN API requires an array of nentries`
	`124`	`+ * extra_data.GIN API requires an array of nentries`
`125`	`125`	`* Pointers, but we just put the same value in each element.`
`126`	`126`	`*/`
`127`	`127`	`trglen=ARRNELEM(trg);`

`‎contrib/pg_trgm/trgm_gist.c`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -405,7 +405,7 @@ gtrgm_consistent(PG_FUNCTION_ARGS)`
`405`	`405`
`406`	`406`	`/*`
`407`	`407`	`* GETBIT() tests may give false positives, due to limited`
`408`		`- * size of the sign array.But since trigramsMatchGraph()`
	`408`	`+ * size of the sign array.But since trigramsMatchGraph()`
`409`	`409`	`* implements a monotone boolean function, false positives`
`410`	`410`	`* in the check array can't lead to false negative answer.`
`411`	`411`	`* So we can apply trigramsMatchGraph despite uncertainty,`

0 commit comments

Comments

(0)

Movatterモバイル変換

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit04e15c6

File tree

699 files changed

Some content is hidden

699 files changed

`‎contrib/btree_gist/btree_interval.c`

`‎contrib/cube/cube.c`

`‎contrib/dblink/dblink.c`

`‎contrib/earthdistance/earthdistance.c`

`‎contrib/file_fdw/file_fdw.c`

`‎contrib/fuzzystrmatch/levenshtein.c`

`‎contrib/hstore/hstore.h`

`‎contrib/hstore/hstore_gin.c`

`‎contrib/intarray/_int_bool.c`

`‎contrib/intarray/_int_gist.c`

`‎contrib/intarray/_int_tool.c`

`‎contrib/ltree/ltree_op.c`

`‎contrib/oid2name/oid2name.c`

`‎contrib/pg_archivecleanup/pg_archivecleanup.c`

`‎contrib/pg_stat_statements/pg_stat_statements.c`

`‎contrib/pg_trgm/trgm_gin.c`

`‎contrib/pg_trgm/trgm_gist.c`

0 commit comments