14:53:55Bikei have a setup now so that operations on bit arrays with displaced-index-offset = 0 (ie most of them) use a simple function that should be insensitive to the "word" size
14:54:13Bikewith nonzero d-i-o they loop over the bits, which will be enormously slower
17:59:32Bikeit started working when i used (value & 1) instead of value in one place, but i don't see what would be passing something other than 1 or 0 as value anyway. this is kind of worrying.
18:09:21Bikewhat's the incantation to prevent clang from optimizing a function, so that I can actually look at variables? [[nooptimize]] or something?
18:34:57stassatsi wonder what constitutes non-optimization, the first ir pass translated into assembly?
19:02:03Bikethe argument is always a bit like it should be
19:02:14Bikemaybe there's some optimization nuttery messing it up that & prevents
19:28:19Bikeother than that weirdness everything seems to work, so maybe now i can get nibble arrays working
19:57:37Bikei see cando uses some custom bit vector functions. could probably straighten that up a little bit
19:58:00Bikee.g. SimpleBitVector_inPlaceOr is covered by core__sbv_bit_ior which i already wrote
20:09:07Bikeand there's lowestIndex which is find first set or whatever, and isZero, and ranged eq, all of those could be implemented without checking individual bits