while ((entry = (ShippableCacheEntry *) hash_seq_search(&status)) != NULL)
{
if (hash_search(ShippableCacheHash,
- (void *) &entry->key,
+ &entry->key,
HASH_REMOVE,
NULL) == NULL)
elog(ERROR, "hash table corrupted");
/* See if we already cached the result. */
entry = (ShippableCacheEntry *)
- hash_search(ShippableCacheHash,
- (void *) &key,
- HASH_FIND,
- NULL);
+ hash_search(ShippableCacheHash, &key, HASH_FIND, NULL);
if (!entry)
{
* cache invalidation.
*/
entry = (ShippableCacheEntry *)
- hash_search(ShippableCacheHash,
- (void *) &key,
- HASH_ENTER,
- NULL);
+ hash_search(ShippableCacheHash, &key, HASH_ENTER, NULL);
entry->shippable = shippable;
}
bool found;
entry = (ParentMapEntry *) hash_search(buildstate->parentMap,
- (const void *) &child,
+ &child,
HASH_ENTER,
&found);
entry->parentblkno = parent;
/* Find node buffer in hash table */
entry = (ParentMapEntry *) hash_search(buildstate->parentMap,
- (const void *) &child,
+ &child,
HASH_FIND,
&found);
if (!found)
/* Find node buffer in hash table */
nodeBuffer = (GISTNodeBuffer *) hash_search(gfbb->nodeBuffersTab,
- (const void *) &nodeBlocknum,
+ &nodeBlocknum,
HASH_ENTER,
&found);
if (!found)
key.forkno = forkno;
key.blkno = blkno;
hentry = (xl_invalid_page *)
- hash_search(invalid_page_tab, (void *) &key, HASH_ENTER, &found);
+ hash_search(invalid_page_tab, &key, HASH_ENTER, &found);
if (!found)
{
}
if (hash_search(invalid_page_tab,
- (void *) &hentry->key,
+ &hentry->key,
HASH_REMOVE, NULL) == NULL)
elog(ERROR, "hash table corrupted");
}
}
if (hash_search(invalid_page_tab,
- (void *) &hentry->key,
+ &hentry->key,
HASH_REMOVE, NULL) == NULL)
elog(ERROR, "hash table corrupted");
}
/* remove deleted rnodes */
for (delete = pendingDeletes; delete != NULL; delete = delete->next)
if (delete->atCommit)
- (void) hash_search(tmphash, (void *) &delete->rlocator,
+ (void) hash_search(tmphash, &delete->rlocator,
HASH_REMOVE, NULL);
hash_seq_init(&scan, tmphash);
/* Skip syncing nodes that smgrDoPendingDeletes() will delete. */
for (pending = pendingDeletes; pending != NULL; pending = pending->next)
if (pending->atCommit)
- (void) hash_search(pendingSyncHash, (void *) &pending->rlocator,
+ (void) hash_search(pendingSyncHash, &pending->rlocator,
HASH_REMOVE, NULL);
hash_seq_init(&scan, pendingSyncHash);
key.pred_op = pred_op;
key.clause_op = clause_op;
cache_entry = (OprProofCacheEntry *) hash_search(OprProofCacheHash,
- (void *) &key,
+ &key,
HASH_ENTER, &cfound);
if (!cfound)
{
/* Look for an existing entry */
oprentry = (OprCacheEntry *) hash_search(OprCacheHash,
- (void *) key,
+ key,
HASH_FIND, NULL);
if (oprentry == NULL)
return InvalidOid;
Assert(OprCacheHash != NULL);
oprentry = (OprCacheEntry *) hash_search(OprCacheHash,
- (void *) key,
+ key,
HASH_ENTER, NULL);
oprentry->opr_oid = opr_oid;
}
while ((hentry = (OprCacheEntry *) hash_seq_search(&status)) != NULL)
{
if (hash_search(OprCacheHash,
- (void *) &hentry->key,
+ &hentry->key,
HASH_REMOVE, NULL) == NULL)
elog(ERROR, "hash table corrupted");
}
/*
* HASH_ENTER returns the existing entry if present or creates a new one.
*/
- entry = hash_search(LogicalRepRelMap, (void *) &remoterel->remoteid,
+ entry = hash_search(LogicalRepRelMap, &remoterel->remoteid,
HASH_ENTER, &found);
if (found)
logicalrep_relmap_init();
/* Search for existing entry. */
- entry = hash_search(LogicalRepRelMap, (void *) &remoteid,
+ entry = hash_search(LogicalRepRelMap, &remoteid,
HASH_FIND, &found);
if (!found)
/* Search for existing entry. */
part_entry = (LogicalRepPartMapEntry *) hash_search(LogicalRepPartMap,
- (void *) &partOid,
+ &partOid,
HASH_ENTER, &found);
entry = &part_entry->relmapentry;
/* search the lookup table */
ent = (ReorderBufferTXNByIdEnt *)
hash_search(rb->by_txn,
- (void *) &xid,
+ &xid,
create ? HASH_ENTER : HASH_FIND,
&found);
if (found)
dclist_delete_from(&rb->catchange_txns, &txn->catchange_node);
/* now remove reference from buffer */
- hash_search(rb->by_txn,
- (void *) &txn->xid,
- HASH_REMOVE,
- &found);
+ hash_search(rb->by_txn, &txn->xid, HASH_REMOVE, &found);
Assert(found);
/* remove entries spilled to disk */
&key.tid);
ent = (ReorderBufferTupleCidEnt *)
- hash_search(txn->tuplecid_hash,
- (void *) &key,
- HASH_ENTER,
- &found);
+ hash_search(txn->tuplecid_hash, &key, HASH_ENTER, &found);
if (!found)
{
ent->cmin = change->data.tuplecid.cmin;
Assert(!isnull);
ent = (ReorderBufferToastEnt *)
- hash_search(txn->toast_hash,
- (void *) &chunk_id,
- HASH_ENTER,
- &found);
+ hash_search(txn->toast_hash, &chunk_id, HASH_ENTER, &found);
if (!found)
{
*/
ent = (ReorderBufferToastEnt *)
hash_search(txn->toast_hash,
- (void *) &toast_pointer.va_valueid,
+ &toast_pointer.va_valueid,
HASH_FIND,
NULL);
if (ent == NULL)
ent = (ReorderBufferTupleCidEnt *)
- hash_search(tuplecid_data,
- (void *) &key,
- HASH_FIND,
- NULL);
+ hash_search(tuplecid_data, &key, HASH_FIND, NULL);
/* no existing mapping, no need to update */
if (!ent)
&key.tid);
new_ent = (ReorderBufferTupleCidEnt *)
- hash_search(tuplecid_data,
- (void *) &key,
- HASH_ENTER,
- &found);
+ hash_search(tuplecid_data, &key, HASH_ENTER, &found);
if (found)
{
restart:
ent = (ReorderBufferTupleCidEnt *)
- hash_search(tuplecid_data,
- (void *) &key,
- HASH_FIND,
- NULL);
+ hash_search(tuplecid_data, &key, HASH_FIND, NULL);
/*
* failed to find a mapping, check whether the table was rewritten and
/* Find cached relation info, creating if not found */
entry = (RelationSyncEntry *) hash_search(RelationSyncCache,
- (void *) &relid,
+ &relid,
HASH_ENTER, &found);
Assert(entry != NULL);
result = (BufferLookupEnt *)
hash_search_with_hash_value(SharedBufHash,
- (void *) tagPtr,
+ tagPtr,
hashcode,
HASH_FIND,
NULL);
result = (BufferLookupEnt *)
hash_search_with_hash_value(SharedBufHash,
- (void *) tagPtr,
+ tagPtr,
hashcode,
HASH_ENTER,
&found);
result = (BufferLookupEnt *)
hash_search_with_hash_value(SharedBufHash,
- (void *) tagPtr,
+ tagPtr,
hashcode,
HASH_REMOVE,
NULL);
/* enter victim array entry into hashtable */
hashent = hash_search(PrivateRefCountHash,
- (void *) &(ReservedRefCountEntry->buffer),
+ &(ReservedRefCountEntry->buffer),
HASH_ENTER,
&found);
Assert(!found);
if (PrivateRefCountOverflowed == 0)
return NULL;
- res = hash_search(PrivateRefCountHash,
- (void *) &buffer,
- HASH_FIND,
- NULL);
+ res = hash_search(PrivateRefCountHash, &buffer, HASH_FIND, NULL);
if (res == NULL)
return NULL;
free->refcount = res->refcount;
/* delete from hashtable */
- hash_search(PrivateRefCountHash,
- (void *) &buffer,
- HASH_REMOVE,
- &found);
+ hash_search(PrivateRefCountHash, &buffer, HASH_REMOVE, &found);
Assert(found);
Assert(PrivateRefCountOverflowed > 0);
PrivateRefCountOverflowed--;
bool found;
Buffer buffer = ref->buffer;
- hash_search(PrivateRefCountHash,
- (void *) &buffer,
- HASH_REMOVE,
- &found);
+ hash_search(PrivateRefCountHash, &buffer, HASH_REMOVE, &found);
Assert(found);
Assert(PrivateRefCountOverflowed > 0);
PrivateRefCountOverflowed--;
/* See if the desired buffer already exists */
hresult = (LocalBufferLookupEnt *)
- hash_search(LocalBufHash, (void *) &newTag, HASH_FIND, NULL);
+ hash_search(LocalBufHash, &newTag, HASH_FIND, NULL);
if (hresult)
{
/* See if the desired buffer already exists */
hresult = (LocalBufferLookupEnt *)
- hash_search(LocalBufHash, (void *) &newTag, HASH_FIND, NULL);
+ hash_search(LocalBufHash, &newTag, HASH_FIND, NULL);
if (hresult)
{
if (buf_state & BM_TAG_VALID)
{
hresult = (LocalBufferLookupEnt *)
- hash_search(LocalBufHash, (void *) &bufHdr->tag,
- HASH_REMOVE, NULL);
+ hash_search(LocalBufHash, &bufHdr->tag, HASH_REMOVE, NULL);
if (!hresult) /* shouldn't happen */
elog(ERROR, "local buffer hash table corrupted");
/* mark buffer invalid just in case hash insert fails */
}
hresult = (LocalBufferLookupEnt *)
- hash_search(LocalBufHash, (void *) &newTag, HASH_ENTER, &found);
+ hash_search(LocalBufHash, &newTag, HASH_ENTER, &found);
if (found) /* shouldn't happen */
elog(ERROR, "local buffer hash table corrupted");
hresult->id = b;
/* Remove entry from hashtable */
hresult = (LocalBufferLookupEnt *)
- hash_search(LocalBufHash, (void *) &bufHdr->tag,
- HASH_REMOVE, NULL);
+ hash_search(LocalBufHash, &bufHdr->tag, HASH_REMOVE, NULL);
if (!hresult) /* shouldn't happen */
elog(ERROR, "local buffer hash table corrupted");
/* Mark buffer invalid */
LocalRefCount[i]);
/* Remove entry from hashtable */
hresult = (LocalBufferLookupEnt *)
- hash_search(LocalBufHash, (void *) &bufHdr->tag,
- HASH_REMOVE, NULL);
+ hash_search(LocalBufHash, &bufHdr->tag, HASH_REMOVE, NULL);
if (!hresult) /* shouldn't happen */
elog(ERROR, "local buffer hash table corrupted");
/* Mark buffer invalid */
localtag.mode = lockmode;
locallock = (LOCALLOCK *) hash_search(LockMethodLocalHash,
- (void *) &localtag,
+ &localtag,
HASH_FIND, NULL);
return (locallock && locallock->nLocks > 0);
localtag.mode = lockmode;
locallock = (LOCALLOCK *) hash_search(LockMethodLocalHash,
- (void *) &localtag,
+ &localtag,
HASH_FIND, NULL);
/*
localtag.mode = lockmode;
locallock = (LOCALLOCK *) hash_search(LockMethodLocalHash,
- (void *) &localtag,
+ &localtag,
HASH_ENTER, &found);
/*
dlist_delete(&proclock->lockLink);
dlist_delete(&proclock->procLink);
if (!hash_search_with_hash_value(LockMethodProcLockHash,
- (void *) &(proclock->tag),
+ &(proclock->tag),
proclock_hashcode,
HASH_REMOVE,
NULL))
* Find or create a lock with this tag.
*/
lock = (LOCK *) hash_search_with_hash_value(LockMethodLockHash,
- (const void *) locktag,
+ locktag,
hashcode,
HASH_ENTER_NULL,
&found);
* Find or create a proclock entry with this tag
*/
proclock = (PROCLOCK *) hash_search_with_hash_value(LockMethodProcLockHash,
- (void *) &proclocktag,
+ &proclocktag,
proclock_hashcode,
HASH_ENTER_NULL,
&found);
*/
Assert(dlist_is_empty(&(lock->procLocks)));
if (!hash_search_with_hash_value(LockMethodLockHash,
- (void *) &(lock->tag),
+ &(lock->tag),
hashcode,
HASH_REMOVE,
NULL))
}
if (!hash_search(LockMethodLocalHash,
- (void *) &(locallock->tag),
+ &(locallock->tag),
HASH_REMOVE, NULL))
elog(WARNING, "locallock table corrupted");
dlist_delete(&proclock->procLink);
proclock_hashcode = ProcLockHashCode(&proclock->tag, hashcode);
if (!hash_search_with_hash_value(LockMethodProcLockHash,
- (void *) &(proclock->tag),
+ &(proclock->tag),
proclock_hashcode,
HASH_REMOVE,
NULL))
LOCK_PRINT("CleanUpLock: deleting", lock, 0);
Assert(dlist_is_empty(&lock->procLocks));
if (!hash_search_with_hash_value(LockMethodLockHash,
- (void *) &(lock->tag),
+ &(lock->tag),
hashcode,
HASH_REMOVE,
NULL))
localtag.mode = lockmode;
locallock = (LOCALLOCK *) hash_search(LockMethodLocalHash,
- (void *) &localtag,
+ &localtag,
HASH_FIND, NULL);
/*
Assert(EligibleForRelationFastPath(locktag, lockmode));
lock = (LOCK *) hash_search_with_hash_value(LockMethodLockHash,
- (const void *) locktag,
+ locktag,
locallock->hashcode,
HASH_FIND,
NULL);
proclocktag.myLock = lock;
proclocktag.myProc = MyProc;
locallock->proclock = (PROCLOCK *) hash_search(LockMethodProcLockHash,
- (void *) &proclocktag,
+ &proclocktag,
HASH_FIND,
NULL);
if (!locallock->proclock)
LWLockAcquire(partitionLock, LW_SHARED);
lock = (LOCK *) hash_search_with_hash_value(LockMethodLockHash,
- (void *) locktag,
+ locktag,
locallock->hashcode,
HASH_FIND,
NULL);
proclock_hashcode = ProcLockHashCode(&proclocktag, locallock->hashcode);
proclock = (PROCLOCK *)
hash_search_with_hash_value(LockMethodProcLockHash,
- (void *) &proclocktag,
+ &proclocktag,
proclock_hashcode,
HASH_FIND,
NULL);
LWLockAcquire(partitionLock, LW_SHARED);
lock = (LOCK *) hash_search_with_hash_value(LockMethodLockHash,
- (const void *) locktag,
+ locktag,
hashcode,
HASH_FIND,
NULL);
* Re-find the lock object (it had better be there).
*/
lock = (LOCK *) hash_search_with_hash_value(LockMethodLockHash,
- (void *) locktag,
+ locktag,
hashcode,
HASH_FIND,
NULL);
proclock_hashcode = ProcLockHashCode(&proclocktag, hashcode);
proclock = (PROCLOCK *) hash_search_with_hash_value(LockMethodProcLockHash,
- (void *) &proclocktag,
+ &proclocktag,
proclock_hashcode,
HASH_FIND,
NULL);
/* Otherwise, find or make an entry in lockhtab */
hentry = (PerLockTagEntry *) hash_search(lockhtab,
- (void *) &locallock->tag.lock,
+ &locallock->tag.lock,
HASH_ENTER, &found);
if (!found) /* initialize, if newly created */
hentry->sessLock = hentry->xactLock = false;
* given lock with my own proc.
*/
if (!hash_update_hash_key(LockMethodProcLockHash,
- (void *) proclock,
- (void *) &proclocktag))
+ proclock,
+ &proclocktag))
elog(PANIC, "duplicate entry found while reassigning a prepared transaction's locks");
/* Re-link into the new proc's proclock list */
* Find or create a lock with this tag.
*/
lock = (LOCK *) hash_search_with_hash_value(LockMethodLockHash,
- (void *) locktag,
+ locktag,
hashcode,
HASH_ENTER_NULL,
&found);
* Find or create a proclock entry with this tag
*/
proclock = (PROCLOCK *) hash_search_with_hash_value(LockMethodProcLockHash,
- (void *) &proclocktag,
+ &proclocktag,
proclock_hashcode,
HASH_ENTER_NULL,
&found);
*/
Assert(dlist_is_empty(&lock->procLocks));
if (!hash_search_with_hash_value(LockMethodLockHash,
- (void *) &(lock->tag),
+ &(lock->tag),
hashcode,
HASH_REMOVE,
NULL))
LWLockAcquire(partitionLock, LW_EXCLUSIVE);
lock = (LOCK *) hash_search_with_hash_value(LockMethodLockHash,
- (const void *) locktag,
+ locktag,
hashcode,
HASH_FIND,
&found);
brlocator.locator = rlocator;
brlocator.backend = backend;
reln = (SMgrRelation) hash_search(SMgrRelationHash,
- (void *) &brlocator,
+ &brlocator,
HASH_ENTER, &found);
/* Initialize it if not present before */
dlist_delete(&reln->node);
if (hash_search(SMgrRelationHash,
- (void *) &(reln->smgr_rlocator),
+ &(reln->smgr_rlocator),
HASH_REMOVE, NULL) == NULL)
elog(ERROR, "SMgrRelation hashtable corrupted");
return;
reln = (SMgrRelation) hash_search(SMgrRelationHash,
- (void *) &rlocator,
+ &rlocator,
HASH_FIND, NULL);
if (reln != NULL)
smgrclose(reln);
/* Cancel previously entered request */
entry = (PendingFsyncEntry *) hash_search(pendingOps,
- (void *) ftag,
+ ftag,
HASH_FIND,
NULL);
if (entry != NULL)
Assert(type == SYNC_REQUEST);
entry = (PendingFsyncEntry *) hash_search(pendingOps,
- (void *) ftag,
+ ftag,
HASH_ENTER,
&found);
/* if new entry, or was previously canceled, initialize it */
/* Lookup current lexeme in hashtable, adding it if new */
item = (TrackItem *) hash_search(lexemes_tab,
- (const void *) &hash_key,
+ &hash_key,
HASH_ENTER, &found);
if (found)
{
char *lexeme = item->key.lexeme;
- if (hash_search(lexemes_tab, (const void *) &item->key,
+ if (hash_search(lexemes_tab, &item->key,
HASH_REMOVE, NULL) == NULL)
elog(ERROR, "hash table corrupted");
pfree(lexeme);
/* Lookup current element in hashtable, adding it if new */
elem_value = elem_values[j];
item = (TrackItem *) hash_search(elements_tab,
- (const void *) &elem_value,
+ &elem_value,
HASH_ENTER, &found);
if (found)
{
Datum value = item->key;
- if (hash_search(elements_tab, (const void *) &item->key,
+ if (hash_search(elements_tab, &item->key,
HASH_REMOVE, NULL) == NULL)
elog(ERROR, "hash table corrupted");
/* We should free memory if element is not passed by value */
* Find or create a hash entry. If we find a valid one, just return it.
*/
riinfo = (RI_ConstraintInfo *) hash_search(ri_constraint_cache,
- (void *) &constraintOid,
+ &constraintOid,
HASH_ENTER, &found);
if (!found)
riinfo->valid = false;
* Lookup for the key
*/
entry = (RI_QueryHashEntry *) hash_search(ri_query_cache,
- (void *) key,
+ key,
HASH_FIND, NULL);
if (entry == NULL)
return NULL;
* invalid by ri_FetchPreparedPlan.
*/
entry = (RI_QueryHashEntry *) hash_search(ri_query_cache,
- (void *) key,
+ key,
HASH_ENTER, &found);
Assert(!found || entry->plan == NULL);
entry->plan = plan;
key.eq_opr = eq_opr;
key.typeid = typeid;
entry = (RI_CompareHashEntry *) hash_search(ri_compare_cache,
- (void *) &key,
+ &key,
HASH_ENTER, &found);
if (!found)
entry->valid = false;
if (attopt->opts)
pfree(attopt->opts);
if (hash_search(AttoptCacheHash,
- (void *) &attopt->key,
+ &attopt->key,
HASH_REMOVE,
NULL) == NULL)
elog(ERROR, "hash table corrupted");
key.attnum = attnum;
attopt =
(AttoptCacheEntry *) hash_search(AttoptCacheHash,
- (void *) &key,
+ &key,
HASH_FIND,
NULL);
* pg_attribute, since the read could cause a cache flush.
*/
attopt = (AttoptCacheEntry *) hash_search(AttoptCacheHash,
- (void *) &key,
+ &key,
HASH_ENTER,
NULL);
attopt->opts = opts;
do { \
RelIdCacheEnt *hentry; bool found; \
hentry = (RelIdCacheEnt *) hash_search(RelationIdCache, \
- (void *) &((RELATION)->rd_id), \
+ &((RELATION)->rd_id), \
HASH_ENTER, &found); \
if (found) \
{ \
do { \
RelIdCacheEnt *hentry; \
hentry = (RelIdCacheEnt *) hash_search(RelationIdCache, \
- (void *) &(ID), \
+ &(ID), \
HASH_FIND, NULL); \
if (hentry) \
RELATION = hentry->reldesc; \
do { \
RelIdCacheEnt *hentry; \
hentry = (RelIdCacheEnt *) hash_search(RelationIdCache, \
- (void *) &((RELATION)->rd_id), \
+ &((RELATION)->rd_id), \
HASH_REMOVE, NULL); \
if (hentry == NULL) \
elog(WARNING, "failed to delete relcache entry for OID %u", \
}
opcentry = (OpClassCacheEnt *) hash_search(OpClassCache,
- (void *) &operatorClassOid,
+ &operatorClassOid,
HASH_ENTER, &found);
if (!found)
for (i = 0; i < eoxact_list_len; i++)
{
idhentry = (RelIdCacheEnt *) hash_search(RelationIdCache,
- (void *) &eoxact_list[i],
+ &eoxact_list[i],
HASH_FIND,
NULL);
if (idhentry != NULL)
for (i = 0; i < eoxact_list_len; i++)
{
idhentry = (RelIdCacheEnt *) hash_search(RelationIdCache,
- (void *) &eoxact_list[i],
+ &eoxact_list[i],
HASH_FIND,
NULL);
if (idhentry != NULL)
entry->relid == relid) /* individual flushed relation */
{
if (hash_search(RelfilenumberMapHash,
- (void *) &entry->key,
+ &entry->key,
HASH_REMOVE,
NULL) == NULL)
elog(ERROR, "hash table corrupted");
* since querying invalid values isn't supposed to be a frequent thing,
* but it's basically free.
*/
- entry = hash_search(RelfilenumberMapHash, (void *) &key, HASH_FIND, &found);
+ entry = hash_search(RelfilenumberMapHash, &key, HASH_FIND, &found);
if (found)
return entry->relid;
* caused cache invalidations to be executed which would have deleted a
* new entry if we had entered it above.
*/
- entry = hash_search(RelfilenumberMapHash, (void *) &key, HASH_ENTER, &found);
+ entry = hash_search(RelfilenumberMapHash, &key, HASH_ENTER, &found);
if (found)
elog(ERROR, "corrupted hashtable");
entry->relid = relid;
if (spc->opts)
pfree(spc->opts);
if (hash_search(TableSpaceCacheHash,
- (void *) &spc->oid,
+ &spc->oid,
HASH_REMOVE,
NULL) == NULL)
elog(ERROR, "hash table corrupted");
if (!TableSpaceCacheHash)
InitializeTableSpaceCache();
spc = (TableSpaceCacheEntry *) hash_search(TableSpaceCacheHash,
- (void *) &spcid,
+ &spcid,
HASH_FIND,
NULL);
if (spc)
* flush.
*/
spc = (TableSpaceCacheEntry *) hash_search(TableSpaceCacheHash,
- (void *) &spcid,
+ &spcid,
HASH_ENTER,
NULL);
spc->opts = opts;
/* Try to look up an existing entry */
entry = (TSParserCacheEntry *) hash_search(TSParserCacheHash,
- (void *) &prsId,
+ &prsId,
HASH_FIND, NULL);
if (entry == NULL || !entry->isvalid)
{
/* Now make the cache entry */
entry = (TSParserCacheEntry *)
- hash_search(TSParserCacheHash,
- (void *) &prsId,
- HASH_ENTER, &found);
+ hash_search(TSParserCacheHash, &prsId, HASH_ENTER, &found);
Assert(!found); /* it wasn't there a moment ago */
}
/* Try to look up an existing entry */
entry = (TSDictionaryCacheEntry *) hash_search(TSDictionaryCacheHash,
- (void *) &dictId,
+ &dictId,
HASH_FIND, NULL);
if (entry == NULL || !entry->isvalid)
{
/* Now make the cache entry */
entry = (TSDictionaryCacheEntry *)
hash_search(TSDictionaryCacheHash,
- (void *) &dictId,
+ &dictId,
HASH_ENTER, &found);
Assert(!found); /* it wasn't there a moment ago */
/* Try to look up an existing entry */
entry = (TSConfigCacheEntry *) hash_search(TSConfigCacheHash,
- (void *) &cfgId,
+ &cfgId,
HASH_FIND, NULL);
if (entry == NULL || !entry->isvalid)
{
/* Now make the cache entry */
entry = (TSConfigCacheEntry *)
hash_search(TSConfigCacheHash,
- (void *) &cfgId,
+ &cfgId,
HASH_ENTER, &found);
Assert(!found); /* it wasn't there a moment ago */
}
/* Try to look up an existing entry */
typentry = (TypeCacheEntry *) hash_search(TypeCacheHash,
- (void *) &type_id,
+ &type_id,
HASH_FIND, NULL);
if (typentry == NULL)
{
/* Now make the typcache entry */
typentry = (TypeCacheEntry *) hash_search(TypeCacheHash,
- (void *) &type_id,
+ &type_id,
HASH_ENTER, &found);
Assert(!found); /* it wasn't there a moment ago */
* the allocations succeed before we create the new entry.
*/
recentry = (RecordCacheEntry *) hash_search(RecordCacheHash,
- (void *) &tupDesc,
+ &tupDesc,
HASH_FIND, &found);
if (found && recentry->tupdesc != NULL)
{
/* Fully initialized; create the hash table entry */
recentry = (RecordCacheEntry *) hash_search(RecordCacheHash,
- (void *) &tupDesc,
+ &tupDesc,
HASH_ENTER, NULL);
recentry->tupdesc = entDesc;
key.cmin = cmin;
key.cmax = cmax;
entry = (ComboCidEntry) hash_search(comboHash,
- (void *) &key,
+ &key,
HASH_ENTER,
&found);
plpgsql_HashEnt *hentry;
hentry = (plpgsql_HashEnt *) hash_search(plpgsql_HashTable,
- (void *) func_key,
+ func_key,
HASH_FIND,
NULL);
if (hentry)
bool found;
hentry = (plpgsql_HashEnt *) hash_search(plpgsql_HashTable,
- (void *) func_key,
+ func_key,
HASH_ENTER,
&found);
if (found)
return;
hentry = (plpgsql_HashEnt *) hash_search(plpgsql_HashTable,
- (void *) function->fn_hashkey,
+ function->fn_hashkey,
HASH_REMOVE,
NULL);
if (hentry == NULL)
cast_key.srctypmod = srctypmod;
cast_key.dsttypmod = dsttypmod;
cast_entry = (plpgsql_CastHashEntry *) hash_search(estate->cast_hash,
- (void *) &cast_key,
+ &cast_key,
HASH_ENTER, &found);
if (!found) /* initialize if new entry */
cast_entry->cast_cexpr = NULL;