1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
.\" $OpenBSD: strings.1,v 1.14 2009/08/16 09:41:08 sobrado Exp $
.\" $NetBSD: strings.1,v 1.4 1994/12/10 11:54:28 jtc Exp $
.\"
.\" Copyright (c) 1980, 1990, 1993
.\" 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.
.\" 3. Neither the name of the University nor the names of its contributors
.\" 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.
.\"
.\" @(#)strings.1 8.1 (Berkeley) 6/6/93
.\"
.Dd $Mdocdate: August 16 2009 $
.Dt STRINGS 1
.Os
.Sh NAME
.Nm strings
.Nd find printable strings in a file
.Sh SYNOPSIS
.Nm strings
.Op Fl afo
.Op Fl m Ar number
.Op Fl n Ar number
.Op Fl t Ar radix
.Op Ar
.Sh DESCRIPTION
.Nm
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.
.Pp
The options are as follows:
.Bl -tag -width Ds
.It Fl a
By default,
.Nm
only searches the text and data segments of object files.
The
.Fl a
option causes
.Nm
to search the entire object file.
.It Fl f
Each string is preceded by the name of the file
in which it was found.
.It Fl m Ar number
Specifies the maximum number of characters in a sequence to be
.Ar number ,
instead of unlimited.
.It Fl n Ar number
Specifies the minimum number of characters in a sequence to be
.Ar number ,
instead of four.
.It Fl o
Each string is preceded by its octal offset in the file.
.It Fl t Ar radix
Each string is preceded by its offset in the file.
The first character of
.Ar radix
determines the radix of the offset:
.Sq o
for octal;
.Sq d
for decimal; or
.Sq x
for hexadecimal.
.El
.Pp
.Nm
is useful for identifying random binaries, among other things.
.Sh SEE ALSO
.Xr hexdump 1 ,
.Xr od 1
.Sh STANDARDS
The
.Nm
utility is compliant with the
.St -p1003.1-2008
specification.
.Pp
The flags
.Op Fl fmo
are extensions to that specification.
.Pp
Historic implementations of
.Nm
only search the initialized data portion of the object file.
This was reasonable as strings were normally stored there.
Given new compiler technology which installs strings in the
text portion of the object file, the default behavior was
changed.
.Sh HISTORY
The
.Nm
utility appeared in
.Bx 3.0 .
.Sh BUGS
The algorithm for identifying strings is extremely primitive.
In particular, machine code instructions on certain architectures
can resemble sequences of ASCII bytes, which
will fool the algorithm.
|
