| Title | Bit table scanning is unoptimized |
| Status | open |
| Priority | nice |
| Assigned user | Gareth Rees |
| Organization | Ravenbrook |
| Description | We have bit table scanning operations in a couple of important places: * Scanning part of an AMC nailboard to see if an object is nailed. * Allocation in an AMS, AWL or LO segment. (And in AMC if we implement the plan in job003797.) These operations could be sped up using architecture- and compiler-specific features. |
| Analysis | See [1] for a summary of bit-scanning compiler features. |
| How found | unknown |
| Evidence | [1] <http://en.wikipedia.org/wiki/Find_first_set> |
| Created by | Gareth Rees |
| Created on | 2014-05-16 21:01:48 |
| Last modified by | Gareth Rees |
| Last modified on | 2014-05-16 21:01:48 |
| History | 2014-05-16 GDR Created. |