The following problem tests your understanding of switch statements that use jump tables. Consider a switch statement implemented by using the jmpq instruction to index into the jump table. The jump table is defined as follows:

$0$x$400598$: $0$x$00000000004004880$x$0000000000400488$

$0$x$4005$a$8$: $0$x$000000000040048$b $0$x$0000000000400493$

$0$x$4005$b$8$: $0$x$000000000040049$a $0$x$0000000000400482$

$0$x$4005$c$8$: $0$x$000000000040049$a $0$x$0000000000400498$

Here is the assembly code for the switch statement:

# on entry : $\%$rdx $=$ c and $\%$rsi $=$ b

$0$x$400474$ : cmp $$0$x$7,\%$edi

$0$x$400477$ : ja $0$x$40049$a

$0$x$400479$ : mov $\%$edi, $\%$edi

$0$x$40047$b : jmpq $*0$x$400598(,\%$rdi, $8)$

$0$x$400482$ : mov $$0$x$15213,\%$eax

$0$x$400487$ : retq

$0$x$400488$ : sub $$0$x$5,\%$edx

$0$x$40048$b : lea $0$x$0(,\%$rdx$,4),\%$eax

$0$x$400492$ : retq

$0$x$400493$ : mov $$0$x$2,\%$edx

$0$x$400498$ : and $\%$edx, $\%$esi

$0$x$40049$a : lea $0$x$4(\%$rsi$),\%$eax

$0$x$40049$d : retq

$[$continued on next page$]$

CS $33|$ SUMMER $2024|$ HOMEWORK $2$ PAGE $4$ Complete the TODO section such that the C code compiles to match given the

assembly code.

int main$($int a$,$ int b$,$ int c$)\{$ int result $=4$;

switch $($a$)\{$

$/*$ TODO $*/$

$\}$

return result; $\}$