/*
 * uty.c
 *
 * All rights reserved. Copyright (C) 1996-1999 by NARITA Tomio.
 * $Id: uty.c,v 1.4 1999/06/06 14:11:05 nrt Exp $
 */
/*
 * 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
 */

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

#ifdef UNIX
#include <unistd.h>
#endif /* UNIX */

#ifdef MSDOS
#include <dos.h>
#endif /* MSDOS */

#include <import.h>
#include <itable.h>
#include <begin.h>
#include <uty.h>

public ic_t BinarySearch( codes_t *array, int high, ic_t code )
{
  int low, mid;

  low = 0;
  mid = high >> 1;

  for( ; low <= high ; mid = ( low + high ) >> 1 ){
    if( array[ mid ].code == code ){
      return array[ mid ].peer;
    } else if( array[ mid ].code > code ){
      high = mid - 1;
    } else {
      low = mid + 1;
    }
  }

  return 0;
}

public ic_t BinarySearchCset( codes_cset_t *array, int high, ic_t code,
			     byte *cset )
{
  int low, mid;

  low = 0;
  mid = high >> 1;

  for( ; low <= high ; mid = ( low + high ) >> 1 ){
    if( array[ mid ].code == code ){
      *cset = array[ mid ].cset;
      return array[ mid ].peer;
    } else if( array[ mid ].code > code ){
      high = mid - 1;
    } else {
      low = mid + 1;
    }
  }

  return 0;
}

public void NotEnoughMemory()
{
  fprintf( stderr, "lv: not enough memory\n" ), exit( -1 );
}

public void FatalErrorOccurred()
{
  fprintf( stderr, "lv: fatal error occurred\n" ), exit( -1 );
}

public void *Malloc( unsigned int size )
{
  void *ptr;

  if( NULL == (ptr = malloc( size )) )
    NotEnoughMemory();

  return ptr;
}

#define TOKEN_LENGTH	32

public byte *TokenAlloc( byte *s )
{
  int i, j;
  byte *token;
  boolean_t flagQuotation;
  byte quotationChar = NULL;

  if( '\'' == *s || '"' == *s ){
    flagQuotation = TRUE;
    quotationChar = *s;
    s++;
  } else
    flagQuotation = FALSE;

  for( i = 0 ; i < TOKEN_LENGTH ; i++ ){
    if( NULL == s[ i ] )
      break;
    if( FALSE == flagQuotation  ){
      if( ' ' == s[ i ] || 0x09 == s[ i ] )
	break;
    } else {
      if( quotationChar == s[ i ] )
	break;
    }
  }
  if( i == TOKEN_LENGTH )
    return "";

  token = (byte *)Malloc( i + 1 );
  for( j = 0 ; j < i ; j++ )
    token[ j ] = s[ j ];
  token[ j ] = NULL;

  return token;
}

#ifdef MSDOS
public void far *FarMalloc( unsigned int size )
{
  union REGS regs;

  regs.h.ah = 0x48;
  if( size & 0x000f )
    regs.x.bx = 1 + ( size >> 4 );
  else
    regs.x.bx = size >> 4;

  intdos( &regs, &regs );

  if( 0x0001 & regs.x.flags ){
    if( 0x08 == regs.x.ax )
      /*NotEnoughMemory();*/
      return NULL;
    else
      FatalErrorOccurred();
  }

  return MK_FP( regs.x.ax, 0 );
}

public void FarFree( void far *ptr )
{
  union REGS regs;

  regs.h.ah = 0x49;
  regs.x.es = FP_SEG( ptr );

  intdosy( &regs, &regs );

  if( 0x0001 & regs.x.flags )
    FatalErrorOccurred();
}
#endif /* MSDOS */

public boolean_t IsAtty( int fd )
{
#ifdef MSDOS
  union REGS regs;

  regs.x.ax = 0x4400;
  regs.x.bx = fd;
  intdos( &regs, &regs );

  if( 0x0001 & regs.x.flags ){
    /*
     * carry flag was set
     */
    if( 0x0006 == regs.x.ax )
      fprintf( stderr, "lv: file descripter %d is not opend\n" );
    else
      fprintf( stderr, "lv: device io control for fd:%d failed\n", fd );
    exit( -1 );
  } else if( 0x8000 == ( 0x8000 & regs.x.dx ) ){
    /*
     * character device
     */
    if( 0x0003 == ( 0x0003 & regs.x.dx ) )
      /*
       * stdin and stdout
       */
      return TRUE;
    else
      return FALSE;
  } else {
    /*
     * block device
     */
    return FALSE;
  }
#else
  if( isatty( fd ) )
    return TRUE;
  else
    return FALSE;
#endif /* MSDOS */
}

public byte *Exts( byte *s )
{
  int i;

  for( i = strlen( s ) - 1 ; i >= 0 ; i-- ){
    if( '.' == s[ i ] )
      return &s[ i + 1 ];
    else if( '/' == s[ i ] || '\\' == s[ i ] )
      return NULL;
  }

  return NULL;
}
