C PROGRAM TO CONVERT ASCII TO BCD CODE

As of 7.2, RPG allows you to specify the CCSID of alphanumeric (character) variables. On a recent project I discovered a new way to convert data from one character set to another. These APIs do a great job, but to make them any more complicated we’d have to get the government involved.

C PROGRAM TO CONVERT ASCII TO BCD CODE

IBM’s translation tables were good for their time, but times have changed.Ī modern solution is the iconv family of code conversion APIs, which use CCSIDs to convert data from one character set to another.

In ancient days, RPG programmers would call the QDCXLATE API, which uses a translation table, to convert EBCDIC to ASCII. Dealing with ASCII data has not been a trivial experience for RPG programmers, but IBM i 7.2 adds a feature that helps immensely. Decrease the original value to place the next lowest digit into proper position for extraction.The system we love so well has a long love affair with the EBCDIC collating sequence, but most of the world runs on ASCII and Unicode. Compute the last part of the information and place it into the result location. Convert from an integer to a BCD value. #include Ĭonstexpr int nMaxSleep = 10000 // Wait enough time (in ms) to check out the boundry cases before continuing. I know this has been previously answered but I've extended this for unsigned ints of different sizes using a template to build the specific code. It appears that it's impossible, even with 64-bit ints, to shift left more than 32 bits, but fortunately, it's entirely possible to multiply by some factor of 16 - which happily has the desired effect. Printf(' Running benchmarks for %u loops.', LOOP_KNT) Printf(' ET for bcd_to_ui32(uint_16_to_bcd(t)) was %f milliseconds. Printf(' Running benchmarks for %u loops.', LOOP_KNT) -Ĭonst unsigned long LOOP_KNT = 3400000000 // set to clock frequencey of your CPU Shift *= 16 // weirdly, it's not possible to left shift more than 32 bits Very convenient and fixed width, but not very space efficient for large tables. I used an uint64_t to store the BCD here. 34 clocks for packing uint32_t into BCD.11 clocks for unpacking BCD to uint32_t.If you want to represent '0' as the single '0' decimal digit rather than the empty digit-string (either is valid), then you'd check specifically for x=0. Keeping the least significant digit as the first simplifies digit-wise arithmetic ops in the case that you don't use a fixed number of digits. There's also no reason to reverse at all if you can remember the fact that the 0th digit is the least significant and reverse only on input/output. Of course, if you know the width of your int type, you may prefer fixed length arrays.

skip the above line if you don't mind that ret is the least significant digit Ret.push_back(x-(d*10)) // may be faster than x%10 skip the above line if you don't mind an empty vector for '0' With that in mind, here's how I'd get the decimal digits of an unsigned int: #include It will also fit in ceil(n/3) = floor((n+2)/3)) decimal digits, since 2^3=8 is less than 10. Usually when someone says they want to convert from decimal to BCD, they're talking about more than one decimal digit.īCD is often packed into two decimal digits per byte (because 0.9 fit in 4 bits, as you've shown), but I think it's more natural to use an array of bytes, one per decimal digit.Īn n-bit unsigned binary number will fit into ceil(n*log_2(10)) = ceil(n/log10(2)) decimal digits.

C program to convert ascii to bcd