int res;
uint8 *p;
- /* EOF is normal here, thus we dont use GETBYTE */
+ /* EOF is normal here, thus we don't use GETBYTE */
res = pullf_read(src, 1, &p);
if (res < 0)
return res;
run_cost += cpu_tuple_cost * numGroups;
run_cost += ptarget->cost.per_tuple * numGroups;
- /* Accout for the eval cost of HAVING quals, if any */
+ /* Account for the eval cost of HAVING quals, if any */
if (root->parse->havingQual)
{
QualCost remote_cost;
/*
* Lock the entry leaf page. This is more coarse-grained than
* necessary, because it will conflict with any insertions that
- * land on the same leaf page, not only the exacty key we searched
+ * land on the same leaf page, not only the exact key we searched
* for. But locking an individual tuple would require updating
* that lock whenever it moves because of insertions or vacuums,
* which seems too complicated.
/*
* Should probably fixed at some point, but for now it's easier to allow
- * buffer and heap tuples to be used interchangably.
+ * buffer and heap tuples to be used interchangeably.
*/
if (slot->tts_ops == &TTSOpsBufferHeapTuple &&
op->d.fetch.kind == &TTSOpsHeapTuple)
MemoryContextAllocZero(planstate->state->es_query_cxt, sizeof(JitInstrumentation));
combined = planstate->state->es_jit_worker_instr;
- /* Accummulate all the workers' instrumentations. */
+ /* Accumulate all the workers' instrumentations. */
for (n = 0; n < shared_jit->num_workers; ++n)
InstrJitAgg(combined, &shared_jit->jit_instr[n]);
* possible.
*
* If materialize is true, the contents of the slots will be made independent
- * from the underlying storage (i.e. all buffer pins are release, memory is
+ * from the underlying storage (i.e. all buffer pins are released, memory is
* allocated in the slot's context).
*
* If shouldFree is not-NULL it'll be set to true if the returned tuple has
;
PartitionBoundSpec:
- /* a HASH partition*/
+ /* a HASH partition */
FOR VALUES WITH '(' hash_partbound ')'
{
ListCell *lc;
/*
* Do not log if log_statement_sample_rate = 0. Log a sample if
- * log_statement_sample_rate <= 1 and avoid unecessary random() call
+ * log_statement_sample_rate <= 1 and avoid unnecessary random() call
* if log_statement_sample_rate = 1. But don't compute any of this
* unless needed.
*/
* When a tuple is updated or deleted, our standard visibility rules
* consider that it is *still valid* so long as we are in the same command,
* ie, until the next CommandCounterIncrement() or transaction commit.
- * (See acces/heap/heapam_visibility.c, and note that system catalogs are
+ * (See access/heap/heapam_visibility.c, and note that system catalogs are
* generally scanned under the most current snapshot available, rather than
* the transaction snapshot.) At the command boundary, the old tuple stops
* being valid and the new version, if any, becomes valid. Therefore,
/*
* To deal with non-anonymous record types that are exchanged by backends
- * involved in a parallel query, we also need a shared verion of the above.
+ * involved in a parallel query, we also need a shared version of the above.
*/
struct SharedRecordTypmodRegistry
{
} CState;
/*
- * Cache cell for zipfian_random call
+ * Cache cell for random_zipfian call
*/
typedef struct
{
/* cell keys */
- double s; /* s - parameter of zipfan_random function */
+ double s; /* s - parameter of random_zipfian function */
int64 n; /* number of elements in range (max - min + 1) */
double harmonicn; /* generalizedHarmonicNumber(n, s) */
/*
* If the host is an absolute path, the connection is via socket
- * unless overriden by hostaddr
+ * unless overridden by hostaddr
*/
if (is_absolute_path(host))
{
* nplans how many plans are in the array
* whichplan which plan is being executed (0 .. n-1), or a
* special negative value. See nodeAppend.c.
- * pruningstate details required to allow partitions to be
+ * prune_state details required to allow partitions to be
* eliminated from the scan, or NULL if not possible.
* valid_subplans for runtime pruning, valid appendplans indexes to
* scan.
/* port/quotes.c */
extern char *escape_single_quotes_ascii(const char *src);
-/* port/wait_error.c */
+/* common/wait_error.c */
extern char *wait_result_to_str(int exit_status);
extern bool wait_result_is_signal(int exit_status, int signum);
extern bool wait_result_is_any_signal(int exit_status, bool include_command_not_found);
*tb_depth = 0;
initStringInfo(&tbstr);
- /* Mimick Python traceback reporting as close as possible. */
+ /* Mimic Python traceback reporting as close as possible. */
appendStringInfoString(&tbstr, "Traceback (most recent call last):");
while (tb != NULL && tb != Py_None)
{