xref: /original-bsd/usr.bin/strings/strings.1 (revision 208c3823)
Copyright (c) 1980 The Regents of the University of California.
All rights reserved.

Redistribution and use in source and binary forms are permitted
provided that the above copyright notice and this paragraph are
duplicated in all such forms and that any documentation,
advertising materials, and other materials related to such
distribution and use acknowledge that the software was developed
by the University of California, Berkeley. The name of the
University may not be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.

@(#)strings.1 6.6 (Berkeley) 04/04/90

STRINGS 1 ""
C
NAME
strings - find the printable strings in a file
SYNOPSIS
strings [ -ao ] [ -n number ] [ file ... ]
DESCRIPTION
String displays the sequences of printable characters in each of the specified files, or in the standard input, by default. By default, a sequence must be at least four characters in length before being displayed.

The options are as follows:

-a By default, strings only searches the initialized data space of object files. The -a option causes strings to search the entire object file.

-n Specifies the minimum number of characters in a sequence to be number , instead of four.

-o The -o option causes each string to be preceded by its decimal offset in the file.

Strings is useful for identifying random binaries, among other things.

"SEE ALSO"
hexdump(1)
BUGS
The algorithm for identifying strings is extremely primitive.