-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinux64.asm
More file actions
363 lines (303 loc) · 9.15 KB
/
Linux64.asm
File metadata and controls
363 lines (303 loc) · 9.15 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
; 64-Bit
; Linux (Windows uses different calling convention)
; github.com/x444556
[BITS 64]
EXTERN malloc
EXTERN free
GLOBAL bucket_sort
GLOBAL bucket_sort_kvp
GLOBAL selection_sort
GLOBAL selection_sort_kvp
GLOBAL compare
GLOBAL copy
section .text
compare: ; uint64_t compare(void* arr1, void* arr2, uint64_t length)
push rbp
mov rbp, rsp
xor rax, rax ; return Count of different bytes
.loop:
mov CL, BYTE [rdi]
cmp CL, BYTE [rsi]
je .equal
inc rax
.equal:
inc rdi
inc rsi
dec rdx
and rdx, rdx
jnz .loop
mov rsp, rbp
pop rbp
ret
copy: ; void* copy(void* source, uint64_t length)
push rbp
mov rbp, rsp
push rdi
push rsi
mov rdi, rsi
call malloc WRT ..plt ; dest* in rax
mov R8, rax
pop rcx ; counter
pop rdi ; source*
.loop:
mov DL, BYTE [rdi]
mov BYTE [rax], DL
inc rdi
inc rax
dec rcx
and rcx, rcx
jnz .loop
mov rax, R8
mov rsp, rbp
pop rbp
ret
bucket_sort: ; void bucket_sort(uint64_t a[], uint64_t length, uint64_t min_key, uint64_t max_key)
push rbp
mov rbp, rsp
sub rsp, 8 ; QWORD [rbp - 8] MIN_KEY
sub rsp, 8 ; QWORD [rbp - 16] --- Not used anymore
sub rsp, 8 ; QWORD [rbp - 24] INPUT_ARRAY_PTR
sub rsp, 8 ; QWORD [rbp - 32] STORAGE_ARRAY_PTR
sub rsp, 8 ; QWORD [rbp - 40] INPUT_ARRAY_LENGTH
sub rsp, 8 ; QWORD [rbp - 48] STORAGE_ARRAY_LENGTH
mov QWORD [rbp - 8], rdx
mov QWORD [rbp - 24], rdi
mov QWORD [rbp - 40], rsi
sub rcx, rdx
mov QWORD [rbp - 48], rcx
imul rcx, QWORD 8
mov rdi, rcx
call malloc WRT ..plt
mov QWORD [rbp - 32], rax
xor rcx, rcx ; index
mov rdi, QWORD [rbp - 24] ; INPUT_ARRAY_PTR
.fill:
cmp rcx, QWORD [rbp - 40]
jae .fill_end
mov rax, QWORD [rdi]
sub rax, QWORD [rbp - 8]
imul rax, QWORD 8
add rax, QWORD [rbp - 32]
inc QWORD [rax]
add rdi, 8
inc rcx
jmp .fill
.fill_end:
xor rcx, rcx ; index in STORAGE_ARRAY
mov rdi, QWORD [rbp - 32] ; STORAGE_ARRAY_PTR
mov rsi, QWORD [rbp - 24] ; OUTPUT_ARRAY_PTR
.read:
cmp rcx, QWORD [rbp - 48] ; while(rcx < STORAGE_ARRAY_LENGTH)
je .read_end
mov rdx, QWORD [rdi]
.write:
and rdx, rdx
jz .write_end
mov rax, rcx
add rax, QWORD [rbp - 8]
mov QWORD [rsi], rax
add rsi, 8
dec rdx
jmp .write
.write_end:
add rdi, 8
inc rcx
jmp .read
.read_end:
mov rdi, QWORD [rbp - 32]
call free WRT ..plt
mov rsp, rbp ; restore stack pointer + free local variables
pop rbp
ret
selection_sort: ; void selection_sort(uint64_t a[], uint64_t length)
push rbp
mov rbp, rsp
; rcx : inner Loop counter
; rdx : outer Loop counter
; rdi : Array*
; rsi : Length
; R8 : Smallest Value
; R9 : Index of R8
xor rdx, rdx
.loop:
mov rcx, rdx
xor R8, R8
not R8
mov R9, rdx
mov rax, rdx
imul rax, 8
add rax, rdi
.loop_2:
cmp QWORD [rax], R8
jae .larger
mov R8, QWORD [rax]
mov R9, rcx
.larger:
add rax, 8
inc rcx
cmp rcx, rsi
jb .loop_2
mov rax, rdx
imul rax, 8
add rax, rdi
mov R10, QWORD [rax]
mov QWORD [rax], R8
imul R9, 8
add R9, rdi
mov QWORD [R9], R10
inc rdx
cmp rdx, rsi
jb .loop
mov rsp, rbp
pop rbp
ret
selection_sort_kvp: ; void selection_sort_kvp(struct Element a[], uint64_t length)
push rbp
mov rbp, rsp
; rcx : inner Loop counter
; rdx : outer Loop counter
; rdi : Array*
; rsi : Length
; R8 : Smallest Key
; R9 : Index of R8
; R10 : temp
; R11 : Value at R9
xor rdx, rdx
.loop:
mov rcx, rdx
xor R8, R8
not R8
mov R9, rdx
mov rax, rdx
imul rax, 16
add rax, rdi
.loop_2:
cmp QWORD [rax], R8
jae .larger
mov R8, QWORD [rax]
mov R11, QWORD [rax + 8]
mov R9, rcx
.larger:
add rax, 16
inc rcx
cmp rcx, rsi
jb .loop_2
; swap keys
mov rax, rdx
imul rax, 16
add rax, rdi
mov R10, QWORD [rax]
mov QWORD [rax], R8
mov rax, R9
imul R9, 16
add R9, rdi
mov QWORD [R9], R10
mov R9, rax
; swap values
mov rax, rdx
imul rax, 16
add rax, rdi
mov R10, QWORD [rax + 8]
mov QWORD [rax + 8], R11
imul R9, 16
add R9, rdi
mov QWORD [R9 + 8], R10
inc rdx
cmp rdx, rsi
jb .loop
mov rsp, rbp
pop rbp
ret
bucket_sort_kvp: ; uint64_t bucket_sort_kvp(uint64_t a[], uint64_t length, uint64_t min_key, uint64_t max_key, uint64_t allocListLength)
push rbp
mov rbp, rsp
sub rsp, 8 ; QWORD [rbp - 8] MIN_KEY
sub rsp, 8 ; QWORD [rbp - 16] MAX_LIST_LENGTH
sub rsp, 8 ; QWORD [rbp - 24] INPUT_ARRAY_PTR
sub rsp, 8 ; QWORD [rbp - 32] STORAGE_ARRAY_PTR
sub rsp, 8 ; QWORD [rbp - 40] INPUT_ARRAY_LENGTH
sub rsp, 8 ; QWORD [rbp - 48] STORAGE_ARRAY_LENGTH
mov QWORD [rbp - 8], rdx
mov QWORD [rbp - 24], rdi
mov QWORD [rbp - 40], rsi
mov QWORD [rbp - 16], R8
sub rcx, rdx
mov QWORD [rbp - 48], rcx
mov rdi, QWORD [rbp - 48]
mov rax, QWORD [rbp - 16]
shl rax, 3 ; rax *= 8
add rax, 8
imul rdi, rax
call malloc WRT ..plt
mov QWORD [rbp - 32], rax
xor rcx, rcx ; rcx = index
;xor rdi, rdi ; rdi = address in input
mov rdi, QWORD [rbp - 24]
mov rax, QWORD [rbp - 16]
shl rax, 3 ; rax *= 8
add rax, 8
mov R8, rax ; R8 = bytes per entry in STORAGE_ARRAY
mov R9, QWORD [rbp - 16]
.fill:
cmp rcx, QWORD [rbp - 40]
je .fill_end
; address of List in STORAGE_ARRAY -> rsi
mov rsi, QWORD [rdi]
sub rsi, QWORD [rbp - 8]
imul rsi, R8
add rsi, QWORD [rbp - 32]
; increase List Counter
inc QWORD [rsi]
; read List Counter
mov rax, QWORD [rsi]
; check for List-Overflow
cmp rax, R9
je .list_overflow
mov rdx, rsi
;imul rax, 8
shl rax, 3
add rdx, rax ; address of current List Entry -> rdx
mov rax, QWORD [rdi + 8] ; read value from INPUT_ARRAY
mov QWORD [rdx], rax ; write value to List
add rdi, 16
inc rcx
jmp .fill
.fill_end:
xor rcx, rcx ; index in STORAGE_ARRAY
mov rdi, QWORD [rbp - 32] ; STORAGE_ARRAY_PTR
mov rsi, QWORD [rbp - 24] ; OUTPUT_ARRAY_PTR
.read:
cmp rcx, QWORD [rbp - 48] ; while(rcx < STORAGE_ARRAY_LENGTH)
je .read_end
mov rdx, QWORD [rdi]
.write:
and rdx, rdx
jz .write_end
; rax = value at [STORAGE_ARRAY_PTR(current element) + (current_list_index+1)*8] (this is the value)
mov rax, QWORD [rdi + rdx * 8]
mov QWORD [rsi + 8], rax
; rax = index_STORAGE_ARRAY + MIN_KEY (this is the key)
mov rax, rcx
add rax, QWORD [rbp - 8]
mov QWORD [rsi], rax
add rsi, 16
dec rdx
jmp .write
.write_end:
add rdi, R8
inc rcx
jmp .read
.read_end:
mov rdi, QWORD [rbp - 32]
call free WRT ..plt ; free temporary array
xor rax, rax ; return 0 -> success
mov rsp, rbp ; restore stack pointer + free local variables
pop rbp
ret
.list_overflow:
mov rdi, QWORD [rbp - 32]
call free WRT ..plt
mov rax, 1 ; return 1 -> error
mov rsp, rbp
pop rbp
ret