nexmon – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | office | 1 | /* |
2 | * Copyright (c) 1987 Regents of the University of California. |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms are permitted |
||
6 | * provided that this notice is preserved and that due credit is given |
||
7 | * to the University of California at Berkeley. The name of the University |
||
8 | * may not be used to endorse or promote products derived from this |
||
9 | * software without specific written prior permission. This software |
||
10 | * is provided ``as is'' without express or implied warranty. |
||
11 | */ |
||
12 | |||
13 | #ifdef HAVE_CONFIG_H |
||
14 | #include "config.h" |
||
15 | #endif |
||
16 | |||
17 | #include <tcpdump-stdinc.h> |
||
18 | |||
19 | #include "interface.h" |
||
20 | |||
21 | /* |
||
22 | * This array is designed for mapping upper and lower case letter |
||
23 | * together for a case independent comparison. The mappings are |
||
24 | * based upon ascii character sequences. |
||
25 | */ |
||
26 | static const u_char charmap[] = { |
||
27 | '\000', '\001', '\002', '\003', '\004', '\005', '\006', '\007', |
||
28 | '\010', '\011', '\012', '\013', '\014', '\015', '\016', '\017', |
||
29 | '\020', '\021', '\022', '\023', '\024', '\025', '\026', '\027', |
||
30 | '\030', '\031', '\032', '\033', '\034', '\035', '\036', '\037', |
||
31 | '\040', '\041', '\042', '\043', '\044', '\045', '\046', '\047', |
||
32 | '\050', '\051', '\052', '\053', '\054', '\055', '\056', '\057', |
||
33 | '\060', '\061', '\062', '\063', '\064', '\065', '\066', '\067', |
||
34 | '\070', '\071', '\072', '\073', '\074', '\075', '\076', '\077', |
||
35 | '\100', '\141', '\142', '\143', '\144', '\145', '\146', '\147', |
||
36 | '\150', '\151', '\152', '\153', '\154', '\155', '\156', '\157', |
||
37 | '\160', '\161', '\162', '\163', '\164', '\165', '\166', '\167', |
||
38 | '\170', '\171', '\172', '\133', '\134', '\135', '\136', '\137', |
||
39 | '\140', '\141', '\142', '\143', '\144', '\145', '\146', '\147', |
||
40 | '\150', '\151', '\152', '\153', '\154', '\155', '\156', '\157', |
||
41 | '\160', '\161', '\162', '\163', '\164', '\165', '\166', '\167', |
||
42 | '\170', '\171', '\172', '\173', '\174', '\175', '\176', '\177', |
||
43 | '\200', '\201', '\202', '\203', '\204', '\205', '\206', '\207', |
||
44 | '\210', '\211', '\212', '\213', '\214', '\215', '\216', '\217', |
||
45 | '\220', '\221', '\222', '\223', '\224', '\225', '\226', '\227', |
||
46 | '\230', '\231', '\232', '\233', '\234', '\235', '\236', '\237', |
||
47 | '\240', '\241', '\242', '\243', '\244', '\245', '\246', '\247', |
||
48 | '\250', '\251', '\252', '\253', '\254', '\255', '\256', '\257', |
||
49 | '\260', '\261', '\262', '\263', '\264', '\265', '\266', '\267', |
||
50 | '\270', '\271', '\272', '\273', '\274', '\275', '\276', '\277', |
||
51 | '\300', '\341', '\342', '\343', '\344', '\345', '\346', '\347', |
||
52 | '\350', '\351', '\352', '\353', '\354', '\355', '\356', '\357', |
||
53 | '\360', '\361', '\362', '\363', '\364', '\365', '\366', '\367', |
||
54 | '\370', '\371', '\372', '\333', '\334', '\335', '\336', '\337', |
||
55 | '\340', '\341', '\342', '\343', '\344', '\345', '\346', '\347', |
||
56 | '\350', '\351', '\352', '\353', '\354', '\355', '\356', '\357', |
||
57 | '\360', '\361', '\362', '\363', '\364', '\365', '\366', '\367', |
||
58 | '\370', '\371', '\372', '\373', '\374', '\375', '\376', '\377', |
||
59 | }; |
||
60 | |||
61 | int |
||
62 | strcasecmp(s1, s2) |
||
63 | const char *s1, *s2; |
||
64 | { |
||
65 | register const u_char *cm = charmap, |
||
66 | *us1 = (u_char *)s1, |
||
67 | *us2 = (u_char *)s2; |
||
68 | |||
69 | while (cm[*us1] == cm[*us2++]) |
||
70 | if (*us1++ == '\0') |
||
71 | return(0); |
||
72 | return(cm[*us1] - cm[*--us2]); |
||
73 | } |
||
74 | |||
75 | int |
||
76 | strncasecmp(s1, s2, n) |
||
77 | const char *s1, *s2; |
||
78 | register int n; |
||
79 | { |
||
80 | register const u_char *cm = charmap, |
||
81 | *us1 = (u_char *)s1, |
||
82 | *us2 = (u_char *)s2; |
||
83 | |||
84 | while (--n >= 0 && cm[*us1] == cm[*us2++]) |
||
85 | if (*us1++ == '\0') |
||
86 | return(0); |
||
87 | return(n < 0 ? 0 : cm[*us1] - cm[*--us2]); |
||
88 | } |