Mercurial > hg > Applications > Grep
view c/regexParser/bitVector.cc @ 108:70069d4647a0 impl-bitvector
implement malloc error checking
author | Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp> |
---|---|
date | Thu, 19 Nov 2015 17:48:36 +0900 |
parents | d0d2262d4edf |
children | a3adc5c24e19 |
line wrap: on
line source
#include <stdio.h> #include <stdlib.h> #include <string.h> #include "bitVector.h" void bitPrint(BitVectorPtr bi); int bitBlock = sizeof(unsigned long) * 8; BitVectorPtr bitSet(int bitSetPosition) { BitVectorPtr bi = (BitVectorPtr)malloc(sizeof(BitVector)); if (bi == NULL) { fprintf(stderr, "Failed to allocate memory.\n"); exit(-1); } bi->bitContainer = (unsigned long*)malloc(sizeof(unsigned long)*bi->arrayNum); if (bi->bitContainer == NULL) { fprintf(stderr, "Failed to allocate memory.\n"); exit(-1); } bi->arrayNum = (bitSetPosition + 1) / bitBlock; if (((bitSetPosition + 1) % bitBlock) != 0) bi->arrayNum++; for (int i = 0; i < bi->arrayNum; i++) { bi->bitContainer[i] = 0; } unsigned long tmp = 1; int arrayPosition = 0; arrayPosition = bitSetPosition / bitBlock; bitSetPosition = bitSetPosition % bitBlock; tmp = tmp << (bitBlock - 1 - bitSetPosition); bi->bitContainer[arrayPosition] = bi->bitContainer[arrayPosition] | tmp; return bi; } void bitPrint(BitVectorPtr bi) { for (int i = 0; i < bi->arrayNum ; i++) { for (int j = bitBlock - 1; j >= 0; j--) { printf( "%lu", ( bi->bitContainer[i] >> j ) & 1 ); } printf(" "); } puts(""); }