dt/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.
300 // Cases to consider when computing u + v:
482 // Cases to consider when computing u + v:
656 // Cases to consider when computing u * v:
778 // Cases to consider when finding the quotient q = floor(u/v):
902 // Cases to consider when finding the remainder r = u % v:
1012 // Cases to consider when computing u    &v:
1120 // Cases to consider when computing u | v:
1226 // Cases to consider when computing u ^ v:
1931 // Convert to int64, long, or int.
1966 // Convert to unsigned int64, unsigned long or unsigned
2059 // Convert to double.
2078 // bounds, return 1/0 according to the sign of the number by assuming
2130     digit[digit_num] &= DIGIT_MASK; // Needed to zero the overflow bits.
2147     digit[digit_num] &= DIGIT_MASK; // Needed to zero the overflow bits.
2167     // Initialize buf to zero.
2183         // If sgn is negative, we have to convert digit to its 2's
2186         // it on buf. Thus, we have to do the complementation on a copy of
2195     // Copy the bits from digit to buf. The division and mod operations
2196     // below can be converted to addition/subtraction and comparison
2222     // Initialize digit to zero.
2225     // Copy the bits from buf to digit.
2311     // make sure that l and r point to the bits of u
2338     // The number of bits up to and including l and r, respectively.
2380         // will be used as a temporary store. The following code tries to
2382         // div operators. Since these operators are function calls to
2384         // reversing is "read bits out of d from left to right and push
2402         // Insertion to digit will always occur at the left end.
2450     // make sure that l and r point to the bits of u
2477     // The number of bits up to and including l and r, respectively.
2519         // will be used as a temporary store. The following code tries to
2521         // div operators. Since these operators are function calls to
2523         // reversing is "read bits out of d from left to right and push
2541         // Insertion to digit will always occur at the left end.
2577     // Save the current setting, and set the base to decimal.
2600 // Checks to see if bit_num is out of bounds.