8322 nl: misleading-indentation
[unleashed/tickless.git] / usr / src / lib / libmail / common / substr.c
blob97ad4e90bf26a3c02e90e0b44ff8559e12466b30
1 /*
2 * CDDL HEADER START
4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License (the "License").
6 * You may not use this file except in compliance with the License.
8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 * or http://www.opensolaris.org/os/licensing.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
19 * CDDL HEADER END
23 * Copyright 2008 Sun Microsystems, Inc. All rights reserved.
24 * Use is subject to license terms.
27 /* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
28 /* All Rights Reserved */
30 #pragma ident "%Z%%M% %I% %E% SMI"
32 #include <sys/types.h>
33 #include "libmail.h"
36 * This routine looks for string2 in string1.
37 * If found, it returns the position string2 is found at,
38 * otherwise it returns a -1.
40 int
41 substr(char *string1, char *string2)
43 int i, j, len1, len2;
45 /* the size of the substring will always fit into an int */
46 /*LINTED*/
47 len1 = (int)strlen(string1);
48 /*LINTED*/
49 len2 = (int)strlen(string2);
50 for (i = 0; i < len1 - len2 + 1; i++) {
51 for (j = 0; j < len2 && string1[i+j] == string2[j]; j++)
52 continue;
53 if (j == len2)
54 return (i);
56 return (-1);