|
|
1.1 root 1: .\" Copyright (c) 1980 Regents of the University of California.
2: .\" All rights reserved. The Berkeley software License Agreement
3: .\" specifies the terms and conditions for redistribution.
4: .\"
5: .\" @(#)strings.1 6.4 (Berkeley) 12/3/86
6: .\"
7: .TH STRINGS 1 "December 3, 1986"
8: .UC
9: .SH NAME
10: strings \- find the printable strings in a file
11: .SH SYNOPSIS
12: .B strings
13: [
14: .B \-ao
15: ] [
16: \fB\-\fInumber\fR
17: ] [ file ... ]
18: .SH DESCRIPTION
19: \fIStrings\fP looks for ascii strings in each of the specified files,
20: or from the standard input. A string is any sequence of 4 or more printing
21: characters. Unless the \fB-a\fP flag is given, \fIstrings\fP only looks
22: in the initialized data space of object files. If the \fB-o\fP flag is
23: given, then each string is preceded by its decimal offset in the file.
24: If the \fB-\fInumber\fR flag is given, then \fInumber\fP is used as the
25: minimum string length rather than 4.
26: .PP
27: \fIStrings\fP is useful for identifying random object files and
28: many other things.
29: .SH "SEE ALSO"
30: od(1)
31: .SH BUGS
32: The algorithm for identifying strings is extremely primitive.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.