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. All advertising materials mentioning features or use of this software
13 .\" must display the following acknowledgement:
14 .\" This product includes software developed by the University of
15 .\" California, Berkeley and its contributors.
16 .\" 4. Neither the name of the University nor the names of its contributors
17 .\" may be used to endorse or promote products derived from this software
18 .\" without specific prior written permission.
20 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 .\" @(#)split.1 8.3 (Berkeley) 4/16/94
40 .Nd split a file into pieces
43 .Op Fl b Ar byte_count[k|m]
44 .Op Fl l Ar line_count
46 .Op Ar file Op Ar name
50 utility reads the given
52 (or standard input if no file is specified)
53 and breaks it up into files of 1000 lines each.
55 The options are as follows:
63 is appended to the number, the file is split into
68 is appended to the number, the file is split into
76 The file is split whenever an input line matches
78 which is interpreted as an extended regular expression.
79 The matching line will be the first line of the next output file.
80 This option is incompatible with the
87 If additional arguments are specified, the first is used as the name
88 of the input file which is to be split.
89 If a second additional argument is specified, it is used as a prefix
90 for the names of the files into which the file is split.
91 In this case, each file into which the file is split is named by the
92 prefix followed by a lexically ordered suffix in the range of
97 argument is not specified, the file is split into lexically ordered
98 files named in the range of
101 For historical reasons, if you specify
104 can only create 676 separate
106 The default naming convention allows 2028 separate files.
108 The maximum line length for matching patterns is 65536.