decimal 0.0.2

data/COPYING

@@ -0,0 +1,57 @@
+Decimal is copyrighted free software by Tadashi Saito <shiba AT
+mail2.accsnet.ne.jp>.
+You can redistribute it and/or modify it under either the terms of the GPL
+version 2 (see the file GPL), or the conditions below:
+
+  1. You may make and give away verbatim copies of the source form of the
+     software without restriction, provided that you duplicate all of the
+     original copyright notices and associated disclaimers.
+
+  2. You may modify your copy of the software in any way, provided that
+     you do at least ONE of the following:
+
+       a) place your modifications in the Public Domain or otherwise
+          make them Freely Available, such as by posting said
+	  modifications to Usenet or an equivalent medium, or by allowing
+	  the author to include your modifications in the software.
+
+       b) use the modified software only within your corporation or
+          organization.
+
+       c) give non-standard binaries non-standard names, with
+          instructions on where to get the original software distribution.
+
+       d) make other distribution arrangements with the author.
+
+  3. You may distribute the software in object code or binary form,
+     provided that you do at least ONE of the following:
+
+       a) distribute the binaries and library files of the software,
+	  together with instructions (in the manual page or equivalent)
+	  on where to get the original distribution.
+
+       b) accompany the distribution with the machine-readable source of
+	  the software.
+
+       c) give non-standard binaries non-standard names, with
+          instructions on where to get the original software distribution.
+
+       d) make other distribution arrangements with the author.
+
+  4. You may modify and include the part of the software into any other
+     software (possibly commercial).  But some files in the distribution
+     are not written by the author, so that they are not under these terms.
+
+     For the list of those files and their copying conditions, see the
+     file LEGAL.
+
+  5. The scripts and library files supplied as input to or produced as 
+     output from the software do not automatically fall under the
+     copyright of the software, but belong to whomever generated them, 
+     and may be sold commercially, and may be aggregated with this
+     software.
+
+  6. THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
+     IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+     WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+     PURPOSE.

data/GPL

@@ -0,0 +1,340 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+                       59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			    NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    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
+
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.

data/INSTALL

@@ -0,0 +1,5 @@
+$ ruby extconf.rb
+$ make
+$ su
+# make install
+

data/README

@@ -0,0 +1 @@
+ALL YOUR DECIMAL BASE ARE BELONG TO US

data/decimal.c

@@ -0,0 +1,1614 @@
+/*
+ *  decimal.c - implementation of Decimal,
+ *              a multi-precision decimal arithmetic library
+ *
+ *  Copyright (C) 2003-2008 Tadashi Saito
+ *
+ *  This program is free software; you can
+ *    0. use this program for any purpose.
+ *    1. study how the program works, and adapt it to your needs.
+ *    2. redistribute copies so you can help your neighbor.
+ *    3. improve the program, and release your improvements
+ *       to the public, so that the whole community benefits.
+ *  with the accessibility to the source code.
+ *
+ *  This program is licensed under the terms of the Ruby License.
+ *  See the file "COPYING" for more details.
+ */
+
+#include <ctype.h>
+#include <float.h>
+#include <math.h>
+#include <stdio.h>
+#include <string.h>
+
+#include <ruby.h>
+#include <rubysig.h>
+#include <version.h>
+#include <util.h>
+
+/*
+ * unfortunately, a few copies of Integer functions
+ * are needed from original Ruby
+ */
+#include "inum18.h"
+
+/*
+ * INUM_* macros: receive both Fixnum and Bignum,
+ *		  to operate Integers transparently
+ */
+#define INUM_PLUS(a, b) \
+    (FIXNUM_P(a) ? fix_plus(a, b) : rb_big_plus(a, b))
+#define INUM_MINUS(a, b) \
+    (FIXNUM_P(a) ? fix_minus(a, b) : rb_big_minus(a, b))
+#define INUM_MUL(a, b) \
+    (FIXNUM_P(a) ? fix_mul(a, b) : rb_big_mul(a, b))
+#define INUM_DIV(a, b) \
+    (FIXNUM_P(a) ? fix_div(a, b) : RARRAY(rb_big_divmod(a, b))->ptr[0])
+#define INUM_DIVMOD(a, b) \
+    (FIXNUM_P(a) ? fix_divmod(a, b) : rb_big_divmod(a, b))
+#define INUM_EQ(a, b) \
+    (FIXNUM_P(a) ? fix_equal(a, b) : rb_big_eq(a, b))
+#define INUM_CMP(a, b) \
+    (FIXNUM_P(a) ? fix_cmp(a, b) : rb_big_cmp(a, b))
+#define INUM_UMINUS(n) \
+    (FIXNUM_P(n) ? LONG2NUM(-FIX2LONG(n)) : big_uminus(n))
+#define INUM_HASH(n) \
+    (FIXNUM_P(n) ? LONG2NUM((long)n) : rb_big_hash(n))
+#define INUM2STR(n) \
+    (FIXNUM_P(n) ? rb_fix2str(n, 10) : rb_big2str(n, 10))
+
+#define INUM_INC(n) do { n = INUM_PLUS(n, INT2FIX(1)); } while (0)
+#define INUM_DEC(n) do { n = INUM_MINUS(n, INT2FIX(1)); } while (0)
+#define INUM_ZERO_P(n) (FIXNUM_P(n) && FIX2LONG(n) == 0)
+#define INUM_NEGATIVE_P(n) (FIXNUM_P(n) ? FIX2LONG(n) < 0 : !RBIGNUM(n)->sign)
+#define INUM_BOTTOMDIG(n) (FIXNUM_P(n) ? FIX2LONG(n) % 10 : \
+  RBIGNUM(n)->len ? FIX2INT(RARRAY(rb_big_divmod(n, INT2FIX(10)))->ptr[1]) : 0)
+#define INUM_ODD_P(n) (FIXNUM_P(n) ? n & 2 : BDIGITS(n)[0] & 1)
+
+/* the body */
+typedef struct {
+    VALUE inum;
+    long scale;
+} Decimal;
+
+/* singleton objects for NaN, +Infinity, -Infinity */
+static Decimal *const DEC_NaN = (Decimal *)1;
+static Decimal *const DEC_PINF = (Decimal *)3;
+static Decimal *const DEC_NINF = (Decimal *)7;
+/* and their representation as Ruby object */
+static VALUE VALUE_NaN, VALUE_PINF, VALUE_NINF;
+
+/* special constants - i.e. non-zero and non-fixnum constants */
+/* used for signed zeros that never meet any fixnums nor normal VALUEs */
+static const VALUE DEC_PZERO = 2, DEC_NZERO = 6;
+#define dec_pzero() WrapDecimal(inum_to_dec(DEC_PZERO))
+#define dec_nzero() WrapDecimal(inum_to_dec(DEC_NZERO))
+
+#define DEC_ISINF(d) ((d) == DEC_PINF || (d) == DEC_NINF)
+/* immediate means non-finite */
+#define DEC_IMMEDIATE_P(d) (DEC_ISINF(d) || d == DEC_NaN)
+/* special signed zeros */
+#define DEC_ZERO_P(d) ((d)->inum == DEC_PZERO || (d)->inum == DEC_NZERO)
+#define INUM_SPZERO_P(n) ((n) == DEC_PZERO || (n) == DEC_NZERO)
+
+/* all rounding modes, corresponding to DEF_ROUNDING_MODE() */
+static VALUE ROUND_CEILING;
+static VALUE ROUND_DOWN;
+static VALUE ROUND_FLOOR;
+static VALUE ROUND_HALF_DOWN;
+static VALUE ROUND_HALF_EVEN;
+static VALUE ROUND_HALF_UP;
+static VALUE ROUND_UP;
+static VALUE ROUND_UNNECESSARY;
+
+#define GetDecimal(obj, d) do { \
+    Data_Get_Struct(obj, Decimal, d); \
+    if (d == NULL) rb_raise(rb_eArgError, "uninitialized Decimal object"); \
+} while (0)
+#define WrapDecimal(d) \
+    Data_Wrap_Struct(cDecimal, dec_mark, dec_free, d)
+#define WrapImmediate(d) \
+    Data_Wrap_Struct(cDecimal, NULL, NULL, d)
+#define DECIMAL_P(d) (CLASS_OF(d) == cDecimal)
+
+static VALUE cDecimal;
+static VALUE eDomainError;
+static VALUE eArithmeticError;
+
+/* mark if d->inum is Bignum */
+static void
+dec_mark(void *p)
+{
+    const Decimal *const d = p;
+
+    if (d == NULL) return; /* uninitialized object */
+    if (!FIXNUM_P(d->inum) && !INUM_SPZERO_P(d->inum)) {
+	rb_gc_mark(d->inum); /* mark a Bignum */
+    }
+}
+
+#ifndef DEBUG
+#define dec_free (-1) /* just xfree() the objects */
+#else
+static void
+dec_free(void *p)
+{
+    static void *prev = NULL;
+
+    if (p == prev) {
+        fprintf(stderr, "dec_free(): double-free occurred on %p\n", p);
+    }
+    xfree(p);
+    prev = p;
+}
+#endif
+
+static Decimal *
+inum_to_dec(VALUE x)
+{
+    Decimal *d = ALLOC(Decimal);
+
+    d = ALLOC(Decimal);
+    if (INUM_ZERO_P(x)) d->inum = DEC_PZERO;
+    else d->inum = x;
+    d->scale = 0;
+    return d;
+}
+
+static VALUE
+cstr_to_inum(VALUE str)
+{
+    return rb_cstr_to_inum((const char *)str, 10, Qtrue);
+}
+
+static VALUE
+invalid_str(VALUE arg)
+{
+    VALUE *assoc = (VALUE *)arg;
+
+    xfree((char *)assoc[0]);
+    rb_invalid_str((const char *)assoc[1], "Decimal");
+    return Qnil; /* not reached */
+}
+
+static Decimal *
+cstr_to_dec(const char *str)
+{
+    Decimal *d;
+    char *const s = strdup(str);
+    char *ss, *ss2;
+    long scale = 0;
+    VALUE inum, assoc[2];
+
+    assoc[0] = (VALUE)s;
+    assoc[1] = (VALUE)str;
+    if (ss = strpbrk(s, "be")) {
+	*ss++ = '\0'; /* for strchr() */
+	inum = rb_rescue(cstr_to_inum, (VALUE)ss, invalid_str, (VALUE)assoc);
+	scale -= NUM2LONG(inum);
+    }
+    if (ss = strchr(s, '.')) {
+	const char *p;
+
+#if RUBY_RELEASE_CODE == 20070924 /* bug workaround for 1.8.6-p111 */
+        if (ss == s || ss[-1] != '0') goto out;
+        ss2 = ss;
+        do {
+            ss2--;  
+        } while (*ss2 == '0' && ss2 > s);
+        if (*ss2 == '0' || *ss2 == '-' || *ss2 == '+' || ISSPACE(*ss2))
+            *ss = '0';
+        else
+  out:    
+#endif
+	*ss = '_'; /* so that rb_cstr_to_inum() can ignore '.' */
+	for (p = ss + 1; ISDIGIT(*p) || *p == '_'; p++) {
+	    if (ISDIGIT(*p)) scale++;
+	}
+    }
+    inum = rb_rescue(cstr_to_inum, (VALUE)s, invalid_str, (VALUE)assoc);
+    d = ALLOC(Decimal);
+    if (INUM_ZERO_P(inum)) {
+	d->inum = strchr(s, '-') ? DEC_NZERO : DEC_PZERO;
+    }
+    else d->inum = inum;
+    d->scale = scale;
+    xfree(s);
+    return d;
+}
+
+static Decimal *
+finite_dup(Decimal *d)
+{
+    Decimal *d2 = ALLOC(Decimal);
+
+    *d2 = *d;
+    if (!FIXNUM_P(d->inum) && !INUM_SPZERO_P(d->inum)) {
+	d2->inum = rb_big_clone(d->inum); /* inum is a Bignum */
+    }
+    return d2;
+}
+
+static Decimal *
+create_dec(VALUE arg)
+{
+    switch (TYPE(arg)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	return inum_to_dec(arg);
+      case T_STRING:
+	return cstr_to_dec(StringValueCStr(arg));
+      case T_DATA:
+	if (DECIMAL_P(arg)) {
+	    Decimal *d;
+
+	    GetDecimal(arg, d);
+	    if (DEC_IMMEDIATE_P(d))
+		return d;
+	    return finite_dup(d);
+	}
+	/* fall through */
+      case T_FLOAT:
+	rb_raise(rb_eArgError, "invalid value Float(%s) for Decimal",
+                 RSTRING(rb_inspect(arg))->ptr);
+      default:
+	rb_raise(rb_eArgError, "invalid value for Decimal: %s",
+                 RSTRING(rb_inspect(arg))->ptr);
+    }
+    return NULL; /* not reached */
+}
+
+static VALUE
+f_decimal(VALUE klass_unused, VALUE arg)
+{
+    if (DECIMAL_P(arg)) return arg;
+    return WrapDecimal(create_dec(arg));
+}
+
+/* TODO: should know about allocation framework */
+static VALUE
+dec_s_allocate(VALUE klass)
+{
+    return Data_Wrap_Struct(klass, dec_mark, dec_free, NULL);
+}
+
+/* TODO: check whether arg is a Decimal or not */
+static VALUE
+dec_initialize(VALUE self, VALUE arg)
+{
+    Decimal *d = create_dec(arg);
+
+    if (DEC_IMMEDIATE_P(d)) { /* no need to manage about memory */
+        RDATA(self)->dmark = RDATA(self)->dmark = NULL;
+    }
+    DATA_PTR(self) = d;
+    return self;
+}
+
+#ifdef DEBUG
+static VALUE
+dec_scale(VALUE self)
+{
+    Decimal *d;
+
+    GetDecimal(self, d); 
+    if (!DEC_IMMEDIATE_P(d)) return LONG2NUM(d->scale);
+    return Qnil;
+}
+
+static VALUE
+dec_unscaled_value(VALUE self)
+{
+    Decimal *d;
+
+    GetDecimal(self, d);
+    if (!DEC_IMMEDIATE_P(d)) {
+	return INUM_SPZERO_P(d->inum) ? INT2FIX(0) : d->inum;
+    }
+    return Qnil;
+}
+#endif
+
+static VALUE
+dec_strip_trailing_zeros(VALUE self)
+{
+    Decimal *d, *d2;
+
+    GetDecimal(self, d);
+    if (DEC_IMMEDIATE_P(d))
+	return self;
+    if (INUM_SPZERO_P(d->inum)) { /* XXX: negative scale? */
+        if (d->scale <= 0) return self;
+	d2 = finite_dup(d);
+	d2->scale = 0; 
+	return WrapDecimal(d2);
+    }
+    d2 = ALLOC(Decimal);
+    *d2 = *d;
+    /* TODO: can be optimized with dividing each part
+     * for Bignums and Fixnums */
+    while (INUM_BOTTOMDIG(d2->inum) == 0) {
+	d2->inum = INUM_DIV(d2->inum, INT2FIX(10));
+	d2->scale--;
+    }
+    return WrapDecimal(d2);
+}
+
+/* FIXME: should return "%g" format string */
+static VALUE
+finite_to_s(Decimal *d)
+{
+    const VALUE str = INUM2STR(d->inum);
+    const char *s = RSTRING(str)->ptr;
+    const long slen = RSTRING(str)->len;
+    const long scale = d->scale;
+    long snumlen, sslen, diff;
+    int negative;
+    char *ss; /* source of newstr */
+    VALUE newstr; /* to be returned */
+
+    if (scale == 0) return str;
+    if (scale < 0) { /* "xx00" */
+	sslen = slen - scale;
+	ss = ALLOC_N(char, sslen);
+	memcpy(ss, s, slen);
+	memset(ss+slen, '0', -scale);
+	goto coda;
+    }
+    negative = (*s == '-');
+    snumlen = negative ? slen-1 : slen;
+    if (scale < snumlen) { /* "xx.xx" */
+	diff = slen - scale;
+	sslen = slen + 1;
+	ss = ALLOC_N(char, sslen);
+	memcpy(ss, s, diff);
+	ss[diff] = '.';
+	memcpy(ss+diff+1, s+diff, scale);
+    }
+    else { /* "0.00xx" */
+	char *ss2; /* alias of ss */
+
+	diff = scale - snumlen;
+	/* "0." + "00..." + "-?xx" */
+	sslen = 2 + diff + slen;
+	ss = ss2 = ALLOC_N(char, sslen);
+	if (negative) *ss2++ = '-', s++;
+	memcpy(ss2, "0.", 2);
+	ss2 += 2;
+	if (diff) memset(ss2, '0', diff);
+	memcpy(ss2+diff, s, snumlen);
+    }
+  coda:
+    newstr = rb_str_new(ss, sslen);
+    xfree(ss);
+    return newstr;
+}
+
+static VALUE
+dec_to_s(VALUE self)
+{
+    Decimal *d;
+
+    GetDecimal(self, d);
+    if (d == DEC_NaN) return rb_str_new2("NaN");
+    if (d == DEC_PINF) return rb_str_new2("Infinity");
+    if (d == DEC_NINF) return rb_str_new2("-Infinity");
+    if (d->inum == DEC_PZERO) return rb_str_new2("0");
+    if (d->inum == DEC_NZERO) return rb_str_new2("-0");
+    return finite_to_s(d);
+}
+
+static VALUE
+dec_inspect(VALUE self)
+{
+    char *s;
+    VALUE str, newstr;
+    long len;
+
+    str = dec_to_s(self);
+    len = 9 + RSTRING(str)->len; /* 9 == strlen("Decimal()") */
+    s = ALLOC_N(char, len + 1); /* +1 for NUL */
+    sprintf(s, "Decimal(%s)", RSTRING(str)->ptr);
+    newstr = rb_str_new(s, len);
+    xfree(s);
+    return newstr;
+}
+
+static VALUE
+dec_coerce(VALUE x, VALUE y)
+{
+    VALUE yy;
+
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	yy = WrapDecimal(inum_to_dec(y));
+	return rb_assoc_new(yy, x);
+      case T_FLOAT:
+	rb_raise(rb_eTypeError, "can't coerce Float to Decimal; "
+		 "use Decimal#to_f explicitly if needed");
+	break;
+      case T_DATA:
+	if (DECIMAL_P(y)) return rb_assoc_new(y, x);
+	/* fall through */
+      default:
+	rb_raise(rb_eTypeError, "can't coerce %s to Decimal",
+		 rb_obj_classname(y));
+	break;
+    }
+    return Qnil; /* not reached */
+}
+
+static VALUE
+dec_uminus(VALUE num)
+{
+    Decimal *d, *d2;
+
+    GetDecimal(num, d);
+    if (d == DEC_NaN) return num;
+    if (d == DEC_PINF) return VALUE_NINF;
+    if (d == DEC_NINF) return VALUE_PINF;
+
+    d2 = ALLOC(Decimal);
+    d2->scale = d->scale;
+    if (d->inum == DEC_PZERO)
+	d2->inum = DEC_NZERO;
+    else if (d->inum == DEC_NZERO)
+	d2->inum = DEC_PZERO;
+    else
+	d2->inum = INUM_UMINUS(d->inum);
+    return WrapDecimal(d2);
+}
+
+/* returns x * (10 ** n) */
+static VALUE
+inum_lshift(VALUE x, long n)
+{
+    VALUE y;
+
+    if (n <= 0) rb_bug("inum_lshift(): not reached");
+    y = fix_pow(INT2FIX(10), LONG2NUM(n));
+    return INUM_MUL(x, y);
+}
+
+/* the "normal" number means "finite and nonzero." */
+static Decimal *
+normal_plus(Decimal *x, Decimal *y, const int add)
+{
+    Decimal *z;
+    VALUE inum;
+    long scale;
+
+    if (x->scale == y->scale) {
+	inum = add ? INUM_PLUS(x->inum, y->inum)
+                   : INUM_MINUS(x->inum, y->inum);
+	scale = x->scale;
+    }
+    else {
+	Decimal *max, *min;
+	VALUE min_inum;
+
+	if (x->scale > y->scale) max = x, min = y;
+	else max = y, min = x;
+	scale = max->scale;
+	min_inum = inum_lshift(min->inum, max->scale - min->scale);
+	if (add) inum = INUM_PLUS(min_inum, max->inum); /* ? + ? */
+	else if (max == x) inum = INUM_MINUS(max->inum, min_inum); /* x - y */
+	else inum = INUM_MINUS(min_inum, max->inum); /* y - x */
+    }
+    if (INUM_ZERO_P(inum)) inum = DEC_PZERO;
+    z = ALLOC(Decimal);
+    z->inum = inum;
+    z->scale = scale;
+    return z;
+}
+
+static VALUE
+dec_plus(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	rb_raise(rb_eTypeError, "can't operate with Float");
+	break;
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    if (b == DEC_NaN) return VALUE_NaN;
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_bin(x, y);
+    }
+    GetDecimal(x, a);
+    if (a == DEC_NaN) return VALUE_NaN;
+    
+    /* now, x and y are not NaNs */
+    if (DEC_ISINF(a)) {
+	if (DEC_ISINF(b) && a != b) return VALUE_NaN;
+	return x;
+    }
+    if (INUM_SPZERO_P(a->inum)) {
+        if (!DEC_IMMEDIATE_P(b) && DEC_ZERO_P(b)) { /* XXX */
+            if (a->inum == DEC_NZERO && b->inum == DEC_NZERO)
+                return dec_nzero(); /* FIXME: scale policy for 0? */
+            return dec_pzero(); /* FIXME: ditto */
+        }
+        return y;
+    }
+    if (DEC_ISINF(b)) return y;
+    if (INUM_SPZERO_P(b->inum)) return x; /* FIXME: ditto */
+    /* "true" means addition */
+    return WrapDecimal(normal_plus(a, b, Qtrue));
+}
+
+static VALUE
+dec_minus(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	rb_raise(rb_eTypeError, "can't operate with Float");
+	break;
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    if (b == DEC_NaN) return VALUE_NaN;
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_bin(x, y);
+    }
+    GetDecimal(x, a);
+    if (a == DEC_NaN) return VALUE_NaN;
+
+    if (DEC_ISINF(a)) {
+	if (a == b) return VALUE_NaN;
+	return x;
+    }
+    if (INUM_SPZERO_P(a->inum)) { /* FIXME: need to refactor */
+	if (!DEC_ISINF(b) && DEC_ZERO_P(b) && a->inum == b->inum) {
+	    return dec_pzero(); /* FIXME: for scaling */
+	}
+	return dec_uminus(y);
+    }
+    if (DEC_ISINF(b)) return dec_uminus(y);
+    if (DEC_ZERO_P(b)) return x;
+    /* "false" means subtraction */
+    return WrapDecimal(normal_plus(a, b, Qfalse));
+}
+
+static Decimal *
+normal_mul(Decimal *x, Decimal *y)
+{
+    Decimal *z = ALLOC(Decimal);
+
+    z->inum = INUM_MUL(x->inum, y->inum);
+    z->scale = x->scale + y->scale;
+    return z;
+}
+
+static VALUE
+dec_mul(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+        /* TODO: can be optimized if y = 0, 1 or -1 */
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	rb_raise(rb_eTypeError, "can't operate with Float");
+        break;
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    if (b == DEC_NaN) return VALUE_NaN;
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_bin(x, y);
+    }
+    GetDecimal(x, a);
+    if (a == DEC_NaN) return VALUE_NaN;
+
+    if (DEC_ISINF(a)) {
+	if (DEC_ISINF(b)) return a == DEC_PINF ? y : dec_uminus(y);
+	if (DEC_ZERO_P(b)) return VALUE_NaN;
+	if (!INUM_NEGATIVE_P(b->inum)) return x;
+	return dec_uminus(x);
+    }
+    if (DEC_ZERO_P(a)) {
+	if (DEC_ISINF(b)) return VALUE_NaN;
+	if (INUM_SPZERO_P(b->inum))  {
+	    return a->inum == DEC_PZERO ? y : dec_uminus(y);
+	}
+	if (INUM_NEGATIVE_P(b->inum)) return dec_uminus(x);
+	return x;
+    }
+    if (DEC_IMMEDIATE_P(b) || INUM_SPZERO_P(b->inum)) {
+        if (INUM_NEGATIVE_P(a->inum)) return dec_uminus(y);
+        return y;
+    }
+    return WrapDecimal(normal_mul(a, b));
+}
+
+static Decimal *
+do_round(Decimal *d, long scale, VALUE mode, VALUE *inump)
+{
+    Decimal *d2;
+    long diff;
+    int lower;
+    int trailing_nonzero, negative;
+    VALUE inum, inumabs, shift, tmp, ary;
+
+    if (d == DEC_PINF) rb_raise(eDomainError, "Infinity");
+    if (d == DEC_NINF) rb_raise(eDomainError, "-Infinity");
+    if (d == DEC_NaN) rb_raise(eDomainError, "NaN");
+    if (INUM_SPZERO_P(d->inum)) {
+	if (inump) {
+	    if (scale != 0) rb_bug("do_round(): "
+                                   "scale != 0 with Integer request");
+	    *inump = INT2FIX(0);
+	    return NULL;
+	}
+	d2 = finite_dup(d);
+	if (d->scale > scale) d2->scale = scale;
+	return d2;
+    }
+    if (d->scale <= scale) { /* no need to round */
+	/* return Decimal */
+	if (scale) return finite_dup(d);
+	/* return Integer */
+	if (!inump) /* XXX: may be reached when Decimal(1)/1  */
+            rb_bug("do_round(): not reached[2]"); 
+	if (d->scale == 0) *inump = d->inum;
+	else *inump = inum_lshift(d->inum, -d->scale);
+	return NULL;
+    }
+    negative = INUM_NEGATIVE_P(d->inum);
+    diff = d->scale - scale;
+    inumabs = negative ? INUM_UMINUS(d->inum) : d->inum;
+    if (mode == ROUND_CEILING ||
+	mode == ROUND_DOWN ||
+	mode == ROUND_FLOOR ||
+	mode == ROUND_UP ||
+	mode == ROUND_UNNECESSARY) {
+	shift = inum_lshift(INT2FIX(1), diff);
+	ary = INUM_DIVMOD(inumabs, shift);
+	inum = RARRAY(ary)->ptr[0];
+	if (mode == ROUND_DOWN) goto coda;
+	trailing_nonzero = !INUM_ZERO_P(RARRAY(ary)->ptr[1]);
+	if (mode == ROUND_CEILING) {
+	    if (!negative && trailing_nonzero) INUM_INC(inum);
+	}
+	else if (mode == ROUND_FLOOR) {
+	    if (negative && trailing_nonzero) INUM_INC(inum);
+	}
+	else if (mode == ROUND_UP) {
+	    if (trailing_nonzero) INUM_INC(inum);
+	}
+	else { /* mode == ROUND_UNNECESSARY */
+	    if (trailing_nonzero) {
+		rb_raise(eArithmeticError, "rounding necessary");
+	    }
+	}
+    }
+    else if (mode == ROUND_HALF_DOWN || /* needs lower digit */
+	     mode == ROUND_HALF_UP ||
+	     mode == ROUND_HALF_EVEN) {
+        if (diff != 1)
+            shift = inum_lshift(INT2FIX(1), diff-1);
+        else
+            shift = INT2FIX(1); /* FIXME!!! */
+	ary = INUM_DIVMOD(inumabs, shift);
+	tmp = RARRAY(ary)->ptr[0];
+
+	ary = INUM_DIVMOD(tmp, INT2FIX(10));
+	inum = RARRAY(ary)->ptr[0];
+	lower = FIX2INT(RARRAY(ary)->ptr[1]);
+	if (mode == ROUND_HALF_DOWN) {
+	    if (lower > 5) INUM_INC(inum);
+	}
+	else if (mode == ROUND_HALF_UP)	{
+	    if (lower >= 5) INUM_INC(inum);
+	}
+	else { /* mode == ROUND_HALF_EVEN */
+	    if (INUM_ODD_P(inum)) {
+		if (lower >= 5) INUM_INC(inum);
+	    }
+	    else {
+		if (lower > 5) INUM_INC(inum);
+	    }
+	}
+    }
+  coda:
+    if (negative) inum = INUM_UMINUS(inum);
+    if (scale == 0 && inump) { /* return Integer */
+	*inump = inum;
+	return NULL;
+    }
+    /* return Decimal */
+    d2 = ALLOC(Decimal);
+    if (INUM_ZERO_P(inum)) {
+	d2->inum = negative ? DEC_NZERO : DEC_PZERO;
+	d2->scale = 0;
+    }
+    else {
+	d2->inum = inum;
+	d2->scale = scale;
+    }
+    return d2;
+}
+
+static Decimal *
+normal_divide(Decimal *x, Decimal *y, long scale, VALUE mode)
+{
+    long diff;
+    VALUE xx;
+    Decimal *z = ALLOC(Decimal);
+
+    diff = x->scale - y->scale;
+    if (diff <= scale) {
+	xx = inum_lshift(x->inum, scale-diff+1); /* +1 for rounding */
+	z->scale = scale + 1;
+    }
+    else {
+	/* FIXME: may be a bug...? */
+	xx = x->inum;
+	z->scale = diff;
+    }
+    z->inum = INUM_DIV(xx, y->inum);
+    return do_round(z, scale, mode, 0);
+}
+
+static int
+valid_rounding_mode(VALUE sym)
+{
+    if (sym == ROUND_CEILING ||
+        sym == ROUND_DOWN ||
+        sym == ROUND_FLOOR ||
+        sym == ROUND_HALF_DOWN ||
+        sym == ROUND_HALF_EVEN ||
+        sym == ROUND_HALF_UP ||
+        sym == ROUND_UP ||
+        sym == ROUND_UNNECESSARY) {
+            return Qtrue;
+    }
+    return Qfalse;
+}
+
+static VALUE
+dec_divide(int argc, VALUE *argv, VALUE x)
+{
+    VALUE y;
+    Decimal *a, *b;
+    VALUE mode = ROUND_UNNECESSARY;
+    long scale, l;
+    VALUE vscale, vmode;
+
+    GetDecimal(x, a);
+    if (a == DEC_NaN) return VALUE_NaN; /* no need to check b */
+
+    rb_scan_args(argc, argv, "12", &y, &vscale, &vmode);
+    switch (argc) {
+      case 3:
+	Check_Type(vmode, T_SYMBOL);
+	if (!valid_rounding_mode(vmode)) {
+	    rb_raise(rb_eArgError, "invalid rounding mode %s",
+                     RSTRING(rb_inspect(mode))->ptr);
+	}
+	mode = vmode;
+	/* fall through */
+      case 2:
+	scale = NUM2LONG(vscale);
+	break;
+      case 1:
+	if (mode != ROUND_UNNECESSARY) {
+	    rb_raise(rb_eArgError, "scale number argument needed");
+	}
+	scale = 0; /* FIXME: dummy */
+    }
+
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+        l = FIX2LONG(y);
+        if (l == 0) {
+            if (DEC_ZERO_P(a)) return VALUE_NaN;
+            if (DEC_ISINF(a)) return x;
+            return INUM_NEGATIVE_P(a->inum) ? VALUE_NINF : VALUE_PINF;
+        }
+        else if (l == 1) return x;
+        else if (l == -1) return dec_uminus(x);
+	/* fall through */
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	rb_raise(rb_eTypeError, "can't operate with Float");
+        return Qnil; /* not reached */
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    if (b == DEC_NaN) return VALUE_NaN;
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_bin(x, y);
+    }
+    /* TODO: can be optimized if b == 0, 1 or -1 */
+    if (DEC_ISINF(a)) {
+	if (DEC_ISINF(b)) return VALUE_NaN;
+	if (b->inum == DEC_PZERO) return x;
+	if (b->inum == DEC_NZERO) return dec_uminus(x);
+	return INUM_NEGATIVE_P(b->inum) ? dec_uminus(x) : x;
+    }
+    if (DEC_ZERO_P(a)) {
+	if (b == DEC_PINF) return x;
+	if (b == DEC_NINF) return dec_uminus(x);
+	if (INUM_SPZERO_P(b->inum)) return VALUE_NaN;
+	return INUM_NEGATIVE_P(b->inum) ? dec_uminus(x) : x;
+    }
+    if (DEC_ISINF(b)) {
+	if (INUM_NEGATIVE_P(a->inum) == (b == DEC_NINF)) {
+	    return dec_pzero();
+	}
+	return dec_nzero();
+    }
+    if (DEC_ZERO_P(b)) {
+	if (INUM_NEGATIVE_P(a->inum) == (b->inum == DEC_NZERO)) {
+	    return VALUE_PINF;
+	}
+	return VALUE_NINF;
+    }
+    return WrapDecimal(normal_divide(a, b, scale, mode));
+}
+
+#ifdef DEBUG
+static VALUE
+dec_div(VALUE x, VALUE y)
+{
+    return dec_divide(1, &y, x);
+}
+#endif
+
+/*
+ * FIXME: test needed!
+ */
+static void
+divmod(Decimal *a, Decimal *b, VALUE *divp, VALUE *modp)
+{
+    Decimal *div, *mod;
+    Decimal *tmp;
+
+    if (a == DEC_NaN || DEC_ISINF(a) || b == DEC_NaN ||
+	(!DEC_ISINF(b) && DEC_ZERO_P(b))) {
+	div = mod = DEC_NaN;
+    }
+    else if (INUM_SPZERO_P(a->inum)) {
+	div = ALLOC(Decimal);
+	div->scale = 0;
+	if (b == DEC_NINF || (b != DEC_PINF && INUM_NEGATIVE_P(b->inum))) {
+	    div->inum = DEC_NZERO;
+	}
+	else {
+	    div->inum = DEC_PZERO;
+	}
+	mod = finite_dup(a);
+    }
+    else if (DEC_ISINF(b)) {
+	const int a_negative = INUM_NEGATIVE_P(a->inum);
+
+	div = ALLOC(Decimal);
+	div->scale = 0;
+	if (a_negative != (b == DEC_NINF)) { /* signs differ */
+	    div->inum = INT2FIX(-1);
+	    mod = b;
+	}
+	else {
+	    div->inum = a_negative ? DEC_NZERO : DEC_PZERO;
+	    mod = finite_dup(a);
+	}
+    }
+    else {
+	/* both of a and b are finite and nonzero */
+	div = normal_divide(a, b, 0, ROUND_DOWN); /* div = x / y */
+	if (INUM_SPZERO_P(div->inum)) {
+	    if (INUM_NEGATIVE_P(b->inum)) div->inum = DEC_NZERO;
+	    mod = finite_dup(a);
+	}
+	else {
+	    tmp = normal_mul(div, b);
+	    mod = normal_plus(a, tmp, 0); /* mod = x - div*y; */
+	    xfree(tmp);
+	}
+	/* if ((mod < 0 && y > 0) || (mod > 0 && y < 0)) { */
+	if (INUM_NEGATIVE_P(mod->inum) != INUM_NEGATIVE_P(b->inum) &&
+            INUM_SPZERO_P(mod->inum) && INUM_SPZERO_P(b->inum)) {
+	    mod = normal_plus(mod, b, 1); /*  mod += y; */
+	    INUM_DEC(div->inum); /* div -= 1; */
+	}
+    }
+    if (divp) *divp = WrapDecimal(div);
+    else if (!DEC_IMMEDIATE_P(div)) xfree(div);
+    if (modp) *modp = WrapDecimal(mod);
+    else if (!DEC_IMMEDIATE_P(mod)) xfree(mod);
+}
+
+static VALUE
+dec_idiv(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+    VALUE div;
+
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	rb_raise(rb_eTypeError, "can't operate with Float");
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_bin(x, y);
+    }
+    GetDecimal(x, a);
+    divmod(a, b, &div, NULL);
+    return div;
+}
+
+static VALUE
+dec_mod(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+    VALUE mod;
+
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	rb_raise(rb_eTypeError, "can't operate with Float");
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_bin(x, y);
+    }
+    GetDecimal(x, a);
+    divmod(a, b, NULL, &mod);
+    return mod;
+}
+
+static VALUE
+dec_divmod(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+    VALUE div, mod;
+
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	rb_raise(rb_eTypeError, "can't operate with Float");
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_bin(x, y);
+    }
+    GetDecimal(x, a);
+    divmod(a, b, &div, &mod);
+    return rb_assoc_new(div, mod);
+}
+
+/* XXX: may have bugs; try "GC.stress = true" to reproduce */
+/* TODO: can be optimized with removing sign "flip flap?" */
+static VALUE
+power_with_long(Decimal *x, long y) /* requires y > 1 */
+{
+    Decimal *z = x, *const orig_x = x, *tmp;
+
+    for (;;) {
+	y--;
+	if (y == 0) break;
+	while ((y & 1) == 0) {
+	    y >>= 1;
+	    x = normal_mul(x, x);
+	    if (!FIXNUM_P(x->inum)) rb_gc_mark(x->inum);
+	}
+        tmp = z;
+	z = normal_mul(z, x);
+	if (!FIXNUM_P(z->inum)) rb_gc_mark(z->inum);
+        if (tmp != orig_x)
+            xfree(tmp);
+    }
+    return WrapDecimal(z);
+}
+
+static VALUE
+dec_pow(VALUE x, VALUE y)
+{
+    Decimal *a;
+    long l;
+
+    GetDecimal(x, a);
+    Check_Type(y, T_FIXNUM);
+    l = FIX2LONG(y);
+    if (l < 0) rb_raise(rb_eArgError, "in a**b, b should be positive integer");
+    if (l == 0) {
+	Decimal *d = ALLOC(Decimal);
+
+	d->inum = INT2FIX(1);
+	d->scale = 0;
+	return WrapDecimal(d);
+    }
+    if (a == DEC_NaN || l == 1) return x;
+    if (a == DEC_PINF || (a != DEC_NINF && a->inum == DEC_PZERO)) return x;
+    if (a == DEC_NINF || a->inum == DEC_NZERO)  {
+	if (l % 2 == 0) {
+	    return a == DEC_NINF ? VALUE_PINF : dec_uminus(x);
+	}
+	return x;
+    }
+    return power_with_long(a, l);
+}
+
+static int
+normal_cmp(Decimal *x, Decimal *y)
+{
+    Decimal *max, *min;
+    VALUE n;
+    const int c = FIX2INT(INUM_CMP(x->inum, y->inum));
+
+    if (x->scale == y->scale) return c;
+    if (c == 0) {
+	return x->scale > y->scale ? -1 : 1;
+    }
+    if (c < 0 && x->scale > y->scale) return -1;
+    if (c > 0 && x->scale < y->scale) return 1;
+    /* XXX: align scales */
+    if (x->scale < y->scale) min = x, max = y;
+    else min = y, max = x;
+    n = inum_lshift(min->inum, max->scale - min->scale);
+    if (x == max) return FIX2INT(INUM_CMP(max->inum, n));
+    return FIX2INT(INUM_CMP(n, max->inum));
+}
+
+/* never accepts NaN for x and y */
+static int
+cmp(Decimal *x, Decimal *y)
+{
+    if (x == y) return 0;
+    if (x == DEC_PINF || y == DEC_NINF) return 1;
+    if (x == DEC_NINF || y == DEC_PINF) return -1;
+    if (INUM_SPZERO_P(x->inum)) {
+	if (INUM_SPZERO_P(y->inum)) return 0;
+	return INUM_NEGATIVE_P(y->inum) ? -1 : 1;
+    }
+    if (INUM_SPZERO_P(y->inum)) {
+	return INUM_NEGATIVE_P(x->inum) ? -1 : 1;
+    }
+    return normal_cmp(x, y);    
+}
+
+static VALUE
+dec_eq(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+
+    GetDecimal(x, a);
+    if (a == DEC_NaN) return Qfalse;
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	return Qnil;
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    if (b == DEC_NaN) return Qfalse;
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_cmp(x, y);
+    }
+    return cmp(a, b) == 0 ? Qtrue : Qfalse;
+}
+
+static VALUE
+dec_cmp(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+
+    GetDecimal(x, a);
+    if (a == DEC_NaN) return Qnil;
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	return Qnil;
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    if (b == DEC_NaN) return Qnil;
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_cmp(x, y);
+    }
+    return INT2FIX(cmp(a, b));
+}
+
+static VALUE
+dec_gt(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+
+    GetDecimal(x, a);
+    if (a == DEC_NaN) return Qfalse;
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	rb_cmperr(x, y);
+        return Qnil; /* not reached */
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    if (b == DEC_NaN) return Qfalse;
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_relop(x, y);
+    }
+    return cmp(a, b) > 0 ? Qtrue : Qfalse;
+}
+
+static VALUE
+dec_ge(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+
+    GetDecimal(x, a);
+    if (a == DEC_NaN) return Qfalse;
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	rb_cmperr(x, y);
+        return Qnil; /* not reached */
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    if (b == DEC_NaN) return Qfalse;
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_relop(x, y);
+    }
+    return cmp(a, b) >= 0 ? Qtrue : Qfalse;
+}
+
+static VALUE
+dec_lt(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+
+    GetDecimal(x, a);
+    if (a == DEC_NaN) return Qfalse;
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	rb_cmperr(x, y);
+        return Qnil; /* not reached */
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    if (b == DEC_NaN) return Qfalse;
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_relop(x, y);
+    }
+    return cmp(a, b) < 0 ? Qtrue : Qfalse;
+}
+
+static VALUE
+dec_le(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+
+    GetDecimal(x, a);
+    if (a == DEC_NaN) return Qfalse;
+    switch (TYPE(y)) {
+      case T_FIXNUM:
+      case T_BIGNUM:
+	b = inum_to_dec(y);
+	break;
+      case T_FLOAT:
+	rb_cmperr(x, y);
+        return Qnil; /* not reached */
+      case T_DATA:
+	if (DECIMAL_P(y)) {
+	    GetDecimal(y, b);
+	    if (b == DEC_NaN) return Qfalse;
+	    break;
+	}
+	/* fall through */
+      default:
+	return rb_num_coerce_relop(x, y);
+    }
+    return cmp(a, b) <= 0 ? Qtrue : Qfalse;
+}
+
+static VALUE
+dec_eql(VALUE x, VALUE y)
+{
+    Decimal *a, *b;
+
+    if (TYPE(y) != T_DATA || !DECIMAL_P(y))
+	return Qfalse;
+
+    GetDecimal(x, a);
+    GetDecimal(y, b);
+    if (a == DEC_NaN || b == DEC_NaN) return Qfalse;
+    if (DEC_ISINF(a) || DEC_ISINF(b))
+	return a == b ? Qtrue : Qfalse;
+
+    if (a->scale != b->scale)
+	return Qfalse;
+    if (a->inum == b->inum)
+	return Qtrue;
+    if (INUM_SPZERO_P(a->inum) || INUM_SPZERO_P(b->inum))
+	return Qfalse;
+    if (INUM_EQ(a->inum, b->inum))
+	return Qtrue;
+    return Qfalse;
+}
+
+static VALUE
+dec_hash(VALUE x)
+{
+    Decimal *d;
+    long hash;
+
+    GetDecimal(x, d);
+    if (!DEC_IMMEDIATE_P(d)) {
+	hash = NUM2LONG(INUM_HASH(d->inum));
+	hash ^= d->scale;
+    }
+    else hash = (long)d;
+    return LONG2NUM(hash);
+}
+
+/* XXX: any other sane way? */
+#define QUIET(stmt) do { \
+    RUBY_CRITICAL( \
+    const VALUE verbose = ruby_verbose; \
+    ruby_verbose = Qnil; \
+    stmt; \
+    ruby_verbose = verbose; \
+    ); \
+} while (0)
+
+static double
+normal_to_f(Decimal *d)
+{
+    double f;
+
+    if (d->scale == 0) QUIET(f = NUM2DBL(d->inum));
+    else if (d->scale < 0) {
+	VALUE n;
+
+	n = inum_lshift(d->inum, -d->scale);
+	QUIET(f = NUM2DBL(n));
+    }
+    else {
+	/* FIXME: more strict handling needed for huge value */
+	double divf;
+	VALUE div;
+
+	QUIET(f = NUM2DBL(d->inum));
+	div = inum_lshift(INT2FIX(1), d->scale);
+	QUIET(divf = NUM2DBL(div));
+	f /= divf;
+    }
+    if (isinf(f)) {
+	rb_warn("Decimal out of Float range");
+	f = HUGE_VAL;
+    }
+    return f;
+}
+
+static VALUE
+dec_to_f(VALUE num)
+{
+    Decimal *d;
+    double f;
+
+    GetDecimal(num, d);
+    if (d == DEC_NaN)
+	f = 0.0 / 0.0;
+    else if (d == DEC_PINF)
+	f = 1.0 / 0.0;
+    else if (d == DEC_NINF)
+	f = -1.0 / 0.0;
+    else if (d->inum == DEC_PZERO)
+	f = 0.0;
+    else if (d->inum == DEC_NZERO)
+	f = -0.0;
+    else
+	f = normal_to_f(d);
+
+    return rb_float_new(f);
+}
+
+static VALUE
+dec_abs(VALUE num)
+{
+    Decimal *d, *d2;
+
+    GetDecimal(num, d);
+    if (d == DEC_NINF)
+	return VALUE_PINF;
+    if (d == DEC_PINF || d == DEC_NaN ||
+        d->inum == DEC_PZERO || !INUM_NEGATIVE_P(d->inum)) {
+	return num;
+    }
+    d2 = ALLOC(Decimal);
+    d2->inum = (d->inum == DEC_NZERO) ? DEC_PZERO : INUM_UMINUS(d->inum);
+    d2->scale = d->scale;
+    return WrapDecimal(d2);
+}
+
+static VALUE
+dec_zero_p(VALUE num)
+{
+    Decimal *d;
+
+    GetDecimal(num, d);
+    if (!DEC_IMMEDIATE_P(d) && DEC_ZERO_P(d)) {
+        return Qtrue;
+    }
+    return Qfalse;
+}
+
+static VALUE
+dec_to_i(VALUE num)
+{
+    Decimal *d;
+    VALUE inum;
+
+    GetDecimal(num, d);
+    do_round(d, 0, ROUND_DOWN, &inum); /* identical to "d.round(0, :down)" */
+    return inum;
+}
+
+static VALUE
+rounding_method(int argc, VALUE *argv, VALUE x, VALUE mode)
+{
+    Decimal *d;
+    VALUE scale, inum;
+
+    rb_scan_args(argc, argv, "01", &scale);
+    GetDecimal(x, d);
+    if (argc == 0) {
+	do_round(d, 0, mode, &inum);
+	return inum;
+    }
+    return WrapDecimal(do_round(d, NUM2LONG(scale), mode, 0));
+}
+
+static VALUE
+dec_truncate(int argc, VALUE *argv, VALUE x)
+{
+    return rounding_method(argc, argv, x, ROUND_DOWN);
+}
+
+static VALUE
+dec_floor(int argc, VALUE *argv, VALUE x)
+{
+    return rounding_method(argc, argv, x, ROUND_FLOOR);
+}
+
+static VALUE
+dec_ceil(int argc, VALUE *argv, VALUE x)
+{
+    return rounding_method(argc, argv, x, ROUND_CEILING);
+}
+
+static VALUE
+dec_round(int argc, VALUE *argv, VALUE x)
+{
+    Decimal *d;
+    VALUE vscale;
+    long scale = 0;
+    VALUE mode = ROUND_HALF_UP, tmpmode;
+
+    rb_scan_args(argc, argv, "02", &vscale, &tmpmode);
+    switch (argc) {
+      case 2:
+	Check_Type(mode, T_SYMBOL);
+	if (!valid_rounding_mode(mode)) {
+	    rb_raise(rb_eArgError, "invalid rounding mode %s",
+                     RSTRING(rb_inspect(mode))->ptr);
+	}
+        mode = tmpmode;
+	/* fall through */
+      case 1:
+	scale = NUM2LONG(vscale);
+	/* fall through */
+      default:
+	break;
+    }
+    GetDecimal(x, d);
+    if (scale == 0) {
+	VALUE inum;
+
+	do_round(d, scale, mode, &inum);
+	return inum;
+    }
+    return WrapDecimal(do_round(d, scale, mode, 0));
+}
+
+
+static VALUE
+dec_nan_p(VALUE num)
+{
+    Decimal *d;
+
+    GetDecimal(num, d);
+    return d == DEC_NaN ? Qtrue : Qfalse;
+}
+
+static VALUE
+dec_finite_p(VALUE num)
+{
+    Decimal *d;
+
+    GetDecimal(num, d);
+    return !DEC_IMMEDIATE_P(d) ? Qtrue : Qfalse;
+}
+
+static VALUE
+dec_infinite_p(VALUE num)
+{
+    Decimal *d;
+
+    GetDecimal(num, d);
+    if (d == DEC_PINF) return INT2FIX(1);
+    if (d == DEC_NINF) return INT2FIX(-1);
+    return Qnil;
+}
+
+void
+Init_decimal(void)
+{
+    cDecimal = rb_define_class("Decimal", rb_cNumeric);
+    eDomainError = rb_define_class_under(cDecimal, "DomainError",
+					 rb_eRangeError);
+    eArithmeticError = rb_define_class_under(cDecimal, "ArithmeticError",
+					     rb_eStandardError);
+
+    rb_define_global_function("Decimal", f_decimal, 1);
+
+    rb_define_alloc_func(cDecimal, dec_s_allocate);
+    rb_define_method(cDecimal, "initialize", dec_initialize, 1);
+
+    /* Singleton objects, should not be freed */
+    /* FIXME: register objects to prevent GC */
+    VALUE_PINF = Data_Wrap_Struct(cDecimal, NULL, NULL, DEC_PINF);
+    VALUE_NINF = Data_Wrap_Struct(cDecimal, NULL, NULL, DEC_NINF);
+    VALUE_NaN = Data_Wrap_Struct(cDecimal, NULL, NULL, DEC_NaN);
+    rb_global_variable(&VALUE_PINF);
+    rb_global_variable(&VALUE_NINF);
+    rb_global_variable(&VALUE_NaN);
+    
+#define DEF_ROUNDING_MODE(MODE, mode) do { \
+    ROUND_ ## MODE = ID2SYM(rb_intern(#mode)); \
+    rb_define_const(cDecimal, "ROUND_" #MODE, ROUND_ ## MODE); \
+} while (0)
+    DEF_ROUNDING_MODE(CEILING, ceiling);
+    DEF_ROUNDING_MODE(DOWN, down);
+    DEF_ROUNDING_MODE(FLOOR, floor);
+    DEF_ROUNDING_MODE(HALF_DOWN, half_down);
+    DEF_ROUNDING_MODE(HALF_EVEN, half_even);
+    DEF_ROUNDING_MODE(HALF_UP, half_up);
+    DEF_ROUNDING_MODE(UP, up);
+    DEF_ROUNDING_MODE(UNNECESSARY, unnecessary);
+
+#ifdef DEBUG
+    rb_define_method(cDecimal, "scale", dec_scale, 0);
+    rb_define_method(cDecimal, "unscaled_value", dec_unscaled_value, 0);
+#endif
+    rb_define_method(cDecimal, "strip_trailing_zeros",
+		     dec_strip_trailing_zeros, 0);
+    rb_define_method(cDecimal, "strip", dec_strip_trailing_zeros, 0);
+    
+    rb_define_method(cDecimal, "to_s", dec_to_s, 0);
+    rb_define_method(cDecimal, "inspect", dec_inspect, 0);
+    rb_define_method(cDecimal, "coerce", dec_coerce, 1);
+    rb_define_method(cDecimal, "-@", dec_uminus, 0);
+    rb_define_method(cDecimal, "+", dec_plus, 1);
+    rb_define_method(cDecimal, "-", dec_minus, 1);
+    rb_define_method(cDecimal, "*", dec_mul, 1);
+    rb_define_method(cDecimal, "divide", dec_divide, -1);
+#ifdef DEBUG
+    rb_define_method(cDecimal, "/", dec_div, 1);
+#endif
+    rb_define_method(cDecimal, "div", dec_idiv, 1);
+    rb_define_method(cDecimal, "%", dec_mod, 1);
+    rb_define_method(cDecimal, "modulo", dec_mod, 1);
+    rb_define_method(cDecimal, "divmod", dec_divmod, 1);
+    rb_define_method(cDecimal, "**", dec_pow, 1);
+    rb_define_method(cDecimal, "==", dec_eq, 1);
+    rb_define_method(cDecimal, "<=>", dec_cmp, 1);
+    rb_define_method(cDecimal, ">", dec_gt, 1);
+    rb_define_method(cDecimal, ">=", dec_ge, 1);
+    rb_define_method(cDecimal, "<", dec_lt, 1);
+    rb_define_method(cDecimal, "<=", dec_le, 1);
+    rb_define_method(cDecimal, "eql?", dec_eql, 1);
+    rb_define_method(cDecimal, "hash", dec_hash, 0);
+    rb_define_method(cDecimal, "to_f", dec_to_f, 0);
+    rb_define_method(cDecimal, "abs", dec_abs, 0);
+    rb_define_method(cDecimal, "zero?", dec_zero_p, 0);
+
+    rb_define_method(cDecimal, "to_i", dec_to_i, 0);
+    rb_define_method(cDecimal, "to_int", dec_to_i, 0);
+    rb_define_method(cDecimal, "truncate",  dec_truncate, -1);
+    rb_define_method(cDecimal, "floor", dec_floor, -1);
+    rb_define_method(cDecimal, "ceil", dec_ceil, -1);
+    rb_define_method(cDecimal, "round", dec_round, -1);
+
+    rb_define_method(cDecimal, "nan?", dec_nan_p, 0);
+    rb_define_method(cDecimal, "finite?", dec_finite_p, 0);
+    rb_define_method(cDecimal, "infinite?", dec_infinite_p, 0);
+}