Commit | Line | Data |
a687059c |
1 | /* $Header: handy.h,v 3.0 89/10/18 15:18:24 lwall Locked $ |
2 | * |
3 | * Copyright (c) 1989, Larry Wall |
4 | * |
5 | * You may distribute under the terms of the GNU General Public License |
6 | * as specified in the README file that comes with the perl 3.0 kit. |
8d063cd8 |
7 | * |
8 | * $Log: handy.h,v $ |
a687059c |
9 | * Revision 3.0 89/10/18 15:18:24 lwall |
10 | * 3.0 baseline |
8d063cd8 |
11 | * |
12 | */ |
13 | |
378cc40b |
14 | #ifdef NULL |
15 | #undef NULL |
16 | #endif |
a687059c |
17 | #ifndef I286 |
18 | # define NULL 0 |
19 | #else |
20 | # define NULL 0L |
21 | #endif |
378cc40b |
22 | #define Null(type) ((type)NULL) |
8d063cd8 |
23 | #define Nullch Null(char*) |
24 | #define Nullfp Null(FILE*) |
25 | |
a687059c |
26 | #ifdef UTS |
27 | #define bool int |
28 | #else |
8d063cd8 |
29 | #define bool char |
a687059c |
30 | #endif |
8d063cd8 |
31 | #define TRUE (1) |
32 | #define FALSE (0) |
33 | |
34 | #define Ctl(ch) (ch & 037) |
35 | |
36 | #define strNE(s1,s2) (strcmp(s1,s2)) |
37 | #define strEQ(s1,s2) (!strcmp(s1,s2)) |
38 | #define strLT(s1,s2) (strcmp(s1,s2) < 0) |
39 | #define strLE(s1,s2) (strcmp(s1,s2) <= 0) |
40 | #define strGT(s1,s2) (strcmp(s1,s2) > 0) |
41 | #define strGE(s1,s2) (strcmp(s1,s2) >= 0) |
42 | #define strnNE(s1,s2,l) (strncmp(s1,s2,l)) |
43 | #define strnEQ(s1,s2,l) (!strncmp(s1,s2,l)) |
378cc40b |
44 | |
45 | #define MEM_SIZE unsigned int |
46 | |
47 | /* Line numbers are unsigned, 16 bits. */ |
48 | typedef unsigned short line_t; |
49 | #ifdef lint |
50 | #define NOLINE ((line_t)0) |
51 | #else |
52 | #define NOLINE ((line_t) 65535) |
53 | #endif |
54 | |
a687059c |
55 | #ifndef lint |
56 | #ifndef LEAKTEST |
57 | char *safemalloc(); |
58 | char *saferealloc(); |
59 | void safefree(); |
60 | #define New(x,v,n,t) (v = (t*)safemalloc((MEM_SIZE)((n) * sizeof(t)))) |
61 | #define Newc(x,v,n,t,c) (v = (c*)safemalloc((MEM_SIZE)((n) * sizeof(t)))) |
62 | #define Newz(x,v,n,t) (v = (t*)safemalloc((MEM_SIZE)((n) * sizeof(t)))), \ |
63 | bzero((char*)(v), (n) * sizeof(t)) |
64 | #define Renew(v,n,t) (v = (t*)saferealloc((char*)(v),(MEM_SIZE)((n)*sizeof(t)))) |
65 | #define Renewc(v,n,t,c) (v = (c*)saferealloc((char*)(v),(MEM_SIZE)((n)*sizeof(t)))) |
66 | #define Safefree(d) safefree((char*)d) |
67 | #define Str_new(x,len) str_new(len) |
68 | #else /* LEAKTEST */ |
69 | char *safexmalloc(); |
70 | char *safexrealloc(); |
71 | void safexfree(); |
72 | #define New(x,v,n,t) (v = (t*)safexmalloc(x,(MEM_SIZE)((n) * sizeof(t)))) |
73 | #define Newc(x,v,n,t,c) (v = (c*)safexmalloc(x,(MEM_SIZE)((n) * sizeof(t)))) |
74 | #define Newz(x,v,n,t) (v = (t*)safexmalloc(x,(MEM_SIZE)((n) * sizeof(t)))), \ |
75 | bzero((char*)(v), (n) * sizeof(t)) |
76 | #define Renew(v,n,t) (v = (t*)safexrealloc((char*)(v),(MEM_SIZE)((n)*sizeof(t)))) |
77 | #define Renewc(v,n,t,c) (v = (c*)safexrealloc((char*)(v),(MEM_SIZE)((n)*sizeof(t)))) |
78 | #define Safefree(d) safexfree((char*)d) |
79 | #define Str_new(x,len) str_new(x,len) |
80 | #define MAXXCOUNT 1200 |
81 | long xcount[MAXXCOUNT]; |
82 | long lastxcount[MAXXCOUNT]; |
83 | #endif /* LEAKTEST */ |
84 | #define Copy(s,d,n,t) (void)bcopy((char*)(s),(char*)(d), (n) * sizeof(t)) |
85 | #define Zero(d,n,t) (void)bzero((char*)(d), (n) * sizeof(t)) |
86 | #else /* lint */ |
87 | #define New(x,v,n,s) (v = Null(s *)) |
88 | #define Newc(x,v,n,s,c) (v = Null(s *)) |
89 | #define Newz(x,v,n,s) (v = Null(s *)) |
90 | #define Renew(v,n,s) (v = Null(s *)) |
91 | #define Copy(s,d,n,t) |
92 | #define Zero(d,n,t) |
93 | #define Safefree(d) d = d |
94 | #endif /* lint */ |