|
|
1.1 root 1: /*-
2: * Copyright (c) 1990 The Regents of the University of California.
3: * All rights reserved.
4: *
5: * This code is derived from software contributed to Berkeley by
6: * Chris Torek.
7: *
8: * Redistribution and use in source and binary forms are permitted
9: * provided that: (1) source distributions retain this entire copyright
10: * notice and comment, and (2) distributions including binaries display
11: * the following acknowledgement: ``This product includes software
12: * developed by the University of California, Berkeley and its contributors''
13: * in the documentation or other materials provided with the distribution
14: * and in all advertising materials mentioning features or use of this
15: * software. Neither the name of the University nor the names of its
16: * contributors may be used to endorse or promote products derived
17: * from this software without specific prior written permission.
18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
19: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
20: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
21: */
22:
23: #if defined(LIBC_SCCS) && !defined(lint)
24: static char sccsid[] = "@(#)strxfrm.c 5.1 (Berkeley) 5/17/90";
25: #endif /* LIBC_SCCS and not lint */
26:
27: #include <sys/stdc.h>
28: #include <string.h>
29:
30: /*
31: * Transform src, storing the result in dst, such that
32: * strcmp() on transformed strings returns what strcoll()
33: * on the original untransformed strings would return.
34: */
35: size_t
36: strxfrm(dst, src, n)
37: register char *dst;
38: register const char *src;
39: register size_t n;
40: {
41: register size_t r = 0;
42: register int c;
43:
44: /*
45: * Since locales are unimplemented, this is just a copy.
46: */
47: if (n != 0) {
48: while ((c = *src++) != 0) {
49: r++;
50: if (--n == 0) {
51: while (*src++ != 0)
52: r++;
53: break;
54: }
55: *dst++ = c;
56: }
57: *dst = 0;
58: }
59: return (r);
60: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.