Menu

[c4b27c]: / joe / utils.c  Maximize  Restore  History

Download this file

863 lines (756 with data), 14.6 kB

  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
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
/*
* Various utilities
* Copyright
* (C) 1992 Joseph H. Allen
* (C) 2001 Marek 'Marx' Grac
*
* This file is part of JOE (Joe's Own Editor)
*/
#include "types.h"
#ifdef HAVE_SYS_IOCTL_H
#include <sys/ioctl.h>
#endif
#if 0
int joe_ispunct(int wide,struct charmap *map,int c)
{
if (joe_isspace(c))
return 0;
if (c=='_')
return 1;
if (isalnum_(wide,map,c))
return 0;
return joe_isprint(wide,map,c);
}
#endif
/*
* return minimum/maximum of two numbers
*/
unsigned int uns_min(unsigned int a, unsigned int b)
{
return a < b ? a : b;
}
signed int int_min(signed int a, signed int b)
{
return a < b ? a : b;
}
signed long int long_max(signed long int a, signed long int b)
{
return a > b ? a : b;
}
signed long int long_min(signed long int a, signed long int b)
{
return a < b ? a : b;
}
off_t off_max(off_t a, off_t b)
{
return a > b ? a : b;
}
off_t off_min(off_t a, off_t b)
{
return a < b ? a : b;
}
ptrdiff_t diff_max(ptrdiff_t a, ptrdiff_t b)
{
return a > b ? a : b;
}
ptrdiff_t diff_min(ptrdiff_t a, ptrdiff_t b)
{
return a < b ? a : b;
}
#if 0
/*
* Characters which are considered as word characters
* _ is considered as word character because is often used
* in the names of C/C++ functions
*/
int isalnum_(int wide,struct charmap *map,int c)
{
/* Fast... */
if (c>='0' && c<='9' ||
c>='a' && c<='z' ||
c>='A' && c<='Z' ||
c=='_')
return 1;
else if(c<128)
return 0;
/* Slow... */
if (wide)
return joe_iswalpha(c);
else
return joe_iswalpha(to_uni(map,c));
}
int isalpha_(int wide,struct charmap *map,int c)
{
/* Fast... */
if (c>='a' && c<='z' ||
c>='A' && c<='Z' ||
c=='_')
return 1;
else if(c<128)
return 0;
/* Slow... */
if (wide)
return joe_iswalpha(c);
else
return joe_iswalpha(to_uni(map,c));
}
#endif
/* Versions of 'read' and 'write' which automatically retry when interrupted */
ptrdiff_t joe_read(int fd, void *buf, ptrdiff_t size)
{
ptrdiff_t rt;
do {
rt = read(fd, buf, (size_t)size);
} while (rt < 0 && errno == EINTR);
return rt;
}
ptrdiff_t joe_write(int fd, const void *buf, ptrdiff_t size)
{
ptrdiff_t rt;
do {
rt = write(fd, buf, (size_t)size);
} while (rt < 0 && errno == EINTR);
return rt;
}
int joe_ioctl(int fd, int req, void *ptr)
{
int rt;
do {
rt = ioctl(fd, req, ptr);
} while (rt == -1 && errno == EINTR);
return rt;
}
/* Heap checking versions of malloc() */
/* #define HEAP_CHECK 1 */
#ifdef HEAP_CHECK
struct mcheck {
struct mcheck *next;
int state; /* 0=malloced, 1=free */
int size; /* size in bytes */
int magic;
};
struct mcheck *first;
struct mcheck *last;
void check_malloc()
{
struct mcheck *m;
int y = 0;
for(m=first;m;m=m->next) {
char *ptr = (char *)m+SIZEOF(struct mcheck);
int x;
if(m->magic!=0x55AA55AA) {
printf("corrupt heap: head %x\n",ptr);
*(int *)0=0;
}
for(x=0;x!=16384;++x)
if(ptr[x+m->size]!=0xAA) {
printf("Corrupt heap: tail %x\n",ptr);
*(int *)0=0;
}
if(m->state)
for(x=0;x!=m->size;++x)
if(ptr[x]!=0x41) {
printf("Corrupt heap: modified free block %x\n",ptr);
*(int *)0=0;
}
++y;
}
}
void *joe_malloc(int size)
{
struct mcheck *m = (struct mcheck *)malloc(size+SIZEOF(struct mcheck)+16384);
char *ptr = (char *)m+SIZEOF(struct mcheck);
int x;
m->state = 0;
m->size = size;
m->magic=0x55AA55AA;
m->next = 0;
if(!size) {
printf("0 passed to malloc\n");
*(int *)0=0;
}
for(x=0;x!=16384;++x)
ptr[x+size]=0xAA;
if(first) {
last->next = m;
last = m;
} else {
first = last = m;
}
check_malloc();
/* printf("malloc size=%d addr=%x\n",size,ptr); fflush(stdout); */
return ptr;
}
void *joe_calloc(int nmemb, int size)
{
int sz = nmemb*size;
int x;
char *ptr;
ptr = joe_malloc(sz);
for(x=0;x!=sz;++x)
ptr[x] = 0;
return ptr;
}
void *joe_realloc(void *ptr, int size)
{
struct mcheck *n;
char *np;
struct mcheck *m = (struct mcheck *)((char *)ptr-SIZEOF(struct mcheck));
if(!size) {
printf("0 passed to realloc\n");
*(int *)0=0;
}
np = joe_malloc(size);
n = (struct mcheck *)(np-SIZEOF(struct mcheck));
if(m->size>size)
memcpy(np,ptr,size);
else
memcpy(np,ptr,m->size);
joe_free(ptr);
return np;
}
void joe_free(void *ptr)
{
struct mcheck *m = (struct mcheck *)((char *)ptr-SIZEOF(struct mcheck));
int x;
if (m->magic!=0x55AA55AA) {
printf("Free non-malloc block %x\n",ptr);
*(int *)0=0x0;
}
if (m->state) {
printf("Double-free %x\n",ptr);
*(int *)0=0x0;
}
for(x=0;x!=m->size;++x)
((char *)ptr)[x]=0x41;
m->state = 1;
check_malloc();
/* printf("free=%x\n",ptr); */
}
#else
/* Normal malloc() */
void *joe_malloc(ptrdiff_t size)
{
void *p = malloc((size_t)size);
if (!p)
ttsig(-1);
return p;
}
void *joe_calloc(ptrdiff_t nmemb,ptrdiff_t size)
{
void *p = calloc((size_t)nmemb, (size_t)size);
if (!p)
ttsig(-1);
return p;
}
void *joe_realloc(void *ptr,ptrdiff_t size)
{
void *p = realloc(ptr, (size_t)size);
if (!p)
ttsig(-1);
return p;
}
void joe_free(void *ptr)
{
free(ptr);
}
#endif
ptrdiff_t zlen(const char *s)
{
return (ptrdiff_t)strlen(s);
}
int zcmp(const char *a, const char *b)
{
return strcmp(a, b);
}
/* Only if you know for sure that the text is ASCII */
int zicmp(const char *a, const char *b)
{
char ca;
char cb;
while (*a && *b) {
ca = *a;
cb = *b;
if (ca >= 'a' && ca <= 'z')
ca = (char)(ca + ('A' - 'a'));
if (cb >= 'a' && cb <= 'z')
cb = (char)(cb + ('A' - 'a'));
if (ca > cb)
return 1;
if (ca < cb)
return -1;
++a;
++b;
}
if (*a)
return 1;
if (*b)
return -1;
return 0;
}
/* Tags file string matcher */
/* a can be something like: "class::subclass::member"
* b can be:
* member
* ::member
* subclass::member
* ::subclass::member
* class::subclass::member
*/
int zmcmp(const char *a, const char *b)
{
ptrdiff_t x = zlen(a);
do {
if (a[x] == ':' && a[x + 1] == ':')
if ((b[0] == ':' && !zcmp(a + x, b)) || !zcmp(a + x + 2, b))
return 0;
} while (x--);
return zcmp(a, b);
}
int zncmp(const char *a, const char *b, ptrdiff_t len)
{
return strncmp(a, b, (size_t)len);
}
char *zdup(const char *bf)
{
ptrdiff_t size = zlen(bf);
char *p = (char *)joe_malloc(size+1);
memcpy(p, bf, (size_t)(size + 1));
return p;
}
#if 0
char *zcpy(char *a, char *b)
{
strcpy(a,b);
return a;
}
#endif
char *zstr(const char *a, const char *b)
{
return (char *)strstr(a,b);
}
char *zncpy(char *a, const char *b, ptrdiff_t len)
{
strncpy(a,b,(size_t)len);
return a;
}
char *zlcpy(char *a, ptrdiff_t len, const char *b)
{
char *org = a;
if (!len) {
fprintf(stderr, "zlcpy called with len == 0\n");
exit(1);
}
--len;
while (len && *b) {
*a++ = *b++;
--len;
}
*a = 0;
return org;
}
void *mcpy(void *a, const void *b, ptrdiff_t len)
{
if (len)
memcpy(a, b, (size_t)len);
return a;
}
#if 0
char *zcat(char *a, char *b)
{
strcat(a,b);
return a;
}
#endif
char *zlcat(char *a, ptrdiff_t siz, const char *b)
{
char *org = a;
while (*a && siz) {
++a;
--siz;
}
zlcpy(a, siz, b);
return org;
}
char *zchr(char *s, int c)
{
return strchr(s,c);
}
char *zrchr(char *s, int c)
{
return strrchr(s,c);
}
off_t zhtoo(const char *s)
{
off_t val = 0;
int flg = 0;
if (s) {
if (*s == '-') {
++s;
flg = 1;
} else if (*s == '+') {
++s;
}
while ((*s >= '0' && *s <= '9') || (*s >= 'a' && *s <= 'f') || (*s >= 'A' && *s <= 'F')) {
if (*s >= '0' && *s <= '9')
val = val * 16 + (off_t)(*s - '0');
else if (*s >= 'a' && *s <= 'f')
val = val * 16 + (off_t)(*s - 'a' + 10);
else if (*s >= 'A' && *s <= 'F')
val = val * 16 + (off_t)(*s - 'A' + 10);
++s;
}
}
if (flg)
return -val;
else
return val;
}
off_t ztoo(const char *s)
{
off_t val = 0;
int flg = 0;
if (s) {
if (*s == '-') {
++s;
flg = 1;
} else if (*s == '+') {
++s;
}
if (s[0] == '0' && s[1] == 'x') {
s += 2;
while ((*s >= '0' && *s <= '9') || (*s >= 'a' && *s <= 'f') || (*s >= 'A' && *s <= 'F')) {
if (*s >= '0' && *s <= '9')
val = val * 16 + (off_t)(*s - '0');
else if (*s >= 'a' && *s <= 'f')
val = val * 16 + (off_t)(*s - 'a' + 10);
else if (*s >= 'A' && *s <= 'F')
val = val * 16 + (off_t)(*s - 'A' + 10);
++s;
}
} else if (s[0] == '0') {
while (*s >= '0' && *s <= '7') {
val = val * 8 + (off_t)(*s - '0');
++s;
}
} else {
while (*s >= '0' && *s <= '9') {
val = val * 10 + (off_t)(*s - '0');
++s;
}
}
}
if (flg)
return -val;
else
return val;
}
long ztol(const char *s)
{
off_t val = ztoo(s);
return (long)val;
}
int ztoi(const char *s)
{
off_t val = ztoo(s);
return (int)val;
}
ptrdiff_t ztodiff(const char *s)
{
off_t val = ztoo(s);
return (ptrdiff_t)val;
}
long zhtol(const char *s)
{
off_t val = zhtoo(s);
return (long)val;
}
int zhtoi(const char *s)
{
off_t val = zhtoo(s);
return (int)val;
}
ptrdiff_t zhtodiff(const char *s)
{
off_t val = zhtoo(s);
return (ptrdiff_t)val;
}
#ifndef SIG_ERR
#define SIG_ERR ((sighandler_t) -1)
#endif
/* wrapper to hide signal interface differrencies */
int joe_set_signal(int signum, sighandler_t handler)
{
int retval;
#ifdef HAVE_SIGACTION
struct sigaction sact;
mset((char *)&sact, 0, SIZEOF(sact));
sact.sa_handler = handler;
#ifdef SA_INTERRUPT
sact.sa_flags = SA_INTERRUPT;
#endif
retval = sigaction(signum, &sact, NULL);
#elif defined(HAVE_SIGVEC)
struct sigvec svec;
mset(&svec, 0, SIZEOF(svec));
svec.sv_handler = handler;
#ifdef HAVE_SV_INTERRUPT
svec.sv_flags = SV_INTERRUPT;
#endif
retval = sigvec(signum, &svec, NULL);
#else
retval = (signal(signum, handler) != SIG_ERR) ? 0 : -1;
#ifdef HAVE_SIGINTERRUPT
siginterrupt(signum, 1);
#endif
#endif
return(retval);
}
/* Helpful little parsing utilities */
/* Skip whitespace and return first non-whitespace character */
int parse_ws(char **pp,int cmt)
{
char *p = *pp;
while (*p==' ' || *p=='\t')
++p;
if (*p=='\r' || *p=='\n' || *p==cmt)
*p = 0;
*pp = p;
return *p;
}
/* Parse an identifier into a buffer. Identifier is truncated to a maximum of len-1 chars. */
int parse_ident(char * *pp, char *buf, ptrdiff_t len)
{
char *p = *pp;
if (joe_isalpha_(locale_map,*p)) {
while(len > 1 && joe_isalnum_(locale_map,*p))
*buf++= *p++, --len;
*buf=0;
while(joe_isalnum_(locale_map,*p))
++p;
*pp = p;
return 0;
} else
return -1;
}
/* Parse to next whitespace */
int parse_tows(char * *pp, char *buf)
{
char *p = *pp;
while (*p && *p!=' ' && *p!='\t' && *p!='\n' && *p!='\r' && *p!='#')
*buf++ = *p++;
*pp = p;
*buf = 0;
return 0;
}
/* Parse over a specific keyword */
int parse_kw(char * *pp, const char *kw)
{
char *p = *pp;
while(*kw && *kw==*p)
++kw, ++p;
if(!*kw && !joe_isalnum_(locale_map,*p)) {
*pp = p;
return 0;
} else
return -1;
}
/* Parse a field (same as parse_kw, but string must be terminated with whitespace) */
int parse_field(char **pp, const char *kw)
{
char *p = *pp;
while(*kw && *kw==*p)
++kw, ++p;
if(!*kw && (!*p || *p==' ' || *p=='\t' || *p=='#' || *p=='\n' || *p=='\r')) {
*pp = p;
return 0;
} else
return -1;
}
/* Parse a specific character */
int parse_char(char **pp, char c)
{
char *p = *pp;
if (*p == c) {
*pp = p+1;
return 0;
} else
return -1;
}
/* Parse an integer. Returns 0 for success. */
int parse_int(char **pp, int *buf)
{
char *p = *pp;
if ((*p>='0' && *p<='9') || *p=='-') {
*buf = ztoi(p);
if(*p=='-')
++p;
while(*p>='0' && *p<='9')
++p;
*pp = p;
return 0;
} else
return -1;
}
int parse_diff(char **pp, ptrdiff_t *buf)
{
char *p = *pp;
if ((*p>='0' && *p<='9') || *p=='-') {
*buf = ztodiff(p);
if(*p=='-')
++p;
while(*p>='0' && *p<='9')
++p;
*pp = p;
return 0;
} else
return -1;
}
/* Parse a long */
int parse_off_t(char * *pp, off_t *buf)
{
char *p = *pp;
off_t val = 0;
int flg = 0;
if ((*p>='0' && *p<='9') || *p=='-') {
if(*p=='-') {
++p;
flg = 1;
}
while(*p >= '0' && *p <= '9') {
val = val * 10 + (int)(*p - '0');
++p;
}
if (flg)
val = -val;
*buf = val;
*pp = p;
return 0;
} else
return -1;
}
/* Parse a string of the form "xxxxx" into a fixed-length buffer. The
* address of the buffer is 'buf'. The length of this buffer is 'len'. A
* terminating NUL is added to the parsed string. If the string is larger
* than the buffer, the string is truncated.
*
* C string escape sequences are handled.
*
* 'p' holds an address of the input string pointer. The pointer
* is updated to point right after the parsed string if the function
* succeeds.
*
* Returns the length of the string (not including the added NUL), or
* -1 if there is no string or if the input ended before the terminating ".
*/
ptrdiff_t parse_string(char **pp, char *buf, ptrdiff_t len)
{
char *start = buf;
char *p= *pp;
if(*p=='\"') {
++p;
while(len > 1 && *p && *p!='\"') {
ptrdiff_t x = 50;
int c = escape(0, (const char **)&p, &x);
*buf++ = TO_CHAR_OK(c);
--len;
}
*buf = 0;
while(*p && *p!='\"')
if(*p=='\\' && p[1])
p += 2;
else
p++;
if(*p == '\"') {
*pp = p + 1;
return buf - start;
}
}
return -1;
}
/* Emit a string with escape sequences */
#ifdef junk
/* Used originally for printing macros */
void emit_string(FILE *f,const char *s,ptrdiff_t len)
{
char buf[8];
char *p, *q;
fputc('\"',f);
while(len) {
p = unescape(buf,*s++);
for(q=buf;q!=p;++q)
fputc(*q,f);
--len;
}
fputc('\"',f);
}
#endif
/* Emit a string */
void emit_string(FILE *f,const char *s,ptrdiff_t len)
{
fputc('"',f);
while(len) {
if (*s=='"' || *s=='\\')
fputc('\\',f), fputc(*s,f);
else if(*s=='\n')
fputc('\\',f), fputc('n',f);
else if(*s=='\r')
fputc('\\',f), fputc('r',f);
else if(*s==0)
fputc('\\',f), fputc('0',f), fputc('0',f), fputc('0',f);
else
fputc(*s,f);
++s;
--len;
}
fputc('"',f);
}
/* Parse a character range: a-z */
int parse_range(char * *pp, int *first, int *second)
{
char *p= *pp;
int a, b;
if(!*p)
return -1;
if(*p=='\\' && p[1]) {
++p;
if(*p=='n')
a = '\n';
else if(*p=='t')
a = '\t';
else
a = *p;
++p;
} else
a = *p++;
if(*p=='-' && p[1]) {
++p;
if(*p=='\\' && p[1]) {
++p;
if(*p=='n')
b = '\n';
else if(*p=='t')
b = '\t';
else
b = *p;
++p;
} else
b = *p++;
} else
b = a;
*first = a;
*second = b;
*pp = p;
return 0;
}
void jsort(void *base, ptrdiff_t num, ptrdiff_t size, int (*compar)(const void *a, const void *b))
{
return qsort(base, (size_t)num, (size_t)size, compar);
}
off_t oabs(off_t a)
{
if (a < 0)
return -a;
else
return a;
}
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.