1da2e3ebdSchin /***********************************************************************
2da2e3ebdSchin *                                                                      *
3da2e3ebdSchin *               This software is part of the ast package               *
4*b30d1939SAndy Fiddaman *          Copyright (c) 1985-2011 AT&T Intellectual Property          *
5da2e3ebdSchin *                      and is licensed under the                       *
6*b30d1939SAndy Fiddaman *                 Eclipse Public License, Version 1.0                  *
77c2fbfb3SApril Chin *                    by AT&T Intellectual Property                     *
8da2e3ebdSchin *                                                                      *
9da2e3ebdSchin *                A copy of the License is available at                 *
10*b30d1939SAndy Fiddaman *          http://www.eclipse.org/org/documents/epl-v10.html           *
11*b30d1939SAndy Fiddaman *         (with md5 checksum b35adb5213ca9657e911e9befb180842)         *
12da2e3ebdSchin *                                                                      *
13da2e3ebdSchin *              Information and Software Systems Research               *
14da2e3ebdSchin *                            AT&T Research                             *
15da2e3ebdSchin *                           Florham Park NJ                            *
16da2e3ebdSchin *                                                                      *
17da2e3ebdSchin *                 Glenn Fowler <gsf@research.att.com>                  *
18da2e3ebdSchin *                  David Korn <dgk@research.att.com>                   *
19da2e3ebdSchin *                   Phong Vo <kpv@research.att.com>                    *
20da2e3ebdSchin *                                                                      *
21da2e3ebdSchin ***********************************************************************/
22da2e3ebdSchin #pragma prototyped
23da2e3ebdSchin 
2434f9b3eeSRoland Mainz #include <ast.h>
2534f9b3eeSRoland Mainz 
26da2e3ebdSchin /*
2734f9b3eeSRoland Mainz  * path prefix strncmp(3) -- longest first!
28da2e3ebdSchin  */
29da2e3ebdSchin 
30da2e3ebdSchin int
strnpcmp(register const char * a,register const char * b,size_t n)3134f9b3eeSRoland Mainz strnpcmp(register const char* a, register const char* b, size_t n)
32da2e3ebdSchin {
3334f9b3eeSRoland Mainz 	register const char*	e;
34da2e3ebdSchin 
3534f9b3eeSRoland Mainz 	e = a + n;
3634f9b3eeSRoland Mainz 	for (;;)
37da2e3ebdSchin 	{
3834f9b3eeSRoland Mainz 		if (a >= e)
3934f9b3eeSRoland Mainz 			return 0;
4034f9b3eeSRoland Mainz 		if (*a != *b)
4134f9b3eeSRoland Mainz 			break;
4234f9b3eeSRoland Mainz 		if (!*a++)
4334f9b3eeSRoland Mainz 			return 0;
4434f9b3eeSRoland Mainz 		b++;
45da2e3ebdSchin 	}
4634f9b3eeSRoland Mainz 	if (*a == 0 && *b == '/')
4734f9b3eeSRoland Mainz 		return 1;
4834f9b3eeSRoland Mainz 	if (*a == '/' && *b == 0)
4934f9b3eeSRoland Mainz 		return -1;
5034f9b3eeSRoland Mainz 	return (a < b) ? -1 : 1;
51da2e3ebdSchin }
52