Dan Williams
ac668c6970
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>
2011-07-03 04:04:51 -07:00
2011-05-29 11:19:16 -07:00
2011-05-26 10:33:34 +01:00
2011-05-26 17:12:32 -07:00
2011-06-04 08:11:26 +09:00
2011-06-04 06:33:24 +09:00
2011-06-02 05:29:19 +09:00
2011-05-30 11:14:13 +09:30
2011-05-31 15:26:42 +09:00
2011-05-29 11:18:09 -07:00
2011-06-02 14:40:43 +09:00
2011-05-26 17:12:37 -07:00
2011-05-29 14:06:42 -07:00
2011-06-04 10:34:28 -07:00
2011-05-26 19:45:05 +02:00
2011-06-02 05:29:19 +09:00
2011-05-26 12:13:57 -07:00
2011-06-04 06:33:24 +09:00
2011-06-04 06:33:24 +09:00
2011-05-26 19:45:46 +02:00
2011-05-29 13:03:13 +01:00
2011-05-27 10:14:22 -07:00
2011-05-28 08:38:55 +02:00
2011-06-04 06:33:24 +09:00
2011-05-27 19:51:32 -07:00
2011-05-27 20:06:53 -07:00
2011-06-04 23:16:00 +09:00
2011-05-26 13:19:00 -07:00
2011-06-02 05:48:50 +09:00
2011-05-29 11:44:33 -07:00
2011-05-27 10:12:35 -07:00
2011-05-27 10:49:30 +01:00
2011-05-26 17:12:33 -07:00
2011-05-26 09:48:24 +02:00
2011-07-03 04:04:51 -07:00
2011-05-27 01:23:54 -06:00
2011-05-26 13:19:00 -07:00
2011-06-04 06:33:24 +09:00
2011-05-28 12:36:15 -07:00
2011-05-30 11:14:15 +09:30
2011-05-26 17:12:32 -07:00
2011-05-30 11:14:16 +09:30
2011-05-26 17:12:38 -07:00
2011-05-26 19:45:06 +02:00
2011-05-26 10:50:56 -07:00
2011-05-28 12:35:15 -07:00
ac668c6970