From 2ccdea26f290f6990606f4a43de5272afa1a784d Mon Sep 17 00:00:00 2001 From: Anton Blanchard Date: Mon, 7 Jan 2013 11:20:53 -0600 Subject: Fix spelling errors in sysdeps/powerpc files. --- sysdeps/powerpc/powerpc32/power7/memchr.S | 2 +- sysdeps/powerpc/powerpc32/power7/memcmp.S | 4 ++-- sysdeps/powerpc/powerpc32/power7/memrchr.S | 2 +- sysdeps/powerpc/powerpc32/power7/strcasecmp.S | 4 ++-- sysdeps/powerpc/powerpc32/power7/strncmp.S | 2 +- 5 files changed, 7 insertions(+), 7 deletions(-) (limited to 'sysdeps/powerpc/powerpc32/power7') diff --git a/sysdeps/powerpc/powerpc32/power7/memchr.S b/sysdeps/powerpc/powerpc32/power7/memchr.S index 1412061206..3d8389e95c 100644 --- a/sysdeps/powerpc/powerpc32/power7/memchr.S +++ b/sysdeps/powerpc/powerpc32/power7/memchr.S @@ -44,7 +44,7 @@ L(proceed): rlwinm r6,r3,3,27,28 /* Calculate padding. */ cmpli cr6,r6,0 /* cr6 == Do we have padding? */ lwz r12,0(r8) /* Load word from memory. */ - cmpb r10,r12,r4 /* Check for BYTE's in WORD1. */ + cmpb r10,r12,r4 /* Check for BYTEs in WORD1. */ beq cr6,L(proceed_no_padding) slw r10,r10,r6 srw r10,r10,r6 diff --git a/sysdeps/powerpc/powerpc32/power7/memcmp.S b/sysdeps/powerpc/powerpc32/power7/memcmp.S index f2cb1dfc2f..815e3c3953 100644 --- a/sysdeps/powerpc/powerpc32/power7/memcmp.S +++ b/sysdeps/powerpc/powerpc32/power7/memcmp.S @@ -73,7 +73,7 @@ EALIGN (BP_SYM(memcmp),4,0) Otherwise we know the two strings have the same alignment (but not yet word aligned). So we force the string addresses to the next lower word boundary and special case this first word using shift left to - eliminate bits preceeding the first byte. Since we want to join the + eliminate bits preceding the first byte. Since we want to join the normal (word aligned) compare loop, starting at the second word, we need to adjust the length (rN) and special case the loop versioning for the first word. This insures that the loop count is @@ -520,7 +520,7 @@ L(zeroLength): Otherwise we know that rSTR1 is not aready word aligned yet. So we can force the string addresses to the next lower word boundary and special case this first word using shift left to - eliminate bits preceeding the first byte. Since we want to join the + eliminate bits preceding the first byte. Since we want to join the normal (Wualigned) compare loop, starting at the second word, we need to adjust the length (rN) and special case the loop versioning for the first W. This insures that the loop count is diff --git a/sysdeps/powerpc/powerpc32/power7/memrchr.S b/sysdeps/powerpc/powerpc32/power7/memrchr.S index a6f495521a..9ff8d662f5 100644 --- a/sysdeps/powerpc/powerpc32/power7/memrchr.S +++ b/sysdeps/powerpc/powerpc32/power7/memrchr.S @@ -51,7 +51,7 @@ L(proceed): cmpb r10,r12,r4 /* Check for BYTE in WORD1. */ slw r10,r10,r0 srw r10,r10,r0 - cmplwi cr7,r10,0 /* If r10 == 0, no BYTE's have been found. */ + cmplwi cr7,r10,0 /* If r10 == 0, no BYTEs have been found. */ bne cr7,L(done) /* Are we done already? */ diff --git a/sysdeps/powerpc/powerpc32/power7/strcasecmp.S b/sysdeps/powerpc/powerpc32/power7/strcasecmp.S index 2fcca034d5..52d73d9f89 100644 --- a/sysdeps/powerpc/powerpc32/power7/strcasecmp.S +++ b/sysdeps/powerpc/powerpc32/power7/strcasecmp.S @@ -39,8 +39,8 @@ ENTRY (BP_SYM (__STRCMP)) #define rSTR1 r5 /* 1st string */ #define rSTR2 r4 /* 2nd string */ #define rLOCARG r5 /* 3rd argument: locale_t */ -#define rCHAR1 r6 /* Byte readed from 1st string */ -#define rCHAR2 r7 /* Byte readed from 2nd string */ +#define rCHAR1 r6 /* Byte read from 1st string */ +#define rCHAR2 r7 /* Byte read from 2nd string */ #define rADDR1 r8 /* Address of tolower(rCHAR1) */ #define rADDR2 r12 /* Address of tolower(rCHAR2) */ #define rLWR1 r8 /* Byte tolower(rCHAR1) */ diff --git a/sysdeps/powerpc/powerpc32/power7/strncmp.S b/sysdeps/powerpc/powerpc32/power7/strncmp.S index 201651902c..3629783bc0 100644 --- a/sysdeps/powerpc/powerpc32/power7/strncmp.S +++ b/sysdeps/powerpc/powerpc32/power7/strncmp.S @@ -55,7 +55,7 @@ EALIGN (BP_SYM(strncmp),5,0) cmplwi cr1,rN,0 lis rFEFE,-0x101 bne L(unaligned) -/* We are word alligned so set up for two loops. first a word +/* We are word aligned so set up for two loops. first a word loop, then fall into the byte loop if any residual. */ srwi. rTMP,rN,2 clrlwi rN,rN,30 -- cgit 1.4.1