*/
Love this site? Hate it? Leave us some comments.
*/

View \main.c

Fast 32-bit and 16-bit Roll And Shift Functions - Keil Shell V1.0

Submitted By: Graham Cole
Rating: starstarstarstarstar (Rate It)


#include "long rolls and shifts.h"
#include "int rolls and shifts.h"
#include "intrins.h"

unsigned long int old_long_roll_left( unsigned long int l, unsigned char c )
{
    return( _lrol_( l, c ) );
}

unsigned long int old_long_roll_right( unsigned long int l, unsigned char c )
{
    return( _lror_( l, c ) );
}

unsigned long int old_long_nibble_roll_left( unsigned long int l )
{
    return( _lrol_( l, 4 ) );
}

unsigned long int old_long_nibble_roll_right( unsigned long int l )
{
    return( _lror_( l, 4 ) );
}

unsigned long int old_long_shift_left( unsigned long int l, unsigned char c )
{
    return( l << c );
}

unsigned long int old_long_shift_right( unsigned long int l, unsigned char c )
{
    return( l >> c );
}

unsigned long int new_long_roll_left( unsigned long int l, unsigned char c )
{
    return( fast_long_roll( l, c ) );
}

unsigned long int new_long_roll_right( unsigned long int l, unsigned char c )
{
    return( fast_long_roll( l, -c ) );
}

unsigned long int new_long_nibble_roll_left( unsigned long int l )
{
    return( fast_long_nibble_roll_left( l ) );
}

unsigned long int new_long_nibble_roll_right( unsigned long int l )
{
    return( fast_long_nibble_roll_right( l ) );
}

unsigned long int new_long_shift_left( unsigned long int l, unsigned char c )
{
    return( fast_long_shift_left( l, c ) );
}

unsigned long int new_long_shift_right( unsigned long int l, unsigned char c )
{
    return( fast_long_shift_right( l, c ) );
}

unsigned int old_int_roll_left( unsigned int i, unsigned char c )
{
    return( _irol_( i, c ) );
}

unsigned int old_int_roll_right( unsigned int i, unsigned char c )
{
    return( _iror_( i, c ) );
}

unsigned int old_int_shift_left( unsigned int i, unsigned char c )
{
    return( i << c );
}

unsigned int old_int_shift_right( unsigned int i, unsigned char c )
{
    return( i >> c );
}

unsigned int new_int_roll_left( unsigned int i, unsigned char c )
{
    return( fast_int_roll( i, c ) );
}

unsigned int new_int_roll_right( unsigned int i, unsigned char c )
{
    return( fast_int_roll( i, -c ) );
}

unsigned int new_int_shift_left( unsigned int i, unsigned char c )
{
    return( fast_int_shift_left( i, c ) );
}

unsigned int new_int_shift_right( unsigned int i, unsigned char c )
{
    return( fast_int_shift_right( i, c ) );
}

unsigned int new_int_nibble_roll_left( unsigned int i )
{
    return( fast_int_nibble_roll_left( i ) );
}

unsigned int new_int_nibble_roll_right( unsigned int i )
{
    return( fast_int_nibble_roll_right( i ) );
}

unsigned int old_int_nibble_roll_left( unsigned int i )
{
    return( _irol_( i, 4 ) );
}

unsigned int old_int_nibble_roll_right( unsigned int i )
{
    return( _iror_( i, 4 ) );
}

void main( void )
{
    unsigned long int   l;
    unsigned int        i;
    unsigned char       t;
    unsigned char       loop;
    unsigned char       passed;

    loop = 255;

    l = 0x12345678L;

    i = 0x1234;

    passed = 1;

    do
    {
        t = 0x20;

        do
        {
            passed = passed && ( new_long_roll_left( l, t ) == old_long_roll_left( l, t ) );
            passed = passed && ( new_long_roll_right( l, t ) == old_long_roll_right( l, t ) );
            passed = passed && ( new_long_shift_left( l, t ) == old_long_shift_left( l, t ) );
            passed = passed && ( new_long_shift_right( l, t ) == old_long_shift_right( l, t ) );

        }while( --t != 0 );

        t = 0x20;

        do
        {
            passed = passed && ( new_int_roll_left( i, t ) == old_int_roll_left( i, t ) );
            passed = passed && ( new_int_roll_right( i, t ) == old_int_roll_right( i, t ) );
            passed = passed && ( new_int_shift_left( i, t ) == old_int_shift_left( i, t ) );
            passed = passed && ( new_int_shift_right( i, t ) == old_int_shift_right( i, t ) );

            passed = passed && ( new_int_roll_left( i, t ) == old_int_roll_left( i, t ) );
            passed = passed && ( new_int_roll_right( i, t ) == old_int_roll_right( i, t ) );
            passed = passed && ( new_int_shift_left( i, t ) == old_int_shift_left( i, t ) );
            passed = passed && ( new_int_shift_right( i, t ) == old_int_shift_right( i, t ) );

        }while( --t != 0 );

        t = 0xA0;

        do
        {
            passed = passed && ( new_long_nibble_roll_left( l ) == old_long_nibble_roll_left( l ) );
            passed = passed && ( new_long_nibble_roll_right( l ) == old_long_nibble_roll_right( l ) );

        }while( --t != 0 );

        t = 0xA0;

        do
        {
            passed = passed && ( new_int_nibble_roll_left( i ) == old_int_nibble_roll_left( i ) );
            passed = passed && ( new_int_nibble_roll_right( i ) == old_int_nibble_roll_right( i ) );

        }while( --t != 0 );

    }while( --loop != 0 );

    do{}while(1);
}

corner
© 1996-2008 CommunityHeaven LLC. All rights reserved. Reproduction in whole or in part, in any form or medium without express written permission is prohibited.
Violators of this policy may be subject to legal action. Please read our Terms Of Use and Privacy Statement for more information.
North American business development: Nicolai Wadstrom. Publisher: Lars Hagelin.