datatypes/int/sc_nbcommon.inc

3   Licensed to Accellera Systems Initiative Inc. (Accellera) under one or
6   Accellera licenses this file to you under the Apache License, Version 2.0
12   Unless required by applicable law or agreed to in writing, software
22   sc_nbcommon.cpp -- Functions common to both sc_signed and sc_unsigned.
28                      to ensure only one version of each function, regardless
29                      of the class that they interface to.
319 // Cases to consider when computing u + v:
501 // Cases to consider when computing u + v:
701 // Cases to consider when computing u * v:
841 // Cases to consider when finding the quotient q = floor(u/v):
999 // Cases to consider when finding the remainder r = u % v:
1141 // Cases to consider when computing u & v:
1286 // Cases to consider when computing u | v:
1424 // Cases to consider when computing u ^ v:
2216 // Convert to int64, long, or int.
2255 // Convert to unsigned int64, unsigned long or unsigned
2381 // Convert to double.
2402 // bounds, return 1/0 according to the sign of the number by assuming
2459   digit[digit_num] &= DIGIT_MASK; // Needed to zero the overflow bits.
2476   digit[digit_num] &= DIGIT_MASK; // Needed to zero the overflow bits.
2497   // Initialize buf to zero.
2515     // If sgn is negative, we have to convert digit to its 2's
2518     // it on buf. Thus, we have to do the complementation on a copy of
2530   // Copy the bits from digit to buf. The division and mod operations
2531   // below can be converted to addition/subtraction and comparison
2559   // Initialize digit to zero.
2562   // Copy the bits from buf to digit.
2656   // make sure that l and r point to the bits of u
2683   // The number of bits up to and including l and r, respectively.
2733     // will be used as a temporary store. The following code tries to
2735     // div operators. Since these operators are function calls to
2737     // reversing is "read bits out of d from left to right and push
2754     // Insertion to digit will always occur at the left end.
2804   // make sure that l and r point to the bits of u
2831   // The number of bits up to and including l and r, respectively.
2881     // will be used as a temporary store. The following code tries to
2883     // div operators. Since these operators are function calls to
2885     // reversing is "read bits out of d from left to right and push
2902     // Insertion to digit will always occur at the left end.
2939   // Save the current setting, and set the base to decimal.
2967 // Checks to see if bit_num is out of bounds.