Array Offsets
Part of the Arithmetic and Control Flow section of Coddy's Assembly journey. Lesson 21 of 28.
Consecutive dq elements occupy eight bytes each. The address of zero-based element i is the base address plus i * 8. Brackets load the value at an address; without brackets you are working with the address itself.
Assume values contains four qwords: 4, 7, 12, 9.
mov rax, [values + 16]The third element has index 2, so its byte offset is 2 * 8 = 16. Loading that location returns 12.
A qword element offset is its zero-based index multiplied by eight.
Use these instruction excerpts inside the supplied solve routine; the challenge provides the input and output code.
Challenge
EasyThe four input numbers are stored in the qword array values. Load and return the third element using memory addressing. Each input is between -100 and 100.
Edit solution.asm between solve: and the supplied ret. The locked main.asm reads the test numbers into r8, r9, r10, and r11 in order, and also stores them as four consecutive 8-byte integers at values. Unused inputs are zero. Leave your answer in rax; the harness prints it as one signed decimal integer followed by a newline. Keep the supplied wrapper and do not print anything yourself.
Try it yourself
bits 64
section .bss
input_buffer resb 256
output_buffer resb 32
values resq 4
section .text
global _start
global values
extern solve
_start:
xor eax, eax
xor edi, edi
mov rsi, input_buffer
mov edx, 255
syscall
test rax, rax
jle .loaded
mov rsi, input_buffer
lea rdi, [input_buffer + rax]
xor ecx, ecx
.scan:
cmp rsi, rdi
jae .loaded
cmp ecx, 4
jae .loaded
movzx eax, byte [rsi]
cmp al, 32
jbe .space
mov r10, 1
cmp al, '-'
jne .number
mov r10, -1
inc rsi
.number:
xor rax, rax
.digit:
cmp rsi, rdi
jae .store
movzx edx, byte [rsi]
cmp dl, '0'
jb .store
cmp dl, '9'
ja .store
imul rax, rax, 10
sub edx, '0'
add rax, rdx
inc rsi
jmp .digit
.store:
imul rax, r10
mov [values + rcx * 8], rax
inc ecx
.space:
inc rsi
jmp .scan
.loaded:
mov r8, [values]
mov r9, [values + 8]
mov r10, [values + 16]
mov r11, [values + 24]
xor eax, eax
call solve
lea rsi, [output_buffer + 31]
mov byte [rsi], 10
mov ecx, 1
xor r8d, r8d
test rax, rax
jns .positive
mov r8d, 1
neg rax
.positive:
mov ebx, 10
.convert:
xor edx, edx
div rbx
add dl, '0'
dec rsi
mov [rsi], dl
inc ecx
test rax, rax
jnz .convert
test r8d, r8d
jz .write
dec rsi
mov byte [rsi], '-'
inc ecx
.write:
mov edx, ecx
mov eax, 1
mov edi, 1
syscall
mov eax, 60
xor edi, edi
syscallThis lesson includes a short quiz. Start the lesson to answer it and track your progress.
All lessons in Arithmetic and Control Flow
2Comparisons and Branches
CMP and the Zero FlagJE, JNE and JMPSigned ComparisonsUnsigned ComparisonsRecap: Temperature Bands5Arrays in Memory
Array OffsetsIndexed AddressingTraversing an ArrayFinding an ExtremeRecap: Positive TotalPractice on your own: Assembly playground