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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
|
/* csplit - split a file into sections determined by context lines
Copyright (C) 1991, 1995 Free Software Foundation, Inc.
This program 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, 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. */
/* Written by Stuart Kemp, cpsrk@groper.jcu.edu.au.
Modified by David MacKenzie, djm@gnu.ai.mit.edu. */
#include <config.h>
#include <stdio.h>
#include <getopt.h>
#include <sys/types.h>
#include <signal.h>
#ifdef HAVE_LIMITS_H
#include <limits.h>
#endif /* HAVE_LIMITS_H */
#include "regex.h"
#include "system.h"
#include "version.h"
#include "error.h"
#ifdef STDC_HEADERS
#include <stdlib.h>
#else
char *malloc ();
char *realloc ();
#endif
#ifndef MAX
#define MAX(a,b) (((a) > (b)) ? (a) : (b))
#endif
#ifndef TRUE
#define FALSE 0
#define TRUE 1
#endif
/* Increment size of area for control records. */
#define ALLOC_SIZE 20
/* The default prefix for output file names. */
#define DEFAULT_PREFIX "xx"
typedef int boolean;
/* A compiled pattern arg. */
struct control
{
char *regexpr; /* Non-compiled regular expression. */
struct re_pattern_buffer re_compiled; /* Compiled regular expression. */
int offset; /* Offset from regexp to split at. */
int lines_required; /* Number of lines required. */
unsigned int repeat; /* Repeat count. */
int repeat_forever; /* Non-zero if `*' used as a repeat count. */
int argnum; /* ARGV index. */
boolean ignore; /* If true, produce no output (for regexp). */
};
/* Initial size of data area in buffers. */
#define START_SIZE 8191
/* Increment size for data area. */
#define INCR_SIZE 2048
/* Number of lines kept in each node in line list. */
#define CTRL_SIZE 80
#ifdef DEBUG
/* Some small values to test the algorithms. */
#define START_SIZE 200
#define INCR_SIZE 10
#define CTRL_SIZE 1
#endif
/* A string with a length count. */
struct cstring
{
int len;
char *str;
};
/* Pointers to the beginnings of lines in the buffer area.
These structures are linked together if needed. */
struct line
{
unsigned used; /* Number of offsets used in this struct. */
unsigned insert_index; /* Next offset to use when inserting line. */
unsigned retrieve_index; /* Next index to use when retrieving line. */
struct cstring starts[CTRL_SIZE]; /* Lines in the data area. */
struct line *next; /* Next in linked list. */
};
/* The structure to hold the input lines.
Contains a pointer to the data area and a list containing
pointers to the individual lines. */
struct buffer_record
{
unsigned bytes_alloc; /* Size of the buffer area. */
unsigned bytes_used; /* Bytes used in the buffer area. */
unsigned start_line; /* First line number in this buffer. */
unsigned first_available; /* First line that can be retrieved. */
unsigned num_lines; /* Number of complete lines in this buffer. */
char *buffer; /* Data area. */
struct line *line_start; /* Head of list of pointers to lines. */
struct line *curr_line; /* The line start record currently in use. */
struct buffer_record *next;
};
int safe_read ();
static void close_output_file __P ((void));
static void create_output_file __P ((void));
static void delete_all_files __P ((void));
static void save_line_to_file __P ((const struct cstring *line));
static void usage __P ((int status));
/* The name this program was run with. */
char *program_name;
/* Convert the number of 8-bit bytes of a binary representation to
the number of characters required to represent the same quantity
as an unsigned octal. For example, a 32-bit (4-byte) quantity may
require a field width as wide as 11 characters. */
static const unsigned int bytes_to_octal_digits[] =
{0, 3, 6, 8, 11, 14, 16, 19, 22, 25, 27, 30, 32, 35, 38, 41, 43};
/* Input file descriptor. */
static int input_desc = 0;
/* List of available buffers. */
static struct buffer_record *free_list = NULL;
/* Start of buffer list. */
static struct buffer_record *head = NULL;
/* Partially read line. */
static char *hold_area = NULL;
/* Number of chars in `hold_area'. */
static unsigned hold_count = 0;
/* Number of the last line in the buffers. */
static unsigned last_line_number = 0;
/* Number of the line currently being examined. */
static unsigned current_line = 0;
/* If TRUE, we have read EOF. */
static boolean have_read_eof = FALSE;
/* Name of output files. */
static char *filename_space = NULL;
/* Prefix part of output file names. */
static char *prefix = NULL;
/* Suffix part of output file names. */
static char *suffix = NULL;
/* Number of digits to use in output file names. */
static int digits = 2;
/* Number of files created so far. */
static unsigned int files_created = 0;
/* Number of bytes written to current file. */
static unsigned int bytes_written;
/* Output file pointer. */
static FILE *output_stream = NULL;
/* Output file name. */
static char *output_filename = NULL;
/* Perhaps it would be cleaner to pass arg values instead of indexes. */
static char **global_argv;
/* If TRUE, do not print the count of bytes in each output file. */
static boolean suppress_count;
/* If TRUE, remove output files on error. */
static boolean remove_files;
/* If TRUE, remove all output files which have a zero length. */
static boolean elide_empty_files;
/* The compiled pattern arguments, which determine how to split
the input file. */
static struct control *controls;
/* Number of elements in `controls'. */
static unsigned int control_used;
/* If non-zero, display usage information and exit. */
static int show_help;
/* If non-zero, print the version on standard output then exit. */
static int show_version;
static struct option const longopts[] =
{
{"digits", required_argument, NULL, 'n'},
{"quiet", no_argument, NULL, 'q'},
{"silent", no_argument, NULL, 's'},
{"keep-files", no_argument, NULL, 'k'},
{"elide-empty-files", no_argument, NULL, 'z'},
{"prefix", required_argument, NULL, 'f'},
{"suffix-format", required_argument, NULL, 'b'},
{"help", no_argument, &show_help, 1},
{"version", no_argument, &show_version, 1},
{NULL, 0, NULL, 0}
};
/* Optionally remove files created so far; then exit.
Called when an error detected. */
static void
cleanup (void)
{
if (output_stream)
close_output_file ();
if (remove_files)
delete_all_files ();
}
static void
cleanup_fatal (void)
{
cleanup ();
exit (1);
}
static RETSIGTYPE
interrupt_handler (int sig)
{
#ifdef SA_INTERRUPT
struct sigaction sigact;
sigact.sa_handler = SIG_DFL;
sigemptyset (&sigact.sa_mask);
sigact.sa_flags = 0;
sigaction (sig, &sigact, NULL);
#else /* !SA_INTERRUPT */
signal (sig, SIG_DFL);
#endif /* SA_INTERRUPT */
cleanup ();
kill (getpid (), sig);
}
/* Allocate N bytes of memory dynamically, with error checking. */
static char *
xmalloc (unsigned int n)
{
char *p;
p = malloc (n);
if (p == NULL)
{
error (0, 0, _("virtual memory exhausted"));
cleanup_fatal ();
}
return p;
}
/* Change the size of an allocated block of memory P to N bytes,
with error checking.
If P is NULL, run xmalloc.
If N is 0, run free and return NULL. */
static char *
xrealloc (char *p, unsigned int n)
{
if (p == NULL)
return xmalloc (n);
if (n == 0)
{
free (p);
return 0;
}
p = realloc (p, n);
if (p == NULL)
{
error (0, 0, _("virtual memory exhausted"));
cleanup_fatal ();
}
return p;
}
/* Keep track of NUM chars of a partial line in buffer START.
These chars will be retrieved later when another large buffer is read.
It is not necessary to create a new buffer for these chars; instead,
we keep a pointer to the existing buffer. This buffer *is* on the
free list, and when the next buffer is obtained from this list
(even if it is this one), these chars will be placed at the
start of the new buffer. */
static void
save_to_hold_area (char *start, unsigned int num)
{
hold_area = start;
hold_count = num;
}
/* Read up to MAX_N_BYTES chars from the input stream into DEST.
Return the number of chars read. */
static int
read_input (char *dest, unsigned int max_n_bytes)
{
int bytes_read;
if (max_n_bytes == 0)
return 0;
bytes_read = safe_read (input_desc, dest, max_n_bytes);
if (bytes_read == 0)
have_read_eof = TRUE;
if (bytes_read < 0)
{
error (0, errno, _("read error"));
cleanup_fatal ();
}
return bytes_read;
}
/* Initialize existing line record P. */
static void
clear_line_control (struct line *p)
{
p->used = 0;
p->insert_index = 0;
p->retrieve_index = 0;
}
/* Initialize all line records in B. */
static void
clear_all_line_control (struct buffer_record *b)
{
struct line *l;
for (l = b->line_start; l; l = l->next)
clear_line_control (l);
}
/* Return a new, initialized line record. */
static struct line *
new_line_control (void)
{
struct line *p;
p = (struct line *) xmalloc (sizeof (struct line));
p->next = NULL;
clear_line_control (p);
return p;
}
/* Record LINE_START, which is the address of the start of a line
of length LINE_LEN in the large buffer, in the lines buffer of B. */
static void
keep_new_line (struct buffer_record *b, char *line_start, int line_len)
{
struct line *l;
/* If there is no existing area to keep line info, get some. */
if (b->line_start == NULL)
b->line_start = b->curr_line = new_line_control ();
/* If existing area for lines is full, get more. */
if (b->curr_line->used == CTRL_SIZE)
{
b->curr_line->next = new_line_control ();
b->curr_line = b->curr_line->next;
}
l = b->curr_line;
/* Record the start of the line, and update counters. */
l->starts[l->insert_index].str = line_start;
l->starts[l->insert_index].len = line_len;
l->used++;
l->insert_index++;
}
/* Scan the buffer in B for newline characters
and record the line start locations and lengths in B.
Return the number of lines found in this buffer.
There may be an incomplete line at the end of the buffer;
a pointer is kept to this area, which will be used when
the next buffer is filled. */
static unsigned int
record_line_starts (struct buffer_record *b)
{
char *line_start; /* Start of current line. */
char *line_end; /* End of each line found. */
unsigned int bytes_left; /* Length of incomplete last line. */
unsigned int lines; /* Number of lines found. */
unsigned int line_length; /* Length of each line found. */
if (b->bytes_used == 0)
return 0;
lines = 0;
line_start = b->buffer;
bytes_left = b->bytes_used;
for (;;)
{
line_end = memchr (line_start, '\n', bytes_left);
if (line_end == NULL)
break;
line_length = line_end - line_start + 1;
keep_new_line (b, line_start, line_length);
bytes_left -= line_length;
line_start = line_end + 1;
lines++;
}
/* Check for an incomplete last line. */
if (bytes_left)
{
if (have_read_eof)
{
keep_new_line (b, line_start, bytes_left);
lines++;
}
else
save_to_hold_area (line_start, bytes_left);
}
b->num_lines = lines;
b->first_available = b->start_line = last_line_number + 1;
last_line_number += lines;
return lines;
}
/* Return a new buffer with room to store SIZE bytes, plus
an extra byte for safety. */
static struct buffer_record *
create_new_buffer (unsigned int size)
{
struct buffer_record *new_buffer;
new_buffer = (struct buffer_record *)
xmalloc (sizeof (struct buffer_record));
new_buffer->buffer = (char *) xmalloc (size + 1);
new_buffer->bytes_alloc = size;
new_buffer->line_start = new_buffer->curr_line = NULL;
return new_buffer;
}
/* Return a new buffer of at least MINSIZE bytes. If a buffer of at
least that size is currently free, use it, otherwise create a new one. */
static struct buffer_record *
get_new_buffer (unsigned int min_size)
{
struct buffer_record *p, *q;
struct buffer_record *new_buffer; /* Buffer to return. */
unsigned int alloc_size; /* Actual size that will be requested. */
alloc_size = START_SIZE;
while (min_size > alloc_size)
alloc_size += INCR_SIZE;
if (free_list == NULL)
new_buffer = create_new_buffer (alloc_size);
else
{
/* Use first-fit to find a buffer. */
p = new_buffer = NULL;
q = free_list;
do
{
if (q->bytes_alloc >= min_size)
{
if (p == NULL)
free_list = q->next;
else
p->next = q->next;
break;
}
p = q;
q = q->next;
}
while (q);
new_buffer = (q ? q : create_new_buffer (alloc_size));
new_buffer->curr_line = new_buffer->line_start;
clear_all_line_control (new_buffer);
}
new_buffer->num_lines = 0;
new_buffer->bytes_used = 0;
new_buffer->start_line = new_buffer->first_available = last_line_number + 1;
new_buffer->next = NULL;
return new_buffer;
}
/* Add buffer BUF to the list of free buffers. */
static void
free_buffer (struct buffer_record *buf)
{
buf->next = free_list;
free_list = buf;
}
/* Append buffer BUF to the linked list of buffers that contain
some data yet to be processed. */
static void
save_buffer (struct buffer_record *buf)
{
struct buffer_record *p;
buf->next = NULL;
buf->curr_line = buf->line_start;
if (head == NULL)
head = buf;
else
{
for (p = head; p->next; p = p->next)
/* Do nothing. */ ;
p->next = buf;
}
}
/* Fill a buffer of input.
Set the initial size of the buffer to a default.
Fill the buffer (from the hold area and input stream)
and find the individual lines.
If no lines are found (the buffer is too small to hold the next line),
release the current buffer (whose contents would have been put in the
hold area) and repeat the process with another large buffer until at least
one entire line has been read.
Return TRUE if a new buffer was obtained, otherwise false
(in which case end-of-file must have been encountered). */
static boolean
load_buffer (void)
{
struct buffer_record *b;
unsigned int bytes_wanted = START_SIZE; /* Minimum buffer size. */
unsigned int bytes_avail; /* Size of new buffer created. */
unsigned int lines_found; /* Number of lines in this new buffer. */
char *p; /* Place to load into buffer. */
if (have_read_eof)
return FALSE;
/* We must make the buffer at least as large as the amount of data
in the partial line left over from the last call. */
if (bytes_wanted < hold_count)
bytes_wanted = hold_count;
do
{
b = get_new_buffer (bytes_wanted);
bytes_avail = b->bytes_alloc; /* Size of buffer returned. */
p = b->buffer;
/* First check the `holding' area for a partial line. */
if (hold_count)
{
if (p != hold_area)
memcpy (p, hold_area, hold_count);
p += hold_count;
b->bytes_used += hold_count;
bytes_avail -= hold_count;
hold_count = 0;
}
b->bytes_used += (unsigned int) read_input (p, bytes_avail);
lines_found = record_line_starts (b);
bytes_wanted = b->bytes_alloc * 2;
if (!lines_found)
free_buffer (b);
}
while (!lines_found && !have_read_eof);
if (lines_found)
save_buffer (b);
return lines_found != 0;
}
/* Return the line number of the first line that has not yet been retrieved. */
static unsigned int
get_first_line_in_buffer (void)
{
if (head == NULL && !load_buffer ())
error (1, errno, _("input disappeared"));
return head->first_available;
}
/* Return a pointer to the logical first line in the buffer and make the
next line the logical first line.
Return NULL if there is no more input. */
static struct cstring *
remove_line (void)
{
struct cstring *line; /* Return value. */
struct line *l; /* For convenience. */
if (head == NULL && !load_buffer ())
return NULL;
if (current_line < head->first_available)
current_line = head->first_available;
++(head->first_available);
l = head->curr_line;
line = &l->starts[l->retrieve_index];
/* Advance index to next line. */
if (++l->retrieve_index == l->used)
{
/* Go on to the next line record. */
head->curr_line = l->next;
if (head->curr_line == NULL || head->curr_line->used == 0)
{
/* Go on to the next data block. */
struct buffer_record *b = head;
head = head->next;
free_buffer (b);
}
}
return line;
}
/* Search the buffers for line LINENUM, reading more input if necessary.
Return a pointer to the line, or NULL if it is not found in the file. */
static struct cstring *
find_line (unsigned int linenum)
{
struct buffer_record *b;
if (head == NULL && !load_buffer ())
return NULL;
if (linenum < head->start_line)
return NULL;
for (b = head;;)
{
if (linenum < b->start_line + b->num_lines)
{
/* The line is in this buffer. */
struct line *l;
unsigned int offset; /* How far into the buffer the line is. */
l = b->line_start;
offset = linenum - b->start_line;
/* Find the control record. */
while (offset >= CTRL_SIZE)
{
l = l->next;
offset -= CTRL_SIZE;
}
return &l->starts[offset];
}
if (b->next == NULL && !load_buffer ())
return NULL;
b = b->next; /* Try the next data block. */
}
}
/* Return TRUE if at least one more line is available for input. */
static boolean
no_more_lines (void)
{
return (find_line (current_line + 1) == NULL) ? TRUE : FALSE;
}
/* Set the name of the input file to NAME and open it. */
static void
set_input_file (const char *name)
{
if (!strcmp (name, "-"))
input_desc = 0;
else
{
input_desc = open (name, O_RDONLY);
if (input_desc < 0)
error (1, errno, "%s", name);
}
}
/* Write all lines from the beginning of the buffer up to, but
not including, line LAST_LINE, to the current output file.
If IGNORE is TRUE, do not output lines selected here.
ARGNUM is the index in ARGV of the current pattern. */
static void
write_to_file (unsigned int last_line, boolean ignore, int argnum)
{
struct cstring *line;
unsigned int first_line; /* First available input line. */
unsigned int lines; /* Number of lines to output. */
unsigned int i;
first_line = get_first_line_in_buffer ();
if (first_line > last_line)
{
error (0, 0, _("%s: line number out of range"), global_argv[argnum]);
cleanup_fatal ();
}
lines = last_line - first_line;
for (i = 0; i < lines; i++)
{
line = remove_line ();
if (line == NULL)
{
error (0, 0, _("%s: line number out of range"), global_argv[argnum]);
cleanup_fatal ();
}
if (!ignore)
save_line_to_file (line);
}
}
/* Output any lines left after all regexps have been processed. */
static void
dump_rest_of_file (void)
{
struct cstring *line;
while ((line = remove_line ()) != NULL)
save_line_to_file (line);
}
/* Handle an attempt to read beyond EOF under the control of record P,
on iteration REPETITION if nonzero. */
static void
handle_line_error (const struct control *p, int repetition)
{
fprintf (stderr, _("%s: `%d': line number out of range"),
program_name, p->lines_required);
if (repetition)
fprintf (stderr, _(" on repetition %d\n"), repetition);
else
fprintf (stderr, "\n");
cleanup_fatal ();
}
/* Determine the line number that marks the end of this file,
then get those lines and save them to the output file.
P is the control record.
REPETITION is the repetition number. */
static void
process_line_count (const struct control *p, int repetition)
{
unsigned int linenum;
unsigned int last_line_to_save = p->lines_required * (repetition + 1);
struct cstring *line;
create_output_file ();
linenum = get_first_line_in_buffer ();
/* Check for requesting a line that has already been written out.
If this ever happens, it's due to a bug in csplit. */
if (linenum >= last_line_to_save)
abort ();
while (linenum++ < last_line_to_save)
{
line = remove_line ();
if (line == NULL)
handle_line_error (p, repetition);
save_line_to_file (line);
}
close_output_file ();
/* Ensure that the line number specified is not 1 greater than
the number of lines in the file. */
if (no_more_lines ())
handle_line_error (p, repetition);
}
static void
regexp_error (struct control *p, int repetition, boolean ignore)
{
fprintf (stderr, _("%s: `%s': match not found"),
program_name, global_argv[p->argnum]);
if (repetition)
fprintf (stderr, _(" on repetition %d\n"), repetition);
else
fprintf (stderr, "\n");
if (!ignore)
{
dump_rest_of_file ();
close_output_file ();
}
cleanup_fatal ();
}
/* Read the input until a line matches the regexp in P, outputting
it unless P->IGNORE is TRUE.
REPETITION is this repeat-count; 0 means the first time. */
static void
process_regexp (struct control *p, int repetition)
{
struct cstring *line; /* From input file. */
unsigned int line_len; /* To make "$" in regexps work. */
unsigned int break_line; /* First line number of next file. */
boolean ignore = p->ignore; /* If TRUE, skip this section. */
int ret;
if (!ignore)
create_output_file ();
/* If there is no offset for the regular expression, or
it is positive, then it is not necessary to buffer the lines. */
if (p->offset >= 0)
{
for (;;)
{
line = find_line (++current_line);
if (line == NULL)
{
if (p->repeat_forever)
{
if (!ignore)
{
dump_rest_of_file ();
close_output_file ();
}
exit (0);
}
else
regexp_error (p, repetition, ignore);
}
line_len = line->len;
if (line->str[line_len - 1] == '\n')
line_len--;
ret = re_search (&p->re_compiled, line->str, line_len,
0, line_len, (struct re_registers *) 0);
if (ret == -2)
{
error (0, 0, _("error in regular expression search"));
cleanup_fatal ();
}
if (ret == -1)
{
line = remove_line ();
if (!ignore)
save_line_to_file (line);
}
else
break;
}
}
else
{
/* Buffer the lines. */
for (;;)
{
line = find_line (++current_line);
if (line == NULL)
{
if (p->repeat_forever)
{
if (!ignore)
{
dump_rest_of_file ();
close_output_file ();
}
exit (0);
}
else
regexp_error (p, repetition, ignore);
}
line_len = line->len;
if (line->str[line_len - 1] == '\n')
line_len--;
ret = re_search (&p->re_compiled, line->str, line_len,
0, line_len, (struct re_registers *) 0);
if (ret == -2)
{
error (0, 0, _("error in regular expression search"));
cleanup_fatal ();
}
if (ret >= 0)
break;
}
}
/* Account for any offset from this regexp. */
break_line = current_line + p->offset;
write_to_file (break_line, ignore, p->argnum);
if (!ignore)
close_output_file ();
current_line = break_line;
}
/* Split the input file according to the control records we have built. */
static void
split_file (void)
{
unsigned int i, j;
for (i = 0; i < control_used; i++)
{
if (controls[i].regexpr)
{
for (j = 0; (controls[i].repeat_forever
|| j <= controls[i].repeat); j++)
process_regexp (&controls[i], j);
}
else
{
for (j = 0; (controls[i].repeat_forever
|| j <= controls[i].repeat); j++)
process_line_count (&controls[i], j);
}
}
create_output_file ();
dump_rest_of_file ();
close_output_file ();
}
/* Return the name of output file number NUM. */
static char *
make_filename (unsigned int num)
{
strcpy (filename_space, prefix);
if (suffix)
sprintf (filename_space+strlen(prefix), suffix, num);
else
sprintf (filename_space+strlen(prefix), "%0*d", digits, num);
return filename_space;
}
/* Create the next output file. */
static void
create_output_file (void)
{
output_filename = make_filename (files_created);
output_stream = fopen (output_filename, "w");
if (output_stream == NULL)
{
error (0, errno, "%s", output_filename);
cleanup_fatal ();
}
files_created++;
bytes_written = 0;
}
/* Delete all the files we have created. */
static void
delete_all_files (void)
{
unsigned int i;
char *name;
for (i = 0; i < files_created; i++)
{
name = make_filename (i);
if (unlink (name))
error (0, errno, "%s", name);
}
}
/* Close the current output file and print the count
of characters in this file. */
static void
close_output_file (void)
{
if (output_stream)
{
if (fclose (output_stream) == EOF)
{
error (0, errno, _("write error for `%s'"), output_filename);
output_stream = NULL;
cleanup_fatal ();
}
if (bytes_written == 0 && elide_empty_files)
{
if (unlink (output_filename))
error (0, errno, "%s", output_filename);
files_created--;
}
else
if (!suppress_count)
fprintf (stdout, "%d\n", bytes_written);
output_stream = NULL;
}
}
/* Save line LINE to the output file and
increment the character count for the current file. */
static void
save_line_to_file (const struct cstring *line)
{
fwrite (line->str, sizeof (char), line->len, output_stream);
bytes_written += line->len;
}
/* Return a new, initialized control record. */
static struct control *
new_control_record (void)
{
static unsigned control_allocated = 0; /* Total space allocated. */
struct control *p;
if (control_allocated == 0)
{
control_allocated = ALLOC_SIZE;
controls = (struct control *)
xmalloc (sizeof (struct control) * control_allocated);
}
else if (control_used == control_allocated)
{
control_allocated += ALLOC_SIZE;
controls = (struct control *)
xrealloc ((char *) controls,
sizeof (struct control) * control_allocated);
}
p = &controls[control_used++];
p->regexpr = NULL;
p->repeat = 0;
p->repeat_forever = 0;
p->lines_required = 0;
p->offset = 0;
return p;
}
/* Convert string NUM to an integer and put the value in *RESULT.
Return a TRUE if the string consists entirely of digits,
FALSE if not. */
/* FIXME: use xstrtoul in place of this function. */
static boolean
string_to_number (int *result, const char *num)
{
char ch;
int val = 0;
if (*num == '\0')
return FALSE;
while ((ch = *num++))
{
if (!ISDIGIT (ch))
return FALSE;
val = val * 10 + ch - '0';
}
*result = val;
return TRUE;
}
/* Check if there is a numeric offset after a regular expression.
STR is the entire command line argument.
P is the control record for this regular expression.
NUM is the numeric part of STR. */
static void
check_for_offset (struct control *p, const char *str, const char *num)
{
if (*num != '-' && *num != '+')
error (1, 0, _("%s: `+' or `-' expected after delimeter"), str);
if (!string_to_number (&p->offset, num + 1))
error (1, 0, _("%s: integer expected after `%c'"), str, *num);
if (*num == '-')
p->offset = -p->offset;
}
/* Given that the first character of command line arg STR is '{',
make sure that the rest of the string is a valid repeat count
and store its value in P.
ARGNUM is the ARGV index of STR. */
static void
parse_repeat_count (int argnum, struct control *p, char *str)
{
char *end;
end = str + strlen (str) - 1;
if (*end != '}')
error (1, 0, _("%s: `}' is required in repeat count"), str);
*end = '\0';
if (str+1 == end-1 && *(str+1) == '*')
p->repeat_forever = 1;
else
if (!string_to_number (&p->repeat, str + 1))
error (1, 0, _("%s}: integer required between `{' and `}'"),
global_argv[argnum]);
*end = '}';
}
/* Extract the regular expression from STR and check for a numeric offset.
STR should start with the regexp delimiter character.
Return a new control record for the regular expression.
ARGNUM is the ARGV index of STR.
Unless IGNORE is TRUE, mark these lines for output. */
static struct control *
extract_regexp (int argnum, boolean ignore, char *str)
{
int len; /* Number of chars in this regexp. */
char delim = *str;
char *closing_delim;
struct control *p;
const char *err;
closing_delim = strrchr (str + 1, delim);
if (closing_delim == NULL)
error (1, 0, _("%s: closing delimeter `%c' missing"), str, delim);
len = closing_delim - str - 1;
p = new_control_record ();
p->argnum = argnum;
p->ignore = ignore;
p->regexpr = (char *) xmalloc ((unsigned) (len + 1));
strncpy (p->regexpr, str + 1, len);
p->re_compiled.allocated = len * 2;
p->re_compiled.buffer = (unsigned char *) xmalloc (p->re_compiled.allocated);
p->re_compiled.fastmap = xmalloc (256);
p->re_compiled.translate = 0;
err = re_compile_pattern (p->regexpr, len, &p->re_compiled);
if (err)
{
error (0, 0, _("%s: invalid regular expression: %s"), str, err);
cleanup_fatal ();
}
if (closing_delim[1])
check_for_offset (p, str, closing_delim + 1);
return p;
}
/* Extract the break patterns from args START through ARGC - 1 of ARGV.
After each pattern, check if the next argument is a repeat count. */
static void
parse_patterns (int argc, int start, char **argv)
{
int i; /* Index into ARGV. */
struct control *p; /* New control record created. */
for (i = start; i < argc; i++)
{
if (*argv[i] == '/' || *argv[i] == '%')
{
p = extract_regexp (i, *argv[i] == '%', argv[i]);
}
else
{
p = new_control_record ();
p->argnum = i;
if (!string_to_number (&p->lines_required, argv[i]))
error (1, 0, _("%s: invalid pattern"), argv[i]);
}
if (i + 1 < argc && *argv[i + 1] == '{')
{
/* We have a repeat count. */
i++;
parse_repeat_count (i, p, argv[i]);
}
}
}
static unsigned
get_format_flags (char **format_ptr)
{
unsigned count = 0;
for (; **format_ptr; (*format_ptr)++)
{
switch (**format_ptr)
{
case '-':
break;
case '+':
case ' ':
count++;
break;
case '#':
count += 2; /* Allow for 0x prefix preceeding an `x' conversion. */
break;
default:
return count;
}
}
return count;
}
static unsigned
get_format_width (char **format_ptr)
{
unsigned count = 0;
char *start;
int ch_save;
start = *format_ptr;
for (; **format_ptr; (*format_ptr)++)
if (!ISDIGIT (**format_ptr))
break;
ch_save = **format_ptr;
**format_ptr = '\0';
/* In the case where no minimum field width is explicitly specified,
allow for enough octal digits to represent the value of LONG_MAX. */
count = ((*format_ptr == start)
? bytes_to_octal_digits[sizeof (long)]
: atoi (start));
**format_ptr = ch_save;
return count;
}
static unsigned
get_format_prec (char **format_ptr)
{
unsigned count = 0;
char *start;
int ch_save;
int is_negative;
if (**format_ptr != '.')
return 0;
(*format_ptr)++;
if (**format_ptr == '-' || **format_ptr == '+')
{
is_negative = (**format_ptr == '-');
(*format_ptr)++;
}
else
{
is_negative = 0;
}
start = *format_ptr;
for (; **format_ptr; (*format_ptr)++)
if (!ISDIGIT (**format_ptr))
break;
/* ANSI 4.9.6.1 says that if the precision is negative, it's as good as
not there. */
if (is_negative)
start = *format_ptr;
ch_save = **format_ptr;
**format_ptr = '\0';
count = (*format_ptr == start) ? 11 : atoi (start);
**format_ptr = ch_save;
return count;
}
static void
get_format_conv_type (char **format_ptr)
{
int ch = *((*format_ptr)++);
switch (ch)
{
case 'd':
case 'i':
case 'o':
case 'u':
case 'x':
case 'X':
break;
case 0:
error (1, 0, _("missing conversion specifier in suffix"));
break;
default:
if (ISPRINT (ch))
error (1, 0, _("invalid conversion specifier in suffix: %c"), ch);
else
error (1, 0, _("invalid conversion specifier in suffix: \\%.3o"), ch);
}
}
static unsigned
max_out (char *format)
{
unsigned out_count = 0;
unsigned percents = 0;
for (; *format; )
{
int ch = *format++;
if (ch != '%')
out_count++;
else
{
percents++;
out_count += get_format_flags (&format);
{
int width = get_format_width (&format);
int prec = get_format_prec (&format);
out_count += MAX (width, prec);
}
get_format_conv_type (&format);
}
}
if (percents == 0)
error (1, 0, _("missing %% conversion specification in suffix"));
else if (percents > 1)
error (1, 0, _("too many %% conversion specifications in suffix"));
return out_count;
}
void
main (int argc, char **argv)
{
int optc;
#ifdef SA_INTERRUPT
struct sigaction oldact, newact;
#endif /* SA_INTERRUPT */
program_name = argv[0];
global_argv = argv;
controls = NULL;
control_used = 0;
suppress_count = FALSE;
remove_files = TRUE;
prefix = DEFAULT_PREFIX;
#ifdef SA_INTERRUPT
newact.sa_handler = interrupt_handler;
sigemptyset (&newact.sa_mask);
newact.sa_flags = 0;
sigaction (SIGHUP, NULL, &oldact);
if (oldact.sa_handler != SIG_IGN)
sigaction (SIGHUP, &newact, NULL);
sigaction (SIGINT, NULL, &oldact);
if (oldact.sa_handler != SIG_IGN)
sigaction (SIGINT, &newact, NULL);
sigaction (SIGQUIT, NULL, &oldact);
if (oldact.sa_handler != SIG_IGN)
sigaction (SIGQUIT, &newact, NULL);
sigaction (SIGTERM, NULL, &oldact);
if (oldact.sa_handler != SIG_IGN)
sigaction (SIGTERM, &newact, NULL);
#else
if (signal (SIGHUP, SIG_IGN) != SIG_IGN)
signal (SIGHUP, interrupt_handler);
if (signal (SIGINT, SIG_IGN) != SIG_IGN)
signal (SIGINT, interrupt_handler);
if (signal (SIGQUIT, SIG_IGN) != SIG_IGN)
signal (SIGQUIT, interrupt_handler);
if (signal (SIGTERM, SIG_IGN) != SIG_IGN)
signal (SIGTERM, interrupt_handler);
#endif
while ((optc = getopt_long (argc, argv, "f:b:kn:sqz", longopts, (int *) 0))
!= EOF)
switch (optc)
{
case 0:
break;
case 'f':
prefix = optarg;
break;
case 'b':
suffix = optarg;
break;
case 'k':
remove_files = FALSE;
break;
case 'n':
if (!string_to_number (&digits, optarg))
error (1, 0, _("%s: invalid number"), optarg);
break;
case 's':
case 'q':
suppress_count = TRUE;
break;
case 'z':
elide_empty_files = TRUE;
break;
default:
usage (1);
}
if (show_version)
{
printf ("csplit - %s\n", version_string);
exit (0);
}
if (show_help)
usage (0);
if (argc - optind < 2)
{
error (0, 0, _("too few arguments"));
usage (1);
}
if (suffix)
filename_space = (char *) xmalloc (strlen (prefix) + max_out (suffix) + 2);
else
filename_space = (char *) xmalloc (strlen (prefix) + digits + 2);
set_input_file (argv[optind++]);
parse_patterns (argc, optind, argv);
split_file ();
if (close (input_desc) < 0)
{
error (0, errno, _("read error"));
cleanup_fatal ();
}
exit (0);
}
static void
usage (int status)
{
if (status != 0)
fprintf (stderr, _("Try `%s --help' for more information.\n"),
program_name);
else
{
printf (_("\
Usage: %s [OPTION]... FILE PATTERN...\n\
"),
program_name);
printf (_("\
Output pieces of FILE separated by PATTERN(s) to files `xx01', `xx02', ...,\n\
and output byte counts of each piece to standard output.\n\
\n\
-b, --suffix-format=FORMAT use sprintf FORMAT instead of %%d\n\
-f, --prefix=PREFIX use PREFIX instead of `xx'\n\
-k, --keep-files do not remove output files on errors\n\
-n, --digits=DIGITS use specified number of digits instead of 2\n\
-s, --quiet, --silent do not print counts of output file sizes\n\
-z, --elide-empty-files remove empty output files\n\
--help display this help and exit\n\
--version output version information and exit\n\
\n\
Read standard input if FILE is -. Each PATTERN may be:\n\
\n\
INTEGER copy up to but not including specified line number\n\
/REGEXP/[OFFSET] copy up to but not including a matching line\n\
%%REGEXP%%[OFFSET] skip to, but not including a matching line\n\
{INTEGER} repeat the previous pattern specified number of times\n\
{*} repeat the previous pattern as many times as possible\n\
\n\
A line OFFSET is a required `+' or `-' followed by a positive integer.\n\
"));
}
exit (status);
}
|