Searched full:multiplying (Results 1 – 25 of 84) sorted by relevance
1234
46 * vector by different shift value. Hence it will be simulated by multiplying
24 * multiplying nr_events[PERF_EVENT_SAMPLE] by a frequency isn't possible to get
14 Family of multiplying DACs from Analog Devices
8 loop logic for multiplying the input clock to a desired output
45 real voltage by multiplying the reported value with (R1+R2)/R2, where R1 is the
39 * Scale a 64-bit delta by scaling and multiplying by a 32-bit fraction,
80 the amount of chunks used for the device. Multiplying both numbers is
61 /* If multiplying would overflow... */ in user2credits()
81 * pstride has both STRIDE_Y and STRIDE_C, but multiplying the whole in rpf_configure_stream()82 * of pstride by 2 is conveniently OK here as we are multiplying both in rpf_configure_stream()
291 * reports in units of uV, so convert by multiplying by 4880. */ in ds2760_battery_read_status()297 * class reports in units of µA, so convert by multiplying by 625. */ in ds2760_battery_read_status()311 * multiplying by .125 * 10 = 1.25. */ in ds2760_battery_read_status()
5 * This generator generates an IV based on a sequence number by multiplying
139 * This can be calculated by multiplying the page number by 2.5. in snd_sof_create_page_table()
349 * - all other values are converted to jiffies by either multiplying397 * - all other values are converted to jiffies by either multiplying
66 * so divide the timebase freq instead of multiplying tmp in period_to_sec()
81 * So it's equivalent to multiplying by 0.25 * 1000 = 250. in temp1_input_show()
97 /* If multiplying would overflow... */ in user2credits()
114 /* Generate partial products by multiplying each bit in the multiplier (tnum a)
201 * Multiplying by ratio before the division has better in cpu_khz_from_msr()
31 * multiplying 255 by more than MAXINT/255. The sum will overflow earlier
288 /* compute the log10(N) by multiplying log2(N) with log10(2). in qm_log10()
259 * Size may be too big for multiplying pi->relative_throughput in st_compare_load()
220 * Now do the final 32-bit fold by multiplying the rightmost word
