-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcdm.c
1768 lines (1647 loc) · 39.8 KB
/
cdm.c
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
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* cdm - CP/M Disk Manager
Copyright (C) 1995 Frank D. Cringle.
cdm is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your
option) any later version.
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. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
/* $Id: cdm.c,v 1.3 2004/01/11 16:49:58 fdc Exp $ */
#ifndef lint
static char vcid[] = "$Id: cdm.c,v 1.3 2004/01/11 16:49:58 fdc Exp $";
#endif /* lint */
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <ctype.h>
#include <sys/stat.h>
#include <sys/mman.h>
#include <fcntl.h>
#include <signal.h>
#ifdef BSD
#if defined(sun)
#include <memory.h>
#include <string.h>
#endif
#ifndef strchr
#define strchr index
#endif
#ifndef strrchr
#define strrchr rindex
#endif
#define memclr(p,n) bzero(p,n)
#define memcpy(t,f,n) bcopy(f,t,n)
#define memcmp(p1,p2,n) bcmp(p1,p2,n)
#define memset(p,v,n) \
do { size_t len = n; \
char *p1 = p; \
while (len--) *p1++ = v; \
} while (0)
#else
#include <string.h>
#define memclr(p,n) (void) memset(p,0,n)
#endif
typedef unsigned char BYTE;
#define VERSION "1.10"
#ifdef CPM3
/* this is rudimentary and untested - just the obvious differences */
#define MAXUSER 15
#define S2MASK 0x3f
#else
/* MAXUSER = 15 for standard CP/M and 31 for ZRDOS */
#define MAXUSER 31
#define S2MASK 0x0f
#endif
extern void *xmalloc(size_t size);
#ifdef USE_GNU_READLINE
#include <readline/readline.h>
void add_history(char *cmd);
#else
#define add_history(x)
#endif
#define PutWORD(a, v) \
do { *(a) = (BYTE)(v); \
*(a+1) = (v) >> 8; \
} while (0)
#define MNT_ACTIVE 1
#define MNT_RDONLY 2
static struct mnt { /* mount table (drives A..P) */
int flags;
char *filename; /* unix filename of disk */
int fd; /* file descriptor */
size_t size; /* file size */
int *xlt; /* pointer to sector translation table, if any */
BYTE *alv; /* pointer to allocation vector */
int spt; /* sectors per track */
int bsh; /* block shift factor */
int exm; /* extent mask */
int dsm; /* max block number */
int drm; /* max directory entry */
int off; /* track offset */
BYTE *data; /* disk image */
BYTE *dir; /* start of directory */
} mnttab[16];
int curdisk = -1; /* current disk (0..15) */
int curuser; /* current user (0..MAXUSER) */
/* stash a string away on the heap */
static char *
newstr(const char *str)
{
char *p = xmalloc(strlen(str) + 1);
(void) strcpy(p, str);
return p;
}
/* count ones in a 16-bit value */
static int
popcount(long v)
{
int total;
total = ((v>>1) & 0x5555) + (v & 0x5555);
total = ((total>>2) & 0x3333) + (total & 0x3333);
total = ((total>>4) & 0x0f0f) + (total & 0x0f0f);
return (total & 0xff) + (total>>8);
}
/* display a mount table entry */
static void
showdisk(int disk, int verbose)
{
struct mnt *dp = mnttab + disk;
printf("%c: ", disk+'A');
if (!(dp->flags & MNT_ACTIVE)) {
puts("not mounted");
return;
}
printf("%s %s\n", dp->flags & MNT_RDONLY ? "r/o " : "r/w ", dp->filename);
if (!verbose)
return;
printf(" spt=%d, bsh=%d, exm=%x, dsm=%d, drm=%d, off=%d\n",
dp->spt, dp->bsh, dp->exm, dp->dsm, dp->drm, dp->off);
}
static int
umount(int disk)
{
struct mnt *dp = mnttab + disk;
if (!(dp->flags & MNT_ACTIVE))
return 0;
free(dp->alv);
if (munmap((char *) dp->data, dp->size) == -1 || close(dp->fd) == -1)
perror(dp->filename);
dp->flags = 0;
free(dp->filename);
if (disk == curdisk)
curdisk = -1;
return 0;
}
/* Find and allocate a free block on dp.
* Return block number or 0 if disk is full.
*/
static long
findfree(struct mnt *dp)
{
BYTE *a = dp->alv;
long b;
for (b = 0; b <= dp->dsm; b++) {
if (a[b>>3] == 0xff) {
b += 7;
continue;
}
if ((a[b>>3]&(0x80>>(b&7))) == 0) {
a[b>>3] |= 0x80>>(b&7);
return b;
}
}
return 0;
}
/* allocate (set=1) or deallocate (set=0) the groups in a directory entry */
static long
alloc(struct mnt *dp, BYTE *p, int set)
{
int i, small = dp->dsm < 256;
BYTE *a = dp->alv;
long total = 0;
for (i = 16; i < 32; i++) {
unsigned long blockno;
if (small)
blockno = p[i];
else {
blockno = p[i] + (p[i+1]<<8);
i++;
}
if (blockno == 0)
continue;
if (blockno > dp->dsm) {
fprintf(stderr, "!!! bad block number on disk %s !!!\n",
dp->filename);
continue;
}
total++;
if (set) {
if (a[blockno >> 3] & (0x80 >> (blockno & 7))) {
fprintf(stderr,
"!!! block %ld used more than once on disk %s !!!\n",
blockno, dp->filename);
continue;
}
a[blockno >> 3] |= 0x80 >> (blockno & 7);
}
else
a[blockno >> 3] &= ~(0x80 >> (blockno & 7));
}
return total;
}
static int
mount(int disk, const char *filename, int readonly)
{
struct mnt *dp;
int prot = PROT_READ|PROT_WRITE;
int doffs, i, al01;
long total;
BYTE buf[128];
struct stat st;
caddr_t cp;
if (disk > 15)
return 0;
dp = mnttab + disk;
if (dp->flags & MNT_ACTIVE)
umount(disk);
dp->flags = 0;
if (stat(filename, &st) < 0) {
perror(filename);
return 0;
}
if ((st.st_mode & S_IFMT) != S_IFREG) {
fprintf(stderr, "%s is not a regular file\n", filename);
return 0;
}
if (readonly || (dp->fd = open(filename, O_RDWR)) < 0) {
prot = PROT_READ;
dp->flags |= MNT_RDONLY;
if ((dp->fd = open(filename, O_RDONLY)) < 0) {
perror(filename);
return 0;
}
}
/* peek at descriptor page */
if (read(dp->fd, buf, 128) != 128) {
perror(filename);
close(dp->fd);
return 0;
}
dp->size = st.st_size;
if (memcmp(buf, "<CPM_Disk>", 10) != 0) {
fprintf(stderr, "%s is not a valid <CPM_Disk> file\n", filename);
close(dp->fd);
return 0;
}
dp->xlt = 0;
dp->spt = buf[32]+(buf[33]<<8);
dp->bsh = buf[34];
dp->exm = buf[36];
dp->dsm = buf[37]+(buf[38]<<8);
dp->drm = buf[39]+(buf[40]<<8);
dp->off = buf[45]+(buf[46]<<8);
al01 = (buf[41]<<8)+buf[42];
doffs = 128;
#ifdef __BOUNDS_CHECKING_ON
/* absurd -1 return code blows bgcc's mind */
cp = mmap(NULL, dp->size, prot, MAP_SHARED, dp->fd, 0);
#else
if ((cp = mmap(NULL, dp->size, prot, MAP_SHARED, dp->fd, 0)) == (caddr_t)-1) {
perror(filename);
close(dp->fd);
return 0;
}
#endif
dp->data = (BYTE *) cp;
dp->dir = dp->data + doffs + dp->off*dp->spt*128;
dp->filename = newstr(filename);
dp->flags |= MNT_ACTIVE;
dp->alv = xmalloc(dp->dsm/8+2); /* keep length an even number */
memclr(dp->alv, dp->dsm/8+2);
dp->alv[0] = (BYTE) (al01>>8);
dp->alv[1] = (BYTE) al01;
total = popcount(al01);
for (i = 0; i <= dp->drm; i++) {
BYTE *p = dp->dir + 32*i;
if (*p <= MAXUSER)
total += alloc(dp, p, 1);
}
printf("%s mounted as disk %c with %ld of %ld bytes allocated\n",
dp->filename, 'A'+disk, total<<(7+dp->bsh), (dp->dsm+1L)<<(7+dp->bsh));
curdisk = disk;
return 1;
}
static const char *white = " \t";
static int
domount(char *tok)
{
int d, v, r;
tok = strtok(NULL, white);
if ((v = tok && (strcmp(tok, "-v") == 0)))
tok = strtok(NULL, white);
if ((r = tok && (strcmp(tok, "-r") == 0)))
tok = strtok(NULL, white);
if (tok && !v) {
d = toupper(*tok) - 'A';
if (d < 0 || d > 15 || tok[1]) {
fprintf(stderr, "illegal disk specifier: %s\n", tok);
return 0;
}
tok = strtok(NULL, white);
mount(d, tok, r);
}
else for (d = 0; d < 16; d++)
if (mnttab[d].flags & MNT_ACTIVE)
showdisk(d, v);
return 0;
}
static int
doumount(char *tok)
{
int d;
tok = strtok(NULL, white);
if (tok) {
d = toupper(*tok) - 'A';
if (d < 0 || d > 15 || tok[1]) {
fprintf(stderr, "illegal disk specifier: %s\n", tok);
return 0;
}
umount(d);
}
return 0;
}
static int
diskuser(char *str, int *disk, int *user)
{
int ch = toupper(*str);
*disk = -1;
*user = -1;
if ('A' <= ch && ch <= 'P') {
*disk = ch - 'A';
str++;
}
if (*str && '0' <= *str && *str <= '9')
*user = *str++ - '0';
if (*str && '0' <= *str && *str <= '9')
*user = *user*10 + *str++ - '0';
return ((*str == 0 || *str == ':') && *user <= MAXUSER);
}
static int
makefcb(char *fn, BYTE *fcb)
{
char *p;
int d = -1;
int u = -1;
int ch, i;
fcb[0] = curuser;
if ((p = strchr(fn, ':')) == NULL)
p = fn;
else {
p++;
if (fn[0] == '*' || fn[0] == '?') {
/* wildcard user, current disk */
if (fn[1] != ':')
return -1;
fcb[0] = '?';
}
else if (fn[1] == '*' || fn[1] == '?') {
/* wildcard user, specified disk */
if (fn[2] != ':' || (ch = toupper(fn[0])) < 'A' || ch > 'P')
return -1;
d = ch - 'A';
fcb[0] = '?';
} else if (!diskuser(fn, &d, &u))
return -1;
}
if (d < 0)
d = curdisk;
if (d < 0 || (mnttab[d].flags & MNT_ACTIVE) == 0)
return -1;
if (u >= 0)
fcb[0] = u;
for (i = 0; i < 8; i++) { /* copy name */
if (*p == '*')
*++fcb = '?';
else if (*p == '.' || *p == 0)
*++fcb = ' ';
else if (strchr("<>,;:=[]", *p))
return -1;
else {
*++fcb = toupper(*p);
p++;
}
}
while (*p && *p != '.')
p++;
if (*p == '.')
p++;
for (i = 0; i < 3; i++) { /* copy extension */
if (*p == '*')
*++fcb = '?';
else if (*p == 0)
*++fcb = ' ';
else if (strchr("<>.,;:=[]", *p))
return -1;
else {
*++fcb = toupper(*p);
p++;
}
}
for (i = 0; i < 4; i++) /* clear ex, s1, s2, rc */
*++fcb = 0;
return d;
}
/* search for a directory entry on disk 'dp' matching 'len' bytes of the name
* in 'fcb' starting at the 'start'th entry. (len 1..15)
*/
static int
srchdir(struct mnt *dp, BYTE* fcb, int len, int start)
{
BYTE *entry = dp->dir + start*32;
/* note: real CP/M quits when it finds virgin entries */
while (start <= dp->drm) {
int n;
for (n = 0; n < len; n++) {
int mask;
switch (n) {
case 0: /* user number / delete flag */
mask = 0xff;
break;
case 12: /* extent */
mask = ~dp->exm & 0x1f;
break;
case 13: /* s1 */
mask = 0; /* ignore possible cpm3 bytecount */
break;
case 14: /* s2 */
mask = S2MASK;
break;
default: /* filename */
mask = 0x7f;
}
if (fcb[n] != '?' && fcb[n] != (entry[n]&mask))
break;
}
if (n == len)
return start;
entry += 32;
start++;
}
return -1;
}
static struct mnt *sortdisk;
static char sortkeys[3];
static int
dircmp(const void *d1, const void *d2)
{
BYTE *p1 = sortdisk->dir + *(int *)d1 * 32;
BYTE *p2 = sortdisk->dir + *(int *)d2 * 32;
int n, d, k;
for (k = 0; k < 3; k++)
switch (sortkeys[k]) {
case 'u': /* user number */
if ((d = (p1[0] - p2[0])))
return d;
break;
case 'n': /* name */
for (n = 1; n < 9; n++)
if ((d = (p1[n]&0x7f) - (p2[n]&0x7f)))
return d;
break;
case 'e': /* extension */
for (n = 9; n < 12; n++)
if ((d = (p1[n]&0x7f) - (p2[n]&0x7f)))
return d;
}
return 0;
}
static int
pname(BYTE *p)
{
int i;
int width;
for (i = 0, width = 0; i < 8; i++, p++)
if (*p != ' ') {
putchar(*p&0x7f);
width++;
}
if (*p != ' ') {
putchar('.');
width++;
for (i = 0; i < 3; i++, p++)
if (*p != ' ') {
putchar(*p&0x7f);
width++;
}
}
return width;
}
/* Find total file size (including unallocated holes, if any)
* p points to an arbitrary directory entry of the file on disk dp.
*/
static long
sizetotal(BYTE *p, struct mnt *dp)
{
int i;
BYTE fcb[16];
long res = 0, finalex = 0;
for (i = 0; i < 12; i++)
fcb[i] = p[i]&0x7f;
i = 0;
for (i = 0; (i = srchdir(dp, fcb, 12, i)) >= 0; i++) {
BYTE *entry = dp->dir + i*32;
long ex = (entry[12]&0x1f&~dp->exm) + ((entry[14]&S2MASK) << 5);
if (ex >= finalex) {
finalex = ex;
res = ex*16*1024 +
((dp->exm&entry[12])+1)*16*1024 - (128-entry[15])*128;
}
}
return res;
}
/* Calculate allocated file size.
* p points to an arbitrary directory entry of the file on disk dp.
*/
static long
sizealloc(BYTE *p, struct mnt *dp)
{
int i;
BYTE fcb[16];
long res = 0;
for (i = 0; i < 12; i++)
fcb[i] = p[i]&0x7f;
i = 0;
for (i = 0; (i = srchdir(dp, fcb, 12, i)) >= 0; i++) {
BYTE *entry = dp->dir + i*32;
res += ((dp->exm&entry[12])+1)*16*1024 - (128-entry[15])*128;
}
return res;
}
/* Calculate number of bytes allocated on disk */
static long
inuse(struct mnt *dp)
{
long blocks = 0;
unsigned short *ap = (unsigned short *) dp->alv;
int i;
for (i = 0; i < dp->dsm/16+1; i++)
blocks += popcount(*ap++);
return blocks<<(dp->bsh-3);
}
/* test a file attribute */
#define attr(b,c) ((b&0x80)?c:'-')
static int
dodir(char *tok)
{
int disk, dn = 0, nmatches;
char *afn = NULL;
BYTE fcb[16];
BYTE *entry;
struct mnt *dp;
char wild[8];
int *list;
int longform = 0;
int columns;
char *def = "eun"; /* default: extension, user, name */
int k = 0, rows, row;
while ((tok = strtok(NULL, white)) != NULL) {
if (*tok == '-')
switch (tok[1]) {
case 'e':
case 'n':
case 'u':
if (k < 3)
sortkeys[k++] = tok[1];
break;
case 'l':
longform = 1;
break;
default:
fprintf(stderr, "unrecognized option: %s\n", tok);
}
else
afn = tok;
}
while (k < 3) {
int d;
for (d = 0; d < 3; d++) {
int j;
for (j = 0; j < k; j++)
if (sortkeys[j] == def[d])
break;
if (j == k) {
sortkeys[k++] = def[d];
break;
}
}
}
if (afn == NULL)
afn = "*.*";
k = strlen(afn);
if (k && k < 5 && afn[k-1] == ':') {
sprintf(wild, "%s*.*", afn);
disk = makefcb(wild, fcb);
}
else
disk = makefcb(afn, fcb);
if (disk < 0)
return 0;
fcb[13] = '?'; /* any s1 */
dp = mnttab + disk;
list = xmalloc(dp->drm * sizeof(dn));
nmatches = 0;
while ((dn = srchdir(dp, fcb, 15, dn)) >= 0) {
if (dp->dir[32*dn] <= MAXUSER)
list[nmatches++] = dn;
dn++;
}
sortdisk = dp;
qsort(list, nmatches, sizeof(dn), dircmp);
columns = longform ? 2 : 4;
rows = (nmatches+columns-1)/columns;
for (row = 0; row < rows; row++) {
int column;
for (column = 0; column < columns; column++) {
int col;
if ((dn = column*rows+row) >= nmatches) {
putchar('\n');
column = columns;
break;
}
entry = dp->dir + 32*list[dn];
if (longform) {
long t = sizetotal(entry, dp);
long a = sizealloc(entry, dp);
printf("%8ld%c %c%c%c%c ", t, t==a ? ' ' : '!',
attr(entry[8], 'w'), attr(entry[9], 'r'),
attr(entry[10], 's'), attr(entry[11], 'a'));
}
printf("%2d:", *entry);
col = 3 + pname(++entry);
if (column == columns-1)
putchar('\n');
else while (col++ < 18)
putchar(' ');
}
}
free(list);
printf("%4ldK of %4ldK in use\n", inuse(dp), (dp->dsm+1L)<<(dp->bsh-3));
return 0;
}
/* CP/M file descriptor */
typedef struct {
struct mnt *dp; /* pointer to mount table entry */
BYTE fcb[16]; /* file name suitable for srchdir() */
int dirp; /* index of most recently used extent */
long pos; /* current position in file */
char *block; /* pointer to data located at pos */
long len; /* length of data pointed to by *block */
char *p; /* work pointer for putcpm */
} CFILE;
/* Set pointer to memory-mapped location of data corresponding to a given
* position in a CP/M file. Sets cf->block to the address and cf->len to the
* length of valid data at that address. cf->block is set to NULL if there is
* no data at that position (due to end of file or a hole in the file) and
* in this case cf->len is set to the block size as a hint where to look next
* in case it is a hole.
* If make is 1, a new block (and extent if needed) is allocated if there is
* currently no data at the given postion.
* Returns 0 if ok, 1 if extent not found and 2 if block not found.
*/
static int
getblock(CFILE *cf, int make)
{
int lex = cf->pos/(16*1024); /* logical extent */
int idx = cf->pos >> (cf->dp->bsh + 7); /* block index within file */
long blockno; /* block index on disk */
long offs; /* offset of pos from block boundary */
BYTE *entry; /* pointer to directory entry */
int mex; /* last extent contained in entry */
cf->len = 1<<(cf->dp->bsh+7); /* block size */
cf->fcb[12] = lex&0x1f;
cf->fcb[14] = lex>>5;
if (cf->dirp >= 0) { /* is dirp still valid? */
entry = cf->dp->dir + cf->dirp*32;
if (((cf->fcb[12] ^ entry[12])&~cf->dp->exm&0x1f) ||
((cf->fcb[14] ^ entry[14])&S2MASK))
cf->dirp = -1;
}
if (cf->dirp < 0) /* search for extent */
cf->dirp = srchdir(cf->dp, cf->fcb, 15, 0);
if (cf->dirp < 0 && make && ((lex>>5) <= S2MASK) &&
(cf->dirp = srchdir(cf->dp, (BYTE *)"\xe5", 1, 0)) >= 0) {
/* allocate a new physical extent */
entry = cf->dp->dir + cf->dirp*32;
memcpy(entry, cf->fcb, 15);
entry[12] = lex&0x1f;
entry[13] = 0;
entry[14] = lex>>5;
entry[15] = 0x80; /* max record count */
memclr(entry+16, 16); /* no blocks yet */
}
if (cf->dirp < 0) { /* eof or hole or directory full */
cf->block = cf->p = NULL;
return 1;
}
entry = cf->dp->dir + cf->dirp*32;
mex = ((entry[14]&S2MASK)<<5)+(entry[12]&0x1f);
if (lex > mex)
blockno = 0;
else
blockno = (cf->dp->dsm < 256) ?
entry[16+(idx&0xf)] :
entry[16+((idx<<1)&0xf)] +
(entry[16+((idx<<1)&0xf)+1] << 8);
if (blockno == 0 && make) { /* allocate a new block */
int ip;
blockno = findfree(cf->dp);
if (blockno != 0) {
entry[12] = lex&0x1f; /* grab the whole physical extent */
entry[13] = 0;
entry[14] = lex>>5;
entry[15] = 0x80; /* max record count */
if (cf->dp->dsm < 256)
entry[16+(idx&0xf)] = blockno;
else {
BYTE* where = entry + 16+((idx<<1)&0xf);
PutWORD(where, blockno);
}
ip = cf->pos & ((cf->dp->bsh<<7)|0x7f);
if (ip) /* clear unused initial portion */
memclr(cf->dp->dir + (blockno<<(cf->dp->bsh+7)) - ip, ip);
}
}
if (blockno == 0) { /* eof or hole or disk full */
cf->block = cf->p = NULL;
return 2;
}
offs = cf->pos & (cf->len-1);
cf->len -= offs;
if (lex == mex && ((cf->pos + cf->len) & 0x3fff) > (entry[15] << 7))
/* in partial last block of logical extent */
cf->len = (entry[15] << 7) - (cf->pos & 0x3fff);
if (cf->len < 0) {
/* just over the top */
cf->len = 1<<(cf->dp->bsh+7);
cf->block = cf->p = NULL;
}
else
cf->block = cf->p = (char *) cf->dp->dir +
(blockno<<(cf->dp->bsh+7)) + offs;
return 0;
}
static int
writeok(struct mnt *dp, int dirp, char *fn)
{
if ((dp->flags & MNT_RDONLY) || (dp->dir[32*dirp+9]&0x80)) {
fprintf(stderr, "read-only: %s\n", fn);
return 0;
}
return 1;
}
static int
erase(struct mnt *dp, BYTE *fcb)
{
int dirp;
int n = 0;
for (dirp = 0; (dirp = srchdir(dp, fcb, 12, dirp)) >= 0; dirp++) {
BYTE *entry = dp->dir + dirp*32;
alloc(dp, entry, 0);
*entry = 0xe5;
n++;
}
return n;
}
static int
doerase(char *tok)
{
int disk, dirp;
BYTE fcb[16];
char *fn = strtok(NULL, white);
if (fn == NULL) {
fputs("need a filename\n", stderr);
return 0;
}
disk = makefcb(fn, fcb);
if (disk >= 0 &&
(dirp = srchdir(mnttab+disk, fcb, 12, 0)) >= 0 &&
!writeok(mnttab+disk, dirp, fn))
return 0;
if (disk < 0 || erase(mnttab+disk, fcb) == 0)
fprintf(stderr, "no match: %s\n", fn);
return 0;
}
static long
getval(char *s)
{
char *tok = s+2;
if (*tok == 0)
tok = strtok(NULL, white);
if (tok && *tok) {
long unit = 1;
char u = tok[strlen(tok)-1];
switch (toupper(u)) {
case 'K':
unit = 1024;
break;
case 'M':
unit = 1024*1024;
break;
}
return unit*strtol(tok, NULL, 10);
}
else {
fprintf(stderr, "option needs a value: %s\n", s);
return -1;
}
}
static void
checkval(int ok, long val, char *msg)
{
if (!ok)
fprintf(stderr, "bad %s value: %ld\n", msg, val);
}
/* create a new CP/M disk */
static int
docreate(char *tok)
{
char *fn = NULL;
FILE *f;
long s, size = 1024*1024;
char header[128];
BYTE sector[128];
long al01, dsm, spt = -1, bsize = -1, drm = -1, offs = -1;
int dblocks;
while ((tok = strtok(NULL, white)) != NULL) {
if (*tok == '-')
switch (tok[1]) {
case 'b':
bsize = getval(tok);
break;
case 'd':
drm = getval(tok);
break;
case 'o':
offs = getval(tok);
break;
case 's':
spt = getval(tok);
break;
default:
fprintf(stderr, "unrecognized option: %s\n", tok);
}
else {
fn = tok;
break;
}
}
if (fn == NULL) {
fputs("need a filename\n", stderr);
return 0;
}
if ((tok = strtok(NULL, white)) != NULL) {
char unit = 'b';
int n = sscanf(tok, "%ld%c", &size, &unit);
if (n == 2)
switch (toupper(unit)) {
case 'B':
break;
case 'K':
size *= 1024;
break;
case 'M':
size *= 1024*1024;
break;
default:
fprintf(stderr, "units not recognized: %s\n", tok);
return 0;
}
else if (n != 1) {
fprintf(stderr, "need numeric size: %s\n", tok);
return 0;
}
}
if ((f = fopen(fn, "w")) == NULL) {
perror(fn);
return 0;
}
memset(sector, 0xe5, sizeof sector);
if (size < 256*1024) {
if (bsize == -1)
bsize = 1024;
if (drm == -1)
drm = 63;
if (spt == -1)
spt = 26;
if (offs == -1)
offs = 0;
}
else {
if (bsize == -1)
bsize = 2048;
if (drm == -1)
drm = 1023;
if (spt == -1)
spt = 26;
if (offs == -1)
offs = 0;
}
dsm = (size - offs*spt*128)/bsize - 1;
checkval(spt <= 0xffff, spt, "sectors per track");
checkval(size/(spt*128)+offs <= 0xffff, size/(spt*128)+offs, "tracks");
checkval(((bsize&(bsize-1))==0) &&
(bsize >= ((dsm < 256) ? 1024 : 2048)) &&
bsize <= 16384, bsize, "block size");
dblocks = ((drm+1)*32+bsize-1)/bsize;
checkval(dblocks<=16 && dblocks < dsm, drm, "max directory entry");
memclr(header, sizeof header);
sprintf(header, "<CPM_Disk>");
PutWORD(header+32, spt);
header[34] = popcount(bsize-1)-7; /* bsh */
header[35] = (bsize/128-1); /* blm */
header[36] = dsm < 256 ? bsize/1024-1 : bsize/2048-1; /* exm */
PutWORD(header+37, dsm);
PutWORD(header+39, drm);
al01 = ~((1<<(16-dblocks))-1);
header[41] = al01>>8;
header[42] = al01;
PutWORD(header+45, offs);
if (fwrite(header, sizeof header, 1, f) == 0) {
perror(fn);
return 0;
}
s = offs*spt*128 + (drm+1)*32;
while (s > 0) {
if (fwrite(sector, sizeof sector, 1, f) == 0) {
perror(fn);
return 0;
}
s -= sizeof sector;
}