1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
|
{
This file is part of the Free Pascal run time library.
A file in Amiga system run time library.
Copyright (c) 2002-2003 by Nils Sjoholm
member of the Amiga RTL development team.
See the file COPYING.FPC, included in this distribution,
for details about the copyright.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
**********************************************************************}
{$I useamigasmartlink.inc}
{$ifdef use_amiga_smartlink}
{$smartlink on}
{$endif use_amiga_smartlink}
unit pcq;
{
A unit to help port program from pcq pascal.
These are some of the common C pchar functions.
Changed a few of the functions.
ToUpper,
ToLower,
strnieq,
strieq,
strnieq,
stricmp
and strnicmp
They all use the utility.library for the checking or
the conversion. The utility.library is opened by all
programs as of version 1.3 of PCQ, so you don't need
to do that.
THIS IS CHANGED!
Looks like the strcompare functions in utility and locale
is buggy so I have redone this functions to use an
internal strcompare instead.
Added the define use_amiga_smartlink.
13 Jan 2003.
Changed integer > smallint.
10 Feb 2003.
Nils Sjoholm < nils.sjoholm@mailbox.swipnet.se
}
interface
uses exec,strings;
function CheckBreak: boolean;
Function isupper(c : Char) : Boolean;
{
Returns True if the character is in A..Z
}
Function islower(c : Char) : Boolean;
{
Returns True if the character is in a..z
}
Function isalpha(c : Char) : Boolean;
{
Returns True if the character is in A..Z or a..z
}
Function isdigit(c : Char) : Boolean;
{
Returns True if the character is in 0..9
}
Function isalnum(c : Char) : Boolean;
{
Returns True if isalpha or isdigit is true
}
Function isspace(c : Char) : Boolean;
{
Returns true if the character is "white space", like a space,
form feed, line feed, carraige return, tab, whatever.
}
Function toupper(c : Char) : Char;
{
If the character is in a..z, the function returns the capital.
Otherwise it returns c. Not true, this function use the utility.library
to make the conversion.
}
Function tolower(c : Char) : Char;
{
If c is in A..Z, the function returns the lower case letter.
Otherwise it returns c. Not true this function use the utility.library
to make the conversion.
}
function lowercase(c : char) : char;
{
If the character is in a..z, the function returns the capital.
Otherwise it returns c. Not true, this function use the utility.library
to make the conversion.
}
function lowercase(c : pchar): pchar;
{
Will turn the pchar till lowercase.
}
function uppercase(c : char): char;
{
If the character is in a..z, the function returns the capital.
Otherwise it returns c. Not true, this function use the utility.library
to make the conversion.
}
function uppercase(c: pchar): pchar;
{
Will turn the pchar till capital letters.
}
Function streq(s1, s2 : pchar) : Boolean;
{
Returns True if s1 and s2 are the same.
}
Function strneq(s1, s2 : pchar; n : longint) : Boolean;
{
Returns True if the first n characters of s1 and s2 are identical.
}
Function strieq(s1, s2 : pchar) : Boolean;
{
The same as streq(), but is case insensitive.
}
Function strnieq(s1, s2 : pchar; n : longint) : Boolean;
{
The same as strneq(), but case insensitive.
}
Function strcmp(s1, s2 : pchar) : longint;
{
Returns an longint < 0 if s1 < s2, zero if they are equal, and > 0
if s1 > s2.
}
Function stricmp(s1, s2 : pchar) : longint;
{
The same as strcmp, but not case sensitive
}
Function strncmp(s1, s2 : pchar; n : longint) : longint;
{
Same as strcmp(), but only considers the first n characters.
}
Function strnicmp(s1, s2 : pchar; n : longint) : longint;
{
Same as strncmp, but not case sensitive
}
Procedure strcpy(s1, s2 : pchar);
{
Copies s2 into s1, appending a trailing zero. This is the same
as C, but opposite from 1.0.
}
Procedure strncpy(s1, s2 : pchar; n : smallint);
{
Copies s2 into s1, with a maximum of n characters. Appends a
trailing zero.
}
Procedure strncat(s1, s2 : pchar; n : smallint);
{
Appends at most n characters from s2 onto s1.
}
Function strdup(s : pchar) : pchar;
{
This allocates a copy of the pchar 's', and returns a ptr
}
Function strpos(s1 : pchar; c : Char) : longint;
{
Return the position, starting at zero, of the first (leftmost)
occurance of c in s1. If there is no c, it returns -1.
}
Function strrpos(s1 : pchar; c : Char) : longint;
{
Returns the longint position of the right-most occurance of c in s1.
If c is not in s1, it returns -1.
}
Function AllocString(l : longint) : pchar;
{
Allocates l bytes, and returns a pointer to the allocated memory.
This memory is allocated through the new() function, so it will be returned
to the system at the end of your program. Note that the proper amount of RAM
to allocate is strlen(s) + 1.
}
Procedure FreeString(s : pchar);
{
This returns memory allocated by AllocString to the system. Since
the Amiga is a multitasking computer, you should always return memory you
don't need to the system.
}
implementation
const
SIGBREAKF_CTRL_C = $1000;
function CheckBreak: boolean;
begin
{ check for Ctrl-C break by user }
if (Setsignal(0,0) AND SIGBREAKF_CTRL_C) <> 0 then Begin
SetSignal(0,SIGBREAKF_CTRL_C);
CheckBreak := true;
end else CheckBreak := false;
end;
Function isupper(c : Char) : Boolean;
begin
if ((ord(c) >= 192) and (ord(c) <= 223)) or ((c >= 'A') and (c <= 'Z'))
then isupper := true
else isupper := false;
end;
Function islower(c : Char) : Boolean;
begin
if ((ord(c) >= 224) and (ord(c) <= 254)) or ((c >= 'a') and (c <= 'z'))
then islower := true
else islower := false;
end;
Function isalpha(c : Char) : Boolean;
begin
if ((ord(c) >= 192) and (ord(c) <= 223)) or ((c >= 'A') and (c <= 'Z'))
or ((ord(c) >= 224) and (ord(c) <= 254)) or ((c >= 'a') and (c <= 'z'))
then isalpha := true
else isalpha := false;
end;
Function isdigit(c : Char) : Boolean;
begin
if c in ['0'..'9'] then isdigit := true
else isdigit := false;
end;
Function isalnum(c : Char) : Boolean;
begin
if isalpha(c) or isdigit(c) then isalnum := true
else isalnum := false;
end;
Function isspace(c : Char) : Boolean;
begin
if c in [#9..#13,#32] then isspace := true
else isspace := false;
end;
Function toupper(c : Char) : Char;
begin
if ((ord(c) >= 224) and (ord(c) <= 254)) or ((c >= 'a') and (c <= 'z'))
then c := char(ord(c)-32);
toupper := c;
end;
Function tolower(c : Char) : Char;
begin
if ((ord(c) >= 192) and (ord(c) <= 223)) or ((c >= 'A') and (c <= 'Z'))
then c := char(ord(c)+32);
tolower := c;
end;
function lowercase(c : char) : char;
begin
lowercase := tolower(c);
end;
function lowercase(c : pchar): pchar;
var
i : longint;
begin
i := 0;
while c[i] <> #0 do begin
c[i] := tolower(c[i]);
i := succ(i);
end;
lowercase := c;
end;
function uppercase(c : char): char;
begin
uppercase := toupper(c);
end;
function uppercase(c: pchar): pchar;
var
i : longint;
begin
i := 0;
while c[i] <> #0 do begin
c[i] := toupper(c[i]);
i := succ(i);
end;
uppercase := c;
end;
Function streq(s1, s2 : pchar) : Boolean;
begin
streq := (strcomp(s1,s2) = 0);
end;
Function strneq(s1, s2 : pchar; n : longint) : Boolean;
begin
strneq := (strlcomp(s1,s2,n) = 0);
end;
Function strieq(s1, s2 : pchar) : Boolean;
begin
s1 := uppercase(s1);
s2 := uppercase(s2);
strieq := (strcomp(s1,s2)=0);
end;
Function strnieq(s1, s2 : pchar; n : longint) : Boolean;
begin
s1 := uppercase(s1);
s2 := uppercase(s2);
strnieq := (strlcomp(s1,s2,n)=0);
end;
Function strcmp(s1, s2 : pchar) : longint;
begin
strcmp := strcomp(s1,s2);
end;
Function stricmp(s1, s2 : pchar) : longint;
begin
s1 := uppercase(s1);
s2 := uppercase(s2);
stricmp := strcomp(s1,s2);
end;
Function strncmp(s1, s2 : pchar; n : longint) : longint;
begin
strncmp := strlcomp(s1,s2,n);
end;
Function strnicmp(s1, s2 : pchar; n : longint) : longint;
begin
s1 := uppercase(s1);
s2 := uppercase(s2);
strnicmp := strlcomp(s1,s2,n);
end;
Procedure strcpy(s1, s2 : pchar);
begin
strcopy(s1,s2)
end;
Procedure strncpy(s1, s2 : pchar; n : smallint);
begin
strlcopy(s1,s2,n);
end;
Procedure strncat(s1, s2 : pchar; n : smallint);
begin
strlcat(s1,s2,n);
end;
Function strdup(s : pchar) : pchar;
begin
strdup := StrNew(s);
end;
Function strpos(s1 : pchar; c : Char) : longint;
Var
count: Longint;
Begin
count := 0;
{ As in Borland Pascal , if looking for NULL return null }
if c = #0 then
begin
strpos := -1;
exit;
end;
{ Find first matching character of Ch in Str }
while S1[count] <> #0 do
begin
if C = S1[count] then
begin
strpos := count;
exit;
end;
Inc(count);
end;
{ nothing found. }
strpos := -1;
end;
Function strrpos(s1 : pchar; c : Char) : longint;
Var
count: Longint;
index: Longint;
Begin
count := Strlen(S1);
{ As in Borland Pascal , if looking for NULL return null }
if c = #0 then
begin
strrpos := -1;
exit;
end;
Dec(count);
for index := count downto 0 do
begin
if C = S1[index] then
begin
strrpos := index;
exit;
end;
end;
{ nothing found. }
strrpos := -1;
end;
Function AllocString(l : longint) : pchar;
begin
AllocString := StrAlloc(l);
end;
Procedure FreeString(s : pchar);
begin
StrDispose(s);
end;
end.
|