| commit | ac668c69709c7d927015c5cf3d9e87bf4eaaf57d | [log] [tgz] |
|---|---|---|
| author | Dan Williams <dan.j.williams@intel.com> | Tue Jun 07 18:50:55 2011 -0700 |
| committer | Dan Williams <dan.j.williams@intel.com> | Sun Jul 03 04:04:51 2011 -0700 |
| tree | 16a42117d260a86b8217d266ab65b25438c48e06 | |
| parent | 9b917987fd16d0687afe550a02f68099419f5d43 [diff] |
isci: cleanup/optimize pool implementation The circ_buf macros are ~6% faster, as measured by perf, because they take advantage of power-of-two math assumptions i.e. no test and branch for rollover. Their semantics are clearer than the hidden side effects in pool.h (like sci_pool_get() which hides an assignment). Signed-off-by: Dan Williams <dan.j.williams@intel.com>