else
*idx = (U16) (c % hashListCp->nmbBins);
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashFuncAnyKey */
else
*idx = (U16) (sum % hashListCp->nmbBins);
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashFuncU32Mod () */
else
*idx = (U16) (sum % hashListCp->nmbBins);
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashFuncBCD8 () */
/*
else
*idx = (U16) (sum % hashListCp->nmbBins);
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashFuncString () */
else
*idx = (U16) (sum % hashListCp->nmbBins);
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashFuncDefault */
#if (ERRCLASS & ERRCLS_DEBUG)
/* error check on parameters */
if (hashListCp->binBitMask == CM_HASH_NOBITMASK)
- RETVALUE(RFAILED);
+ return RFAILED;
#endif
prod = CM_HASH_MULT24_CONST * *((U32 *)key);
shift = CM_HASH_MULT24_BITPOS - hashListCp->nmbBinBits;
*idx = ((U16) (prod & (hashListCp->binBitMask << shift))) >> shift;
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashFuncMult24 */
break;
default:
- RETVALUE(RFAILED);
+ return RFAILED;
}
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashFuncConId */
*idx = *((U16 *) key);
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashFuncDirIdx */
\f
/* compare key lengths */
if (keyLen1 != keyLen2)
- RETVALUE(RFAILED);
+ return RFAILED;
/* compare key strings */
- RETVALUE(cmMemcmp(key1, key2, (PTR) keyLen1));
+ return (cmMemcmp(key1, key2, (PTR) keyLen1));
} /* end of cmHashMatchKey */
\f
oldEntry->next = newEntry;
(newEntry->next)->prev = newEntry;
- RETVALUE(ROK);
+ return ROK;
} /* end of cmListInsert */
\f
TRC2(cmListDelete);
if (entry == NULLP)
- RETVALUE(RFAILED);
+ return RFAILED;
if (entry->prev != NULLP)
(entry->prev)->next = entry->next;
if (entry->next != NULLP)
(entry->next)->prev = entry->prev;
- RETVALUE(ROK);
+ return ROK;
} /* end of cmListDelete */
#if (ERRCLASS & ERRCLS_DEBUG)
/* error check on parameters */
if (hashListCp == NULLP)
- RETVALUE(RFAILED);
+ return RFAILED;
#endif
/* initialize control point fields */
case CM_HASH_KEYTYPE_MULT24:
/* return failure if number of bins is not a power of 2 */
if (((nmbBins) & (nmbBins - 1)) != 0)
- RETVALUE (RFAILED);
+ return (RFAILED);
hashListCp->hashFunc = cmHashFuncMult24;
break;
#ifndef CM_MT_HASH_BIN
if (SGetSBuf(region, pool, (Data **) &hashListCp->hl,
(Size) (nmbBins * sizeof(CmListEnt))) != ROK)
- RETVALUE(RFAILED);
+ return RFAILED;
#else
if (SGetSBuf(region, pool, (Data **) &hashListCp->hl,
(Size) (nmbBins * sizeof(CmListBinEnt))) != ROK)
- RETVALUE(RFAILED);
+ return RFAILED;
#endif
/* initialize bin pointers */
}
}
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashListInit */
\f
#if (ERRCLASS & ERRCLS_DEBUG)
/* error check on parameters */
if (hashListCp == NULLP)
- RETVALUE(RFAILED);
+ return RFAILED;
#endif
/* deallocate memory for bins */
hashListCp->keyType = CM_HASH_KEYTYPE_DEF;
hashListCp->hashFunc = NULLP;
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashListDeinit */
\f
/* error check on parameters */
if ((hashListCp == NULLP) || (entry == NULLP) ||
(key == NULLP) || (keyLen == 0))
- RETVALUE(RFAILED);
+ return RFAILED;
#endif
/* check for duplicates */
{
/* no duplicates allowed, check if key already exists */
if (cmHashListFind(hashListCp, key, keyLen, 0, &dupEntry) == ROK)
- RETVALUE(ROKDUP);
+ return (ROKDUP);
}
/* get pointer to hash list entry header */
/* compute index for insertion */
if ((*hashListCp->hashFunc)(hashListCp, key, keyLen, &idx) != ROK)
- RETVALUE(RFAILED);
+ return RFAILED;
hashListEnt->hashVal = idx;
hashListCp->hl[idx].nmbEnt++;
#endif /* #ifndef CM_MT_HASH_BIN */
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashListInsert */
\f
#if (ERRCLASS & ERRCLS_DEBUG)
/* error check on parameters */
if ((hashListCp == NULLP) || (entry == NULLP))
- RETVALUE(RFAILED);
+ return RFAILED;
#endif
/* get pointer to hash list entry header */
/* check if entry is already deleted if yes then return OK */
if((hashListEnt->list.next == NULLP) ||
(hashListEnt->list.prev == NULLP))
- RETVALUE(ROK);
+ return ROK;
#ifdef CM_MT_HASH_BIN
/* compute index for insertion */
if ((*hashListCp->hashFunc)(hashListCp, hashListEnt->key,
hashListEnt->keyLen, &idx) != ROK)
- RETVALUE(RFAILED);
+ return RFAILED;
#endif /* #ifdef CM_MT_HASH_BIN */
/* delete entry from list */
hashListCp->hl[idx].nmbEnt--;
#endif /* #ifndef CM_MT_HASH_BIN */
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashListDelete */
\f
/* error check on parameters */
if ((hashListCp == NULLP) || (key == NULLP) ||
(keyLen == 0) || (entry == NULLP))
- RETVALUE(RFAILED);
+ return RFAILED;
#endif
/* compute hash table index */
if ((*hashListCp->hashFunc)(hashListCp, key, keyLen, &idx) != ROK)
- RETVALUE(RFAILED);
+ return RFAILED;
/* search this bin for exact key match */
hashListBin = &hashListCp->hl[idx];
/* check for duplicates */
if (!hashListCp->dupFlg)
- RETVALUE(ROK);
+ return ROK;
/* for duplicate key, check sequence number */
if (i++ == seqNmb)
- RETVALUE(ROK);
+ return ROK;
}
/* go to next entry */
}
/* no matching key found */
- RETVALUE(RFAILED);
+ return RFAILED;
} /* end of cmHashListFind */
\f
#if (ERRCLASS & ERRCLS_DEBUG)
/* error check on parameters */
if ((hashListCp == NULLP) || (entry == NULLP))
- RETVALUE(RFAILED);
+ return RFAILED;
#endif
/* check if need to get first entry */
/* requested entry is in nxtEnt */
*entry = (PTR) (((U8 *) hashListEnt) - hashListCp->offset);
- RETVALUE(ROK);
+ return ROK;
}
/* no more entries */
- RETVALUE(ROKDNA);
+ return (ROKDNA);
}
/* use previous entry to find next entry */
/* found next entry */
*entry = (PTR) (((U8 *) prevListEnt) - hashListCp->offset);
- RETVALUE(ROK);
+ return ROK;
}
/* no more entries in this bin, go to next bin, check if more bins */
}
/* no more entries */
- RETVALUE(ROKDNA);
+ return (ROKDNA);
} /* end of cmHashListGetNext */
#ifdef CM_MT_HASH_BIN
#if (ERRCLASS & ERRCLS_DEBUG)
/* error check on parameters */
if ((hashListCp == NULLP) || (entry == NULLP))
- RETVALUE(RFAILED);
+ return RFAILED;
#endif
/* check if need to get first entry */
/* requested entry is in nxtEnt */
*entry = (PTR) (((U8 *) hashListEnt) - hashListCp->offset);
- RETVALUE(ROK);
+ return ROK;
}
/* no more entries */
- RETVALUE(ROKDNA);
+ return (ROKDNA);
}
/* use previous entry to find next entry */
/* found next entry */
*entry = (PTR) (((U8 *) prevListEnt) - hashListCp->offset);
- RETVALUE(ROK);
+ return ROK;
}
/* no more entries */
- RETVALUE(ROKDNA);
+ return (ROKDNA);
} /* end of cmHashListBinGetNextEntry */
#endif
#if (ERRCLASS & ERRCLS_DEBUG)
/* error check on parameters */
if (result == NULLP)
- RETVALUE(RFAILED);
+ return RFAILED;
#endif
/* respond depending on query type */
#else
*result = (U16) sizeof(CmListBinEnt);
#endif
- RETVALUE(ROK);
+ return ROK;
}
/* deal with queries that do need hashListCp */
#if (ERRCLASS & ERRCLS_DEBUG)
/* error check on parameters */
if (hashListCp == NULLP)
- RETVALUE(RFAILED);
+ return RFAILED;
#endif
/* respond depending on query type */
*result += hashListCp->hl[i].nmbEnt;
}
#endif
- RETVALUE(ROK);
+ return ROK;
case CM_HASH_QUERYTYPE_BINS: /* number of bins */
*result = (U16) hashListCp->nmbBins;
- RETVALUE(ROK);
+ return ROK;
case CM_HASH_QUERYTYPE_OFFSET: /* offset of CmHashListEnt in entries */
*result = (U16) hashListCp->offset;
- RETVALUE(ROK);
+ return ROK;
case CM_HASH_QUERYTYPE_DUPFLG: /* allow duplicate keys */
*result = (U16) hashListCp->dupFlg;
- RETVALUE(ROK);
+ return ROK;
case CM_HASH_QUERYTYPE_KEYTYPE: /* key type for selecting hash functions */
*result = (U16) hashListCp->keyType;
- RETVALUE(ROK);
+ return ROK;
default: /* process other query types */
break;
}
/* illegal query type */
- RETVALUE(RFAILED);
+ return RFAILED;
} /* end of cmHashListQuery */
#ifdef HASH_OPEN_ADDRESSING
/* error check on parameters */
if ((hashListCp == NULLP) || (entry == NULLP) ||
(key == NULLP) || (keyLen == 0))
- RETVALUE(RFAILED);
+ return RFAILED;
#endif
#ifndef CM_MT_HASH_BIN
#endif
/* check if table is full */
if (hashListCp->nmbBins == nmbEnt)
- RETVALUE(ROUTRES);
+ return (ROUTRES);
/* get pointer to hash list entry header */
hashListEnt = (CmHashListEnt *) (((U8 *) entry) + hashListCp->offset);
/* compute index for insertion */
if ((*hashListCp->hashFunc)(hashListCp, key, keyLen, &idx) != ROK)
- RETVALUE(RFAILED);
+ return RFAILED;
/*
* find an empty bin
/* insert into list */
if (cmListInsert(hashBin->prev, &hashListEnt->list) != ROK)
- RETVALUE(RFAILED);
+ return RFAILED;
hashListEnt->hashVal = idx;
hashBin->nmbEnt++;
#endif
- RETVALUE(ROK);
+ return ROK;
} /* end of cmHashListOAInsert */