aboutsummaryrefslogtreecommitdiff
path: root/fs/ncpfs/getopt.h
diff options
context:
space:
mode:
authorJustin Madru <jdm64@gawab.com>2009-12-18 15:52:53 -0800
committerGreg Kroah-Hartman <gregkh@suse.de>2010-03-03 16:42:33 -0800
commit8c172dde41db666f7a5f3bb62205da017e23c0ec (patch)
treeee8f478264aa66e738df8b92cccedecb309816af /fs/ncpfs/getopt.h
parent096417e087a391dc78780cc1843369a521635522 (diff)
Staging: s5k3e2fx.c: simplify complexity by factoring
the code was looping, setting s_move[i] to the following calculations if (actual_step>= 0) s_move[i] = ((((i + 1) * gain + 0x200) - (i * gain + 0x200)) / 0x400); else s_move[i] = ((((i + 1) * gain - 0x200) - (i * gain - 0x200)) / 0x400); but, this code reduces to the expression s_move[i] = gain>> 10; The reason for the complexity was to generate a step function with integer division and rounding to land on specific values. But these calculations can be simplified to the following code: gain = ((actual_step<< 10) / 5)>> 10; for (i = 0; i<= 4; i++) s_move[i] = gain; Signed-off-by: Justin Madru<jdm64@gawab.com> Reviewed-by: Ray Lee<ray-lk@madrabbit.org> Signed-off-by: Greg Kroah-Hartman <gregkh@suse.de>
Diffstat (limited to 'fs/ncpfs/getopt.h')
0 files changed, 0 insertions, 0 deletions