Searched refs:division (Results 1 - 8 of 8) sorted by relevance

/external/qemu/
H A Dcurses_keys.h435 { "division", 0x0f7 },
H A Dmonitor.c2249 expr_error(mon, "division by zero");
/external/sonivox/arm-wt-22k/lib_src/
H A Deas_smf.c247 /*lint -e{704} use shift instead of division */
1046 EAS_U16 division; local
1075 /* get the time division */
1076 if ((result = EAS_HWGetWord(hwInstData, pSMFData->fileHandle, &division, EAS_TRUE)) != EAS_SUCCESS)
1081 if (!division || division & 0x8000)
1084 pSMFData->ppqn = (division & 0x7fff);
/external/sonivox/arm-fm-22k/lib_src/
H A Deas_smf.c247 /*lint -e{704} use shift instead of division */
1046 EAS_U16 division; local
1071 /* get the time division */
1072 if ((result = EAS_HWGetWord(hwInstData, pSMFData->fileHandle, &division, EAS_TRUE)) != EAS_SUCCESS)
1077 if (division & 0x8000)
1080 pSMFData->ppqn = (division & 0x7fff);
/external/sonivox/arm-hybrid-22k/lib_src/
H A Deas_smf.c247 /*lint -e{704} use shift instead of division */
1046 EAS_U16 division; local
1071 /* get the time division */
1072 if ((result = EAS_HWGetWord(hwInstData, pSMFData->fileHandle, &division, EAS_TRUE)) != EAS_SUCCESS)
1077 if (division & 0x8000)
1080 pSMFData->ppqn = (division & 0x7fff);
/external/dropbear/libtommath/
H A Dbn.tex1138 To perform a complete and general integer division with remainder use the following function.
1304 a decent speedup over straight division. First a $\mu$ value must be precomputed with the following function.
1408 Which calculates $a = R$ for the odd moduli $b$ without using multiplication or division.
1633 You should always still perform a trial division before a Miller-Rabin test though.
1640 This will perform a trial division followed by $t$ rounds of Miller-Rabin tests on $a$ and store the result in $result$.
/external/oprofile/events/i386/nehalem/
H A Devents33 event:0x14 counters:0,1,2,3 um:arith minimum:6000 name:ARITH : Counts division cycles and number of multiplies. Includes integer and FP, but excludes DPPS/MPSAD.
/external/dropbear/libtomcrypt/
H A Dcrypt.tex4884 two phases. First it will perform trial division by the first few primes. Second it will perform eight rounds of the
4890 When making random primes the trial division step is in fact an optimized implementation of \textit{Implementation of Fast RSA Key Generation on Smart Cards}\footnote{Chenghuai Lu, Andre L. M. dos Santos and Francisco R. Pimentel}.

Completed in 155 milliseconds