aboutsummaryrefslogtreecommitdiffstats
path: root/litmus/gpu_affinity.c
diff options
context:
space:
mode:
authorGlenn Elliott <gelliott@cs.unc.edu>2013-02-20 11:45:17 -0500
committerGlenn Elliott <gelliott@cs.unc.edu>2013-02-20 11:45:17 -0500
commit4d628f66d82caa8514db22cba00f1a6d0bf64d40 (patch)
treeb288e253820c9f3309d731218bb5b2a4ab998f74 /litmus/gpu_affinity.c
parentd6ddecb0d2cee3880a2785c2b4345336855dc6e5 (diff)
compiler junk
Diffstat (limited to 'litmus/gpu_affinity.c')
-rw-r--r--litmus/gpu_affinity.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/litmus/gpu_affinity.c b/litmus/gpu_affinity.c
index f4bfb1a67097..e051fb7909a0 100644
--- a/litmus/gpu_affinity.c
+++ b/litmus/gpu_affinity.c
@@ -39,7 +39,7 @@ static fp_t update_estimate(feedback_est_t* fb, fp_t a, fp_t b, lt_t observed)
39} 39}
40#endif 40#endif
41 41
42lt_t varience(lt_t nums[], const lt_t avg, const uint16_t count) 42static lt_t varience(lt_t nums[], const lt_t avg, const uint16_t count)
43{ 43{
44 /* brute force: takes about as much time as incremental running methods when 44 /* brute force: takes about as much time as incremental running methods when
45 * count < 50 (on Bonham). Brute force also less prone to overflow. 45 * count < 50 (on Bonham). Brute force also less prone to overflow.
@@ -54,7 +54,7 @@ lt_t varience(lt_t nums[], const lt_t avg, const uint16_t count)
54 return sqdeviations/count; 54 return sqdeviations/count;
55} 55}
56 56
57lt_t isqrt(lt_t n) 57static lt_t isqrt(lt_t n)
58{ 58{
59 /* integer square root using babylonian method 59 /* integer square root using babylonian method
60 * (algo taken from wikipedia */ 60 * (algo taken from wikipedia */