/*
   (c) Copyright 2012-2013  DirectFB integrated media GmbH
   (c) Copyright 2001-2013  The world wide DirectFB Open Source Community (directfb.org)
   (c) Copyright 2000-2004  Convergence (integrated media) GmbH

   All rights reserved.

   Written by Denis Oliver Kropp <dok@directfb.org>,
              Andreas Shimokawa <andi@directfb.org>,
              Marek Pikarski <mass@directfb.org>,
              Sven Neumann <neo@directfb.org>,
              Ville Syrjälä <syrjala@sci.fi> and
              Claudio Ciccani <klan@users.sf.net>.

   This library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Lesser General Public
   License as published by the Free Software Foundation; either
   version 2 of the License, or (at your option) any later version.

   This library 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
   Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public
   License along with this library; if not, write to the
   Free Software Foundation, Inc., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, USA.
*/



#include <config.h>

#include <direct/debug.h>
#include <direct/filesystem.h>
#include <direct/mem.h>
#include <direct/messages.h>
#include <direct/util.h>


/**********************************************************************************************************************/

static const char *strings_base[150];

#define STRINGS_ADD( index, string )                        \
     do {                                                   \
          D_ASSERT( index < D_ARRAY_SIZE(strings_base) );   \
          strings_base[index] = string;                     \
     } while (0)

void
__D_util_init()
{
     STRINGS_ADD( EPERM,              "Operation not permitted" );
     STRINGS_ADD( ENOENT,             "No such file or directory" );
     STRINGS_ADD( ESRCH,              "No such process" );
     STRINGS_ADD( EINTR,              "Interrupted system call" );
     STRINGS_ADD( EIO,                "I/O error" );
     STRINGS_ADD( ENXIO,              "No such device or address" );
     STRINGS_ADD( E2BIG,              "Argument list too long" );
     STRINGS_ADD( ENOEXEC,            "Exec format error" );
     STRINGS_ADD( EBADF,              "Bad file number" );
     STRINGS_ADD( ECHILD,             "No child processes" );
     STRINGS_ADD( EAGAIN,             "Try again" );
     STRINGS_ADD( ENOMEM,             "Out of memory" );
     STRINGS_ADD( EACCES,             "Permission denied" );
     STRINGS_ADD( EFAULT,             "Bad address" );
#ifdef ENOTBLK
     STRINGS_ADD( ENOTBLK,            "Block device required" );
#endif
     STRINGS_ADD( EBUSY,              "Device or resource busy" );
     STRINGS_ADD( EEXIST,             "File exists" );
     STRINGS_ADD( EXDEV,              "Cross-device link" );
     STRINGS_ADD( ENODEV,             "No such device" );
     STRINGS_ADD( ENOTDIR,            "Not a directory" );
     STRINGS_ADD( EISDIR,             "Is a directory" );
     STRINGS_ADD( EINVAL,             "Invalid argument" );
     STRINGS_ADD( ENFILE,             "File table overflow" );
     STRINGS_ADD( EMFILE,             "Too many open files" );
     STRINGS_ADD( ENOTTY,             "Not a typewriter" );
     STRINGS_ADD( ETXTBSY,            "Text file busy" );
     STRINGS_ADD( EFBIG,              "File too large" );
     STRINGS_ADD( ENOSPC,             "No space left on device" );
     STRINGS_ADD( ESPIPE,             "Illegal seek" );
     STRINGS_ADD( EROFS,              "Read-only file system" );
     STRINGS_ADD( EMLINK,             "Too many links" );
     STRINGS_ADD( EPIPE,              "Broken pipe" );
     STRINGS_ADD( EDOM,               "Math argument out of domain of func" );
     STRINGS_ADD( ERANGE,             "Math result not representable" );
     STRINGS_ADD( ETIMEDOUT,          "Timed out" );
}

void
__D_util_deinit()
{
}

/**********************************************************************************************************************/

const char *
direct_strerror( int erno )
{
     if (erno < 0)
          return "negative errno";

     if (erno >= D_ARRAY_SIZE(strings_base))
          return "too high errno";

     return strings_base[erno];
}


/*
 * translates errno to DirectResult
 */
__dfb_no_instrument_function__
DirectResult
errno2result( int erno )
{
     switch (erno) {
          case 0:
               return DR_OK;
          case ENOENT:
               return DR_FILENOTFOUND;
          case EACCES:
          case EPERM:
               return DR_ACCESSDENIED;
          case EBUSY:
          case EAGAIN:
               return DR_BUSY;
          case ETIMEDOUT:
               return DR_TIMEOUT;
          case ECONNREFUSED:
               return DR_ACCESSDENIED;
          case EINTR:
               return DR_SIGNALLED;
          case ENOSYS:
               return DR_NOSUCHMETHOD;
          case EINVAL:
               return DR_INVARG;
          case ENODEV:
          case ENXIO:
#ifdef ENOTSUP
               /* ENOTSUP is not defined on NetBSD */
          case ENOTSUP:
#endif
               return DR_UNSUPPORTED;
     }

     return DR_FAILURE;
}

int
direct_sscanf( const char *str, const char *format, ... )
{
     int     ret;
     va_list args;

     va_start( args, format );
     ret = direct_vsscanf( str, format, args );
     va_end( args );

     return ret;
}

/*
int
direct_vsscanf( const char *str, const char *format, va_list args )
{
     return vsscanf( str, format, args );
}
*/

size_t
direct_strlen( const char *s )
{
     return strlen( s );
}

void
direct_trim( char **s )
{
     int i;
     int len = direct_strlen( *s );

     for (i = len-1; i >= 0; i--)
          if ((*s)[i] <= ' ')
               (*s)[i] = 0;
          else
               break;

     while (**s)
          if (**s <= ' ')
               (*s)++;
          else
               return;
}

int
direct_strcmp( const char *a, const char *b )
{
     return strcmp( a, b );
}

unsigned long
direct_strtoul( const char *nptr, char **endptr, int base )
{
     return strtoul( nptr, endptr, base );
}


static __inline__ char *
__D_strtok_r (char *s, const char *delim, char **save_ptr)
{
  char *token;

  if (s == NULL)
    s = *save_ptr;

  /* Scan leading delimiters.  */
  s += strspn (s, delim);
  if (*s == '\0')
    {
      *save_ptr = s;
      return NULL;
    }

  /* Find the end of the token.  */
  token = s;
  s = strpbrk (token, delim);
  if (s == NULL)
    /* This token finishes the string.  */
    *save_ptr = strchr (token, '\0');
  else
    {
      /* Terminate the token and make *SAVE_PTR point past it.  */
      *s = '\0';
      *save_ptr = s + 1;
    }
  return token;
}

#ifdef __GNUC__
#define __D_string2_1bptr_p(__x) \
  ((size_t)(const void *)((__x) + 1) - (size_t)(const void *)(__x) == 1)

#define __D_strtok_r(s, sep, nextp)                                             \
  (__extension__ (__builtin_constant_p (sep) && __D_string2_1bptr_p (sep)	    \
		  ? (((__const char *) (sep))[0] != '\0'		                        \
		     && ((__const char *) (sep))[1] == '\0'		                        \
		     ? __D_strtok_r_1c (s, ((__const char *) (sep))[0], nextp)          \
		     : __D_strtok_r (s, sep, nextp))			                        \
		  : __D_strtok_r (s, sep, nextp)))
#endif

static __inline__ char *
__D_strtok_r_1c (char *__s, char __sep, char **__nextp)
{
     char *__result;
     if (__s == NULL)
          __s = *__nextp;
     while (*__s == __sep)
          ++__s;
     __result = NULL;
     if (*__s != '\0') {
          __result = __s++;
          while (*__s != '\0')
               if (*__s++ == __sep) {
                    __s[-1] = '\0';
                    break;
               }
          *__nextp = __s;
     }
     return __result;
}

char *
direct_strtok_r( char *str, const char *delim, char **saveptr )
{
     return __D_strtok_r( str, delim, saveptr );
}

char *
direct_snputs( char       *dest,
               const char *src,
               size_t      n )
{
     char *start = dest;

     D_ASSERT( dest != NULL );
     D_ASSERT( src != NULL );

     if (!n)
          return NULL;

     for (; n>1 && *src; n--)
          *dest++ = *src++;

     *dest = 0;

     return start;
}

/*
 * Encode/Decode Base-64.
 */
char*
direct_base64_encode( const void *data, int size )
{
     static const char   *enc = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
                                "abcdefghijklmnopqrstuvwxyz"
                                "0123456789+/=";
     const unsigned char *src = (const unsigned char*)data;
     char                *ret;
     char                *buf;

     D_ASSERT( data != NULL );

     buf = ret = D_MALLOC( (size + 2) / 3 * 4 + 1 );
     if (!ret)
          return NULL;

     for (; size >= 3; size -= 3) {
          buf[0] = enc[((src[0] & 0xfc) >> 2)];
          buf[1] = enc[((src[0] & 0x03) << 4) | ((src[1] & 0xf0) >> 4)];
          buf[2] = enc[((src[1] & 0x0f) << 2) | ((src[2] & 0xc0) >> 6)];
          buf[3] = enc[((src[2] & 0x3f))];
          buf += 4;
          src += 3;
     }

     if (size > 0) {
          buf[0] = enc[(src[0] & 0xfc) >> 2];

          if (size > 1) {
               buf[1] = enc[((src[0] & 0x03) << 4) | ((src[1] & 0xf0) >> 4)];
               buf[2] = enc[((src[1] & 0x0f) << 2)];
          }
          else {
               buf[1] = enc[(src[0] & 0x03) << 4];
               buf[2] = '=';
          }

          buf[3] = '=';
          buf += 4;
     }

     *buf = '\0';

     return ret;
}

void*
direct_base64_decode( const char *string, int *ret_size )
{
     unsigned char  dec[256];
     unsigned char *ret;
     unsigned char *buf;
     int            len;
     int            i, j;

     D_ASSERT( string != NULL );

     len = direct_strlen( string );
     buf = ret = D_MALLOC( len * 3 / 4 + 3 );
     if (!ret)
          return NULL;

     /* generate decode table */
     for (i = 0; i < 255; i++)
          dec[i] = 0x80;
     for (i = 'A'; i <= 'Z'; i++)
          dec[i] = 0  + (i - 'A');
     for (i = 'a'; i <= 'z'; i++)
          dec[i] = 26 + (i - 'a');
     for (i = '0'; i <= '9'; i++)
          dec[i] = 52 + (i - '0');
     dec['+'] = 62;
     dec['/'] = 63;
     dec['='] = 0;

     /* decode */
     for (j = 0; j < len; j += 4) {
          unsigned char a[4], b[4];

          for (i = 0; i < 4; i++) {
               int c = string[i+j];
               a[i] = c;
               b[i] = dec[c];
          }

          *buf++ = (b[0] << 2) | (b[1] >> 4);
          *buf++ = (b[1] << 4) | (b[2] >> 2);
          *buf++ = (b[2] << 6) | (b[3]     );
          if (a[2] == '=' || a[3] == '=')
               break;
     }

     *buf = '\0';

     if (ret_size)
          *ret_size = buf - ret;

     return ret;
}

/*
 * Compute MD5 sum.
 */
static const u8 S[4][4] = {
     { 7, 12, 17, 22},  /* Round 1 */
     { 5,  9, 14, 20},  /* Round 2 */
     { 4, 11, 16, 23},  /* Round 3 */
     { 6, 10, 15, 21}   /* Round 4 */
};

static const u32 T[64] = {
     0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,   /* Round 1 */
     0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
     0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
     0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,

     0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,   /* Round 2 */
     0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
     0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
     0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,

     0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,   /* Round 3 */
     0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
     0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
     0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,

     0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,   /* Round 4 */
     0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
     0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
     0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
};

static void
md5_hash( u32 ABCD[4], u32 X[16] )
{
     u32 a = ABCD[3];
     u32 b = ABCD[2];
     u32 c = ABCD[1];
     u32 d = ABCD[0];
     int   t;
     int   i;

#ifdef WORDS_BIGENDIAN
     for (i = 0; i < 16; i++)
          X[i] = BSWAP32(X[i]);
#endif

     for (i = 0; i < 64; i++) {
          t = S[i>>4][i&3];
          a += T[i];
          switch (i>>4) {
               case 0: a += (d ^ (b&(c^d))) + X[     i &15]; break;
               case 1: a += (c ^ (d&(c^b))) + X[(1+5*i)&15]; break;
               case 2: a += (b^c^d)         + X[(5+3*i)&15]; break;
               case 3: a += (c^(b|~d))      + X[(  7*i)&15]; break;
          }
          a = b + ((a << t) | (a >> (32 - t)));
          t = d; d = c; c = b; b = a; a = t;
     }

     ABCD[0] += d;
     ABCD[1] += c;
     ABCD[2] += b;
     ABCD[3] += a;
}

void
direct_md5_sum( void *dst, const void *src, const int len )
{
     u8    block[64];
     u32 ABCD[4];
     int   i, j;

     D_ASSERT( dst != NULL );
     D_ASSERT( src != NULL );

     ABCD[0] = 0x10325476;
     ABCD[1] = 0x98badcfe;
     ABCD[2] = 0xefcdab89;
     ABCD[3] = 0x67452301;

     for (i = 0, j = 0; i < len; i++) {
          block[j++] = ((const u8*)src)[i];
          if (j == 64) {
               md5_hash( ABCD, (u32*)block );
               j = 0;
          }
     }

     block[j++] = 0x80;
     memset( &block[j], 0, 64-j );

     if (j > 56) {
          md5_hash( ABCD, (u32*)block );
          memset( block, 0, 64 );
     }

     for (i = 0; i < 8; i++)
          block[56+i] = (u8)(((u64)len << 3) >> (i << 3));

     md5_hash( ABCD, (u32*)block );

     for (i = 0; i < 4; i++)
#ifdef WORDS_BIGENDIAN
          ((u32*)dst)[i] = BSWAP32(ABCD[3-i]);
#else
          ((u32*)dst)[i] = ABCD[3-i];
#endif
}



void *
direct_bsearch( const void *key,
                const void *base,
		      size_t      nmemb,
                size_t      size,
                void       *func )
{
#ifdef __KERNEL__
     D_UNIMPLEMENTED();
     return NULL;
#else
     return bsearch( key, base, nmemb, size, func );
#endif
}