News. - What is DAR? - The bindings. - API Documentation. - Related works. - Project site. - What is the logo? - Public key.

           

---

translations.cpp

Go to the documentation of this file.

/*
 * translations.cpp
 * Created on 25 Feb 2005
 * Authors:
 *    Wesley Leggette <wleggette@kaylix.net>
 * 
 * 
 * 
 * libdarc
 * 
 * 
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 * 
 * $Id: translations_8cpp-source.html 708 2005-03-21 12:30:37Z leggwes $
 */

#ifdef LIBDARC_DEBUG
# define TRANSLATIONS_H_INTERNAL
#endif

#include "translations.h"
#undef TRANSLATIONS_H_INTERNAL
#include "user_interaction_specific.hpp"
#if LIBDARC_HAVE_LIBDAR_HPP
#include <dar/libdar.hpp>
#endif

#if HAVE_LIMITS_H
#include <limits.h>
#endif

#ifdef LIBDARC_DEBUG
char break_buffer[30];
#endif

NAMESPACE_LIBDAR_START


// Wraps char array as a generic_file. Used to read and write binary data
// from infinint objects.
class byte_stream : public generic_file
{
public:
    const static size_t ALLOCATE_SIZE = 16;
    
    
    byte_stream(user_interaction & dialog, char* source)
    : generic_file( dialog, gf_read_only )
    {
        buffer = source;
        position = 0;
        buf_size = 0;
    }
    
    byte_stream(user_interaction & dialog)
    : generic_file( dialog, gf_write_only )
    {
        position = length = 0;
        buf_size = ALLOCATE_SIZE;
        buffer = (char*)malloc(ALLOCATE_SIZE);
        if (buffer == NULL)
            throw Ememory("could not allocate string buffer");
    }
    
    ~byte_stream()
    {
        if (buf_size != 0)
            free(buffer);
    }
    
    char* get_string(U_I* store_size)
    {
        if (store_size != NULL)
            *store_size = length;
        char* ret = (char*)malloc(length);
        if (ret == NULL)
            return NULL;  // or out of memory
        memcpy(ret, buffer, length);
        //int i;
        //for (i = 0; i < length; i++)
        //  printf("ret[%X] = %X\n", ret + i, *(ret + i));
        return ret;
    }
    
    bool skip(const infinint & pos)
    {
        int tmp = 0;
        infinint t(pos);
        t.unstack(tmp);
        //printf("byte_stream::skip called, skipping %d\n", tmp);
        position += tmp;
        return true;
    }
    
    bool skip_to_eof()
    {
        //printf("byte_stream::skip_to_eof called, skipping to %X\n", buffer + position);
        position = length;
        return true;
    }
    
    bool skip_relative(S_I x)
    {
        //printf("byte_stream::skip_relative called, skipping %d\n", x);
        if (x > 0)
            position += x;
        else
            position -= (unsigned int)(-1 * x);
        return true;
    }
    
    infinint get_position()
    {
        return position;
    }
    
    S_I inherited_read(char* a, size_t size)
    {
        //printf("byte_stream::inherited_read: size = %d\n", size);
        size_t i = 0;
        //for (; i < size; i++)
        //  printf("byte_stream::inherited_read: buf = %X\n", *(buffer + position + i));
        //strncpy(a, (buffer + position), size);
        for(i = 0; i < size; i++)
            *(a+i) = *(buffer + position + i);
        //for (i = 0; i < size; i++)
        //  printf("byte_stream::inherited_read: a = %X\n", *(a + i));
        //printf("byte_stream::inherited_read: check 1\n");
        position += size;
        //printf("byte_stream::inherited_read: check 2\n");
        return (S_I)size;
    }
    

    
    S_I inherited_write(char* a, size_t size)
    {
        //printf("byte_stream::inherited_write: size = %d\n", size);
        //size_t i = 0;
        //for ( i = 0; i < size; i++ )
        //  printf("byte_stream::inherited_write: *a = %X\n", *(a+i));
        //printf("begin position = %X\n", buffer + position);
        //printf("begin length = %d\n", length);
        //for (i = 0; i < buf_size; i++)
        //  printf("begin *buffer[%X] = %X\n", buffer + i, 
        //                           *(buffer + i));
        if (size > buf_size - position)
        {
            //printf("byte_stream::inherited_write: check 1\n");
            buffer = (char*)realloc(buffer, buf_size + size + ALLOCATE_SIZE);
            //printf("byte_stream::inherited_write: check 2\n");
            if (buffer == NULL)
                throw Ememory("could not reallocate string buffer");
            //printf("byte_stream::inherited_write: check 3\n");
            buf_size += size + ALLOCATE_SIZE;
            //printf("byte_stream::inherited_write: check 4\n");
            //printf("byte_stream::inherited_write: check 5\n");
            memcpy((buffer+position), a, size);
            position += size;
            length += size;
            //printf("byte_stream::inherited_write: check 6\n");
        } else {
            //printf("byte_stream::inherited_write: check a\n");
            //printf("byte_stream::inherited_write: check b\n");
            memcpy((buffer+position), a, size);
            position += size;
            length += size;
            //printf("byte_stream::inherited_write: check c\n");
        }
        //printf("end position = %X\n", buffer + position);
        //printf("end length = %d\n", length);
        //printf("end buffer = %x\n", buffer);
        //for (i = 0; i < buf_size; i++)
        //  printf("end *buffer[%X] = %X\n", buffer + i, 
        //                           *(buffer + i));
        
        return size;
    }
            
        
private:
    size_t buf_size;
    size_t length;
    size_t position;
    char* buffer;
};

// convert decimal string to hex string
//char* dtoh( char* deci )
//{
    
    


extern "C" void dar_infinint_destroy(dar_infinint* ref)
{
    infinint* tmp = reinterpret_cast<infinint*>( ref );
    delete tmp;
    return;
}

extern "C" dar_infinint *dar_infinint_copy(dar_infinint* ref)
{
    infinint* tmp = reinterpret_cast<infinint*>(ref);
    infinint* ret = new infinint( *tmp );
    return (dar_infinint*)ret;
}


extern "C" void dar_infinint_add( dar_infinint** a, dar_infinint* b )
{
    infinint* ar = reinterpret_cast<infinint*>(*a);
    infinint* br = reinterpret_cast<infinint*>( b);
    *ar += *br;
    //*a = (dar_infinint*)ar;
}

extern "C" void dar_infinint_sub( dar_infinint** a, dar_infinint* b )
{
    infinint* ar = (infinint*)*a;
    infinint* br = (infinint*)b;
    *ar -= *br;
    //*a = (dar_infinint*)ar;
}

extern "C" void dar_infinint_mult( dar_infinint** a, dar_infinint* b )
{
    infinint* ar = (infinint*)*a;
    infinint* br = (infinint*)b;
    *ar *= *br;
    //*a = (dar_infinint*)ar;
}

extern "C" void dar_infinint_div( dar_infinint** a, dar_infinint* b )
{
    infinint* ar = (infinint*)*a;
    infinint* br = (infinint*)b;
    *ar /= *br;
    //*a = (dar_infinint*)ar;
}

extern "C" void dar_infinint_pow( dar_infinint** a, dar_infinint* b )
{
    infinint* ar = (infinint*)*a;
    infinint* br = (infinint*)b;
    *ar = ar->power(*br);
    //*a = (dar_infinint*)ar;
}

extern "C" void dar_infinint_powi( dar_infinint** a, int exp )
{
    infinint* ar = (infinint*)*a;
    *ar = ar->power(exp);
    //*a = (dar_infinint*)ar;
}

extern "C" void dar_infinint_shiftl( dar_infinint** a, dar_infinint* b )
{
    infinint* ar = (infinint*)*a;
        //int i = 0;
        //infinint tmp(*ar);
        //tmp.unstack(i);
        //printf("ar = %d\n", i);
    infinint* br = (infinint*)b;
        //i = 0;
        //tmp = *br;
        //tmp.unstack(i);
        //printf("br = %d\n", i);
    *ar <<= *br;
        //i = 0;
        //tmp = *ar;
        //tmp.unstack(i);
        //printf("final ar = %d\n", i);
    //*a = (dar_infinint*)ar;   
}

extern "C" void dar_infinint_shiftli( dar_infinint** a, int bit )
{
    infinint* ar = (infinint*)*a;
        //int i = 0;
        //infinint tmp(*ar);
        //tmp.unstack(i);
        //printf("ar = %d\n", i);
    *ar <<= bit;
        //i = 0;
        //tmp = *ar;
        //tmp.unstack(i);
        //printf("final ar = %d\n", i);
    //*a = (dar_infinint*)ar;
}

extern "C" void dar_infinint_shiftr( dar_infinint** a, dar_infinint* b )
{
    infinint* ar = (infinint*)*a;
    infinint* br = (infinint*)b;
    *ar >>= *br;
    //*a = (dar_infinint*)ar;   
}

extern "C" void dar_infinint_shiftri( dar_infinint** a, int bit )
{
    infinint* ar = (infinint*)*a;
    *ar >>= bit;
    //*a = (dar_infinint*)ar;
}

extern "C" void dar_infinint_mod( dar_infinint** a, dar_infinint* b )
{
    infinint* ar = reinterpret_cast<infinint*>(*a);
    infinint* br = reinterpret_cast<infinint*>( b);
    *ar %= *br;
    //*a = (dar_infinint*)ar;
}

extern "C" void dar_infinint_increment( dar_infinint** a )
{
    infinint* ar = (infinint*)*a;
        //int i = 0;
        //infinint tmp(*ar);
        //tmp.unstack(i);
        //printf("ar = %d\n", i);
    (*ar)++;
        //i = 0;
        //tmp = *ar;
        //tmp.unstack(i);
        //printf("final ar = %d\n", i);
    //*a = (dar_infinint*)ar;
}

extern "C" void dar_infinint_decrement( dar_infinint** a )
{
    infinint* ar = (infinint*)*a;
    (*ar)--;
    //*a = (dar_infinint*)ar;
}

extern "C" void dar_infinint_euclide( dar_infinint* a, dar_infinint* b,
                     dar_infinint** q, dar_infinint** r )
{
    infinint* ar = (infinint*)a;
    infinint* br = (infinint*)b;
    infinint* qr = (infinint*)*q;
    infinint* rr = (infinint*)*r;
    *qr = *ar / *br;
    *rr = *ar % *br;
}
                     

extern "C" bool dar_infinint_comp_eq( dar_infinint* a, dar_infinint* b )
{
    infinint* ar = (infinint*)a;
    infinint* br = (infinint*)b;
    return *ar == *br;
}

extern "C" bool dar_infinint_comp_leq( dar_infinint* a, dar_infinint* b )
{
    infinint* ar = (infinint*)a;
    infinint* br = (infinint*)b;
    return *ar <= *br;
}

extern "C" bool dar_infinint_comp_l( dar_infinint* a, dar_infinint* b )
{
    infinint* ar = (infinint*)a;
    infinint* br = (infinint*)b;
    return *ar < *br;
}

extern "C" bool dar_infinint_comp_geq( dar_infinint* a, dar_infinint* b )
{
    infinint* ar = (infinint*)a;
    infinint* br = (infinint*)b;
    return *ar >= *br;
}

extern "C" bool dar_infinint_comp_g( dar_infinint* a, dar_infinint* b )
{
    infinint* ar = (infinint*)a;
    infinint* br = (infinint*)b;
    return *ar > *br;
}

extern "C" bool dar_infinint_comp_neq( dar_infinint* a, dar_infinint* b )
{
    infinint* ar = (infinint*)a;
    infinint* br = (infinint*)b;
    return *ar != *br;
}



extern "C" dar_infinint *dar_infpi(int num)
{
    infinint* ret = new infinint(num);
    return (dar_infinint*)ret;
}

#if LIBDARC_OS_BITS == 64
    extern "C" dar_infinint *dar_infi(U_64 num)
    {
        infinint* ret = new infinint(num);
        return (dar_infinint*)ret;
    }
    
#else
    extern "C" dar_infinint *dar_infi(U_32 num)
    {
        infinint* ret = new infinint(num);
        return (dar_infinint*)ret;
    }
    
#endif

extern "C" dar_infinint *dar_infu32(U_32 num)
{
    infinint* ret = new infinint(num);
    return (dar_infinint*)ret;
}

extern "C" dar_infinint *dar_infu64(U_64 num)
{
    infinint* ret = new infinint(num);
    return (dar_infinint*)ret;
}


extern "C" dar_infinint *dar_infds(char* num)
{
    try {
        std::string str(num);
        deci d(str);
        infinint* ret = new infinint();
        *ret = d.computer();
        return (dar_infinint*)ret;
    } catch (...)
    {
        return NULL;
    }
}

extern "C" dar_infinint *dar_infhs(char* num)
{
    // TODO: This function is not implemented.
    infinint* ret = new infinint();
    return (dar_infinint*)ret;
}

extern "C" dar_infinint *dar_infbin(U_8* num)
{
    user_interaction_null* ut = new user_interaction_null();
    byte_stream stream( *ut, (char*)num );
    infinint* ret = new infinint();
    try 
    {
        ret->read( stream );
    } catch (...) {
        delete ut;
        delete ret;
        return NULL;
    }
//  int tmp = 0;
//  infinint t(*ret);
//  t.unstack(tmp);
//  printf("final infinint = %d\n", tmp);
    delete ut;
    return (dar_infinint*)ret;
}


extern "C" int dar_piinf (bool* overflow, dar_infinint* box)
{
    infinint* rb = (infinint*)box;
    infinint tmp(*rb);
    int ret = 0;
    if (overflow != NULL)
    {
        if ( tmp >= UINT_MAX )
            *overflow = true;
        else
            *overflow = false;
    }
    tmp.unstack(ret);
    return ret;
}


#if LIBDARC_OS_BITS == 64
    extern "C" U_64 dar_iinf (bool* overflow, dar_infinint* box)
    {
        infinint* rb = (infinint*)box;
        infinint tmp(*rb);
        U_64 ret = 0;
        if (overflow != NULL)
        {
            if ( tmp >= U_64_MAX )
                *overflow = true;
            else
                *overflow = false;
        }
        tmp.unstack(ret);
        return ret;
    }
    
#else
    extern "C" U_32 dar_iinf (bool* overflow, dar_infinint* box)
    {
        infinint* rb = (infinint*)box;
        infinint tmp(*rb);
        U_32 ret = 0;
        if (overflow != NULL)
        {
            if ( tmp >= U_32_MAX )
                *overflow = true;
            else
                *overflow = false;
        }
        tmp.unstack(ret);
        return ret;
    }
    
#endif

extern "C" U_32 dar_u32inf (bool* overflow, dar_infinint* box)
{
    infinint* rb = (infinint*)box;
    infinint tmp(*rb);
    U_32 ret = 0;
    if (overflow != NULL)
    {
        if ( tmp >= U_32_MAX )
            *overflow = true;
        else
            *overflow = false;
    }
    tmp.unstack(ret);
    return ret;
}

extern "C" U_64 dar_u64inf (bool* overflow, dar_infinint* box)
{
    infinint* rb = (infinint*)box;
    infinint tmp(*rb);
    U_64 ret = 0;
    if (overflow != NULL)
    {
        if ( tmp >= U_64_MAX )
            *overflow = true;
        else
            *overflow = false;
    }
    tmp.unstack(ret);
    return ret;
}

extern "C" char* dar_dsinf (U_I* length, dar_infinint* box)
{
    infinint* tmp = (infinint*)box;
    deci d(*tmp);
    std::string str(d.human());
    char* ret = (char*)malloc(str.length() + 1);
    if (ret == NULL) { return NULL; }
    strcpy(ret, str.c_str());
    if (length != NULL)
        *length = strlen(str.c_str());
    return ret;
}

extern "C" char* dar_hsinf (U_I* length, dar_infinint* box)
{
    // TODO: This function is not implemented.
    char* ret = (char*)malloc(5);
    if (ret == NULL) { return NULL; }
    if (length != NULL)
        *length = 0;
    return ret;
}

extern "C" U_8* dar_bininf (U_I* length, dar_infinint* box)
{
    user_interaction_null* ut = new user_interaction_null();
    infinint* b = reinterpret_cast<infinint*>(box);
    byte_stream stream( *ut );
    try {
        b->dump( stream );
    } catch ( Egeneric & e ) {
        //printf("error = %s", e.get_message().c_str() );
        return NULL;
    }
    delete ut;
    return (U_8*)stream.get_string(length);
}




NAMESPACE_LIBDAR_END

---

API Copyright © 2005, Wesley Leggette - See Sourceforge project page for contact details.
Documents generated on Mon Mar 21 13:26:16 2005 by doxygen 1.2.18