projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| daacd5f0 | 1 | .\" Copyright (c) 1980, 1990 The Regents of the University of California. |
| e316c02c | 2 | .\" All rights reserved. |
| 3a1a282a | 3 | .\" |
| daacd5f0 | 4 | .\" %sccs.include.redist.man% |
| e316c02c | 5 | .\" |
| daacd5f0 | 6 | .\" @(#)strings.1 6.7 (Berkeley) %G% |
| 3a1a282a | 7 | .\" |
| daacd5f0 | 8 | .TH STRINGS 1 "%Q" |
| 3a1a282a KM |
9 | .UC |
| 10 | .SH NAME | |
| e8d9c970 | 11 | strings \- find the printable strings in a file |
| 3a1a282a | 12 | .SH SYNOPSIS |
| 61539330 KB |
13 | .ft B |
| 14 | strings [ \-ao ] [ \-n number ] [ file ... ] | |
| 15 | .ft R | |
| 3a1a282a | 16 | .SH DESCRIPTION |
| 61539330 KB |
17 | .I String |
| 18 | displays the sequences of printable characters in each of the specified | |
| 19 | files, or in the standard input, by default. | |
| 20 | By default, a sequence must be at least four characters in length | |
| 21 | before being displayed. | |
| 3a1a282a | 22 | .PP |
| 61539330 KB |
23 | The options are as follows: |
| 24 | .TP | |
| 25 | \-a | |
| 26 | By default, | |
| 27 | .I strings | |
| 28 | only searches the initialized data space of object files. | |
| 29 | The | |
| 30 | .I \-a | |
| 31 | option causes | |
| 32 | .I strings | |
| 33 | to search the entire object file. | |
| 34 | .TP | |
| 35 | \-n | |
| 36 | Specifies the minimum number of characters in a sequence to be | |
| 37 | .IR number , | |
| 38 | instead of four. | |
| 39 | .TP | |
| 40 | \-o | |
| 41 | The | |
| 42 | .I \-o | |
| 43 | option causes each string to be preceded by its decimal offset in the | |
| 44 | file. | |
| 45 | .PP | |
| 46 | .I Strings | |
| 47 | is useful for identifying random binaries, among other things. | |
| 3a1a282a | 48 | .SH "SEE ALSO" |
| 61539330 | 49 | hexdump(1) |
| 3a1a282a | 50 | .SH BUGS |
| 570d12e7 | 51 | The algorithm for identifying strings is extremely primitive. |