Searched refs:sqrt (Results 1 – 21 of 21) sorted by relevance
11 sqrt(rcnt*7230970)) ^ 7230716) ^ \
23 (void)sqrt(rand()); in __sqrtloop()
328 loop_stddev = sqrt(loop_stddev); in htab_mem_report_final() 329 mem_stddev = sqrt(mem_stddev); in htab_mem_report_final()
235 creates_stddev = sqrt(creates_stddev); in report_final()
234 *events_stddev = sqrt(*events_stddev); in compute_events()
71 sqrt(i); in main()
27 | acos(X) = 2 * atan( sqrt(z) ).
26 | z := sqrt( [1-X][1+X] )
66 (3) The sqrt function has been tuned to get good performance. It is based189 sqrt() 128.7 crashed 145.2 227.0215 sqrt() 195.1 4732.5237 The following table compares the emulator accuracy for the sqrt(),250 sqrt(x) 1 .. 2 64.1 63.2
143 *r_stddev = sqrt(r2_sum / n); in regress()
271 also creates another kthread for each sqrt(nr_cpu_ids) CPUs279 The sqrt(nr_cpu_ids) grouping may be overridden using the282 sqrt(nr_cpu_ids) can be a bit of a blunt instrument.
32 12 significant bits. Mode 2 is a simple sqrt-like companding scheme with 6 PWL
206 bs->mean / 1000000, sqrt((bs->mean / 1000000) / bs->nr)); in test_print_stats()
87 return 100 * sqrt(variance / stat->count) / average; in rel_stddev()
54 * sqrt(n)67 return sqrt(variance_mean); in stddev_stats()
95 * highest accurate speed: sqrt(clock*100)
597 2^31*sqrt(`a'/2^31), where `a' is considered an integer. If bit 0 of `aExp'598 is 0, the integer returned approximates 2^31*sqrt(`a'/2^30). In either
237 possible value of ABS_MT_TOUCH_MAJOR is sqrt(X^2 + Y^2), the diagonal [#f4]_.
585 1 kHz tone that has an amplitude of sqrt(2).
6615 # z := sqrt( [1-X][1+X] ) #6717 # acos(X) = 2 * atan( sqrt(z) ). #6752 lea (%sp),%a0 # pass ptr to sqrt15524 # For norms/denorms, scale the exponents such that a sqrt #
6509 # z := sqrt( [1-X][1+X] ) #6611 # acos(X) = 2 * atan( sqrt(z) ). #6646 lea (%sp),%a0 # pass ptr to sqrt