mirror of https://github.com/lianthony/NT4.0
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1017 lines
23 KiB
1017 lines
23 KiB
//============================================================================
|
|
//
|
|
// DBCS aware string routines...
|
|
//
|
|
//
|
|
//============================================================================
|
|
|
|
#include "ctlspriv.h"
|
|
|
|
#ifdef WINNT
|
|
#include <winnlsp.h> // Get private NORM_ flag for StrEqIntl()
|
|
#endif
|
|
|
|
// WARNING: all of these APIs do not setup DS, so you can not access
|
|
// any data in the default data seg of this DLL.
|
|
//
|
|
// do not create any global variables... talk to chrisg if you don't
|
|
// understand thid
|
|
|
|
|
|
|
|
#ifdef WINNT
|
|
#define FASTCALL
|
|
#else
|
|
|
|
#ifdef DBCS
|
|
#define FASTCALL PASCAL
|
|
#else
|
|
#define FASTCALL _fastcall
|
|
#endif
|
|
|
|
#endif
|
|
|
|
#ifdef UNICODE
|
|
#define lstrfns_StrEndN lstrfns_StrEndNW
|
|
#define ChrCmp ChrCmpW
|
|
#define ChrCmpI ChrCmpIW
|
|
|
|
#else
|
|
#define lstrfns_StrEndN lstrfns_StrEndNA
|
|
#define ChrCmp ChrCmpA
|
|
#define ChrCmpI ChrCmpIA
|
|
|
|
#endif
|
|
|
|
|
|
/*
|
|
* StrEndN - Find the end of a string, but no more than n bytes
|
|
* Assumes lpStart points to start of null terminated string
|
|
* nBufSize is the maximum length
|
|
* returns ptr to just after the last byte to be included
|
|
*/
|
|
LPSTR NEAR FASTCALL lstrfns_StrEndNA(LPCSTR lpStart, int nBufSize)
|
|
{
|
|
LPCSTR lpEnd;
|
|
|
|
for (lpEnd = lpStart + nBufSize; *lpStart && OFFSETOF(lpStart) < OFFSETOF(lpEnd);
|
|
lpStart = AnsiNext(lpStart))
|
|
continue; /* just getting to the end of the string */
|
|
if (OFFSETOF(lpStart) > OFFSETOF(lpEnd))
|
|
{
|
|
/* We can only get here if the last byte before lpEnd was a lead byte
|
|
*/
|
|
lpStart -= 2;
|
|
}
|
|
return((LPSTR)lpStart);
|
|
}
|
|
|
|
LPWSTR NEAR FASTCALL lstrfns_StrEndNW(LPCWSTR lpStart, int nBufSize)
|
|
{
|
|
#ifdef UNICODE
|
|
LPCWSTR lpEnd;
|
|
|
|
for (lpEnd = lpStart + nBufSize; *lpStart && (lpStart < lpEnd);
|
|
lpStart++)
|
|
continue; /* just getting to the end of the string */
|
|
|
|
return((LPWSTR)lpStart);
|
|
|
|
#else
|
|
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return NULL;
|
|
|
|
#endif
|
|
}
|
|
|
|
|
|
// REVIEW WIN32 HACK - Convert to 32bit asm.
|
|
#ifndef WIN32
|
|
/*
|
|
* ReverseScan - Find last occurrence of a byte in a string
|
|
* Assumes lpSource points to first byte to check (end of the string)
|
|
* uLen is the number of bytes to check
|
|
* bMatch is the byte to match
|
|
* returns ptr to the last occurrence of ch in str, NULL if not found.
|
|
*/
|
|
LPSTR NEAR PASCAL ReverseScan(LPCSTR lpSource, UINT uLen, BYTE bMatch)
|
|
{
|
|
_asm
|
|
{
|
|
/* Load count */
|
|
mov cx,uLen
|
|
jcxz ReverseScanFail ; count is zero, return failure.
|
|
|
|
/* Load up es:di, ax */
|
|
les di,lpSource
|
|
mov al,bMatch
|
|
/* Set the direction flag based on bBackward
|
|
* Perform the search; return 0 if we reached the end of the string
|
|
* otherwise, return es:di+1
|
|
*/
|
|
std
|
|
repne scasb
|
|
jne ReverseScanFail ; check result of last compare.
|
|
|
|
inc di
|
|
mov dx,es
|
|
mov ax,di
|
|
jmp ReverseScanExit
|
|
|
|
ReverseScanFail:
|
|
xor ax,ax
|
|
xor dx,dx
|
|
|
|
/* clear the direction flag and return
|
|
*/
|
|
ReverseScanExit:
|
|
cld
|
|
}
|
|
if (0) return 0; // suppress warning, optimized out
|
|
}
|
|
#endif
|
|
|
|
/*
|
|
* ChrCmp - Case sensitive character comparison for DBCS
|
|
* Assumes w1, wMatch are characters to be compared
|
|
* Return FALSE if they match, TRUE if no match
|
|
*/
|
|
BOOL NEAR FASTCALL ChrCmpA(WORD w1, WORD wMatch)
|
|
{
|
|
/* Most of the time this won't match, so test it first for speed.
|
|
*/
|
|
if (LOBYTE(w1) == LOBYTE(wMatch))
|
|
{
|
|
if (IsDBCSLeadByte(LOBYTE(w1)))
|
|
{
|
|
return(w1 != wMatch);
|
|
}
|
|
return FALSE;
|
|
}
|
|
return TRUE;
|
|
}
|
|
|
|
BOOL NEAR FASTCALL ChrCmpW(WORD w1, WORD wMatch)
|
|
{
|
|
#ifdef UNICODE
|
|
return(!(w1 == wMatch));
|
|
#else
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return FALSE;
|
|
#endif
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
* ChrCmpI - Case insensitive character comparison for DBCS
|
|
* Assumes w1, wMatch are characters to be compared;
|
|
* HIBYTE of wMatch is 0 if not a DBC
|
|
* Return FALSE if match, TRUE if not
|
|
*/
|
|
BOOL NEAR FASTCALL ChrCmpIA(WORD w1, WORD wMatch)
|
|
{
|
|
char sz1[3], sz2[3];
|
|
|
|
if (IsDBCSLeadByte(sz1[0] = LOBYTE(w1)))
|
|
{
|
|
sz1[1] = HIBYTE(w1);
|
|
sz1[2] = '\0';
|
|
}
|
|
else
|
|
sz1[1] = '\0';
|
|
|
|
*(WORD FAR *)sz2 = wMatch;
|
|
sz2[2] = '\0';
|
|
return lstrcmpiA(sz1, sz2);
|
|
}
|
|
|
|
|
|
BOOL NEAR FASTCALL ChrCmpIW(WORD w1, WORD wMatch)
|
|
{
|
|
#ifdef UNICODE
|
|
TCHAR sz1[2], sz2[2];
|
|
|
|
sz1[0] = w1;
|
|
sz1[1] = TEXT('\0');
|
|
sz2[0] = wMatch;
|
|
sz2[1] = TEXT('\0');
|
|
|
|
return lstrcmpiW(sz1, sz2);
|
|
|
|
#else
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return FALSE;
|
|
|
|
#endif
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
* StrChr - Find first occurrence of character in string
|
|
* Assumes lpStart points to start of null terminated string
|
|
* wMatch is the character to match
|
|
* returns ptr to the first occurrence of ch in str, NULL if not found.
|
|
*/
|
|
LPSTR FAR PASCAL StrChrA(LPCSTR lpStart, WORD wMatch)
|
|
{
|
|
for ( ; *lpStart; lpStart = AnsiNext(lpStart))
|
|
{
|
|
if (!ChrCmpA(*(UNALIGNED WORD FAR *)lpStart, wMatch))
|
|
{
|
|
return((LPSTR)lpStart);
|
|
}
|
|
}
|
|
return (NULL);
|
|
}
|
|
|
|
LPWSTR FAR PASCAL StrChrW(LPCWSTR lpStart, WORD wMatch)
|
|
{
|
|
#ifdef UNICODE
|
|
|
|
for ( ; *lpStart; lpStart = AnsiNext(lpStart))
|
|
{
|
|
// Need a tmp word since casting ptr to WORD * will
|
|
// fault on MIPS, ALPHA
|
|
|
|
WORD wTmp;
|
|
memcpy(&wTmp, lpStart, sizeof(WORD));
|
|
|
|
if (!ChrCmpW(wTmp, wMatch))
|
|
{
|
|
return((LPWSTR)lpStart);
|
|
}
|
|
}
|
|
return (NULL);
|
|
|
|
#else
|
|
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return NULL;
|
|
|
|
#endif
|
|
}
|
|
|
|
/*
|
|
* StrRChr - Find last occurrence of character in string
|
|
* Assumes lpStart points to start of string
|
|
* lpEnd points to end of string (NOT included in search)
|
|
* wMatch is the character to match
|
|
* returns ptr to the last occurrence of ch in str, NULL if not found.
|
|
*/
|
|
LPSTR FAR PASCAL StrRChrA(LPCSTR lpStart, LPCSTR lpEnd, WORD wMatch)
|
|
{
|
|
LPCSTR lpFound = NULL;
|
|
|
|
if (!lpEnd)
|
|
lpEnd = lpStart + lstrlenA(lpStart);
|
|
|
|
for ( ; OFFSETOF(lpStart) < OFFSETOF(lpEnd); lpStart = AnsiNext(lpStart))
|
|
{
|
|
if (!ChrCmpA(*(UNALIGNED WORD FAR *)lpStart, wMatch))
|
|
lpFound = lpStart;
|
|
}
|
|
return ((LPSTR)lpFound);
|
|
}
|
|
|
|
LPWSTR FAR PASCAL StrRChrW(LPCWSTR lpStart, LPCWSTR lpEnd, WORD wMatch)
|
|
{
|
|
#ifdef UNICODE
|
|
|
|
LPCWSTR lpFound = NULL;
|
|
|
|
if (!lpEnd)
|
|
lpEnd = lpStart + lstrlenW(lpStart);
|
|
|
|
for ( ; lpStart < lpEnd; lpStart++)
|
|
{
|
|
if (!ChrCmpW(*(UNALIGNED WORD FAR *)lpStart, wMatch))
|
|
lpFound = lpStart;
|
|
}
|
|
return ((LPWSTR)lpFound);
|
|
|
|
#else
|
|
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return NULL;
|
|
|
|
#endif
|
|
}
|
|
|
|
/*
|
|
* StrChrI - Find first occurrence of character in string, case insensitive
|
|
* Assumes lpStart points to start of null terminated string
|
|
* wMatch is the character to match
|
|
* returns ptr to the first occurrence of ch in str, NULL if not found.
|
|
*/
|
|
LPSTR FAR PASCAL StrChrIA(LPCSTR lpStart, WORD wMatch)
|
|
{
|
|
wMatch = (UINT)(IsDBCSLeadByte(LOBYTE(wMatch)) ? wMatch : LOBYTE(wMatch));
|
|
|
|
for ( ; *lpStart; lpStart = AnsiNext(lpStart))
|
|
{
|
|
if (!ChrCmpIA(*(UNALIGNED WORD FAR *)lpStart, wMatch))
|
|
return((LPSTR)lpStart);
|
|
}
|
|
return (NULL);
|
|
}
|
|
|
|
LPWSTR FAR PASCAL StrChrIW(LPCWSTR lpStart, WORD wMatch)
|
|
{
|
|
#ifdef UNICODE
|
|
|
|
for ( ; *lpStart; lpStart++)
|
|
{
|
|
if (!ChrCmpIW(*(WORD FAR *)lpStart, wMatch))
|
|
return((LPWSTR)lpStart);
|
|
}
|
|
return (NULL);
|
|
|
|
#else
|
|
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return NULL;
|
|
|
|
#endif
|
|
}
|
|
|
|
/*
|
|
* StrRChrI - Find last occurrence of character in string, case insensitive
|
|
* Assumes lpStart points to start of string
|
|
* lpEnd points to end of string (NOT included in search)
|
|
* wMatch is the character to match
|
|
* returns ptr to the last occurrence of ch in str, NULL if not found.
|
|
*/
|
|
LPSTR FAR PASCAL StrRChrIA(LPCSTR lpStart, LPCSTR lpEnd, WORD wMatch)
|
|
{
|
|
LPCSTR lpFound = NULL;
|
|
|
|
if (!lpEnd)
|
|
lpEnd = lpStart + lstrlenA(lpStart);
|
|
|
|
wMatch = (UINT)(IsDBCSLeadByte(LOBYTE(wMatch)) ? wMatch : LOBYTE(wMatch));
|
|
|
|
for ( ; OFFSETOF(lpStart) < OFFSETOF(lpEnd); lpStart = AnsiNext(lpStart))
|
|
{
|
|
if (!ChrCmpIA(*(UNALIGNED WORD FAR *)lpStart, wMatch))
|
|
lpFound = lpStart;
|
|
}
|
|
return ((LPSTR)lpFound);
|
|
}
|
|
|
|
LPWSTR FAR PASCAL StrRChrIW(LPCWSTR lpStart, LPCWSTR lpEnd, WORD wMatch)
|
|
{
|
|
#ifdef UNICODE
|
|
|
|
LPCWSTR lpFound = NULL;
|
|
|
|
if (!lpEnd)
|
|
lpEnd = lpStart + lstrlenW(lpStart);
|
|
|
|
for ( ; lpStart < lpEnd; lpStart++)
|
|
{
|
|
if (!ChrCmpIW(*(WORD FAR *)lpStart, wMatch))
|
|
lpFound = lpStart;
|
|
}
|
|
return ((LPWSTR)lpFound);
|
|
|
|
#else
|
|
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return NULL;
|
|
|
|
#endif
|
|
}
|
|
|
|
|
|
// StrCSpn: return index to first char of lpStr that is present in lpSet.
|
|
// Includes the NUL in the comparison; if no lpSet chars are found, returns
|
|
// the index to the NUL in lpStr.
|
|
// Just like CRT strcspn.
|
|
//
|
|
int FAR PASCAL StrCSpnA(LPCSTR lpStr, LPCSTR lpSet)
|
|
{
|
|
// nature of the beast: O(lpStr*lpSet) work
|
|
LPCSTR lp = lpStr;
|
|
if (!lpStr || !lpSet)
|
|
return 0;
|
|
|
|
while (*lp)
|
|
{
|
|
if (StrChrA(lpSet, *(UNALIGNED WORD FAR *)lp))
|
|
return (int)(lp-lpStr);
|
|
lp = AnsiNext(lp);
|
|
}
|
|
|
|
return (int)(lp-lpStr); // ==lstrlen(lpStr)
|
|
}
|
|
|
|
int FAR PASCAL StrCSpnW(LPCWSTR lpStr, LPCWSTR lpSet)
|
|
{
|
|
#ifdef UNICODE
|
|
|
|
// nature of the beast: O(lpStr*lpSet) work
|
|
LPCWSTR lp = lpStr;
|
|
if (!lpStr || !lpSet)
|
|
return 0;
|
|
|
|
while (*lp)
|
|
{
|
|
if (StrChrW(lpSet, *(WORD FAR *)lp))
|
|
return (int)(lp-lpStr);
|
|
lp++;
|
|
}
|
|
|
|
return (int)(lp-lpStr); // ==lstrlen(lpStr)
|
|
|
|
#else
|
|
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return -1;
|
|
|
|
#endif
|
|
}
|
|
|
|
// StrCSpnI: case-insensitive version of StrCSpn.
|
|
//
|
|
int FAR PASCAL StrCSpnIA(LPCSTR lpStr, LPCSTR lpSet)
|
|
{
|
|
// nature of the beast: O(lpStr*lpSet) work
|
|
LPCSTR lp = lpStr;
|
|
if (!lpStr || !lpSet)
|
|
return 0;
|
|
|
|
while (*lp)
|
|
{
|
|
if (StrChrIA(lpSet, *(UNALIGNED WORD FAR *)lp))
|
|
return (int)(lp-lpStr);
|
|
lp = AnsiNext(lp);
|
|
}
|
|
|
|
return (int)(lp-lpStr); // ==lstrlen(lpStr)
|
|
}
|
|
|
|
int FAR PASCAL StrCSpnIW(LPCWSTR lpStr, LPCWSTR lpSet)
|
|
{
|
|
#ifdef UNICODE
|
|
// nature of the beast: O(lpStr*lpSet) work
|
|
LPCWSTR lp = lpStr;
|
|
if (!lpStr || !lpSet)
|
|
return 0;
|
|
|
|
while (*lp)
|
|
{
|
|
if (StrChrIW(lpSet, *(WORD FAR *)lp))
|
|
return (int)(lp-lpStr);
|
|
lp++;
|
|
}
|
|
|
|
return (int)(lp-lpStr); // ==lstrlen(lpStr)
|
|
|
|
#else
|
|
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return -1;
|
|
|
|
#endif
|
|
}
|
|
|
|
|
|
/*
|
|
* StrCmpN - Compare n bytes
|
|
*
|
|
* returns See lstrcmp return values.
|
|
* BUGBUG, won't work if source strings are in ROM
|
|
*/
|
|
int FAR PASCAL StrCmpNA(LPCSTR lpStr1, LPCSTR lpStr2, int nChar)
|
|
{
|
|
char sz1[4];
|
|
char sz2[4];
|
|
int i;
|
|
LPCSTR lpszEnd = lpStr1 + nChar;
|
|
|
|
//DebugMsg(DM_TRACE, "StrCmpN: %s %s %d returns:", lpStr1, lpStr2, nChar);
|
|
|
|
for ( ; (lpszEnd > lpStr1) && (*lpStr1 || *lpStr2); lpStr1 = AnsiNext(lpStr1), lpStr2 = AnsiNext(lpStr2)) {
|
|
WORD wMatch;
|
|
|
|
if (IsDBCSLeadByte(*lpStr2))
|
|
lpStr2++;
|
|
|
|
wMatch = (WORD) *lpStr2;
|
|
|
|
i = ChrCmpA(*(UNALIGNED WORD FAR *)lpStr1, wMatch);
|
|
if (i) {
|
|
int iRet;
|
|
|
|
(*(WORD FAR *)sz1) = *(UNALIGNED WORD FAR *)lpStr1;
|
|
(*(WORD FAR *)sz2) = *(UNALIGNED WORD FAR *)lpStr2;
|
|
*AnsiNext(sz1) = 0;
|
|
*AnsiNext(sz2) = 0;
|
|
iRet = lstrcmpA(sz1, sz2);
|
|
//DebugMsg(DM_TRACE, ".................... %d", iRet);
|
|
return iRet;
|
|
}
|
|
}
|
|
|
|
//DebugMsg(DM_TRACE, ".................... 0");
|
|
return 0;
|
|
}
|
|
|
|
int FAR PASCAL StrCmpNW(LPCWSTR lpStr1, LPCWSTR lpStr2, int nChar)
|
|
{
|
|
#ifdef UNICODE
|
|
|
|
WCHAR sz1[2];
|
|
WCHAR sz2[2];
|
|
int i;
|
|
LPCWSTR lpszEnd = lpStr1 + nChar;
|
|
|
|
//DebugMsg(DM_TRACE, "StrCmpN: %s %s %d returns:", lpStr1, lpStr2, nChar);
|
|
|
|
for ( ; (lpszEnd > lpStr1) && (*lpStr1 || *lpStr2); lpStr1++, lpStr2++) {
|
|
i = ChrCmpW(*lpStr1, *lpStr2);
|
|
if (i) {
|
|
int iRet;
|
|
|
|
sz1[0] = *lpStr1;
|
|
sz2[0] = *lpStr2;
|
|
sz1[1] = TEXT('\0');
|
|
sz2[1] = TEXT('\0');
|
|
iRet = lstrcmpW(sz1, sz2);
|
|
//DebugMsg(DM_TRACE, ".................... %d", iRet);
|
|
return iRet;
|
|
}
|
|
}
|
|
|
|
//DebugMsg(DM_TRACE, ".................... 0");
|
|
return 0;
|
|
|
|
#else
|
|
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return -1;
|
|
|
|
#endif
|
|
}
|
|
|
|
/*
|
|
* StrCmpNI - Compare n bytes, case insensitive
|
|
*
|
|
* returns See lstrcmpi return values.
|
|
*/
|
|
int FAR PASCAL StrCmpNIA(LPCSTR lpStr1, LPCSTR lpStr2, int nChar)
|
|
{
|
|
int i;
|
|
LPCSTR lpszEnd = lpStr1 + nChar;
|
|
|
|
//DebugMsg(DM_TRACE, "StrCmpNI: %s %s %d returns:", lpStr1, lpStr2, nChar);
|
|
|
|
for ( ; (lpszEnd > lpStr1) && (*lpStr1 || *lpStr2); (lpStr1 = AnsiNext(lpStr1)), (lpStr2 = AnsiNext(lpStr2))) {
|
|
WORD wMatch;
|
|
|
|
if (IsDBCSLeadByte(*lpStr2))
|
|
lpStr2++;
|
|
|
|
wMatch = (WORD) *lpStr2;
|
|
|
|
i = ChrCmpIA(*(UNALIGNED WORD FAR *)lpStr1, wMatch);
|
|
if (i) {
|
|
//DebugMsg(DM_TRACE, ".................... %d", i);
|
|
return i;
|
|
}
|
|
}
|
|
//DebugMsg(DM_TRACE, ".................... 0");
|
|
return 0;
|
|
}
|
|
|
|
int FAR PASCAL StrCmpNIW(LPCWSTR lpStr1, LPCWSTR lpStr2, int nChar)
|
|
{
|
|
#ifdef UNICODE
|
|
|
|
int i;
|
|
LPCWSTR lpszEnd = lpStr1 + nChar;
|
|
|
|
//DebugMsg(DM_TRACE, "StrCmpNI: %s %s %d returns:", lpStr1, lpStr2, nChar);
|
|
|
|
for ( ; (lpszEnd > lpStr1) && (*lpStr1 || *lpStr2); lpStr1++, lpStr2++) {
|
|
i = ChrCmpIW(*lpStr1, *lpStr2);
|
|
if (i) {
|
|
//DebugMsg(DM_TRACE, ".................... %d", i);
|
|
return i;
|
|
}
|
|
}
|
|
//DebugMsg(DM_TRACE, ".................... 0");
|
|
return 0;
|
|
|
|
#else
|
|
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return -1;
|
|
|
|
#endif
|
|
}
|
|
|
|
/*
|
|
* IntlStrEq
|
|
*
|
|
* returns TRUE if strings are equal, FALSE if not
|
|
*/
|
|
BOOL FAR PASCAL IntlStrEqWorkerA(BOOL fCaseSens, LPCSTR lpString1, LPCSTR lpString2, int nChar) {
|
|
int retval;
|
|
DWORD dwFlags = fCaseSens ? LOCALE_USE_CP_ACP : (NORM_IGNORECASE | LOCALE_USE_CP_ACP);
|
|
|
|
#ifdef WINNT
|
|
//
|
|
// On NT we can tell CompareString to stop at a '\0' if one is found before nChar chars
|
|
//
|
|
dwFlags |= NORM_STOP_ON_NULL;
|
|
#else
|
|
//
|
|
// On Win9x we have to do the check manually
|
|
//
|
|
if (nChar != -1) {
|
|
LPSTR psz1, psz2;
|
|
int cch = 0;
|
|
|
|
psz1 = lpString1;
|
|
psz2 = lpString2;
|
|
|
|
while( *psz1 != '\0' && *psz2 != '\0' && cch < nChar) {
|
|
#ifdef DBCS
|
|
psz1 = CharNextA(psz1);
|
|
psz2 = CharNextA(psz2);
|
|
|
|
cch = min(psz1 - lpString1, psz2 - lpString2);
|
|
#else
|
|
psz1++;
|
|
psz2++;
|
|
cch++;
|
|
#endif
|
|
}
|
|
|
|
// add one in for terminating '\0'
|
|
cch++;
|
|
|
|
if (cch < nChar) {
|
|
nChar = cch;
|
|
}
|
|
}
|
|
#endif
|
|
|
|
retval = CompareStringA( GetThreadLocale(),
|
|
dwFlags,
|
|
lpString1,
|
|
nChar,
|
|
lpString2,
|
|
nChar );
|
|
if (retval == 0)
|
|
{
|
|
//
|
|
// The caller is not expecting failure. Try the system
|
|
// default locale id.
|
|
//
|
|
retval = CompareStringA( GetSystemDefaultLCID(),
|
|
dwFlags,
|
|
lpString1,
|
|
nChar,
|
|
lpString2,
|
|
nChar );
|
|
}
|
|
|
|
if (retval == 0)
|
|
{
|
|
if (lpString1 && lpString2)
|
|
{
|
|
//
|
|
// The caller is not expecting failure. We've never had a
|
|
// failure indicator before. We'll do a best guess by calling
|
|
// the C runtimes to do a non-locale sensitive compare.
|
|
//
|
|
if (fCaseSens)
|
|
retval = StrCmpNA(lpString1, lpString2, nChar) + 2;
|
|
else {
|
|
retval = StrCmpNIA(lpString1, lpString2, nChar) + 2;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
retval = 2;
|
|
}
|
|
}
|
|
|
|
return (retval == 2);
|
|
|
|
}
|
|
|
|
BOOL FAR PASCAL IntlStrEqWorkerW(BOOL fCaseSens, LPCTSTR lpString1, LPCTSTR lpString2, int nChar) {
|
|
#ifdef UNICODE
|
|
int retval;
|
|
DWORD dwFlags = fCaseSens ? 0 : NORM_IGNORECASE;
|
|
|
|
#ifdef WINNT
|
|
//
|
|
// On NT we can tell CompareString to stop at a '\0' if one is found before nChar chars
|
|
//
|
|
dwFlags |= NORM_STOP_ON_NULL;
|
|
#else
|
|
//
|
|
// On Win9x we have to do the check manually
|
|
//
|
|
if (nChar != -1) {
|
|
LPWSTR psz1, psz2;
|
|
int cch = 0;
|
|
|
|
psz1 = lpString1;
|
|
psz2 = lpString2;
|
|
|
|
while( *psz1 != TEXT('\0') && *psz2 != TEXT('\0') && cch < nChar) {
|
|
psz1++;
|
|
psz2++;
|
|
cch++;
|
|
}
|
|
|
|
// add one in for terminating '\0'
|
|
cch++;
|
|
|
|
if (cch < nChar) {
|
|
nChar = cch;
|
|
}
|
|
}
|
|
#endif
|
|
|
|
# if 0
|
|
# pragma message(__FILE__"(599): warning : remove debug code!")
|
|
OutputDebugString(TEXT("StrCmpWorkerW: comparing ["));
|
|
OutputDebugString(lpString1);
|
|
OutputDebugString(TEXT("] and ["));
|
|
OutputDebugString(lpString2);
|
|
OutputDebugString(TEXT("] returning... "));
|
|
# endif
|
|
|
|
|
|
retval = CompareStringW( GetThreadLocale(),
|
|
dwFlags,
|
|
lpString1,
|
|
nChar,
|
|
lpString2,
|
|
nChar );
|
|
if (retval == 0)
|
|
{
|
|
//
|
|
// The caller is not expecting failure. Try the system
|
|
// default locale id.
|
|
//
|
|
retval = CompareStringW( GetSystemDefaultLCID(),
|
|
dwFlags,
|
|
lpString1,
|
|
nChar,
|
|
lpString2,
|
|
nChar );
|
|
}
|
|
|
|
if (retval == 0)
|
|
{
|
|
if (lpString1 && lpString2)
|
|
{
|
|
//
|
|
// The caller is not expecting failure. We've never had a
|
|
// failure indicator before. We'll do a best guess by calling
|
|
// the C runtimes to do a non-locale sensitive compare.
|
|
//
|
|
if (fCaseSens)
|
|
retval = StrCmpNW(lpString1, lpString2, nChar) + 2;
|
|
else {
|
|
retval = StrCmpNIW(lpString1, lpString2, nChar) + 2;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
retval = 2;
|
|
}
|
|
}
|
|
|
|
|
|
# if 0
|
|
OutputDebugString(retval == 2 ? TEXT("TRUE\n") : TEXT("FALSE\n"));
|
|
# endif
|
|
|
|
return (retval == 2);
|
|
|
|
#else
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return FALSE;
|
|
#endif
|
|
}
|
|
|
|
|
|
// REVIEW WIN32 HACK - Cut a dependancy on ReverseScan (it's in asm).
|
|
#ifndef WIN32
|
|
/*
|
|
* StrRStr - Search for last occurrence of a substring
|
|
*
|
|
* Assumes lpSource points to the null terminated source string
|
|
* lpLast points to where to search from in the source string
|
|
* lpLast is not included in the search
|
|
* lpSrch points to string to search for
|
|
* returns last occurrence of string if successful; NULL otherwise
|
|
*/
|
|
LPSTR FAR PASCAL StrRStr(LPCSTR lpSource, LPCSTR lpLast, LPCSTR lpSrch)
|
|
{
|
|
UINT uLen;
|
|
BYTE bMatch;
|
|
|
|
uLen = (UINT)lstrlen(lpSrch);
|
|
bMatch = *lpSrch;
|
|
|
|
if (!lpLast)
|
|
lpLast = lpSource + lstrlen(lpSource);
|
|
|
|
for ( ; ; )
|
|
{
|
|
/* Return NULL if we hit the exact beginning of the string
|
|
*/
|
|
if (lpLast == lpSource)
|
|
return(NULL);
|
|
|
|
--lpLast;
|
|
|
|
/* Break if we hit the beginning of the string
|
|
*/
|
|
if ((lpLast=ReverseScan(lpLast, (UINT)(OFFSETOF(lpLast)-OFFSETOF(lpSource)+1),
|
|
bMatch)) == 0)
|
|
break;
|
|
|
|
/* Break if we found the string, and its first byte is not a tail byte
|
|
*/
|
|
if (!StrCmpN(lpLast, lpSrch, uLen) &&
|
|
(lpLast==lstrfns_StrEndN(lpSource, (int)(OFFSETOF(lpLast)-OFFSETOF(lpSource)))))
|
|
break;
|
|
}
|
|
|
|
return((LPSTR)lpLast);
|
|
}
|
|
#endif
|
|
|
|
/*
|
|
* StrRStrI - Search for last occurrence of a substring
|
|
*
|
|
* Assumes lpSource points to the null terminated source string
|
|
* lpLast points to where to search from in the source string
|
|
* lpLast is not included in the search
|
|
* lpSrch points to string to search for
|
|
* returns last occurrence of string if successful; NULL otherwise
|
|
*/
|
|
LPSTR FAR PASCAL StrRStrIA(LPCSTR lpSource, LPCSTR lpLast, LPCSTR lpSrch)
|
|
{
|
|
LPCSTR lpFound = NULL;
|
|
LPSTR lpEnd;
|
|
char cHold;
|
|
|
|
if (!lpLast)
|
|
lpLast = lpSource + lstrlenA(lpSource);
|
|
|
|
if (lpSource >= lpLast || *lpSrch == 0)
|
|
return NULL;
|
|
|
|
lpEnd = lstrfns_StrEndNA(lpLast, (UINT)(lstrlenA(lpSrch)-1));
|
|
cHold = *lpEnd;
|
|
*lpEnd = 0;
|
|
|
|
while ((lpSource = StrStrIA(lpSource, lpSrch))!=0 &&
|
|
OFFSETOF(lpSource) < OFFSETOF(lpLast))
|
|
{
|
|
lpFound = lpSource;
|
|
lpSource = AnsiNext(lpSource);
|
|
}
|
|
*lpEnd = cHold;
|
|
return((LPSTR)lpFound);
|
|
}
|
|
|
|
LPWSTR FAR PASCAL StrRStrIW(LPCWSTR lpSource, LPCWSTR lpLast, LPCWSTR lpSrch)
|
|
{
|
|
#ifdef UNICODE
|
|
LPCWSTR lpFound = NULL;
|
|
LPWSTR lpEnd;
|
|
WCHAR cHold;
|
|
|
|
if (!lpLast)
|
|
lpLast = lpSource + lstrlenW(lpSource);
|
|
|
|
if (lpSource >= lpLast || *lpSrch == 0)
|
|
return NULL;
|
|
|
|
lpEnd = lstrfns_StrEndNW(lpLast, (UINT)(lstrlenW(lpSrch)-1));
|
|
cHold = *lpEnd;
|
|
*lpEnd = 0;
|
|
|
|
while ((lpSource = StrStrIW(lpSource, lpSrch))!=0 &&
|
|
lpSource < lpLast)
|
|
{
|
|
lpFound = lpSource;
|
|
lpSource++;
|
|
}
|
|
*lpEnd = cHold;
|
|
return((LPWSTR)lpFound);
|
|
|
|
#else
|
|
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return NULL;
|
|
|
|
#endif
|
|
}
|
|
|
|
/*
|
|
* StrStr - Search for first occurrence of a substring
|
|
*
|
|
* Assumes lpSource points to source string
|
|
* lpSrch points to string to search for
|
|
* returns first occurrence of string if successful; NULL otherwise
|
|
*/
|
|
LPSTR FAR PASCAL StrStrA(LPCSTR lpFirst, LPCSTR lpSrch)
|
|
{
|
|
UINT uLen;
|
|
WORD wMatch;
|
|
|
|
uLen = (UINT)lstrlenA(lpSrch);
|
|
wMatch = *(UNALIGNED WORD FAR *)lpSrch;
|
|
|
|
for ( ; (lpFirst=StrChrA(lpFirst, wMatch))!=0 && !IntlStrEqNA(lpFirst, lpSrch, uLen);
|
|
lpFirst=AnsiNext(lpFirst))
|
|
continue; /* continue until we hit the end of the string or get a match */
|
|
|
|
return((LPSTR)lpFirst);
|
|
}
|
|
|
|
LPWSTR FAR PASCAL StrStrW(LPCWSTR lpFirst, LPCWSTR lpSrch)
|
|
{
|
|
#ifdef UNICODE
|
|
|
|
UINT uLen;
|
|
WORD wMatch;
|
|
|
|
uLen = (UINT)lstrlenW(lpSrch);
|
|
wMatch = *(WORD FAR *)lpSrch;
|
|
|
|
for ( ; (lpFirst=StrChrW(lpFirst, wMatch))!=0 && !IntlStrEqNW(lpFirst, lpSrch, uLen);
|
|
lpFirst++)
|
|
continue; /* continue until we hit the end of the string or get a match */
|
|
|
|
return((LPWSTR)lpFirst);
|
|
|
|
#else
|
|
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return NULL;
|
|
|
|
#endif
|
|
}
|
|
|
|
/*
|
|
* StrStrI - Search for first occurrence of a substring, case insensitive
|
|
*
|
|
* Assumes lpFirst points to source string
|
|
* lpSrch points to string to search for
|
|
* returns first occurrence of string if successful; NULL otherwise
|
|
*/
|
|
LPSTR FAR PASCAL StrStrIA(LPCSTR lpFirst, LPCSTR lpSrch)
|
|
{
|
|
UINT uLen;
|
|
WORD wMatch;
|
|
|
|
uLen = (UINT)lstrlenA(lpSrch);
|
|
wMatch = *(UNALIGNED WORD FAR *)lpSrch;
|
|
|
|
for ( ; (lpFirst = StrChrIA(lpFirst, wMatch)) != 0 && !IntlStrEqNIA(lpFirst, lpSrch, uLen);
|
|
lpFirst=AnsiNext(lpFirst))
|
|
continue; /* continue until we hit the end of the string or get a match */
|
|
|
|
return((LPSTR)lpFirst);
|
|
}
|
|
|
|
LPWSTR FAR PASCAL StrStrIW(LPCWSTR lpFirst, LPCWSTR lpSrch)
|
|
{
|
|
#ifdef UNICODE
|
|
|
|
UINT uLen;
|
|
WORD wMatch;
|
|
|
|
uLen = (UINT)lstrlenW(lpSrch);
|
|
wMatch = *(WORD FAR *)lpSrch;
|
|
|
|
for ( ; (lpFirst = StrChrIW(lpFirst, wMatch)) != 0 && !IntlStrEqNIW(lpFirst, lpSrch, uLen);
|
|
lpFirst++)
|
|
continue; /* continue until we hit the end of the string or get a match */
|
|
|
|
return((LPWSTR)lpFirst);
|
|
|
|
#else
|
|
|
|
SetLastErrorEx(ERROR_CALL_NOT_IMPLEMENTED, SLE_WARNING);
|
|
return NULL;
|
|
|
|
#endif
|
|
}
|