1.\" Copyright (c) 1990, 1991, 1993, 1994 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" Redistribution and use in source and binary forms, with or without 5.\" modification, are permitted provided that the following conditions 6.\" are met: 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. 19.\" 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 30.\" SUCH DAMAGE. 31.\" 32.\" @(#)split.1 8.3 (Berkeley) 4/16/94 33.\" $FreeBSD$ 34.\" 35.Dd April 16, 1994 36.Dt SPLIT 1 37.Os 38.Sh NAME 39.Nm split 40.Nd split a file into pieces 41.Sh SYNOPSIS 42.Nm 43.Op Fl a Ar suffix_length 44.Op Fl b Ar byte_count[k|m] 45.Op Fl l Ar line_count 46.Op Fl p Ar pattern 47.Op Ar file Op Ar name 48.Sh DESCRIPTION 49The 50.Nm 51utility reads the given 52.Ar file 53(or standard input if no file is specified) 54and breaks it up into files of 1000 lines each. 55.Pp 56The options are as follows: 57.Bl -tag -width Ds 58.It Fl a 59Use 60.Ar suffix_length 61letters to form the suffix of the file name. 62.It Fl b 63Create smaller files 64.Ar byte_count 65bytes in length. 66If 67.Dq Li k 68is appended to the number, the file is split into 69.Ar byte_count 70kilobyte pieces. 71If 72.Dq Li m 73is appended to the number, the file is split into 74.Ar byte_count 75megabyte pieces. 76.It Fl l 77Create smaller files 78.Ar n 79lines in length. 80.It Fl p Ar pattern 81The file is split whenever an input line matches 82.Ar pattern , 83which is interpreted as an extended regular expression. 84The matching line will be the first line of the next output file. 85This option is incompatible with the 86.Fl b 87and 88.Fl l 89options. 90.El 91.Pp 92If additional arguments are specified, the first is used as the name 93of the input file which is to be split. 94If a second additional argument is specified, it is used as a prefix 95for the names of the files into which the file is split. 96In this case, each file into which the file is split is named by the 97prefix followed by a lexically ordered suffix using 98.Ar suffix_length 99characters in the range 100.Dq Li a-z . 101If 102.Fl a 103is not specified, two letters are used as the suffix. 104.Pp 105If the 106.Ar name 107argument is not specified, the file is split into lexically ordered 108files named with prefixes in the range of 109.Dq Li x-z 110and with suffixes as above. 111.Sh BUGS 112For historical reasons, if you specify 113.Ar name , 114.Nm 115can only create 676 separate 116files. 117The default naming convention allows 2028 separate files. 118The 119.Fl a 120option can be used to work around this limitation. 121.Pp 122The maximum line length for matching patterns is 65536. 123.Sh SEE ALSO 124.Xr re_format 7 125.Sh HISTORY 126A 127.Nm 128command appeared in 129.At v6 . 130