Существуют ли методы побитового сравнения строк?

inline unsigned int rev_int(unsigned  int a ) {
/// switching bytes to right order.
    int b=a;
    unsigned char * pb =(unsigned char * ) &b;
    unsigned char tmp;
    tmp = pb[0];
    pb[0]= pb[3];
    pb[3]=tmp;
    tmp = pb[1];
    pb[1]=pb[2];
    pb[2]=tmp;
    return b;
};
 
 
bool bitcmp2(void * source,void * entry,int start_bit,int entry_len) {
    unsigned int * s = (unsigned int *)source;
    unsigned int * e = (unsigned int *)entry; // int pointers. Best and fastest for 32bit architecture.
 
    unsigned int wlen; // whole length mesured in dwords(for32bit)
    unsigned int plen; // particial length in dwords.
 
    unsigned int wstart;// whole shift from start of source in dwords
    unsigned int pstart;// particial shift from start of source in dwords
 
    unsigned int start_mask;//masks to realize it all
    unsigned int end_mask;
 
    unsigned int tmp; // whole dword will be extracted here from the source.
    unsigned int tmp2;
/*
     
  */
    wlen=entry_len/(sizeof(int)*8 );// 
    plen=entry_len%(sizeof(int)*8 );// simple maths
 
    wstart= start_bit/(sizeof(int)*8);
    pstart= start_bit%(sizeof(int)*8);// as well as here
    
    start_mask = (-1); // -1 = 0xFF.....F in bin. representation 
    start_mask>>=pstart;// first (pstart) bits of source do not matter.
//    rev_int(start_mask);
    end_mask = (-1); //same as here
    end_mask<<= ( (sizeof(int)*8 - plen ) );//the last bits of entry do not matter
    for(int i=0;i<wlen;i++) {// comparing full dwords
        /// first,extracting the start of next dword.
        /// then, reverse it( to make bytes be in natural order,intel reverses words &dwords in memory)
        /// after thet,apply the mask to get bits required
        // and split it using OR.
        // compare with reversed memory dword and return 0,if they aint equal
        tmp = (rev_int(s[wstart+i]) & start_mask) << pstart;
        tmp|= (rev_int(s[wstart+i+1] ) &(~start_mask) ) >> (sizeof(int)*8 - pstart);
        if(tmp!= rev_int(e[i]) ) return 0;    
 
    };
    //the difference between
    //cycle comparing
    //and this one is the end mask
    // we dont need end mask in cycle
    //but here we must skip last bits of input/output,cause they dont matter.
    //if we dont skip,we might get  a wrong answer.
    tmp = (rev_int(s[wstart+wlen]) & start_mask) << pstart;
    tmp|= (rev_int(s[wstart+wlen+1] ) &(~start_mask) ) >> (sizeof(int)*8 - pstart);
    if((tmp & end_mask )!= (rev_int( e[wlen])&end_mask ) ) return 0;
 
 
    return 1;
};

int main() {
     char * buffer ="\366\355\152\222\256\243";
     // buffer = 1111011 (here!)>01110110 10110101 01001001 01010111 01010...
     // entry =  01110110 10110101 01001001 01010111 0101
     char * entry = "\166\265\111\127\120";
    entry[1];
    for(int i=0;i<90;i++) {
        printf("%d ", bitcmp2(buffer,entry,i,36) );
 
    };
    getch();
};