1 USING: bit-arrays classes.struct math sequences tools.gc-decode
5 IN: tools.gc-decode.tests
14 B{ 239 1 } byte-array>bit-array
17 { ?{ t t t t t t t t } } [ B{ 255 } byte-array>bit-array ] unit-test
21 \ effects:<effect> word>gc-info scrub-bits
23 ?{ t t t f t t t t } ! 64-bit
24 ?{ t t t f f f f f t t t t } ! 32-bit
31 \ decode-gc-maps word>gc-info scrub-bits
36 \ effects:<effect> decode-gc-maps empty?
40 \ + decode-gc-maps empty?
45 \ decode-gc-maps decode-gc-maps
50 \ llvm.types:resolve-types word>gc-info base-pointer-groups
53 { -1 -1 -1 -1 -1 -1 -1 -1 }
54 { -1 -1 -1 -1 -1 -1 -1 -1 }
55 { -1 -1 -1 -1 -1 -1 -1 -1 }
56 { -1 -1 -1 -1 -1 -1 -1 4 }
57 { -1 -1 -1 -1 -1 -1 -1 4 }
58 { -1 -1 -1 -1 -1 -1 -1 -1 }
61 { -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 }
62 { -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 }
63 { -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 }
64 { -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 8 }
65 { -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 8 }
66 { -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 }
72 ! One of the few words that has derived roots.
74 \ llvm.types:resolve-types word>gc-info
76 S{ gc-info f 0 2 2 1 5 8 6 } ! 64-bit
77 S{ gc-info f 0 2 2 1 9 12 6 } ! 32-bit