Hacker News new | past | comments | ask | show | jobs | submit login

It looks like it can use both traditional "tagged pointer" alignment bits AND virtual address bits...



I see that in the readme but I don't see where that's handled in the bitmasking. It appears to be universally masking high-order bits here: https://github.com/irrustible/ointers/blob/1961f75bbb9818d72...


Read the function above the function you linked to.


Oh that's frightening they shift the entire pointer by the alignment


Why? Alignment causes some low–order bits to be zero. Shifting the pointer to the right drops those zeros on the floor, leaving high–order bits zero (or sign extended or whatever). Then you can put your tag up there instead. Shifting the value left by the same amount drops the tag and recovers the same pointer for use.


My guideline with pointer tricks is: if you're not just masking bits it's too complicated for real use.


Any idea why it's preferred to do the alignment route instead of storing the bits in the upper part of the pointer & masking?


Personal preference, architectural differences, phase of the moon, etc, etc.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: