85 lines
2.5 KiB
C
85 lines
2.5 KiB
C
|
/*
|
||
|
|
* strstr.c --
|
||
|
|
*
|
||
|
|
* Source code for the "strstr" library routine.
|
||
|
|
*
|
||
|
|
* Copyright (c) 1988-1993 The Regents of the University of California.
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* Permission is hereby granted, without written agreement and without
|
||
|
|
* license or royalty fees, to use, copy, modify, and distribute this
|
||
|
|
* software and its documentation for any purpose, provided that the
|
||
|
|
* above copyright notice and the following two paragraphs appear in
|
||
|
|
* all copies of this software.
|
||
|
|
*
|
||
|
|
* IN NO EVENT SHALL THE UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY FOR
|
||
|
|
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT
|
||
|
|
* OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY OF
|
||
|
|
* CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
*
|
||
|
|
* THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY WARRANTIES,
|
||
|
|
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
|
||
|
|
* AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
|
||
|
|
* ON AN "AS IS" BASIS, AND THE UNIVERSITY OF CALIFORNIA HAS NO OBLIGATION TO
|
||
|
|
* PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef lint
|
||
|
|
static char rcsid[] = "$Header: /user6/ouster/tcl/compat/RCS/strstr.c,v 1.2 93/03/19 15:25:40 ouster Exp $ SPRITE (Berkeley)";
|
||
|
|
#endif /* not lint */
|
||
|
|
|
||
|
|
/*
|
||
|
|
*----------------------------------------------------------------------
|
||
|
|
*
|
||
|
|
* strstr --
|
||
|
|
*
|
||
|
|
* Locate the first instance of a substring in a string.
|
||
|
|
*
|
||
|
|
* Results:
|
||
|
|
* If string contains substring, the return value is the
|
||
|
|
* location of the first matching instance of substring
|
||
|
|
* in string. If string doesn't contain substring, the
|
||
|
|
* return value is 0. Matching is done on an exact
|
||
|
|
* character-for-character basis with no wildcards or special
|
||
|
|
* characters.
|
||
|
|
*
|
||
|
|
* Side effects:
|
||
|
|
* None.
|
||
|
|
*
|
||
|
|
*----------------------------------------------------------------------
|
||
|
|
*/
|
||
|
|
|
||
|
|
char *
|
||
|
|
strstr(string, substring)
|
||
|
|
register char *string; /* String to search. */
|
||
|
|
char *substring; /* Substring to try to find in string. */
|
||
|
|
{
|
||
|
|
register char *a, *b;
|
||
|
|
|
||
|
|
/* First scan quickly through the two strings looking for a
|
||
|
|
* single-character match. When it's found, then compare the
|
||
|
|
* rest of the substring.
|
||
|
|
*/
|
||
|
|
|
||
|
|
b = substring;
|
||
|
|
if (*b == 0) {
|
||
|
|
return string;
|
||
|
|
}
|
||
|
|
for ( ; *string != 0; string += 1) {
|
||
|
|
if (*string != *b) {
|
||
|
|
continue;
|
||
|
|
}
|
||
|
|
a = string;
|
||
|
|
while (1) {
|
||
|
|
if (*b == 0) {
|
||
|
|
return string;
|
||
|
|
}
|
||
|
|
if (*a++ != *b++) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
b = substring;
|
||
|
|
}
|
||
|
|
return (char *) 0;
|
||
|
|
}
|