

  BCDASM performs huge integer math using binary-coded-decimals.

  Occasionally, I want to use big integers in my programs so I
  sat down and wrote BCDASM. The primary goals were to supply a
  basic set of integer math routines, to look into the formats
  and general behavior of binary-coded decimals, and to target
  a large number of x86 memory models and language conventions
  with minimum effort.


  If you're interested in code that handles 48K+ digit integers
  and can be used with assembly, C, or Pascal right out of the
  .zip, you will proabably find what you need in BCDASM.

  If you're looking for fast code, look elsewhere. The routines
  here aren't slow or very fast but the BCD format simply isn't
  the best choice for speed.

  If you want to see how multi-digit numbers can be processed,
  how multi-memory-model assembly can be done using Borland's
  Turbo Assembler, or just some BCD basics, take a look inside.


  Here's what I have to offer:
  - 16/32-bit routines to do huge packed signed BCDs: add, sub,
    imul, idiv, mod, shl, shr, cmp, mov, load, sprintf, convert
  - full commented source code, assembles in all memory models
    (tiny thru tchuge and flat) supporting most languages
  - full documentation
  - ASM/C header and .LIB files, Pascal unit and .TPU files
  - demonstration program, and ASM/C/Pascal examples


  To get started, try doc\files.txt or demo\trybcd.exe. 
  All the .bat files assume that TASM is installed.


  June, 1997
  Morten Elling
