Gecko [ www.foryou-vip.com ]

Name	Size	Permission	Date
.libs	[ DIR ]	drwxr-xr-x	2024-03-12 14:24
add.c	2.5 KB	-rw-rw-r--	2022-10-31 11:36
add.lo	325 B	-rw-r--r--	2024-03-12 14:24
add.o	71.13 KB	-rw-r--r--	2024-03-12 14:24
bcmath.h	4.63 KB	-rw-rw-r--	2022-10-31 11:36
compare.c	3.75 KB	-rw-rw-r--	2022-10-31 11:36
compare.lo	337 B	-rw-r--r--	2024-03-12 14:24
compare.o	70.95 KB	-rw-r--r--	2024-03-12 14:24
config.h	175 B	-rw-rw-r--	2022-10-31 11:36
debug.c	1.78 KB	-rw-rw-r--	2022-10-31 11:36
debug.lo	331 B	-rw-r--r--	2024-03-12 14:24
debug.o	71.29 KB	-rw-r--r--	2024-03-12 14:24
div.c	6.8 KB	-rw-rw-r--	2022-10-31 11:36
div.lo	325 B	-rw-r--r--	2024-03-12 14:24
div.o	79.02 KB	-rw-r--r--	2024-03-12 14:24
divmod.c	2.38 KB	-rw-rw-r--	2022-10-31 11:36
divmod.lo	334 B	-rw-r--r--	2024-03-12 14:24
divmod.o	72.11 KB	-rw-r--r--	2024-03-12 14:24
doaddsub.c	5.75 KB	-rw-rw-r--	2022-10-31 11:36
doaddsub.lo	340 B	-rw-r--r--	2024-03-12 14:24
doaddsub.o	75.63 KB	-rw-r--r--	2024-03-12 14:24
init.c	3.06 KB	-rw-rw-r--	2022-10-31 11:36
init.lo	328 B	-rw-r--r--	2024-03-12 14:24
init.o	73.13 KB	-rw-r--r--	2024-03-12 14:24
int2num.c	2.05 KB	-rw-rw-r--	2022-10-31 11:36
int2num.lo	337 B	-rw-r--r--	2024-03-12 14:24
int2num.o	70.88 KB	-rw-r--r--	2024-03-12 14:24
nearzero.c	1.93 KB	-rw-rw-r--	2022-10-31 11:36
nearzero.lo	340 B	-rw-r--r--	2024-03-12 14:24
nearzero.o	69.63 KB	-rw-r--r--	2024-03-12 14:24
neg.c	1.48 KB	-rw-rw-r--	2022-10-31 11:36
neg.lo	325 B	-rw-r--r--	2024-03-12 14:24
neg.o	68.05 KB	-rw-r--r--	2024-03-12 14:24
num2long.c	2.09 KB	-rw-rw-r--	2022-10-31 11:36
num2long.lo	340 B	-rw-r--r--	2024-03-12 14:24
num2long.o	69.23 KB	-rw-r--r--	2024-03-12 14:24
num2str.c	2.41 KB	-rw-rw-r--	2022-10-31 11:36
num2str.lo	337 B	-rw-r--r--	2024-03-12 14:24
num2str.o	71.31 KB	-rw-r--r--	2024-03-12 14:24
outofmem.c	1.43 KB	-rw-rw-r--	2022-10-31 11:36
outofmem.lo	340 B	-rw-r--r--	2024-03-12 14:24
outofmem.o	68.59 KB	-rw-r--r--	2024-03-12 14:24
output.c	5.48 KB	-rw-rw-r--	2022-10-31 11:36
output.lo	334 B	-rw-r--r--	2024-03-12 14:24
output.o	78.58 KB	-rw-r--r--	2024-03-12 14:24
private.h	1.49 KB	-rw-rw-r--	2022-10-31 11:36
raise.c	3.36 KB	-rw-rw-r--	2022-10-31 11:36
raise.lo	331 B	-rw-r--r--	2024-03-12 14:24
raise.o	72.98 KB	-rw-r--r--	2024-03-12 14:24
raisemod.c	3.63 KB	-rw-rw-r--	2022-10-31 11:36
raisemod.lo	340 B	-rw-r--r--	2024-03-12 14:24
raisemod.o	77.42 KB	-rw-r--r--	2024-03-12 14:24
recmul.c	7.37 KB	-rw-rw-r--	2022-10-31 11:36
recmul.lo	334 B	-rw-r--r--	2024-03-12 14:24
recmul.o	85.43 KB	-rw-r--r--	2024-03-12 14:24
rmzero.c	1.73 KB	-rw-rw-r--	2022-10-31 11:36
rmzero.lo	334 B	-rw-r--r--	2024-03-12 14:24
rmzero.o	68.13 KB	-rw-r--r--	2024-03-12 14:24
sqrt.c	3.36 KB	-rw-rw-r--	2022-10-31 11:36
sqrt.lo	328 B	-rw-r--r--	2024-03-12 14:24
sqrt.o	74 KB	-rw-r--r--	2024-03-12 14:24
str2num.c	2.93 KB	-rw-rw-r--	2022-10-31 11:36
str2num.lo	337 B	-rw-r--r--	2024-03-12 14:24
str2num.o	71.71 KB	-rw-r--r--	2024-03-12 14:24
sub.c	2.54 KB	-rw-rw-r--	2022-10-31 11:36
sub.lo	325 B	-rw-r--r--	2024-03-12 14:24
sub.o	71.09 KB	-rw-r--r--	2024-03-12 14:24
zero.c	1.83 KB	-rw-rw-r--	2022-10-31 11:36
zero.lo	328 B	-rw-r--r--	2024-03-12 14:24
zero.o	69.83 KB	-rw-r--r--	2024-03-12 14:24

Rename

/* compare.c: bcmath library file. */
/*
    Copyright (C) 1991, 1992, 1993, 1994, 1997 Free Software Foundation, Inc.
    Copyright (C) 2000 Philip A. Nelson

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.  (LICENSE)

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.

You may contact the author by:
       e-mail:  philnelson@acm.org
      us-mail:  Philip A. Nelson
                Computer Science Department, 9062
                Western Washington University
                Bellingham, WA 98226-9062

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

#include <config.h>
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <stdarg.h>
#include "bcmath.h"
#include "private.h"

/* Compare two bc numbers.  Return value is 0 if equal, -1 if N1 is less
   than N2 and +1 if N1 is greater than N2.  If USE_SIGN is false, just
   compare the magnitudes. */

int
_bc_do_compare (n1, n2, use_sign, ignore_last)
     bc_num n1, n2;
     int use_sign;
     int ignore_last;
{
  char *n1ptr, *n2ptr;
  int  count;

/* First, compare signs. */
  if (use_sign && n1->n_sign != n2->n_sign)
    {
      if (n1->n_sign == PLUS)
	return (1);	/* Positive N1 > Negative N2 */
      else
	return (-1);	/* Negative N1 < Positive N1 */
    }

/* Now compare the magnitude. */
  if (n1->n_len != n2->n_len)
    {
      if (n1->n_len > n2->n_len)
	{
	  /* Magnitude of n1 > n2. */
	  if (!use_sign || n1->n_sign == PLUS)
	    return (1);
	  else
	    return (-1);
	}
      else
	{
	  /* Magnitude of n1 < n2. */
	  if (!use_sign || n1->n_sign == PLUS)
	    return (-1);
	  else
	    return (1);
	}
    }

/* If we get here, they have the same number of integer digits.
     check the integer part and the equal length part of the fraction. */
  count = n1->n_len + MIN (n1->n_scale, n2->n_scale);
  n1ptr = n1->n_value;
  n2ptr = n2->n_value;

while ((count > 0) && (*n1ptr == *n2ptr))
    {
      n1ptr++;
      n2ptr++;
      count--;
    }
  if (ignore_last && count == 1 && n1->n_scale == n2->n_scale)
    return (0);
  if (count != 0)
    {
      if (*n1ptr > *n2ptr)
	{
	  /* Magnitude of n1 > n2. */
	  if (!use_sign || n1->n_sign == PLUS)
	    return (1);
	  else
	    return (-1);
	}
      else
	{
	  /* Magnitude of n1 < n2. */
	  if (!use_sign || n1->n_sign == PLUS)
	    return (-1);
	  else
	    return (1);
	}
    }

/* They are equal up to the last part of the equal part of the fraction. */
  if (n1->n_scale != n2->n_scale)
    {
      if (n1->n_scale > n2->n_scale)
	{
	  for (count = n1->n_scale-n2->n_scale; count>0; count--)
	    if (*n1ptr++ != 0)
	      {
		/* Magnitude of n1 > n2. */
		if (!use_sign || n1->n_sign == PLUS)
		  return (1);
		else
		  return (-1);
	      }
	}
      else
	{
	  for (count = n2->n_scale-n1->n_scale; count>0; count--)
	    if (*n2ptr++ != 0)
	      {
		/* Magnitude of n1 < n2. */
		if (!use_sign || n1->n_sign == PLUS)
		  return (-1);
		else
		  return (1);
	      }
	}
    }

/* They must be equal! */
  return (0);
}

/* This is the "user callable" routine to compare numbers N1 and N2. */

int
bc_compare (n1, n2)
     bc_num n1, n2;
{
  return _bc_do_compare (n1, n2, TRUE, FALSE);
}