1 .\" Copyright (c) 1990, 1991, 1993, 1994
2 .\" The Regents of the University of California. All rights reserved.
4 .\" Redistribution and use in source and binary forms, with or without
5 .\" modification, are permitted provided that the following conditions
7 .\" 1. Redistributions of source code must retain the above copyright
8 .\" notice, this list of conditions and the following disclaimer.
9 .\" 2. Redistributions in binary form must reproduce the above copyright
10 .\" notice, this list of conditions and the following disclaimer in the
11 .\" documentation and/or other materials provided with the distribution.
12 .\" 3. Neither the name of the University nor the names of its contributors
13 .\" may be used to endorse or promote products derived from this software
14 .\" without specific prior written permission.
16 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
17 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
20 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 .\" @(#)split.1 8.3 (Berkeley) 4/16/94
36 .Nd split a file into pieces
40 .Op Fl l Ar line_count
41 .Op Fl a Ar suffix_length
42 .Op Ar file Op Ar prefix
45 .Fl b Ar byte_count Ns
48 .Cm K | k | M | m | G | g
51 .Op Fl a Ar suffix_length
52 .Op Ar file Op Ar prefix
56 .Op Fl a Ar suffix_length
57 .Op Ar file Op Ar prefix
61 .Op Fl a Ar suffix_length
62 .Op Ar file Op Ar prefix
66 utility reads the given
68 and breaks it up into files of 1000 lines each
69 (if no options are specified), leaving the
78 reads from the standard input.
80 The options are as follows:
81 .Bl -tag -width indent
82 .It Fl a Ar suffix_length
85 letters to form the suffix of the file name.
86 .It Fl b Ar byte_count Ns Oo
88 .Cm K | k | M | m | G | g
98 is appended to the number, the file is split into
105 is appended to the number, the file is split into
112 is appended to the number, the file is split into
116 Continue creating files and do not overwrite existing
119 Use a numeric suffix instead of a alphabetic suffix.
120 .It Fl l Ar line_count
124 .It Fl n Ar chunk_count
128 The first n - 1 files will be of size (size of
133 and the last file will contain the remaining bytes.
135 The file is split whenever an input line matches
137 which is interpreted as an extended regular expression.
138 The matching line will be the first line of the next output file.
139 This option is incompatible with the
146 If additional arguments are specified, the first is used as the name
147 of the input file which is to be split.
148 If a second additional argument is specified, it is used as a prefix
149 for the names of the files into which the file is split.
150 In this case, each file into which the file is split is named by the
151 prefix followed by a lexically ordered suffix using
153 characters in the range
154 .Dq Li a Ns - Ns Li z .
157 is not specified, two letters are used as the initial suffix.
158 If the output does not fit into the resulting number of files and the
160 flag is not specified, then the suffix length is automatically extended as
161 needed such that all output files continue to sort in lexical order.
165 argument is not specified, the file is split into lexically ordered
166 files named with the prefix
168 and with suffixes as above.
172 will overwrite any existing output files.
177 will instead create files with names that do not already exist.
180 .Ev LANG , LC_ALL , LC_CTYPE
183 environment variables affect the execution of
190 Split input into as many files as needed, so that each file contains at most 2
192 .Bd -literal -offset indent
193 $ echo -e "first line\\nsecond line\\nthird line\\nforth line" | split -l2
196 Split input in chunks of 10 bytes using numeric prefixes for file names.
197 This generates two files of 10 bytes (x00 and x01) and a third file (x02) with the
199 .Bd -literal -offset indent
200 $ echo -e "This is 22 bytes long" | split -d -b10
203 Split input generating 6 files:
204 .Bd -literal -offset indent
205 $ echo -e "This is 22 bytes long" | split -n 6
208 Split input creating a new file every time a line matches the regular expression
215 thus creating two files:
216 .Bd -literal -offset indent
217 $ echo -e "stack\\nstock\\nstuck\\nanother line" | split -p 't[au]'
235 pattern and line matching only operated on lines shorter than 65,536 bytes.