find:
;; RSI contains the entry we are currently looking at
.loop:
- movzx rcx, byte [rsi + 16] ; Length of word being looked at
+ movzx rcx, byte [rsi + 8 + 1] ; Length of word being looked at
cmp rcx, [.search_length]
jne .next ; If the words don't have the same length, we have the wrong word
;; Otherwise, we need to compare strings
- lea rdx, [rsi + 16 + 1] ; Location of character being compared in entry
+ lea rdx, [rsi + 8 + 1 + 1] ; Location of character being compared in entry
mov rdi, [.search_buffer] ; Location of character being compared in search buffer
.compare_char:
mov al, [rdx]
;; Parses a string.
;;
;; Parameters:
-;; * [.length] = Length of string
-;; * [.buffer] = Pointer to string buffer
+;; * rcx = Length of string
+;; * rdi = Pointer to string buffer
;;
;; Results:
;; * rax = Value
;; Add (10^(rcx-1) * parse_char(rdi[length - rcx])) to the accumulated value
;; for each rcx.
- mov rcx, [.length]
+ mov [.length], rcx
.loop:
;; First, calcuate 10^(rcx - 1)
mov rax, 1
read_word.length db ?
read_word.char_buffer db ?
-parse_number.buffer dq ?
parse_number.length dq ?