Function bm_insertNode

bitmap/bitmain.cpp:385–401

  return (hval % (MAX_BITMAPS / 2));
}
bm_Node *bm_insertNode(bm_T data) {
  bm_Node *p, *p0;
  bm_hashTableIndex bucket;
  /************************************************
   *  allocate bm_Node for data and insert in table  *
   ************************************************/
  /* insert bm_Node at beginning of list */
  bucket = bm_hash(data);
  if ((p = (bm_Node *)mem_malloc(sizeof(bm_Node))) == 0) {
    exit(1);
  }
  p0 = bm_hashTable[bucket];
  bm_hashTable[bucket] = p;
  p->next = p0;
  p->data = data;
  return p;
}
void bm_deleteNode(bm_T data) {
  bm_Node *p0, *p;
  bm_hashTableIndex bucket;