-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStr_ASM.cpp
More file actions
461 lines (405 loc) · 8.95 KB
/
Str_ASM.cpp
File metadata and controls
461 lines (405 loc) · 8.95 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
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
//---------------------------------------------------------------
// Name: Ren's String Library
//
// A standalone string class not relying on STL.
// Speed may be sacrificed for code size and readibility, but I've
// also included some assembly optimizations which may speed things up.
//
// Using id's string library as inspiration
//
// This file contains scalar assembly methods
//---------------------------------------------------------------
#include "Str.h"
#ifdef ASM
//rfind, back to front
int rStr::rfind_asm(const char *src, const char c, const int l)
{
if(!l)
return -1;
int i;
__asm
{
mov edi, src //Move text pointer into edi
add edi, l //Move to last point in data
mov eax, 0
mov al, c //Move test character into EAX
mov ecx, l //Move length into ECX
loop1:
mov ebx, [edi] //Move src to EAX
cmp bl, al //Compare lower EBX against test character
je match //exit if there is a match
dec edi //If not, increment pointer
dec ecx //Decrement counter by 1
jz noMatch
jnz loop1 //If not zero, goto loop1
noMatch:
mov i, -1 //Move -1 into i, no match
jmp exit
match:
mov i, ecx //Move counter to i
exit:
nop
}
return i; //Diff in position
}
//Find, front to back
int rStr::find_asm(const char *src, const char c, const int l)
{
if(!l)
return -1;
int i;
__asm
{
mov edi, src //Move text pointer into edi
mov eax, 0
mov al, c //Move test character into EAX
mov ecx, l //Move length into ECX
loop1:
mov ebx, [edi] //Move src to EAX
cmp bl, al //Compare lower EBX against test character
je match //exit if there is a match
inc edi //If not, increment pointer
dec ecx //Decrement counter by 1
jz noMatch
jnz loop1 //If not zero, goto loop1
noMatch:
mov i, -1 //Move -1 into i, no match
jmp exit
match:
mov i, ecx //Move counter to i
mov ecx, l //Move l into ECX
sub ecx, i //Position difference
mov i, ecx //Move new difference back into i
exit:
nop
}
return i; //Diff in position
}
//rFind case insensitive, back to front
int rStr::rfindNoCase_asm(const char *src, const char charLow, const char charUpr, const int l)
{
if(!l)
return -1;
int i;
__asm
{
mov edi, src //Move text pointer into edi
add edi, l //Move to last point in data
mov eax, 0
mov al, charLow //Move test character into EAX
mov ah, charUpr //Move test character into EAX
mov ecx, l //Move length into ECX
loop1:
mov ebx, [edi] //Move src to EAX
cmp bl, al //Compare lower EBX against test character
je match //exit if there is a match
cmp bl, ah //Compare lower EBX against test character
je match //exit if there is a match
dec edi //If not, increment pointer
dec ecx //Decrement counter by 1
jz noMatch
jnz loop1 //If not zero, goto loop1
noMatch:
mov i, -1 //Move -1 into i, no match
jmp exit
match:
mov i, ecx //Move counter to i
exit:
nop
}
return i; //Diff in position
}
//Find case insensitive, front to back
int rStr::findNoCase_asm(const char *src, const char charLow, const char charUpr, const int l)
{
if(!l)
return -1;
int i;
__asm
{
mov edi, src //Move text pointer into edi
mov eax, 0
mov al, charLow //Move test character into EAX
mov ah, charUpr //Move test character into EAX
mov ecx, l //Move length into ECX
loop1:
mov ebx, [edi] //Move src to EAX
cmp bl, al //Compare lower EBX against test character
je match //exit if there is a match
cmp bl, ah //Compare lower EBX against test character
je match //exit if there is a match
inc edi //If not, increment pointer
dec ecx //Decrement counter by 1
jz noMatch
jnz loop1 //If not zero, goto loop1
noMatch:
mov i, -1 //Move -1 into i, no match
jmp exit
match:
mov i, ecx //Move counter to i
mov ecx, l //Move l into ECX
sub ecx, i //Position difference
mov i, ecx //Move new difference back into i
exit:
nop
}
return i; //Diff in position
}
//String length, based on '\0' terminator
int rStr::r_strlen_asm(const char *src)
{
/* Reference: http://www.int80h.org/strlen/ */
//Don't bother counting if we're null
if(!src || src[0] == '\0')
return 0;
int i = 0;
__asm
{
mov edi, src //Move text pointer into edi
sub ecx, ecx //Make ecx 0
not ecx //Make ecx maximum unsigned __int32
sub al, al //lower register A 0
cld
repne scasb //Scan bytes
not ecx //Get unsigned inverse to figure out length (1/x)
dec ecx //Minus 1
mov i, ecx
}
return i;
}
//Copy memory
void rStr::r_memcopy_asm(const char* dst, const char* src, const int l)
{
//Fast code loop chooser
int loopMod = 1;
if(l % 10 == 0) loopMod = 10;
else if(l % 9 == 9) loopMod = 9;
else if(l % 8 == 8) loopMod = 8;
else if(l % 7 == 7) loopMod = 7;
else if(l % 6 == 6) loopMod = 6;
else if(l % 5 == 5) loopMod = 5;
else if(l % 4 == 4) loopMod = 4;
else if(l % 3 == 3) loopMod = 3;
else if(l % 2 == 2) loopMod = 2;
else loopMod = 1;
__asm
{
mov edi, dst //Move dest pointer to edi
mov esi, src //Move src pointer to esi
mov ecx, l //Move length to counter register
cmp ecx, 0 //See if length is zero
jz exit //If zero, exit
mov edx, loopMod
cmp edx, 1
je loop1
cmp edx, 2
je loop2
cmp edx, 3
je loop3
cmp edx, 4
je loop4
cmp edx, 5
je loop5
cmp edx, 6
je loop6
cmp edx, 7
je loop7
cmp edx, 8
je loop8
cmp edx, 9
je loop9
cmp edx, 10
je loop10
loop10:
mov eax, [esi]
mov [edi], eax
mov eax, [esi+1]
mov [edi+1], eax
mov eax, [esi+2]
mov [edi+2], eax
mov eax, [esi+3]
mov [edi+3], eax
mov eax, [esi+4]
mov [edi+4], eax
mov eax, [esi+5]
mov [edi+5], eax
mov eax, [esi+6]
mov [edi+6], eax
mov eax, [esi+7]
mov [edi+7], eax
mov eax, [esi+8]
mov [edi+8], eax
mov eax, [esi+9]
mov [edi+9], eax
add esi, 10
add edi, 10
sub ecx, 10
jne loop10
je exit
loop9:
mov eax, [esi]
mov [edi], eax
mov eax, [esi+1]
mov [edi+1], eax
mov eax, [esi+2]
mov [edi+2], eax
mov eax, [esi+3]
mov [edi+3], eax
mov eax, [esi+4]
mov [edi+4], eax
mov eax, [esi+5]
mov [edi+5], eax
mov eax, [esi+6]
mov [edi+6], eax
mov eax, [esi+7]
mov [edi+7], eax
mov eax, [esi+8]
mov [edi+8], eax
add esi, 9
add edi, 9
sub ecx, 9
jne loop9
je exit
loop8:
mov eax, [esi]
mov [edi], eax
mov eax, [esi+1]
mov [edi+1], eax
mov eax, [esi+2]
mov [edi+2], eax
mov eax, [esi+3]
mov [edi+3], eax
mov eax, [esi+4]
mov [edi+4], eax
mov eax, [esi+5]
mov [edi+5], eax
mov eax, [esi+6]
mov [edi+6], eax
mov eax, [esi+7]
mov [edi+7], eax
add esi, 8
add edi, 8
sub ecx, 8
jne loop8
je exit
loop7:
mov eax, [esi]
mov [edi], eax
mov eax, [esi+1]
mov [edi+1], eax
mov eax, [esi+2]
mov [edi+2], eax
mov eax, [esi+3]
mov [edi+3], eax
mov eax, [esi+4]
mov [edi+4], eax
mov eax, [esi+5]
mov [edi+5], eax
mov eax, [esi+6]
mov [edi+6], eax
add esi, 7
add edi, 7
sub ecx, 7
jne loop7
je exit
loop6:
mov eax, [esi]
mov [edi], eax
mov eax, [esi+1]
mov [edi+1], eax
mov eax, [esi+2]
mov [edi+2], eax
mov eax, [esi+3]
mov [edi+3], eax
mov eax, [esi+4]
mov [edi+4], eax
mov eax, [esi+5]
mov [edi+5], eax
add esi, 6
add edi, 6
sub ecx, 6
jne loop6
je exit
loop5:
mov eax, [esi]
mov [edi], eax
mov eax, [esi+1]
mov [edi+1], eax
mov eax, [esi+2]
mov [edi+2], eax
mov eax, [esi+3]
mov [edi+3], eax
mov eax, [esi+4]
mov [edi+4], eax
add esi, 5
add edi, 5
sub ecx, 5
jne loop5
je exit
loop4:
mov eax, [esi]
mov [edi], eax
mov eax, [esi+1]
mov [edi+1], eax
mov eax, [esi+2]
mov [edi+2], eax
mov eax, [esi+3]
mov [edi+3], eax
add esi, 4
add edi, 4
sub ecx, 4
jne loop4
je exit
loop3:
mov eax, [esi]
mov [edi], eax
mov eax, [esi+1]
mov [edi+1], eax
mov eax, [esi+2]
mov [edi+2], eax
add esi, 3
add edi, 3
sub ecx, 3
jne loop3
je exit
loop2:
mov eax, [esi]
mov [edi], eax
mov eax, [esi+1]
mov [edi+1], eax
add esi, 2
add edi, 2
sub ecx, 2
jne loop2
je exit
loop1:
mov eax, [esi] //Move src to EAX
mov [edi], eax //Move EAX to dst
inc esi //Increment pointers by 1byte
inc edi
dec ecx //Decrement counter by 1
jne loop1 //If not zero, goto loop1
exit:
nop //No opperation
}
}
//Fill memory based on arbitrary length, stuff that isn't aligned to granularity.
void rStr::r_memset_asm(const char* dst, const char c, const int l)
{
__asm
{
mov edi, dst //Move dest pointer to edi
mov al, c //Move character into lower EAX
mov ecx, l //Move length into ecx
cmp ecx, 0 //See if length is zero
jz exit //If zero, exit
loop1:
mov [edi], al //Move character into edi
inc edi //Increment pointer by 1 byte
dec ecx //Decrement pointer by 1
jne loop1 //Check is counter is 0
exit:
nop
}
}
#endif