1 ! Copyright (C) 2008 Doug Coleman.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: assocs help.markup help.syntax math sequences ;
7 { $values { "values..." "a series of objects" } { "bitspec" "an array" } { "n" integer } }
8 { $description "Constructs an integer from a series of values on the stack together with a bit field specifier, which is an array whose elements have one of the following shapes:"
10 { { $snippet "{ constant shift }" } " - the resulting bit field is bitwise or'd with " { $snippet "constant" } " shifted to the right by " { $snippet "shift" } " bits" }
11 { { $snippet "{ word shift }" } " - the resulting bit field is bitwise or'd with " { $snippet "word" } " applied to the top of the stack; the result is shifted to the right by " { $snippet "shift" } " bits" }
12 { { $snippet "shift" } " - the resulting bit field is bitwise or'd with the top of the stack; the result is shifted to the right by " { $snippet "shift" } " bits" }
14 "The bit field specifier is processed left to right, so stack values should be supplied in reverse order." }
16 "Consider the following specification:"
18 { "bits 0-10 are set to the value of " { $snippet "x" } }
19 { "bits 11-14 are set to the value of " { $snippet "y" } }
20 { "bit 15 is always on" }
21 { "bits 16-20 are set to the value of " { $snippet "fooify" } " applied to " { $snippet "z" } }
23 "Such a bit field construction can be specified with a word like the following:"
25 ": baz-bitfield ( x y z -- n )"
36 { $values { "m" integer } { "n" integer } { "m'" integer } }
37 { $description "Keep only n bits from the integer m." }
38 { $example "USING: math.bitwise prettyprint ;" "HEX: 123abcdef 16 bits .h" "cdef" } ;
41 { $values { "x" integer } { "s" "a shift integer" } { "w" "a wrap integer" } { "y" integer }
43 { $description "Roll n by s bits to the left, wrapping around after w bits." }
45 { $example "USING: math.bitwise prettyprint ;" "1 -1 32 bitroll .b" "10000000000000000000000000000000" }
46 { $example "USING: math.bitwise prettyprint ;" "HEX: ffff0000 8 32 bitroll .h" "ff0000ff" }
51 { "x" integer } { "n" integer }
54 { $description "Returns " { $link t } " if the nth bit is set to zero." }
56 { $example "USING: math.bitwise prettyprint ;"
57 "HEX: ff 8 bit-clear? ."
60 { $example "" "USING: math.bitwise prettyprint ;"
61 "HEX: ff 7 bit-clear? ."
66 { bit? bit-clear? set-bit clear-bit } related-words
73 { $description "Returns the number of set bits as an integer." }
75 { $example "USING: math.bitwise prettyprint ;"
79 { $example "USING: math.bitwise prettyprint ;"
87 { "n" integer } { "s" integer }
90 { $description "Rolls the number " { $snippet "n" } " by " { $snippet "s" } " bits to the left, wrapping around after 32 bits." }
92 { $example "USING: math.bitwise prettyprint ;"
93 "HEX: 1 10 bitroll-32 .h"
96 { $example "USING: math.bitwise prettyprint ;"
97 "HEX: 1 -10 bitroll-32 .h"
104 { "n" integer } { "s" "a shift integer" }
107 { $description "Rolls the number " { $snippet "n" } " by " { $snippet "s" } " bits to the left, wrapping around after 64 bits." }
109 { $example "USING: math.bitwise prettyprint ;"
110 "HEX: 1 10 bitroll-64 .h"
113 { $example "USING: math.bitwise prettyprint ;"
114 "HEX: 1 -10 bitroll-64 .h"
119 { bitroll bitroll-32 bitroll-64 } related-words
123 { "x" integer } { "n" integer }
126 { $description "Sets the nth bit of " { $snippet "x" } " to zero." }
128 { $example "USING: math.bitwise kernel prettyprint ;"
129 "HEX: ff 7 clear-bit .h"
136 { "values" sequence }
138 { $description "Constructs a constant flag value from a sequence of integers or words that output integers. The resulting constant is computed at compile-time, which makes this word as efficient as using a literal integer." }
140 { $example "USING: math.bitwise kernel prettyprint ;"
143 "{ HEX: 20 x BIN: 100 } flags .h"
149 { $values { "symbols" sequence } { "assoc" assoc } { "flag-bits" integer } }
150 { $description "Constructs an integer value by mapping the values in the " { $snippet "symbols" } " sequence to integer values using " { $snippet "assoc" } " and " { $link bitor } "ing the values together." }
152 { $example "USING: math.bitwise prettyprint ui.gadgets.worlds ;"
154 "CONSTANT: window-controls>flags H{"
155 " { close-button 1 }"
156 " { minimize-button 2 }"
157 " { maximize-button 4 }"
158 " { resize-handles 8 }"
159 " { small-title-bar 16 }"
160 " { normal-title-bar 32 }"
162 "{ resize-handles close-button small-title-bar } window-controls>flags symbols>flags ."
169 { "x" integer } { "n" integer }
172 { $description "After the operation, only the bits that were set in both the mask and the original number are set." }
174 { $example "USING: math.bitwise kernel prettyprint ;"
175 "BIN: 11111111 BIN: 101 mask .b"
182 { "m" integer } { "n" integer }
185 { $description "Turns off all bits besides the nth bit." }
187 { $example "USING: math.bitwise kernel prettyprint ;"
188 "HEX: ff 2 mask-bit .b"
195 { "x" integer } { "n" integer }
198 { $description "Returns true if all of the bits in the mask " { $snippet "n" } " are set in the integer input " { $snippet "x" } "." }
200 { $example "USING: math.bitwise kernel prettyprint ;"
201 "HEX: ff HEX: f mask? ."
205 { $example "USING: math.bitwise kernel prettyprint ;"
206 "HEX: f0 HEX: 1 mask? ."
216 { $description "Returns an integer with " { $snippet "n" } " bits set." }
218 { $example "USING: math.bitwise kernel prettyprint ;"
222 { $example "USING: math.bitwise kernel prettyprint ;"
234 { $description "Toggles the nth bit of an integer." }
236 { $example "USING: math.bitwise kernel prettyprint ;"
240 { $example "USING: math.bitwise kernel prettyprint ;"
241 "BIN: 1000 3 toggle-bit .b"
248 { "x" integer } { "n" integer }
251 { $description "Sets the nth bit of " { $snippet "x" } "." }
253 { $example "USING: math.bitwise kernel prettyprint ;"
261 { "n" integer } { "s" integer } { "w" integer }
264 { $description "Calls " { $link shift } " on " { $snippet "n" } " and " { $snippet "s" } ", wrapping the result to " { $snippet "w" } " bits." } ;
268 { "x" integer } { "n" integer }
271 { $description "Clears the bits in " { $snippet "x" } " if they are set in the mask " { $snippet "n" } "." }
273 { $example "USING: math.bitwise kernel prettyprint ;"
274 "HEX: ff HEX: 0f unmask .h"
281 { "x" integer } { "n" integer }
284 { $description "Tests whether unmasking the bits in " { $snippet "x" } " would return an integer greater than zero." }
286 { $example "USING: math.bitwise kernel prettyprint ;"
287 "HEX: ff HEX: 0f unmask? ."
294 { "int" integer } { "int" integer }
297 { $description "Multiplies two integers and wraps the result to 32 bits." }
299 { $example "USING: math.bitwise kernel prettyprint ;"
300 "HEX: ffffffff HEX: 2 w* ."
307 { "int" integer } { "int" integer }
310 { $description "Adds two integers and wraps the result to 32 bits." }
312 { $example "USING: math.bitwise kernel prettyprint ;"
313 "HEX: ffffffff HEX: 2 w+ ."
320 { "int" integer } { "int" integer }
323 { $description "Subtracts two integers and wraps the result to 32 bits." }
325 { $example "USING: math.bitwise kernel prettyprint ;"
326 "HEX: 0 HEX: ff w- ."
333 { "m" integer } { "n" integer }
336 { $description "Wraps an integer " { $snippet "m" } " by modding it by " { $snippet "n" } ". This word is uses bitwise arithmetic and does not actually call the modulus word, and as such can only mod by powers of two." }
337 { $examples "Equivalent to modding by 8:"
339 "USING: math.bitwise prettyprint ;"
340 "HEX: ffff 8 wrap .h"
345 ARTICLE: "math-bitfields" "Constructing bit fields"
346 "Some applications, such as binary communication protocols and assemblers, need to construct integers from elaborate bit field specifications. Hand-coding this using " { $link shift } " and " { $link bitor } " results in repetitive code. A higher-level facility exists to factor out this repetition:"
347 { $subsection bitfield } ;
349 ARTICLE: "math.bitwise" "Additional bitwise arithmetic"
350 "The " { $vocab-link "math.bitwise" } " vocabulary provides bitwise arithmetic words extending " { $link "bitwise-arithmetic" } ". They are useful for efficiency, low-level programming, and interfacing with C libraries."
352 "Setting and clearing bits:"
353 { $subsection set-bit }
354 { $subsection clear-bit }
355 "Testing if bits are set or clear:"
357 { $subsection bit-clear? }
358 "Operations with bitmasks:"
360 { $subsection unmask }
361 { $subsection mask? }
362 { $subsection unmask? }
363 "Generating an integer with n set bits:"
364 { $subsection on-bits }
365 "Counting the number of set bits:"
366 { $subsection bit-count }
367 "More efficient modding by powers of two:"
370 { $subsection bitroll }
371 { $subsection bitroll-32 }
372 { $subsection bitroll-64 }
378 { $subsection flags }
379 { $subsection "math-bitfields" } ;
381 ABOUT: "math.bitwise"