1994-05-27 08:33:43 -04:00
|
|
|
.\" Copyright (c) 1990, 1991, 1993, 1994
|
|
|
|
|
.\" The Regents of the University of California. All rights reserved.
|
|
|
|
|
.\"
|
|
|
|
|
.\" Redistribution and use in source and binary forms, with or without
|
|
|
|
|
.\" modification, are permitted provided that the following conditions
|
|
|
|
|
.\" are met:
|
|
|
|
|
.\" 1. Redistributions of source code must retain the above copyright
|
|
|
|
|
.\" notice, this list of conditions and the following disclaimer.
|
|
|
|
|
.\" 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
|
.\" notice, this list of conditions and the following disclaimer in the
|
|
|
|
|
.\" documentation and/or other materials provided with the distribution.
|
2017-02-28 18:42:47 -05:00
|
|
|
.\" 3. Neither the name of the University nor the names of its contributors
|
1994-05-27 08:33:43 -04:00
|
|
|
.\" may be used to endorse or promote products derived from this software
|
|
|
|
|
.\" without specific prior written permission.
|
|
|
|
|
.\"
|
|
|
|
|
.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
|
.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
|
.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
|
.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
|
.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
|
.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
|
.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
|
.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
|
.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
|
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
|
.\" SUCH DAMAGE.
|
|
|
|
|
.\"
|
|
|
|
|
.\" @(#)split.1 8.3 (Berkeley) 4/16/94
|
|
|
|
|
.\"
|
split(1): auto-extend suffix length if required
If the input cannot be split into the number of files resulting from the
default suffix length, automatically extend the suffix length rather
than bailing out with 'too many files'.
Suffixes are extended such that the resulting files continue to sort
lexically and "cat *" would reproduce the input. For example, splitting
a 1M lines file into (default) 1000 lines per file would yield files
named 'xaa', 'xab', ..., 'xyy', 'xyz', 'xzaaa', 'xzaab', ..., 'xzanl'.
If '-a' is specified, the suffix length is not auto-extended.
This behavior matches GNU sort(1) since around version 8.16.
Reviewed by: christos
Approved by: kevans
Different Revision: https://reviews.freebsd.org/D38279
2023-05-30 08:55:38 -04:00
|
|
|
.Dd May 26, 2023
|
1994-05-27 08:33:43 -04:00
|
|
|
.Dt SPLIT 1
|
|
|
|
|
.Os
|
|
|
|
|
.Sh NAME
|
|
|
|
|
.Nm split
|
|
|
|
|
.Nd split a file into pieces
|
|
|
|
|
.Sh SYNOPSIS
|
2000-11-20 14:21:22 -05:00
|
|
|
.Nm
|
2023-05-30 09:13:16 -04:00
|
|
|
.Op Fl cd
|
1994-05-27 08:33:43 -04:00
|
|
|
.Op Fl l Ar line_count
|
2006-08-08 17:25:22 -04:00
|
|
|
.Op Fl a Ar suffix_length
|
|
|
|
|
.Op Ar file Op Ar prefix
|
|
|
|
|
.Nm
|
2023-05-30 09:13:16 -04:00
|
|
|
.Op Fl cd
|
2006-08-08 17:25:22 -04:00
|
|
|
.Fl b Ar byte_count Ns
|
|
|
|
|
.Oo
|
2006-09-29 11:20:48 -04:00
|
|
|
.Sm off
|
|
|
|
|
.Cm K | k | M | m | G | g
|
|
|
|
|
.Sm on
|
2006-08-08 17:25:22 -04:00
|
|
|
.Oc
|
|
|
|
|
.Op Fl a Ar suffix_length
|
|
|
|
|
.Op Ar file Op Ar prefix
|
|
|
|
|
.Nm
|
2023-05-30 09:13:16 -04:00
|
|
|
.Op Fl cd
|
2008-03-16 11:15:32 -04:00
|
|
|
.Fl n Ar chunk_count
|
|
|
|
|
.Op Fl a Ar suffix_length
|
|
|
|
|
.Op Ar file Op Ar prefix
|
|
|
|
|
.Nm
|
2023-05-30 09:13:16 -04:00
|
|
|
.Op Fl cd
|
2006-08-08 17:25:22 -04:00
|
|
|
.Fl p Ar pattern
|
|
|
|
|
.Op Fl a Ar suffix_length
|
|
|
|
|
.Op Ar file Op Ar prefix
|
1994-05-27 08:33:43 -04:00
|
|
|
.Sh DESCRIPTION
|
|
|
|
|
The
|
2000-11-20 14:21:22 -05:00
|
|
|
.Nm
|
1994-05-27 08:33:43 -04:00
|
|
|
utility reads the given
|
|
|
|
|
.Ar file
|
2006-08-08 17:25:22 -04:00
|
|
|
and breaks it up into files of 1000 lines each
|
|
|
|
|
(if no options are specified), leaving the
|
|
|
|
|
.Ar file
|
|
|
|
|
unchanged.
|
2002-05-27 01:27:10 -04:00
|
|
|
If
|
|
|
|
|
.Ar file
|
|
|
|
|
is a single dash
|
2002-05-30 02:07:29 -04:00
|
|
|
.Pq Sq Fl
|
2002-05-27 01:27:10 -04:00
|
|
|
or absent,
|
|
|
|
|
.Nm
|
|
|
|
|
reads from the standard input.
|
1994-05-27 08:33:43 -04:00
|
|
|
.Pp
|
|
|
|
|
The options are as follows:
|
2006-08-08 17:25:22 -04:00
|
|
|
.Bl -tag -width indent
|
2005-08-30 08:48:28 -04:00
|
|
|
.It Fl a Ar suffix_length
|
2002-02-01 01:55:18 -05:00
|
|
|
Use
|
|
|
|
|
.Ar suffix_length
|
|
|
|
|
letters to form the suffix of the file name.
|
2006-09-29 11:20:48 -04:00
|
|
|
.It Fl b Ar byte_count Ns Oo
|
|
|
|
|
.Sm off
|
|
|
|
|
.Cm K | k | M | m | G | g
|
|
|
|
|
.Sm on
|
|
|
|
|
.Oc
|
2009-01-24 00:32:11 -05:00
|
|
|
Create split files
|
1994-05-27 08:33:43 -04:00
|
|
|
.Ar byte_count
|
|
|
|
|
bytes in length.
|
|
|
|
|
If
|
2005-11-18 05:36:29 -05:00
|
|
|
.Cm k
|
2006-08-10 06:41:47 -04:00
|
|
|
or
|
|
|
|
|
.Cm K
|
1994-05-27 08:33:43 -04:00
|
|
|
is appended to the number, the file is split into
|
|
|
|
|
.Ar byte_count
|
|
|
|
|
kilobyte pieces.
|
|
|
|
|
If
|
2005-11-18 05:36:29 -05:00
|
|
|
.Cm m
|
2006-08-10 06:41:47 -04:00
|
|
|
or
|
|
|
|
|
.Cm M
|
1994-05-27 08:33:43 -04:00
|
|
|
is appended to the number, the file is split into
|
|
|
|
|
.Ar byte_count
|
|
|
|
|
megabyte pieces.
|
2006-08-10 06:41:47 -04:00
|
|
|
If
|
|
|
|
|
.Cm g
|
|
|
|
|
or
|
|
|
|
|
.Cm G
|
|
|
|
|
is appended to the number, the file is split into
|
|
|
|
|
.Ar byte_count
|
|
|
|
|
gigabyte pieces.
|
2023-05-30 09:13:16 -04:00
|
|
|
.It Fl c
|
|
|
|
|
Continue creating files and do not overwrite existing
|
|
|
|
|
output files.
|
2013-05-10 00:23:03 -04:00
|
|
|
.It Fl d
|
|
|
|
|
Use a numeric suffix instead of a alphabetic suffix.
|
2005-08-30 08:48:28 -04:00
|
|
|
.It Fl l Ar line_count
|
2009-01-24 00:32:11 -05:00
|
|
|
Create split files
|
2006-08-08 17:25:22 -04:00
|
|
|
.Ar line_count
|
1994-05-27 08:33:43 -04:00
|
|
|
lines in length.
|
2008-03-16 11:15:32 -04:00
|
|
|
.It Fl n Ar chunk_count
|
2010-09-02 17:29:50 -04:00
|
|
|
Split file into
|
2008-03-16 11:15:32 -04:00
|
|
|
.Ar chunk_count
|
|
|
|
|
smaller files.
|
2020-06-18 11:14:10 -04:00
|
|
|
The first n - 1 files will be of size (size of
|
|
|
|
|
.Ar file
|
|
|
|
|
/
|
|
|
|
|
.Ar chunk_count
|
|
|
|
|
)
|
|
|
|
|
and the last file will contain the remaining bytes.
|
1999-02-01 16:16:45 -05:00
|
|
|
.It Fl p Ar pattern
|
|
|
|
|
The file is split whenever an input line matches
|
|
|
|
|
.Ar pattern ,
|
|
|
|
|
which is interpreted as an extended regular expression.
|
|
|
|
|
The matching line will be the first line of the next output file.
|
|
|
|
|
This option is incompatible with the
|
|
|
|
|
.Fl b
|
|
|
|
|
and
|
|
|
|
|
.Fl l
|
|
|
|
|
options.
|
1994-05-27 08:33:43 -04:00
|
|
|
.El
|
|
|
|
|
.Pp
|
|
|
|
|
If additional arguments are specified, the first is used as the name
|
|
|
|
|
of the input file which is to be split.
|
|
|
|
|
If a second additional argument is specified, it is used as a prefix
|
|
|
|
|
for the names of the files into which the file is split.
|
|
|
|
|
In this case, each file into which the file is split is named by the
|
2002-02-01 01:55:18 -05:00
|
|
|
prefix followed by a lexically ordered suffix using
|
|
|
|
|
.Ar suffix_length
|
|
|
|
|
characters in the range
|
2006-09-29 11:20:48 -04:00
|
|
|
.Dq Li a Ns - Ns Li z .
|
2002-02-01 01:55:18 -05:00
|
|
|
If
|
|
|
|
|
.Fl a
|
split(1): auto-extend suffix length if required
If the input cannot be split into the number of files resulting from the
default suffix length, automatically extend the suffix length rather
than bailing out with 'too many files'.
Suffixes are extended such that the resulting files continue to sort
lexically and "cat *" would reproduce the input. For example, splitting
a 1M lines file into (default) 1000 lines per file would yield files
named 'xaa', 'xab', ..., 'xyy', 'xyz', 'xzaaa', 'xzaab', ..., 'xzanl'.
If '-a' is specified, the suffix length is not auto-extended.
This behavior matches GNU sort(1) since around version 8.16.
Reviewed by: christos
Approved by: kevans
Different Revision: https://reviews.freebsd.org/D38279
2023-05-30 08:55:38 -04:00
|
|
|
is not specified, two letters are used as the initial suffix.
|
|
|
|
|
If the output does not fit into the resulting number of files and the
|
|
|
|
|
.Fl d
|
|
|
|
|
flag is not specified, then the suffix length is automatically extended as
|
|
|
|
|
needed such that all output files continue to sort in lexical order.
|
1994-05-27 08:33:43 -04:00
|
|
|
.Pp
|
|
|
|
|
If the
|
2006-08-08 17:25:22 -04:00
|
|
|
.Ar prefix
|
1994-05-27 08:33:43 -04:00
|
|
|
argument is not specified, the file is split into lexically ordered
|
2005-08-21 02:35:02 -04:00
|
|
|
files named with the prefix
|
|
|
|
|
.Dq Li x
|
2002-02-01 01:55:18 -05:00
|
|
|
and with suffixes as above.
|
2023-05-30 09:13:16 -04:00
|
|
|
.Pp
|
|
|
|
|
By default,
|
|
|
|
|
.Nm
|
|
|
|
|
will overwrite any existing output files.
|
|
|
|
|
If the
|
|
|
|
|
.Fl c
|
|
|
|
|
flag is specified,
|
|
|
|
|
.Nm
|
|
|
|
|
will instead create files with names that do not already exist.
|
2004-07-11 10:47:32 -04:00
|
|
|
.Sh ENVIRONMENT
|
|
|
|
|
The
|
|
|
|
|
.Ev LANG , LC_ALL , LC_CTYPE
|
|
|
|
|
and
|
|
|
|
|
.Ev LC_COLLATE
|
|
|
|
|
environment variables affect the execution of
|
|
|
|
|
.Nm
|
|
|
|
|
as described in
|
|
|
|
|
.Xr environ 7 .
|
2005-01-17 02:44:44 -05:00
|
|
|
.Sh EXIT STATUS
|
2004-07-11 10:47:32 -04:00
|
|
|
.Ex -std
|
2020-06-18 11:14:10 -04:00
|
|
|
.Sh EXAMPLES
|
|
|
|
|
Split input into as many files as needed, so that each file contains at most 2
|
|
|
|
|
lines:
|
|
|
|
|
.Bd -literal -offset indent
|
|
|
|
|
$ echo -e "first line\\nsecond line\\nthird line\\nforth line" | split -l2
|
|
|
|
|
.Ed
|
|
|
|
|
.Pp
|
|
|
|
|
Split input in chunks of 10 bytes using numeric prefixes for file names.
|
|
|
|
|
This generates two files of 10 bytes (x00 and x01) and a third file (x02) with the
|
|
|
|
|
remaining 2 bytes:
|
|
|
|
|
.Bd -literal -offset indent
|
|
|
|
|
$ echo -e "This is 22 bytes long" | split -d -b10
|
|
|
|
|
.Ed
|
|
|
|
|
.Pp
|
|
|
|
|
Split input generating 6 files:
|
|
|
|
|
.Bd -literal -offset indent
|
2023-04-14 07:50:13 -04:00
|
|
|
$ echo -e "This is 22 bytes long" | split -n 6
|
2020-06-18 11:14:10 -04:00
|
|
|
.Ed
|
|
|
|
|
.Pp
|
|
|
|
|
Split input creating a new file every time a line matches the regular expression
|
|
|
|
|
for a
|
|
|
|
|
.Dq t
|
|
|
|
|
followed by either
|
|
|
|
|
.Dq a
|
|
|
|
|
or
|
|
|
|
|
.Dq u
|
|
|
|
|
thus creating two files:
|
|
|
|
|
.Bd -literal -offset indent
|
|
|
|
|
$ echo -e "stack\\nstock\\nstuck\\nanother line" | split -p 't[au]'
|
|
|
|
|
.Ed
|
1999-02-01 16:16:45 -05:00
|
|
|
.Sh SEE ALSO
|
2002-05-27 02:08:14 -04:00
|
|
|
.Xr csplit 1 ,
|
2000-11-15 12:27:54 -05:00
|
|
|
.Xr re_format 7
|
2002-05-27 02:08:14 -04:00
|
|
|
.Sh STANDARDS
|
|
|
|
|
The
|
|
|
|
|
.Nm
|
|
|
|
|
utility conforms to
|
|
|
|
|
.St -p1003.1-2001 .
|
1994-05-27 08:33:43 -04:00
|
|
|
.Sh HISTORY
|
|
|
|
|
A
|
2000-11-20 14:21:22 -05:00
|
|
|
.Nm
|
1994-05-27 08:33:43 -04:00
|
|
|
command appeared in
|
2002-06-03 10:41:32 -04:00
|
|
|
.At v3 .
|
2022-08-22 22:05:58 -04:00
|
|
|
.Pp
|
|
|
|
|
Before
|
|
|
|
|
.Fx 14 ,
|
2022-10-25 17:51:21 -04:00
|
|
|
pattern and line matching only operated on lines shorter than 65,536 bytes.
|