Home	Sort by: relevance | last modified time | path

Full Search in project(s): src xsrc Definition Symbol File Path History   | | Help

    Searched defs:REMAINDER (Results 1 - 8 of 8) sorted by relevancy

/src/external/gpl3/gcc/dist/libdecnumber/
decBasic.c	55 #define REMAINDER 0x40000000 /* .. */ 171 /* op is one of DIVIDE, REMAINDER, DIVIDEINT, or REMNEAR. */ 209 if (op&(REMAINDER|REMNEAR)) return decInvalid(result, set); /* as is rem */ 215 if (op&(REMAINDER|REMNEAR)) return decCanonical(result, dfl); 231 if (op&(REMAINDER|REMNEAR)) return decInvalid(result, set); /* bad rem */ 245 if (!(op&DIVIDE)) { /* a remainder */ 456 /* to get the remainder (which will be <DIVBASE)) */ 590 /* Is DIVIDEINT or a remainder; there is more to do -- first form */ 664 /* Have a remainder to calculate */ 787 /* quotient/remainder has to be calculated for base-billion (1E+9). *     [all...]
decNumber.c	192 #define REMAINDER 0x40 /* .. */ 400 /* now low has the lsd, hi the remainder */ 437 /* now low has the lsd, hi the remainder */ 819 msudigs=MSUDIGITS(set->digits); /* [faster than remainder] */ 1212 msudigs=MSUDIGITS(set->digits); /* [faster than remainder] */ 1827 msudigs=MSUDIGITS(set->digits); /* [faster than remainder] */ 2385 /* decNumberRemainder -- divide and return remainder */ 2399 decDivideOp(res, lhs, rhs, set, REMAINDER, &status); 2408 /* decNumberRemainderNear -- divide and return remainder from nearest */ 2410 /* This computes C = A % B, where % is the IEEE remainder operator *     [all...]
/src/external/gpl3/gcc.old/dist/libdecnumber/
decBasic.c	55 #define REMAINDER 0x40000000 /* .. */ 171 /* op is one of DIVIDE, REMAINDER, DIVIDEINT, or REMNEAR. */ 209 if (op&(REMAINDER|REMNEAR)) return decInvalid(result, set); /* as is rem */ 215 if (op&(REMAINDER|REMNEAR)) return decCanonical(result, dfl); 231 if (op&(REMAINDER|REMNEAR)) return decInvalid(result, set); /* bad rem */ 245 if (!(op&DIVIDE)) { /* a remainder */ 456 /* to get the remainder (which will be <DIVBASE)) */ 590 /* Is DIVIDEINT or a remainder; there is more to do -- first form */ 664 /* Have a remainder to calculate */ 787 /* quotient/remainder has to be calculated for base-billion (1E+9). *     [all...]
decNumber.c	192 #define REMAINDER 0x40 /* .. */ 400 /* now low has the lsd, hi the remainder */ 437 /* now low has the lsd, hi the remainder */ 819 msudigs=MSUDIGITS(set->digits); /* [faster than remainder] */ 1212 msudigs=MSUDIGITS(set->digits); /* [faster than remainder] */ 1827 msudigs=MSUDIGITS(set->digits); /* [faster than remainder] */ 2385 /* decNumberRemainder -- divide and return remainder */ 2399 decDivideOp(res, lhs, rhs, set, REMAINDER, &status); 2408 /* decNumberRemainderNear -- divide and return remainder from nearest */ 2410 /* This computes C = A % B, where % is the IEEE remainder operator *     [all...]
/src/external/gpl3/gdb/dist/libdecnumber/
decBasic.c	55 #define REMAINDER 0x40000000 /* .. */ 171 /* op is one of DIVIDE, REMAINDER, DIVIDEINT, or REMNEAR. */ 209 if (op&(REMAINDER|REMNEAR)) return decInvalid(result, set); /* as is rem */ 215 if (op&(REMAINDER|REMNEAR)) return decCanonical(result, dfl); 231 if (op&(REMAINDER|REMNEAR)) return decInvalid(result, set); /* bad rem */ 245 if (!(op&DIVIDE)) { /* a remainder */ 456 /* to get the remainder (which will be <DIVBASE)) */ 590 /* Is DIVIDEINT or a remainder; there is more to do -- first form */ 664 /* Have a remainder to calculate */ 787 /* quotient/remainder has to be calculated for base-billion (1E+9). *     [all...]
decNumber.c	192 #define REMAINDER 0x40 /* .. */ 400 /* now low has the lsd, hi the remainder */ 437 /* now low has the lsd, hi the remainder */ 819 msudigs=MSUDIGITS(set->digits); /* [faster than remainder] */ 1212 msudigs=MSUDIGITS(set->digits); /* [faster than remainder] */ 1827 msudigs=MSUDIGITS(set->digits); /* [faster than remainder] */ 2385 /* decNumberRemainder -- divide and return remainder */ 2399 decDivideOp(res, lhs, rhs, set, REMAINDER, &status); 2408 /* decNumberRemainderNear -- divide and return remainder from nearest */ 2410 /* This computes C = A % B, where % is the IEEE remainder operator *     [all...]
/src/external/gpl3/gdb.old/dist/libdecnumber/
decBasic.c	55 #define REMAINDER 0x40000000 /* .. */ 171 /* op is one of DIVIDE, REMAINDER, DIVIDEINT, or REMNEAR. */ 209 if (op&(REMAINDER|REMNEAR)) return decInvalid(result, set); /* as is rem */ 215 if (op&(REMAINDER|REMNEAR)) return decCanonical(result, dfl); 231 if (op&(REMAINDER|REMNEAR)) return decInvalid(result, set); /* bad rem */ 245 if (!(op&DIVIDE)) { /* a remainder */ 456 /* to get the remainder (which will be <DIVBASE)) */ 590 /* Is DIVIDEINT or a remainder; there is more to do -- first form */ 664 /* Have a remainder to calculate */ 787 /* quotient/remainder has to be calculated for base-billion (1E+9). *     [all...]
decNumber.c	192 #define REMAINDER 0x40 /* .. */ 400 /* now low has the lsd, hi the remainder */ 437 /* now low has the lsd, hi the remainder */ 819 msudigs=MSUDIGITS(set->digits); /* [faster than remainder] */ 1212 msudigs=MSUDIGITS(set->digits); /* [faster than remainder] */ 1827 msudigs=MSUDIGITS(set->digits); /* [faster than remainder] */ 2385 /* decNumberRemainder -- divide and return remainder */ 2399 decDivideOp(res, lhs, rhs, set, REMAINDER, &status); 2408 /* decNumberRemainderNear -- divide and return remainder from nearest */ 2410 /* This computes C = A % B, where % is the IEEE remainder operator *     [all...]

Completed in 70 milliseconds

Indexes created Thu Jul 23 00:25:05 UTC 2026