1 /* Compare two memory blocks for differences in the first COUNT bytes.
2 Copyright (C) 2004, 2005 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
5 The GNU C Library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Lesser General Public
7 License as published by the Free Software Foundation; either
8 version 2.1 of the License, or (at your option) any later version.
10 The GNU C Library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public
16 License along with the GNU C Library; if not, write to the Free
17 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
21 #include "asm-syntax.h"
25 #define PARMS LINKAGE+4 /* Preserve EBX. */
27 #define BLK2 BLK1+PTR_SIZE
28 #define LEN BLK2+PTR_SIZE
29 #define ENTRANCE pushl %ebx; cfi_adjust_cfa_offset (4); \
30 cfi_rel_offset (ebx, 0); ENTER
31 #define RETURN popl %ebx; cfi_adjust_cfa_offset (-4); \
32 cfi_restore (ebx); LEAVE; ret
34 /* Load an entry in a jump table into EBX. TABLE is a jump table
35 with relative offsets. INDEX is a register contains the index
36 into the jump table. */
37 #define LOAD_JUMP_TABLE_ENTRY(TABLE, INDEX) \
38 /* We first load PC into EBX. */ \
39 call __i686.get_pc_thunk.bx; \
40 /* Get the address of the jump table. */ \
41 addl $(TABLE - .), %ebx; \
42 /* Get the entry and convert the relative offset to the \
43 absolute address. */ \
44 addl (%ebx,INDEX,4), %ebx
47 .section .gnu.linkonce.t.__i686.get_pc_thunk.bx,"ax",@progbits
48 .globl __i686.get_pc_thunk.bx
49 .hidden __i686.get_pc_thunk.bx
54 .type __i686.get_pc_thunk.bx,@function
55 __i686.get_pc_thunk.bx:
61 ENTRY (BP_SYM (memcmp))
70 movzbl (%eax), %ecx /* LEN == 1 */
83 jl L(bye) /* LEN == 0 */
86 cfi_adjust_cfa_offset (4)
88 cfi_rel_offset (esi, 0)
90 jge L(32bytesormore) /* LEN => 32 */
92 LOAD_JUMP_TABLE_ENTRY (L(table_32bytes), %ecx)
135 cfi_adjust_cfa_offset (-4)
140 cfi_adjust_cfa_offset (4)
141 cfi_rel_offset (esi, 0)
178 movzbl -1(%esi), %eax
182 cfi_adjust_cfa_offset (-4)
187 cfi_adjust_cfa_offset (4)
188 cfi_rel_offset (esi, 0)
225 movzwl -2(%esi), %eax
226 movzwl -2(%edx), %ecx
232 cfi_adjust_cfa_offset (-4)
237 cfi_adjust_cfa_offset (4)
238 cfi_rel_offset (esi, 0)
275 movzwl -3(%esi), %eax
276 movzwl -3(%edx), %ecx
281 movzbl -1(%esi), %eax
285 cfi_adjust_cfa_offset (-4)
290 cfi_adjust_cfa_offset (4)
291 cfi_rel_offset (esi, 0)
334 LOAD_JUMP_TABLE_ENTRY (L(table_32bytes), %ecx)
365 /* We get there only if we already know there is a
372 cfi_adjust_cfa_offset (-4)
375 END (BP_SYM (memcmp))
380 .long L(0bytes) - . + 0x0
381 .long L(1bytes) - . + 0x4
382 .long L(2bytes) - . + 0x8
383 .long L(3bytes) - . + 0xc
384 .long L(4bytes) - . + 0x10
385 .long L(5bytes) - . + 0x14
386 .long L(6bytes) - . + 0x18
387 .long L(7bytes) - . + 0x1c
388 .long L(8bytes) - . + 0x20
389 .long L(9bytes) - . + 0x24
390 .long L(10bytes) - . + 0x28
391 .long L(11bytes) - . + 0x2c
392 .long L(12bytes) - . + 0x30
393 .long L(13bytes) - . + 0x34
394 .long L(14bytes) - . + 0x38
395 .long L(15bytes) - . + 0x3c
396 .long L(16bytes) - . + 0x40
397 .long L(17bytes) - . + 0x44
398 .long L(18bytes) - . + 0x48
399 .long L(19bytes) - . + 0x4c
400 .long L(20bytes) - . + 0x50
401 .long L(21bytes) - . + 0x54
402 .long L(22bytes) - . + 0x58
403 .long L(23bytes) - . + 0x5c
404 .long L(24bytes) - . + 0x60
405 .long L(25bytes) - . + 0x64
406 .long L(26bytes) - . + 0x68
407 .long L(27bytes) - . + 0x6c
408 .long L(28bytes) - . + 0x70
409 .long L(29bytes) - . + 0x74
410 .long L(30bytes) - . + 0x78
411 .long L(31bytes) - . + 0x7c
415 weak_alias (BP_SYM (memcmp), BP_SYM (bcmp))
416 libc_hidden_builtin_def (BP_SYM (memcmp))