Miroirs/planckforth
1
0
Fork 0
mirror of https://github.com/nineties/planckforth synced 2025-01-13 08:01:10 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

BREAKING CHANGE: Changed Pascal string to C-string

Browse source
This commit is contained in:
Koichi Nakamura 2021-01-04 21:57:52 +09:00
parent f0e5b2ddb7
commit 1cd2f5c8ac
5 changed files with 152 additions and 153 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
README.md
View file

@ -64,7 +64,7 @@ $ cat bootstrap.fs - | ./planck
| i | docol | ( -- a-addr ) | Get the interpreter function | | i | docol | ( -- a-addr ) | Get the interpreter function |
| e | exit | ( -- ) | Exit current function | | e | exit | ( -- ) | Exit current function |
| L | lit | ( -- n ) | Load immediate | | L | lit | ( -- n ) | Load immediate |
| S | litstring | ( -- c-addr u ) | Load string literal | | S | litstring | ( -- c-addr ) | Load string literal |
| + | add | ( a b -- c ) | c = (a + b) | | + | add | ( a b -- c ) | c = (a + b) |
| - | sub | ( a b -- c ) | c = (a - b) | | - | sub | ( a b -- c ) | c = (a - b) |
| * | mul | ( a b -- c ) | c = (a * b) | | * | mul | ( a b -- c ) | c = (a * b) |

289
bootstrap.fs
View file

@ -134,8 +134,9 @@ l!
\ 'latest' will not be updated. \ 'latest' will not be updated.
h@l@, k1k0-h@$ kch@k1k0-+$ h@C+h! h@l@, k1k0-h@$ kch@k1k0-+$ h@C+h!
i, 'h, '@, 'l, '@, ',, i, 'h, '@, 'l, '@, ',,
'L, k1k0-, 'h, '@, '$, 'L, k1k0-, 'h, '@, '$, \ fill 1
'k, 'h, '@, 'L, k1k0-, '+, '$, 'k, 'h, '@, 'L, k1k0-, '+, '$, \ fill "c"
'L, k0k0-, 'h, '@, 'L, k2k0-, '+, '$, \ fill "\0"
'h, '@, 'C, '+, 'h, '!, 'h, '@, 'C, '+, 'h, '!,
'e, l! 'e, l!
@ -215,37 +216,41 @@ ca i,
\ Round up 'here' to a nearlest multiple of CELL \ Round up 'here' to a nearlest multiple of CELL
cA i, 'h, '@, 'a, 'h, '!, 'e, l! cA i, 'h, '@, 'a, 'h, '!, 'e, l!
\ 'E' ( c-addr1 u1 c-addr2 u2 -- n ) STR= \ 'E' ( c-addr1 c-addr2 -- flag ) STR=
\ Compare two strings. \ Compate null-terminated strings.
\ Return 1 if they are same 0 otherwise. \ Return 1 if they are same 0 otherwise.
cE i, cE i,
'{, '~, '}, \ ( c-addr1 c-addr2 u1 u2 )
'o, '=, 'J, kVk0-C*, \ jump to <not_equal> if u1!=u2
\ <loop> \ <loop>
\ ( c-addr1 c-addr2 u ) 'o, '?, 'o, '?, \ ( c-addr1 c-addr2 c1 c2 )
'#, 'J, kMk0-C*, \ jump to <equal> if u==0 'o, '=, 'J, k=k0-C*, \ goto <not_equal> if c1<>c2
'{, \ preserve u 'J, kAk0-C*, \ goto <equal> if c1==0
'o, '?, \ ( c-addr1 c-addr2 c1 ) 'L, k1k0-, '+, '~, \ increment c-addr2
'o, '?, \ ( c-addr1 c-addr2 c1 c2 ) 'L, k1k0-, '+, '~, \ increment c-addr1
'}, \ ( c-addr1 c-addr2 c1 c2 u ) restore u 'j, k0kC-C*, \ goto <loop>
'~, '{, '~, '}, \ ( c-addr1 c-addr2 u c1 c2 )
'=, 'J, kFk0-C*, \ jump to <not_equal> if c1!=c2
'{, '{, \ ( c-addr1 , R:u c-addr2 )
'L, k1k0-, '+, \ increment c-addr1
'}, 'L, k1k0-, '+, \ increment c-addrr2
'}, 'L, k1k0-, '-, \ decrement u
'j, k0kN-C*, \ jump to <loop>
\ <equal>
'_, '_, '_, 'L, k1k0-, 'e,
\ <not_equal> \ <not_equal>
'_, '_, '_, 'L, k0k0-, 'e, '_, '_, '_, 'L, k0k0-, 'e,
\ <equal>
'_, '_, 'L, k1k0-, 'e,
l!
\ 'z' ( c-addr -- u ) STRLEN
\ Calculate length of string
cz i,
'L, k0k0-, \ 0
\ <loop>
'o, '?, 'J, k;k0-C*, \ goto <exit> if '\0'
'L, k1k0-, '+, '~, \ increment u
'L, k1k0-, '+, '~, \ increment c-addr
'j, k0k=-C*, \ goto <loop>
\ <exit>
'~, '_, 'e,
l! l!
\ 's' ( c -- n) \ 's' ( c -- n)
\ Return 1 if c==' ' or c=='\n', 0 otherwise. \ Return 1 if c==' ' or c=='\n', 0 otherwise.
cs i, '#, 'L, k , '=, '~, 'L, k:k0-, '=, '|, 'e, l! cs i, '#, 'L, k , '=, '~, 'L, k:k0-, '=, '|, 'e, l!
\ 'W' ( "name" -- c-addr u ) \ 'W' ( "name" -- c-addr )
\ Skip leading spaces (' ' and '\n'), \ Skip leading spaces (' ' and '\n'),
\ Read name, then return its address and length. \ Read name, then return its address and length.
\ The maximum length of the name is 63. The behavior is undefined \ The maximum length of the name is 63. The behavior is undefined
@ -253,9 +258,9 @@ cs i, '#, 'L, k , '=, '~, 'L, k:k0-, '=, '|, 'e, l!
\ Note that it returns the address of statically allocated buffer, \ Note that it returns the address of statically allocated buffer,
\ so the content will be overwritten each time 'w' executed. \ so the content will be overwritten each time 'w' executed.
\ Allocate buffer of 63 bytes or more, \ Allocate buffer of 63+1 bytes or more,
\ push the address for compilation of 'w' \ push the address for compilation of 'w'
h@ # kok0-+ h! A h@ # kpk0-+ h! A
cW~ cW~
i, i,
\ skip leading spaces \ skip leading spaces
@ -267,19 +272,20 @@ i,
'o, '$, \ store c to p 'o, '$, \ store c to p
'L, k1k0-, '+, \ increment p 'L, k1k0-, '+, \ increment p
'k, '#, 's, 'J, k0k9-C*, \ goto <loop> if c is not space 'k, '#, 's, 'J, k0k9-C*, \ goto <loop> if c is not space
'_, 'L, , \ ( p buf ) '_,
'~, 'o, '-, \ ( buf p-buf ) 'L, k0k0-, 'o, '$, \ fill \0
'_, 'L, , \ return buf
'e, l! 'e, l!
\ 'F' ( c-addr u -- w ) \ 'F' ( c-addr -- w )
\ Lookup multi-character word from dictionary. \ Lookup multi-character word from dictionary.
\ Return 0 if the word is not found. \ Return 0 if the word is not found.
\ Entries with smudge-bit=1 are ignored. \ Entries with smudge-bit=1 are ignored.
cF i, cF i,
'l, '@, 'l, '@,
\ <loop> ( addr u it ) \ <loop> ( addr it )
'#, 'J, kUk0-C*, \ goto <exit> if it=NULL '#, 'J, kEk0-C*, \ goto <exit> if it=NULL
'#, 'C, '+, '?, \ ( addr u it len+flag ) '#, 'C, '+, '?, \ ( addr it len+flag )
'L, k@, '&, \ test smudge-bit of it 'L, k@, '&, \ test smudge-bit of it
'J, k4k0-C*, 'J, k4k0-C*,
\ <1> \ <1>
@ -288,15 +294,12 @@ cF i,
'j, k0k>-C*, \ goto <loop> 'j, k0k>-C*, \ goto <loop>
\ <2> \ <2>
\ smudge-bit=0 \ smudge-bit=0
'{, 'o, 'o, 'r, '@, '~, '{, '~, '}, '}, 'o, 'o, \ ( addr it addr it )
\ ( addr u it addr u it ) 'L, Ck1k0-+, '+, \ address of name
'#, 'L, Ck1k0-+, '+, \ address of name \ ( addr1 it addr1 addr2 )
'~, 'C, '+, '?, \ length+flag 'E, 'J, k0k:-C*, \ goto <1> if different name
'L, kok0-, '&, \ take length (lower 6-bits)
\ ( addr1 u1 it addr1 u1 addr2 u2 )
'E, 'J, k0kJ-C*, \ goto <1> if different name
\ <exit> \ <exit>
'{, '_, '_, '}, \ Drop addr u return it '{, '_, '}, \ Drop addr, return it
'e, l! 'e, l!
\ 'G' ( w -- xt ) \ 'G' ( w -- xt )
@ -305,7 +308,7 @@ cG i,
'C, '+, '#, '?, \ ( addr len+flag ) 'C, '+, '#, '?, \ ( addr len+flag )
'L, kok0-, '&, \ take length 'L, kok0-, '&, \ take length
'+, \ add length to the addr '+, \ add length to the addr
'L, k1k0-, '+, \ add 1 to the addr (1byte for len+field) 'L, k2k0-, '+, \ add 2 to the addr (len+field and \0)
'a, \ align 'a, \ align
'e, l! 'e, l!
@ -361,18 +364,19 @@ c ] i , ' L , k 1 k 0 - , ' M , ' ! , ' e , l !
\ Read name, create word with smudge=1, \ Read name, create word with smudge=1,
\ compile 'docol' and enter compile mode. \ compile 'docol' and enter compile mode.
c : i , c : i ,
' A , \ align here ' A , \ align here
' h , ' @ , ' h , ' @ ,
' l , ' @ , ' , , \ fill link ' l , ' @ , ' , , \ fill link
' l , ' ! , \ update latest ' l , ' ! , \ update latest
' W , \ read name ( addr len ) ' W , \ read name ( addr )
' # , \ ( addr len len ) ' # , ' z , ' # , \ ( addr len len )
' L , k @ , ' | , ' L , k @ , ' | , \ set smudge-bit
' B , \ fill length + smudge-bit ' B , \ fill length + smudge-bit
' m , \ fill name ' m , \ fill name
' A , \ align here ' L , k 0 k 0 - , ' B , \ fill \0
' i , ' , , \ compile docol ' A , \ align here
' ] , \ enter compile mode ' i , ' , , \ compile docol
' ] , \ enter compile mode
' e , l ! ' e , l !
\ ; ( -- ) SEMICOLON \ ; ( -- ) SEMICOLON
@ -412,9 +416,11 @@ set-immediate \
\ Copy code pointer of builtin word "name-old" to \ Copy code pointer of builtin word "name-old" to
\ the new word "name-new". \ the new word "name-new".
\ "name-old" must not be a FORTH word. \ "name-old" must not be a FORTH word.
A h @ l @ , l ! \ fill link, update latest A h @ l @ , l ! \ fill link, update latest
W # B m A \ fill length and chars of "name-new" W # z # B m \ fill length and chars of "name-new"
W F G @ , \ fill code-pointer of "name-old" [ ' L , k 0 k 0 - , ] B \ fill \0
A
W F G @ , \ fill code-pointer of "name-old"
; ;
\ Add new names to builtin primities. \ Add new names to builtin primities.
@ -455,6 +461,7 @@ alias-builtin xor ^
: >cfa G ; : >cfa G ;
: c, B ; : c, B ;
: cmove, m ; : cmove, m ;
: strlen z ;
: state M ; : state M ;
: aligned a ; : aligned a ;
: align A ; : align A ;
@ -795,15 +802,16 @@ alias-builtin xor ^
\ at the end of the entry. \ at the end of the entry.
: create : create
align align
latest , \ fill link latest , \ fill link
here cell- &latest ! \ update latest here cell- &latest ! \ update latest
word word
dup c, cmove, align \ fill length and name dup strlen
docol , \ compile docol dup c, cmove, 0 c, align \ fill length, name and \0
docol , \ compile docol
['] lit , ['] lit ,
here 3 cells + , \ compile the address here 3 cells + , \ compile the address
['] nop , \ does>, if any, will fill this cell ['] nop , \ does>, if any, will fill this cell
['] exit , \ compile exit ['] exit , \ compile exit
; ;
: does>-helper : does>-helper
@ -903,7 +911,7 @@ create exception-marker
( === Printing Numbers === ) ( === Printing Numbers === )
\ Skip reading spaces, read characters and returns first character \ Skip reading spaces, read characters and returns first character
: char ( <spces>ccc -- c ) word drop c@ ; : char ( <spces>ccc -- c ) word c@ ;
\ compile-time version of char \ compile-time version of char
: [char] ( compile: <spaces>ccc -- ; runtime: --- c ) : [char] ( compile: <spaces>ccc -- ; runtime: --- c )
@ -1002,25 +1010,20 @@ decimal \ set default to decimal
( === Parsing Numbers === ) ( === Parsing Numbers === )
\ Parse string c-addr2 u2 as an unsigned integer with base u1 \ Parse string c-addr as an unsigned integer with base u
\ and return n. f represents the conversion is success or not. \ and return n. f represents the conversion is success or not.
: parse-uint ( u1 c-addr2 u2 -- n f ) : parse-uint ( u c-addr -- n f )
0 \ accumulator 0 \ accumulator
begin begin over c@ while
over 0> \ ( base addr acc )
while
\ ( base addr len acc )
>r \ save acc >r \ save acc
1- >r \ decrement len and save
dup c@ swap 1+ >r \ load char, increment addr and save dup c@ swap 1+ >r \ load char, increment addr and save
dup case dup case
'0' '9' rangeof '0' - endof '0' '9' rangeof '0' - endof
'a' 'z' rangeof 'a' - 10 + endof 'a' 'z' rangeof 'a' - 10 + endof
'A' 'Z' rangeof 'A' - 10 + endof 'A' 'Z' rangeof 'A' - 10 + endof
\ failed to convert \ failed to convert
r> r> r> drop drop drop 2drop r> r> swap drop false
swap drop
false
exit exit
endcase endcase
2dup 2dup
@ -1029,74 +1032,69 @@ decimal \ set default to decimal
\ ( base n 0 base n ) \ ( base n 0 base n )
within unless within unless
\ failed to convert \ failed to convert
r> r> r> drop drop drop 2drop r> r> swap drop false
swap drop
false
exit exit
then then
\ ( base addr len n acc ) \ ( base addr n acc )
r> swap r> swap r> r> swap r>
4 pick * + 3 pick * +
repeat repeat
\ success \ success
swap drop swap drop
swap drop swap drop
swap drop
true true
; ;
\ increment c-addr1 and decrement u1
: s++ ( c-addr1 u1 -- c-addr2 u2 )
1- swap 1+ swap
;
\ Parse string as number. \ Parse string as number.
\ This function interprets prefixes that specifies number base. \ This function interprets prefixes that specifies number base.
: >number ( c-addr u -- n f ) : >number ( c-addr -- n f )
dup 0<= if dup c@ unless
2drop drop
0 false 0 false
exit exit
then then
over c@ case dup c@ case
'-' of '-' of
s++ 1+
recurse if recurse if
negate true negate true
else else
false false
then then
endof endof
'&' of s++ 10 -rot parse-uint endof '&' of 1+ 10 swap parse-uint endof
'#' of s++ 10 -rot parse-uint endof '#' of 1+ 10 swap parse-uint endof
'%' of s++ 2 -rot parse-uint endof '%' of 1+ 2 swap parse-uint endof
'0' of '0' of
\ hexadecimal \ hexadecimal
dup 1 = if \ ( addr )
2drop 0 true exit 1+
dup c@ unless
drop 0 true exit
then then
s++ dup c@ 'x' = if
over c@ 'x' = if 1+ 16 swap parse-uint exit
s++ 16 -rot parse-uint exit
then then
2drop 0 false exit drop 0 false exit
endof endof
'\'' of '\'' of
\ character code \ character code
case \ ( addr )
1 of drop 0 false endof 1+
2 of 1+ c@ true endof dup c@ unless
3 of drop 0 false exit
1+ dup c@ swap then
1+ c@ '\'' = if true else false then dup c@ swap 1+
endof c@ case
0 of true exit endof
'\'' of true exit endof
drop 0 false drop 0 false
endcase endcase
endof endof
\ default case \ default case
drop base @ -rot \ ( addr base )
parse-uint drop base @ swap parse-uint
dup \ need this because endcase drops top of stack dup \ need this because endcase drops top of stack
endcase endcase
; ;
@ -1119,29 +1117,29 @@ decimal \ set default to decimal
\ we already have cmove, \ we already have cmove,
\ ( a-addr -- c-addr u ) \ ( c-from c-to -- )
\ Load address of length of a string from length-prefixed string \ copy nul terminated string from c-from to c-to
\ | length (1cell) | characters ... | : strcpy
: string dup @ swap cell+ swap ; begin over c@ dup while
\ ( c-from c-to c )
\ ( c-addr u a-addr -- ) over c!
\ Store length-prefixed string to given address 1+ swap 1+ swap
: copy-string repeat drop drop drop
2dup ! \ fill length
cell+ \ increment addr
swap cmove \ copy string
; ;
\ ( c-addr u -- ) \ ( c-addr -- )
\ Allocate memory and store length-prefixed string \ copy string to here including \0
: string, dup , cmove, ; : strcpy,
begin dup c@ dup while
c, 1+
repeat drop
0 c,
;
\ Print string \ Print string
: type ( c-addr u -- ) : type ( c-addr -- )
begin dup 0> while \ while u>0 begin dup c@ dup while \ while c<>\0
over c@ emit \ print char emit 1+
1- \ decrement u
swap 1+ swap \ increment c-addr
repeat repeat
2drop 2drop
; ;
@ -1166,6 +1164,7 @@ char 0 char B - constant STRING-OVERFLOW-ERROR \ -18
c, \ store character c, \ store character
1+ \ increment length 1+ \ increment length
repeat drop repeat drop
0 c, \ store \0
swap ! \ back-fill length swap ! \ back-fill length
align align
else else
@ -1177,8 +1176,7 @@ char 0 char B - constant STRING-OVERFLOW-ERROR \ -18
over c! \ store char over c! \ store char
1+ \ increment address 1+ \ increment address
repeat drop repeat drop
\ ( start-addr last-addr ) 0 swap c! \ store \0
over - \ calculate length
then then
; immediate ; immediate
@ -1196,24 +1194,24 @@ char 0 char B - constant STRING-OVERFLOW-ERROR \ -18
\ Single linked list of error code and messages. \ Single linked list of error code and messages.
\ Thre structure of each entry: \ Thre structure of each entry:
\ | link | code | len | message ... | \ | link | code | message ... |
variable error-list variable error-list
0 error-list ! 0 error-list !
: error>next ( a-addr -- a-addr) @ ; : error>next ( a-addr -- a-addr) @ ;
: error>message ( a-addr -- c-addr u ) 2 cells + string ; : error>message ( a-addr -- c-addr ) 2 cells + ;
: error>code ( a-addr -- n ) cell+ @ ; : error>code ( a-addr -- n ) cell+ @ ;
: add-error ( n c-addr u -- ) : add-error ( n c-addr -- )
error-list here error-list here
over @ , \ fill link over @ , \ fill link
swap ! \ update error-list swap ! \ update error-list
rot , \ fill error-code rot , \ fill error-code
string, \ fill message strcpy, \ fill message
; ;
: def-error ( n c-addr u "name" -- ) : def-error ( n c-addr "name" -- )
create 2 pick , create over ,
add-error add-error
does> @ does> @
; ;
@ -1226,7 +1224,7 @@ variable next-user-error
s" -256" >number drop next-user-error ! s" -256" >number drop next-user-error !
\ Create new user defined error and returns error code. \ Create new user defined error and returns error code.
: exception ( c-addr u -- n ) : exception ( c-addr -- n )
next-user-error @ -rot add-error next-user-error @ -rot add-error
next-user-error @ next-user-error @
1 next-user-error -! 1 next-user-error -!
@ -1237,12 +1235,13 @@ s" -256" >number drop next-user-error !
create word-buffer s" 63" >number drop cell+ allot drop create word-buffer s" 63" >number drop cell+ allot drop
: interpret : interpret
word \ read name from input word \ read name from input
2dup word-buffer copy-string \ save input \ ( addr )
2dup find \ lookup dictionary dup word-buffer strcpy \ save input
dup find \ lookup dictionary
?dup if ?dup if
\ Found the word \ Found the word
-rot 2drop swap drop
state @ if state @ if
\ compile mode \ compile mode
dup cell+ c@ immediate-bit and if dup cell+ c@ immediate-bit and if
@ -1281,7 +1280,7 @@ create word-buffer s" 63" >number drop cell+ allot drop
2 pick = if 2 pick = if
error>message type error>message type
." : " ." : "
word-buffer string type cr word-buffer type cr
bye bye
then then
error>next error>next
@ -1423,15 +1422,15 @@ R/O stdin_ file>fam c!
drop drop
dup >r dup >r
begin dup 0> while begin dup 0> while
key 2 tuck c! s++ \ c-addr u c
key 2 pick c!
1- swap 1+ swap
repeat repeat
2drop 2drop
r> success \ 0: no-error r> success \ 0: no-error
; stdin_ file>read-file ! ; stdin_ file>read-file !
:noname ( c-addr u1 file -- u2 flag e ) :noname ( c-addr u1 file -- u2 flag e )
." Readline!" cr
.s cr
drop 0 drop 0
begin begin
( c-addr u1 u2 ) ( c-addr u1 u2 )
@ -1446,7 +1445,7 @@ R/O stdin_ file>fam c!
exit exit
then then
3 pick c! 3 pick c!
1+ >r s++ r> 1+ >r 1- swap 1+ swap r>
again again
; stdin_ file>read-line ! ; stdin_ file>read-line !
@ -1493,3 +1492,5 @@ variable input-streams
; ;
stdin_ push-input-stream stdin_ push-input-stream
." Ready" cr

1
others/planck.c
View file

@ -100,7 +100,6 @@ defcode('L', lit) { push(*pc++); next(); }
defcode('S', litstring) { defcode('S', litstring) {
int len = *pc++; int len = *pc++;
push((cell) pc); push((cell) pc);
push(len);
pc += (len + CELL - 1)/CELL; pc += (len + CELL - 1)/CELL;
} }
defcode('k', key) { defcode('k', key) {

1
others/planck.py
View file

@ -183,7 +183,6 @@ while True:
elif code == LITSTRING: elif code == LITSTRING:
n = read(pc) n = read(pc)
push(pc + CELL) push(pc + CELL)
push(n)
pc = (pc + 2*CELL + n - 1) & ~CELL pc = (pc + 2*CELL + n - 1) & ~CELL
elif code == ADD: elif code == ADD:
b = pop() b = pop()

12
planck.xxd
View file

@ -106,9 +106,9 @@
000002a0: 2000 0000 0000 0000 000002a0: 2000 0000 0000 0000
000002a8: 9082 0408 0153 0000 S: litstring 000002a8: 9082 0408 0153 0000 S: litstring
000002b0: b482 0408 ad56 5001 lodsl; pushl %esi; pushl %eax 000002b0: b482 0408 ad56 01c6 lodsl; pushl %esi; addl %eax,%esi;
000002b8: c683 c603 83e6 fcad addl %eax,%esi; addl $3,%esi; andl $~3,%esi;next; 000002b8: 83c6 0383 e6fc adff addl $3,%esi; andl $~3,%esi;next;
000002c0: ff20 0000 0000 0000 000002c0: 2000 0000 0000 0000
000002c8: a882 0408 012b 0000 +: add 000002c8: a882 0408 012b 0000 +: add
000002d0: d482 0408 5801 0424 popl %eax; addl %eax,(%esp) 000002d0: d482 0408 5801 0424 popl %eax; addl %eax,(%esp)
@ -124,15 +124,15 @@
00000310: f882 0408 012f 0000 /: div 00000310: f882 0408 012f 0000 /: div
00000318: 1c83 0408 31d2 5b58 xorl %edx,%edx; popl %ebx; popl %eax 00000318: 1c83 0408 31d2 5b58 xorl %edx,%edx; popl %ebx; popl %eax
00000320: f7fb 50ad ff20 0000 idiv %ebx; pushl %eax 00000320: f7fb 50ad ff20 0000 idiv %ebx; pushl %eax; next;
00000328: 1083 0408 0125 0000 %: mod 00000328: 1083 0408 0125 0000 %: mod
00000330: 3483 0408 31d2 5b58 xorl %edx,%edx; popl %ebx; popl %eax 00000330: 3483 0408 31d2 5b58 xorl %edx,%edx; popl %ebx; popl %eax
00000338: f7fb 52ad ff20 0000 idiv %ebx; pushl %edx 00000338: f7fb 52ad ff20 0000 idiv %ebx; pushl %edx; next;
00000340: 2883 0408 0126 0000 &: and 00000340: 2883 0408 0126 0000 &: and
00000348: 4c83 0408 5821 0424 popl %eax; andl %eax,(%esp) 00000348: 4c83 0408 5821 0424 popl %eax; andl %eax,(%esp)
00000350: adff 2000 0000 0000 next; 00000350: adff 2000 0000 0000 next; next;
00000358: 4083 0408 017c 0000 |: or 00000358: 4083 0408 017c 0000 |: or
00000360: 6483 0408 5809 0424 popl %eax; orl %eax,(%esp) 00000360: 6483 0408 5809 0424 popl %eax; orl %eax,(%esp)