cur = (GBT_NUMKEY *) DatumGetPointer((entryvec->vector[0].key));
- o.lower = &((GBT_NUMKEY *) out)[0];
- o.upper = &((GBT_NUMKEY *) out)[tinfo->size];
+ o.lower = &out[0];
+ o.upper = &out[tinfo->size];
memcpy(out, cur, 2 * tinfo->size);
switch (strategy)
{
case RTOverlapStrategyNumber:
- retval = (bool) cube_overlap_v0(key, query);
+ retval = cube_overlap_v0(key, query);
break;
case RTSameStrategyNumber:
case RTContainsStrategyNumber:
case RTOldContainsStrategyNumber:
- retval = (bool) cube_contains_v0(key, query);
+ retval = cube_contains_v0(key, query);
break;
case RTContainedByStrategyNumber:
case RTOldContainedByStrategyNumber:
- retval = (bool) cube_overlap_v0(key, query);
+ retval = cube_overlap_v0(key, query);
break;
default:
retval = false;
if ((pos < 0) || (pos >= s->length))
return '\0';
- return ((char) *(s->str + pos));
+ return *(s->str + pos);
}
MBuf *mbuf;
mbuf = palloc(sizeof *mbuf);
- mbuf->data = (uint8 *) data;
+ mbuf->data = data;
mbuf->buf_end = mbuf->data + len;
mbuf->data_end = mbuf->data + len;
mbuf->read_pos = mbuf->data;
values,
#endif
isnull,
- (char *) tp + hoff,
+ tp + hoff,
data_size,
&tupmask,
(hasnull ? (bits8 *) tp + sizeof(IndexTupleData) : NULL));
if (append)
elog(DEBUG2, "appended %d new items to block %u; %d bytes (%d to go)",
- maxitems, BufferGetBlockNumber(buf), (int) leaf->lsize,
+ maxitems, BufferGetBlockNumber(buf), leaf->lsize,
items->nitem - items->curitem - maxitems);
else
elog(DEBUG2, "inserted %d new items to block %u; %d bytes (%d to go)",
- maxitems, BufferGetBlockNumber(buf), (int) leaf->lsize,
+ maxitems, BufferGetBlockNumber(buf), leaf->lsize,
items->nitem - items->curitem - maxitems);
}
else
if (append)
elog(DEBUG2, "appended %d items to block %u; split %d/%d (%d to go)",
- maxitems, BufferGetBlockNumber(buf), (int) leaf->lsize, (int) leaf->rsize,
+ maxitems, BufferGetBlockNumber(buf), leaf->lsize, leaf->rsize,
items->nitem - items->curitem - maxitems);
else
elog(DEBUG2, "inserted %d items to block %u; split %d/%d (%d to go)",
- maxitems, BufferGetBlockNumber(buf), (int) leaf->lsize, (int) leaf->rsize,
+ maxitems, BufferGetBlockNumber(buf), leaf->lsize, leaf->rsize,
items->nitem - items->curitem - maxitems);
}
Assert(ndecoded == a->nitems);
- return (ItemPointer) items;
+ return items;
}
/*
OffsetNumber *unend;
unused = (OffsetNumber *) ptr;
- unend = (OffsetNumber *) ((char *) ptr + len);
+ unend = (OffsetNumber *) (ptr + len);
if ((unend - unused) > 0)
PageIndexMultiDelete(page, unused, unend - unused);
OffsetNumber *unend;
unused = (OffsetNumber *) ptr;
- unend = (OffsetNumber *) ((char *) ptr + len);
+ unend = (OffsetNumber *) (ptr + len);
if ((unend - unused) > 0)
PageIndexMultiDelete(page, unused, unend - unused);
records.tail->data = palloc(records.bytes_free);
}
- memcpy(((char *) records.tail->data) + records.tail->len, data, len);
+ memcpy(records.tail->data + records.tail->len, data, len);
records.tail->len += padlen;
records.bytes_free -= padlen;
records.total_len += padlen;
elog(ERROR, "AccessPriv node must specify privilege or columns");
priv = string_to_privilege(privnode->priv_name);
- if (priv & ~((AclMode) all_privileges))
+ if (priv & ~all_privileges)
ereport(ERROR,
(errcode(ERRCODE_INVALID_GRANT_OPERATION),
errmsg(errormsg, privilege_to_string(priv))));
elog(ERROR, "AccessPriv node must specify privilege");
priv = string_to_privilege(privnode->priv_name);
- if (priv & ~((AclMode) all_privileges))
+ if (priv & ~all_privileges)
ereport(ERROR,
(errcode(ERRCODE_INVALID_GRANT_OPERATION),
errmsg(errormsg, privilege_to_string(priv))));
NewColumnValue *ex = lfirst(l);
/* expr already planned */
- ex->exprstate = ExecInitExpr((Expr *) ex->expr, NULL);
+ ex->exprstate = ExecInitExpr(ex->expr, NULL);
}
notnull_attrs = notnull_virtual_attrs = NIL;
var->typid = exprType((Node *) argexpr);
var->typmod = exprTypmod((Node *) argexpr);
- ExecInitExprRec((Expr *) argexpr, state, &var->value, &var->isnull);
+ ExecInitExprRec(argexpr, state, &var->value, &var->isnull);
jsestate->args = lappend(jsestate->args, var);
}
*op->resvalue = Int32GetDatum((int32) newval);
break;
case INT8OID:
- *op->resvalue = Int64GetDatum((int64) newval);
+ *op->resvalue = Int64GetDatum(newval);
break;
default:
elog(ERROR, "unsupported sequence type %u",
&found_whole_row);
/* We ignore the value of found_whole_row. */
onconfl->oc_WhereClause =
- ExecInitQual((List *) clause, &mtstate->ps);
+ ExecInitQual(clause, &mtstate->ps);
}
}
}
char *ns_uri;
char *ns_name;
- value = ExecEvalExpr((ExprState *) expr, econtext, &isnull);
+ value = ExecEvalExpr(expr, econtext, &isnull);
if (isnull)
ereport(ERROR,
(errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED),
/* pool */
new_pool = (Pool *) palloc(sizeof(Pool));
- new_pool->size = (int) pool_size;
- new_pool->string_length = (int) string_length;
+ new_pool->size = pool_size;
+ new_pool->string_length = string_length;
/* all chromosome */
new_pool->data = (Chromosome *) palloc(pool_size * sizeof(Chromosome));
* target list and HAVING quals are parallel-safe.
*/
if (input_rel->consider_parallel && target_parallel_safe &&
- is_parallel_safe(root, (Node *) havingQual))
+ is_parallel_safe(root, havingQual))
grouped_rel->consider_parallel = true;
/*
tle = tlist_member(uniqexpr, newtlist);
if (!tle)
{
- tle = makeTargetEntry((Expr *) uniqexpr,
+ tle = makeTargetEntry(uniqexpr,
nextresno,
NULL,
false);
case T_SeqScan:
return create_seqscan_path(root, rel, required_outer, 0);
case T_SampleScan:
- return (Path *) create_samplescan_path(root, rel, required_outer);
+ return create_samplescan_path(root, rel, required_outer);
case T_IndexScan:
case T_IndexOnlyScan:
{
*/
result = makeNode(Query);
result->commandType = CMD_UTILITY;
- result->utilityStmt = (Node *) parseTree;
+ result->utilityStmt = parseTree;
break;
}
case T_CaseTestExpr:
case T_Var:
{
- result = (Node *) expr;
+ result = expr;
break;
}
if (*exprtype == UNKNOWNOID || typcategory == TYPCATEGORY_STRING)
{
- expr = coerce_to_target_type(pstate, (Node *) expr, *exprtype,
+ expr = coerce_to_target_type(pstate, expr, *exprtype,
TEXTOID, -1,
COERCION_IMPLICIT,
COERCE_IMPLICIT_CAST, -1);
*/
if (shmctl(shmid, IPC_RMID, NULL) < 0)
elog(LOG, "shmctl(%d, %d, 0) failed: %m",
- (int) shmid, IPC_RMID);
+ shmid, IPC_RMID);
}
}
SpinLockRelease(&walsnd->mutex);
/* don't need the lock anymore */
- MyWalSnd = (WalSnd *) walsnd;
+ MyWalSnd = walsnd;
break;
}
parsetree->hasSubLinks = checkExprHasSubLink(viewqual);
}
else
- AddQual(parsetree, (Node *) viewqual);
+ AddQual(parsetree, viewqual);
}
/*
* A boolean expression "x" can be interpreted as "x = true", so
* proceed with seeing if it's a suitable Var.
*/
- clause_expr = (Node *) clause;
+ clause_expr = clause;
}
/*
* A boolean expression "x" can be interpreted as "x = true", so
* proceed with seeing if it's a suitable Var.
*/
- clause_expr = (Node *) clause;
+ clause_expr = clause;
}
/*
if (IsA(rightop, Const))
{
- expr = (Node *) leftop;
+ expr = leftop;
cst = (Const *) rightop;
expronleft = true;
}
else if (IsA(leftop, Const))
{
- expr = (Node *) rightop;
+ expr = rightop;
cst = (Const *) leftop;
expronleft = false;
}
/* pointer to the data part (skip the varlena header) */
raw = (char *) data;
ptr = VARDATA_ANY(raw);
- endptr = (char *) raw + VARSIZE_ANY(data);
+ endptr = raw + VARSIZE_ANY(data);
/* get the header and perform further sanity checks */
memcpy(&mcvlist->magic, ptr, sizeof(uint32));
if (pgaio_io_was_recycled(ioh, ref_generation, &state))
return;
- switch ((PgAioHandleState) state)
+ switch (state)
{
case PGAIO_HS_IDLE:
case PGAIO_HS_HANDED_OUT:
pgaio_io_state_get_name(PgAioHandleState s)
{
#define PGAIO_HS_TOSTR_CASE(sym) case PGAIO_HS_##sym: return #sym
- switch ((PgAioHandleState) s)
+ switch (s)
{
PGAIO_HS_TOSTR_CASE(IDLE);
PGAIO_HS_TOSTR_CASE(HANDED_OUT);
const char *
pgaio_result_status_string(PgAioResultStatus rs)
{
- switch ((PgAioResultStatus) rs)
+ switch (rs)
{
case PGAIO_RS_UNKNOWN:
return "UNKNOWN";
if (pgaio_uring_caps.mem_init_size > 0)
{
ring_mem_remain = pgaio_uring_ring_shmem_size();
- ring_mem_next = (char *) shmem;
+ ring_mem_next = shmem;
/* align to page boundary, see also pgaio_uring_ring_shmem_size() */
ring_mem_next = (char *) TYPEALIGN(sysconf(_SC_PAGESIZE), ring_mem_next);
struct pollfd *cur_pollfd;
/* Sleep */
- rc = poll(set->pollfds, set->nevents, (int) cur_timeout);
+ rc = poll(set->pollfds, set->nevents, cur_timeout);
/* Check return code */
if (rc < 0)
HASH_ENTER, &found);
Assert(sxid != NULL);
Assert(!found);
- sxid->myXact = (SERIALIZABLEXACT *) sxact;
+ sxid->myXact = sxact;
/*
* Update global xmin. Note that this is a special case compared to
MemSet(ptr, 0, requestSize);
procs = (PGPROC *) ptr;
- ptr = (char *) ptr + TotalProcs * sizeof(PGPROC);
+ ptr = ptr + TotalProcs * sizeof(PGPROC);
ProcGlobal->allProcs = procs;
/* XXX allProcCount isn't really all of them; it excludes prepared xacts */
* how hotly they are accessed.
*/
ProcGlobal->xids = (TransactionId *) ptr;
- ptr = (char *) ptr + (TotalProcs * sizeof(*ProcGlobal->xids));
+ ptr = ptr + (TotalProcs * sizeof(*ProcGlobal->xids));
ProcGlobal->subxidStates = (XidCacheStatus *) ptr;
- ptr = (char *) ptr + (TotalProcs * sizeof(*ProcGlobal->subxidStates));
+ ptr = ptr + (TotalProcs * sizeof(*ProcGlobal->subxidStates));
ProcGlobal->statusFlags = (uint8 *) ptr;
- ptr = (char *) ptr + (TotalProcs * sizeof(*ProcGlobal->statusFlags));
+ ptr = ptr + (TotalProcs * sizeof(*ProcGlobal->statusFlags));
/* make sure wer didn't overflow */
Assert((ptr > (char *) procs) && (ptr <= (char *) procs + requestSize));
resultarray = (char *) palloc(arraytyplen);
memcpy(resultarray, DatumGetPointer(arraydatum), arraytyplen);
- elt_ptr = (char *) resultarray + indx[0] * elmlen;
+ elt_ptr = resultarray + indx[0] * elmlen;
ArrayCastAndSet(dataValue, elmlen, elmbyval, elmalign, elt_ptr);
return PointerGetDatum(resultarray);
}
olditemlen = att_addlength_pointer(0, elmlen, elt_ptr);
olditemlen = att_align_nominal(olditemlen, elmalign);
}
- lenafter = (int) (olddatasize - lenbefore - olditemlen);
+ lenafter = olddatasize - lenbefore - olditemlen;
}
if (isNull)
newkey.val.string.len = VARSIZE_ANY_EXHDR(pathelem);
(void) pushJsonbValue(st, WJB_KEY, &newkey);
- (void) push_path(st, level, path_elems, path_nulls,
- path_len, newval);
+ push_path(st, level, path_elems, path_nulls, path_len, newval);
/* Result is closed with WJB_END_OBJECT outside of this function */
}
if (idx > 0)
push_null_elements(st, idx - nelems);
- (void) push_path(st, level, path_elems, path_nulls,
- path_len, newval);
+ push_path(st, level, path_elems, path_nulls, path_len, newval);
/* Result is closed with WJB_END_OBJECT outside of this function */
}
if (needcomma)
appendStringInfoString(buf, ", ");
- get_rule_expr((Node *) e, context, true);
+ get_rule_expr(e, context, true);
appendStringInfo(buf, " AS %s",
quote_identifier(map_xml_name_to_sql_identifier(argname)));
needcomma = true;
* This would be DUMP_COMPONENT_ACL for from-initdb casts, but they do not
* support ACLs currently.
*/
- if (cast->dobj.catId.oid <= (Oid) g_last_builtin_oid)
+ if (cast->dobj.catId.oid <= g_last_builtin_oid)
cast->dobj.dump = DUMP_COMPONENT_NONE;
else
cast->dobj.dump = fout->dopt->include_everything ?
plang->dobj.dump = DUMP_COMPONENT_NONE;
else
{
- if (plang->dobj.catId.oid <= (Oid) g_last_builtin_oid)
+ if (plang->dobj.catId.oid <= g_last_builtin_oid)
plang->dobj.dump = fout->remoteVersion < 90600 ?
DUMP_COMPONENT_NONE : DUMP_COMPONENT_ACL;
else
* This would be DUMP_COMPONENT_ACL for from-initdb access methods, but
* they do not support ACLs currently.
*/
- if (method->dobj.catId.oid <= (Oid) g_last_builtin_oid)
+ if (method->dobj.catId.oid <= g_last_builtin_oid)
method->dobj.dump = DUMP_COMPONENT_NONE;
else
method->dobj.dump = fout->dopt->include_everything ?
* change permissions on their member objects, if they wish to, and have
* those changes preserved.
*/
- if (extinfo->dobj.catId.oid <= (Oid) g_last_builtin_oid)
+ if (extinfo->dobj.catId.oid <= g_last_builtin_oid)
extinfo->dobj.dump = extinfo->dobj.dump_contains = DUMP_COMPONENT_ACL;
else
{
{
uint8 *digest;
- digest = (uint8 *) digest0;
+ digest = digest0;
#ifdef WORDS_BIGENDIAN
memmove(digest, &ctx->h.b8[0], 20);
size_t off;
size_t copysiz;
- input = (const uint8 *) data;
+ input = data;
off = 0;
while (off < len)
*(short *) var = (short) value;
break;
case ECPGt_int:
- *(int *) var = (int) value;
+ *(int *) var = value;
break;
case ECPGt_long:
*(long *) var = (long) value;
{
length = strlen(arg);
buffer_len = 2 * length + 1;
- res = (char *) ecpg_alloc(buffer_len + 3, lineno);
+ res = ecpg_alloc(buffer_len + 3, lineno);
if (!res)
return res;
escaped_len = PQescapeString(res + 1, arg, buffer_len);
return cache_entry->isarray;
}
- array_query = (char *) ecpg_alloc(strlen("select typlen from pg_type where oid= and typelem<>0") + 11, stmt->lineno);
+ array_query = ecpg_alloc(strlen("select typlen from pg_type where oid= and typelem<>0") + 11, stmt->lineno);
if (array_query == NULL)
return ECPG_ARRAY_ERROR;
}
ecpg_log("ecpg_store_result on line %d: allocating memory for %d tuples\n", stmt->lineno, ntuples);
- var->value = (char *) ecpg_auto_alloc(len, stmt->lineno);
+ var->value = ecpg_auto_alloc(len, stmt->lineno);
if (!var->value)
return false;
*((char **) var->pointer) = var->value;
{
int len = var->ind_offset * ntuples;
- var->ind_value = (char *) ecpg_auto_alloc(len, stmt->lineno);
+ var->ind_value = ecpg_auto_alloc(len, stmt->lineno);
if (!var->ind_value)
return false;
*((char **) var->ind_pointer) = var->ind_value;
struct ECPGgeneric_bytea *variable =
(struct ECPGgeneric_bytea *) (var->value);
- if (!(mallocedval = (char *) ecpg_alloc(variable->len, lineno)))
+ if (!(mallocedval = ecpg_alloc(variable->len, lineno)))
return false;
memcpy(mallocedval, variable->arr, variable->len);
struct ECPGgeneric_varchar *variable =
(struct ECPGgeneric_varchar *) (var->value);
- if (!(newcopy = (char *) ecpg_alloc(variable->len + 1, lineno)))
+ if (!(newcopy = ecpg_alloc(variable->len + 1, lineno)))
return false;
strncpy(newcopy, variable->arr, variable->len);
{
char *newcopy;
- if (!(newcopy = (char *) ecpg_alloc(strlen(stmt->command)
- + strlen(tobeinserted)
- + 1, stmt->lineno)))
+ if (!(newcopy = ecpg_alloc(strlen(stmt->command) + strlen(tobeinserted) + 1, stmt->lineno)))
{
ecpg_free(tobeinserted);
return false;
int buffersize = sizeof(int) * CHAR_BIT * 10 / 3; /* a rough guess of the
* size we need */
- if (!(tobeinserted = (char *) ecpg_alloc(buffersize, stmt->lineno)))
+ if (!(tobeinserted = ecpg_alloc(buffersize, stmt->lineno)))
{
ecpg_free_params(stmt, false);
return false;
char *buffer,
*newcopy;
- if (!(buffer = (char *) ecpg_alloc(buffersize, lineno)))
+ if (!(buffer = ecpg_alloc(buffersize, lineno)))
return false;
snprintf(buffer, buffersize, "$%d", counter++);
for (len = 1; (*text)[ptr + len] && isvarchar((*text)[ptr + len]); len++)
/* skip */ ;
- if (!(newcopy = (char *) ecpg_alloc(strlen(*text) - len + strlen(buffer) + 1, lineno)))
+ if (!(newcopy = ecpg_alloc(strlen(*text) - len + strlen(buffer) + 1, lineno)))
{
ecpg_free(buffer);
return false;
char *text;
PGresult *query;
- text = (char *) ecpg_alloc(strlen("deallocate \"\" ") + strlen(this->name), this->stmt->lineno);
+ text = ecpg_alloc(strlen("deallocate \"\" ") + strlen(this->name), this->stmt->lineno);
if (text)
{
return -1;
}
- *(pg_funcptr_t *) routines[i].address = address;
+ *routines[i].address = address;
}
initialized = true;
TestValueType update = keys[i] + 1;
/* rt_set should report the key found */
- EXPECT_TRUE(rt_set(radixtree, keys[i], (TestValueType *) &update));
+ EXPECT_TRUE(rt_set(radixtree, keys[i], &update));
}
/* delete and re-insert keys */