GAWK: Effective AWK Programming, Edition 4
GAWK: Effective AWK Programming, Edition 4
Arnold D. Robbins
Published by:
Free Software Foundation
51 Franklin Street, Fifth Floor
Boston, MA 02110-1301 USA
Phone: +1-617-542-5942
Fax: +1-617-542-2652
Email: [email protected]
URL: http://www.gnu.org/
ISBN 1-882114-28-0
c 1989, 1991, 1992, 1993, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
Copyright
2005, 2007, 2009, 2010, 2011 Free Software Foundation, Inc.
This is Edition 4 of GAWK: Effective AWK Programming: A Users Guide for GNU Awk,
for the 4.0.0 (or later) version of the GNU implementation of AWK.
Permission is granted to copy, distribute and/or modify this document under the terms of
the GNU Free Documentation License, Version 1.3 or any later version published by the
Free Software Foundation; with the Invariant Sections being GNU General Public License,
the Front-Cover texts being (a) (see below), and with the Back-Cover Texts being (b) (see
below). A copy of the license is included in the section entitled GNU Free Documentation
License.
a. A GNU Manual
b. You have the freedom to copy and modify this GNU manual. Buying copies from the
FSF supports it in developing GNU and promoting software freedom.
Short Contents
Foreword . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1 Getting Started with awk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
2 Running awk and gawk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
3 Regular Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
4 Reading Input Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
5 Printing Output . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
6 Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89
7 Patterns, Actions, and Variables . . . . . . . . . . . . . . . . . . . . . . . 111
8 Arrays in awk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135
9 Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147
10 Internationalization with gawk . . . . . . . . . . . . . . . . . . . . . . . . . 185
11 Advanced Features of gawk . . . . . . . . . . . . . . . . . . . . . . . . . . . 195
12 A Library of awk Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . 211
13 Practical awk Programs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241
14 dgawk: The awk Debugger . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
A The Evolution of the awk Language . . . . . . . . . . . . . . . . . . . . . 301
B Installing gawk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 309
C Implementation Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 325
D Basic Programming Concepts . . . . . . . . . . . . . . . . . . . . . . . . . 341
Glossary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 347
GNU General Public License . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 357
GNU Free Documentation License . . . . . . . . . . . . . . . . . . . . . . . . . 369
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 377
iii
Table of Contents
Foreword . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
History of awk and gawk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
A Rose by Any Other Name . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Using This Book . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Typographical Conventions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
The GNU Project and This Book . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
How to Contribute . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3
4
5
6
7
8
9
11
11
12
12
13
14
15
16
16
17
19
20
21
22
22
Invoking awk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Command-Line Options . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Other Command-Line Arguments . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Naming Standard Input . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
The Environment Variables gawk Uses . . . . . . . . . . . . . . . . . . . . . . . . .
2.5.1 The AWKPATH Environment Variable . . . . . . . . . . . . . . . . . . . . . .
2.5.2 Other Environment Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2.6 gawks Exit Status . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2.7 Including Other Files Into Your Program . . . . . . . . . . . . . . . . . . . . . .
2.8 Obsolete Options and/or Features . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2.9 Undocumented Options and Features . . . . . . . . . . . . . . . . . . . . . . . . . .
25
25
30
31
32
32
32
33
34
35
35
Regular Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
3.1 How to Use Regular Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3.2 Escape Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3.3 Regular Expression Operators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3.4 Using Bracket Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3.5 gawk-Specific Regexp Operators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3.6 Case Sensitivity in Matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3.7 How Much Text Matches? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3.8 Using Dynamic Regexps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
37
38
40
42
44
45
46
47
49
52
53
54
56
57
57
58
59
60
61
63
64
67
67
68
69
69
70
71
71
71
71
72
72
Printing Output . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
5.1 The print Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.2 print Statement Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.3 Output Separators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.4 Controlling Numeric Output with print . . . . . . . . . . . . . . . . . . . . . . .
5.5 Using printf Statements for Fancier Printing . . . . . . . . . . . . . . . . .
5.5.1 Introduction to the printf Statement . . . . . . . . . . . . . . . . . . . .
5.5.2 Format-Control Letters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.5.3 Modifiers for printf Formats . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.5.4 Examples Using printf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
73
73
75
75
76
76
76
78
80
v
5.6
5.7
81
84
84
85
85
86
Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89
6.1
Pattern Elements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
7.1.1 Regular Expressions as Patterns . . . . . . . . . . . . . . . . . . . . . . . . .
7.1.2 Expressions as Patterns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
7.1.3 Specifying Record Ranges with Patterns . . . . . . . . . . . . . . . . .
7.1.4 The BEGIN and END Special Patterns . . . . . . . . . . . . . . . . . . . . .
7.1.4.1 Startup and Cleanup Actions . . . . . . . . . . . . . . . . . . . . . . .
7.1.4.2 Input/Output from BEGIN and END Rules . . . . . . . . . . .
7.1.5 The BEGINFILE and ENDFILE Special Patterns . . . . . . . . . . .
7.1.6 The Empty Pattern . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
7.2 Using Shell Variables in Programs . . . . . . . . . . . . . . . . . . . . . . . . . . . .
7.3 Actions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
7.4 Control Statements in Actions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
111
111
111
113
114
114
115
115
116
116
117
118
118
119
120
120
121
122
123
124
125
125
126
127
129
133
135
135
136
137
137
138
139
140
141
142
143
144
Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147
9.1
Built-in Functions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.1.1 Calling Built-in Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.1.2 Numeric Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.1.3 String-Manipulation Functions . . . . . . . . . . . . . . . . . . . . . . . . . .
9.1.3.1 More About \ and & with sub(), gsub(), and
gensub() . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.1.4 Input/Output Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.1.5 Time Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.1.6 Bit-Manipulation Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.1.7 Getting Type Information . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.1.8 String-Translation Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.2 User-Defined Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.2.1 Function Definition Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.2.2 Function Definition Examples . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.2.3 Calling User-Defined Functions . . . . . . . . . . . . . . . . . . . . . . . . . .
9.2.3.1 Writing A Function Call . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.2.3.2 Controlling Variable Scope . . . . . . . . . . . . . . . . . . . . . . . . .
147
147
147
149
158
160
163
167
170
170
170
170
172
173
173
174
vii
9.2.3.3 Passing Function Arguments By Value Or By Reference
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 175
9.2.4 The return Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 177
9.2.5 Functions and Their Effects on Variable Typing . . . . . . . . . 178
9.3 Indirect Function Calls . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 178
10
11
12
185
185
187
189
189
189
190
191
193
195
196
196
196
200
202
203
205
206
211
212
213
214
215
216
217
218
219
221
221
222
223
224
225
225
230
234
238
13
14
241
241
241
246
250
252
254
255
259
262
262
262
265
267
269
270
271
275
276
283
284
285
285
285
286
286
287
287
290
290
292
293
294
295
296
298
299
ix
Appendix B
Appendix C
301
302
302
303
303
305
306
307
309
309
309
310
312
312
313
314
314
314
314
315
316
317
318
318
318
318
319
319
320
320
321
325
325
325
326
327
328
329
332
332
332
C.4
Appendix D
341
342
343
344
344
345
Glossary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 347
GNU General Public License . . . . . . . . . . . . . . . . . . . 357
GNU Free Documentation License . . . . . . . . . . . . . 369
ADDENDUM: How to use this License for your documents . . . . . . . . 375
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 377
Foreword 1
Foreword
Arnold Robbins and I are good friends. We were introduced in 1990 by circumstancesand
our favorite programming language, AWK. The circumstances started a couple of years
earlier. I was working at a new job and noticed an unplugged Unix computer sitting in the
corner. No one knew how to use it, and neither did I. However, a couple of days later it
was running, and I was root and the one-and-only user. That day, I began the transition
from statistician to Unix programmer.
On one of many trips to the library or bookstore in search of books on Unix, I found
the gray AWK book, a.k.a. Aho, Kernighan and Weinberger, The AWK Programming
Language, Addison-Wesley, 1988. AWKs simple programming paradigmfind a pattern in
the input and then perform an actionoften reduced complex or tedious data manipulations
to few lines of code. I was excited to try my hand at programming in AWK.
Alas, the awk on my computer was a limited version of the language described in the
AWK book. I discovered that my computer had old awk and the AWK book described
new awk. I learned that this was typical; the old version refused to step aside or relinquish
its name. If a system had a new awk, it was invariably called nawk, and few systems had it.
The best way to get a new awk was to ftp the source code for gawk from prep.ai.mit.edu.
gawk was a version of new awk written by David Trueman and Arnold, and available under
the GNU General Public License.
(Incidentally, its no longer difficult to find a new awk. gawk ships with GNU/Linux, and
you can download binaries or source code for almost any system; my wife uses gawk on her
VMS box.)
My Unix system started out unplugged from the wall; it certainly was not plugged into
a network. So, oblivious to the existence of gawk and the Unix community in general, and
desiring a new awk, I wrote my own, called mawk. Before I was finished I knew about gawk,
but it was too late to stop, so I eventually posted to a comp.sources newsgroup.
A few days after my posting, I got a friendly email from Arnold introducing himself.
He suggested we share design and algorithms and attached a draft of the POSIX standard
so that I could update mawk to support language extensions added after publication of the
AWK book.
Frankly, if our roles had been reversed, I would not have been so open and we probably
would have never met. Im glad we did meet. He is an AWK experts AWK expert and a
genuinely nice person. Arnold contributes significant amounts of his expertise and time to
the Free Software Foundation.
This book is the gawk reference manual, but at its core it is a book about AWK programming that will appeal to a wide audience. It is a definitive reference to the AWK language
as defined by the 1987 Bell Laboratories release and codified in the 1992 POSIX Utilities
standard.
On the other hand, the novice AWK programmer can study a wealth of practical programs that emphasize the power of AWKs basic idioms: data driven control-flow, pattern
matching with regular expressions, and associative arrays. Those looking for something
new can try out gawks interface to network protocols via special /inet files.
The programs in this book make clear that an AWK program is typically much smaller
and faster to develop than a counterpart written in C. Consequently, there is often a payoff
to prototype an algorithm or design in AWK to get it running quickly and expose problems
early. Often, the interpreted performance is adequate and the AWK prototype becomes the
product.
The new pgawk (profiling gawk), produces program execution counts. I recently experimented with an algorithm that for n lines of input, exhibited Cn2 performance, while
theory predicted Cn log n behavior. A few minutes poring over the awkprof.out profile pinpointed the problem to a single line of code. pgawk is a welcome addition to my
programmers toolbox.
Arnold has distilled over a decade of experience writing and using AWK programs, and
developing gawk, into this book. If you use AWK or want to learn how, then read this book.
Michael Brennan
Author of mawk
March, 2001
Preface 3
Preface
Several kinds of tasks occur repeatedly when working with text files. You might want to
extract certain lines and discard the rest. Or you may need to make changes wherever
certain patterns appear, but leave the rest of the file alone. Writing single-use programs for
these tasks in languages such as C, C++, or Java is time-consuming and inconvenient. Such
jobs are often easier with awk. The awk utility interprets a special-purpose programming
language that makes it easy to handle simple data-reformatting jobs.
The GNU implementation of awk is called gawk; it is fully compatible with the POSIX1
specification of the awk language and with the Unix version of awk maintained by Brian
Kernighan. This means that all properly written awk programs should work with gawk.
Thus, we usually dont distinguish between gawk and other awk implementations.
Using awk allows you to:
1 part snobol
3 parts C
Blend all parts well using lex and yacc. Document minimally and release.
After eight years, add another part egrep and two more parts C. Document
very well and release.
The name awk comes from the initials of its designers: Alfred V. Aho, Peter J. Weinberger and Brian W. Kernighan. The original version of awk was written in 1977 at AT&T
Bell Laboratories. In 1985, a new version made the programming language more powerful,
introducing user-defined functions, multiple input streams, and computed regular expressions. This new version became widely available with Unix System V Release 3.1 (1987).
The version in System V Release 4 (1989) added some new features and cleaned up the
behavior in some of the dark corners of the language. The specification for awk in the
POSIX Command Language and Utilities standard further clarified the language. Both the
gawk designers and the original Bell Laboratories awk designers provided feedback for the
POSIX specification.
Paul Rubin wrote the GNU implementation, gawk, in 1986. Jay Fenlason completed
it, with advice from Richard Stallman. John Woods contributed parts of the code as
well. In 1988 and 1989, David Trueman, with help from me, thoroughly reworked gawk for
compatibility with the newer awk. Circa 1994, I became the primary maintainer. Current
development focuses on bug fixes, performance improvements, standards compliance, and
occasionally, new features.
In May of 1997, J
urgen Kahrs felt the need for network access from awk, and with a
little help from me, set about adding features to do this for gawk. At that time, he also
wrote the bulk of TCP/IP Internetworking with gawk (a separate document, available as
part of the gawk distribution). His code finally became part of the main gawk distribution
with gawk version 3.1.
John Haque rewrote the gawk internals, in the process providing an awk-level debugger.
This version became available as gawk version 4.0, in 2011.
See Section A.8 [Major Contributors to gawk], page 307, for a complete list of those who
made important contributions to gawk.
Preface
Throughout this book, whenever we refer to a language feature that should be available
in any complete implementation of POSIX awk, we simply use the term awk. When referring
to a feature that is specific to the GNU implementation, we use the term gawk.
All such differences appear in the index under the entry differences in awk and gawk.
Chapter 7 [Patterns, Actions, and Variables], page 111, describes how to write patterns
for matching records, actions for doing something when a record is matched, and the built-in
variables awk and gawk use.
Chapter 8 [Arrays in awk], page 135, covers awks one-and-only data structure: associative arrays. Deleting array elements and whole arrays is also described, as well as sorting
arrays in gawk. It also describes how gawk provides arrays of arrays.
Chapter 9 [Functions], page 147, describes the built-in functions awk and gawk provide,
as well as how to define your own functions.
Chapter 10 [Internationalization with gawk], page 185, describes special features in gawk
for translating program messages into different languages at runtime.
Chapter 11 [Advanced Features of gawk], page 195, describes a number of gawk-specific
advanced features. Of particular note are the abilities to have two-way communications
with another process, perform TCP/IP networking, and profile your awk programs.
Chapter 12 [A Library of awk Functions], page 211, and Chapter 13 [Practical awk
Programs], page 241, provide many sample awk programs. Reading them allows you to see
awk solving real problems.
Chapter 14 [dgawk: The awk Debugger], page 285, describes the awk debugger, dgawk.
Appendix A [The Evolution of the awk Language], page 301, describes how the awk
language has evolved since its first release to present. It also describes how gawk has
acquired features over time.
Appendix B [Installing gawk], page 309, describes how to get gawk, how to compile it on
POSIX-compatible systems, and how to compile and use it on different non-POSIX systems.
It also describes how to report bugs in gawk and where to get other freely available awk
implementations.
Appendix C [Implementation Notes], page 325, describes how to disable gawks extensions, as well as how to contribute new code to gawk, how to write extension libraries, and
some possible future directions for gawk development.
Appendix D [Basic Programming Concepts], page 341, provides some very cursory background material for those who are completely unfamiliar with computer programming. Also
centralized there is a discussion of some of the issues surrounding floating-point numbers.
The [Glossary], page 347, defines most, if not all, the significant terms used throughout
the book. If you find terms that you arent familiar with, try looking them up here.
[GNU General Public License], page 357, and [GNU Free Documentation License],
page 369, present the licenses that cover the gawk source code and this book, respectively.
Typographical Conventions
This book is written in Texinfo, the GNU documentation formatting language. A single
Texinfo source file is used to produce both the printed and online versions of the documentation. Because of this, the typographical conventions are slightly different than in other
books you may have read.
Examples you would type at the command-line are preceded by the common shell primary and secondary prompts, $ and >. Input that you type is shown like this. Output
from the command is preceded by the glyph a . This typically represents the commands
Preface 7
standard output. Error messages, and other output on the commands standard error, are
preceded by the glyph error . For example:
$ echo hi on stdout
a hi on stdout
$ echo hello on stderr 1>&2
error hello on stderr
In the text, command names appear in this font, while code segments appear in the
same font and quoted, like this. Options look like this: -f. Some things are emphasized
like this, and if a point needs to be made strongly, it is done like this. The first occurrence of
a new term is usually its definition and appears in the same font as the previous occurrence of
definition in this sentence. Finally, file names are indicated like this: /path/to/ourfile.
Characters that you type at the keyboard look like this. In particular, there are special
characters called control characters. These are characters that you type by holding down
both the CONTROL key and another key, at the same time. For example, a Ctrl-d is typed
by first pressing and holding the CONTROL key, next pressing the d key and finally releasing
both keys.
Dark Corners
Dark corners are basically fractal no matter how much you illuminate, theres
always a smaller but darker one.
Brian Kernighan
Until the POSIX standard (and GAWK: Effective AWK Programming), many features of
awk were either poorly documented or not documented at all. Descriptions of such features
(often called dark corners) are noted in this book with the picture of a flashlight in the
margin, as shown here. They also appear in the index under the heading dark corner.
As noted by the opening quote, though, any coverage of dark corners is, by definition,
incomplete.
Extensions to the standard awk language that are supported by more than one awk
implementation are marked (c.e.), and listed in the index under common extensions
and extensions, common.
A shell, an editor (Emacs), highly portable optimizing C, C++, and Objective-C compilers, a symbolic debugger and dozens of large and small utilities (such as gawk), have all
been completed and are freely available. The GNU operating system kernel (the HURD),
has been released but remains in an early stage of development.
Until the GNU operating system is more fully developed, you should consider using
R
, Power ArchitecGNU/Linux, a freely distributable, Unix-like operating system for Intel
6
ture, Sun SPARC, IBM S/390, and other systems. Many GNU/Linux distributions are
available for download from the Internet.
(There are numerous other freely available, Unix-like operating systems based on the
Berkeley Software Distribution, and some of them use recent versions of gawk for their
versions of awk. NetBSD, FreeBSD, and OpenBSD are three of the most popular ones, but
there are others.)
The book you are reading is actually freeat least, the information in it is free to
anyone. The machine-readable source code for the book comes with gawk; anyone may take
this book to a copying machine and make as many copies as they like. (Take a moment to
check the Free Documentation License in [GNU Free Documentation License], page 369.)
The book itself has gone through a number of previous editions. Paul Rubin wrote the
very first draft of The GAWK Manual; it was around 40 pages in size. Diane Close and
Richard Stallman improved it, yielding a version that was around 90 pages long and barely
described the original, old version of awk.
I started working with that version in the fall of 1988. As work on it progressed, the FSF
published several preliminary versions (numbered 0.x). In 1996, Edition 1.0 was released
with gawk 3.0.0. The FSF published the first two editions under the title The GNU Awk
Users Guide.
This edition maintains the basic structure of the previous editions. For Edition 4.0, the
content has been thoroughly reviewed and updated. All references to versions prior to 4.0
have been removed. Of significant note for this edition is Chapter 14 [dgawk: The awk
Debugger], page 285.
GAWK: Effective AWK Programming will undoubtedly continue to evolve. An electronic
version comes with the gawk distribution from the FSF. If you find an error in this book,
please report it! See Section B.4 [Reporting Problems and Bugs], page 320, for information
on submitting problem reports electronically.
How to Contribute
As the maintainer of GNU awk, I once thought that I would be able to manage a collection of
publicly available awk programs and I even solicited contributions. Making things available
on the Internet helps keep the gawk distribution down to manageable size.
The initial collection of material, such as it is, is still available at
ftp://ftp.freefriends.org/arnold/Awkstuff.
In the hopes of doing something more broad, I acquired the awk.info domain.
However, I found that I could not dedicate enough time to managing contributed code:
the archive did not grow and the domain went unused for several years.
6
Preface 9
Fortunately, late in 2008, a volunteer took on the task of setting up an awk-related web
sitehttp://awk.infoand did a very nice job.
If you have written an interesting awk program, or have written a gawk extension that you
would like to share with the rest of the world, please see http://awk.info/?contribute
for how to contribute it to the web site.
Acknowledgments
The initial draft of The GAWK Manual had the following acknowledgments:
Many people need to be thanked for their assistance in producing this manual.
Jay Fenlason contributed many ideas and sample programs. Richard Mlynarik
and Robert Chassell gave helpful comments on drafts of this manual. The
paper A Supplemental Document for awk by John W. Pierce of the Chemistry
Department at UC San Diego, pinpointed several issues relevant both to awk
implementation and to this manual, that would otherwise have escaped us.
I would like to acknowledge Richard M. Stallman, for his vision of a better world and
for his courage in founding the FSF and starting the GNU Project.
Earlier editions of this book had the following acknowledgements:
The following people (in alphabetical order) provided helpful comments on various versions of this book, Rick Adams, Dr. Nelson H.F. Beebe, Karl Berry,
Dr. Michael Brennan, Rich Burridge, Claire Cloutier, Diane Close, Scott Deifik, Christopher (Topher) Eliot, Jeffrey Friedl, Dr. Darrel Hankerson, Michal
Jaegermann, Dr. Richard J. LeBlanc, Michael Lijewski, Pat Rankin, Miriam
Robbins, Mary Sheehan, and Chuck Toporek.
Robert J. Chassell provided much valuable advice on the use of Texinfo. He
also deserves special thanks for convincing me not to title this book How To
Gawk Politely. Karl Berry helped significantly with the TEX part of Texinfo.
I would like to thank Marshall and Elaine Hartholz of Seattle and Dr. Bert
and Rita Schreiber of Detroit for large amounts of quiet vacation time in their
homes, which allowed me to make significant progress on this book and on gawk
itself.
Phil Hughes of SSC contributed in a very important way by loaning me his
laptop GNU/Linux system, not once, but twice, which allowed me to do a lot
of work while away from home.
David Trueman deserves special credit; he has done a yeoman job of evolving
gawk so that it performs well and without bugs. Although he is no longer
involved with gawk, working with him on this project was a significant pleasure.
The intrepid members of the GNITS mailing list, and most notably Ulrich
Drepper, provided invaluable help and feedback for the design of the internationalization features.
Chuck Toporek, Mary Sheehan, and Claire Coutier of OReilly & Associates
contributed significant editorial help for this book for the 3.1 release of gawk.
Dr. Nelson Beebe, Andreas Buening, Antonio Colombo, Stephen Davies, Scott Deifik,
John H. DuBois III, Darrel Hankerson, Michal Jaegermann, J
urgen Kahrs, Dave Pitts,
Stepan Kasal, Pat Rankin, Andrew Schorr, Corinna Vinschen, Anders Wallin, and Eli
Zaretskii (in alphabetical order) make up the current gawk crack portability team. Without their hard work and help, gawk would not be nearly the fine program it is today. It has
been and continues to be a pleasure working with this team of fine people.
John Haque contributed the modifications to convert gawk into a byte-code interpreter,
including the debugger. Stephen Davies contributed to the effort to bring the byte-code
changes into the mainstream code base. Efraim Yawitz contributed the initial text of
Chapter 14 [dgawk: The awk Debugger], page 285.
I would like to thank Brian Kernighan for invaluable assistance during the testing and
debugging of gawk, and for ongoing help and advice in clarifying numerous points about the
language. We could not have done nearly as good a job on either gawk or its documentation
without his help.
I must thank my wonderful wife, Miriam, for her patience through the many versions of
this project, for her proofreading, and for sharing me with the computer. I would like to
thank my parents for their love, and for the grace with which they raised and educated me.
Finally, I also must acknowledge my gratitude to G-d, for the many opportunities He has
sent my way, as well as for the gifts He has given me with which to take advantage of those
opportunities.
Arnold Robbins
Nof Ayalon
ISRAEL
March, 2011
11
This format is also useful for running short or medium-sized awk programs from shell
scripts, because it avoids the need for a separate file for the awk program. A self-contained
shell script is more reliable because there are no other files to misplace.
Section 1.3 [Some Simple Examples], page 17, later in this chapter, presents several
short, self-contained programs.
If you use Bash as your shell, you should execute the command set +H before running this program
interactively, to disable the C shell-style command history, which treats ! as a special character. We
recommend putting this command into your personal startup file.
Although we generally recommend the use of single quotes around the program text, double quotes are
needed here in order to put the single quote into the message.
13
The -f instructs the awk utility to get the awk program from the file source-file. Any
file name can be used for source-file. For example, you could put the program:
BEGIN { print "Dont Panic!" }
into the file advice. Then this command:
awk -f advice
does the same thing as this one:
awk "BEGIN { print \"Dont Panic!\" }"
This was explained earlier (see Section 1.1.2 [Running awk Without Input Files], page 12).
Note that you dont usually need single quotes around the file name that you specify with
-f, because most file names dont contain any of the shells special characters. Notice that
in advice, the awk program did not have single quotes around it. The quotes are only
needed for programs that are provided on the awk command line.
If you want to clearly identify your awk program files as such, you can add the extension
.awk to the file name. This doesnt affect the execution of the awk program but it does
make housekeeping easier.
The #! mechanism works on GNU/Linux systems, BSD-based systems and commercial Unix systems.
The line beginning with #! lists the full file name of an interpreter to run and an optional initial
command-line argument to pass to that interpreter. The operating system then runs the interpreter
with the given argument and the full argument list of the executed program. The first argument in the
list is the full file name of the awk program. The rest of the argument list contains either options to awk,
or data files, or both.
passes it to awk. Doing this leads to confusing behaviormost likely a usage diagnostic of
some sort from awk.
Finally, the value of ARGV[0] (see Section 7.5 [Built-in Variables], page 126) varies depending upon your operating system. Some systems put awk there, some put the full
pathname of awk (such as /bin/awk), and some put the name of your script (advice).
Dont rely on the value of ARGV[0] to provide your script name.
15
# wrong!
In the second case, awk will attempt to use the text of the program as the value of FS,
and the first file name as the text of the program! This results in syntax errors at best,
and confusing behavior at worst.
Mixing single and double quotes is difficult. You have to resort to shell quoting tricks,
like this:
$ awk BEGIN { print "Here is a single quote <"">" }
a Here is a single quote <>
This program consists of three concatenated quoted strings. The first and the third are
single-quoted, the second is double-quoted.
This can be simplified to:
$ awk BEGIN { print "Here is a single quote <\>" }
a Here is a single quote <>
Judge for yourself which of these two is the more readable.
Another option is to use double quotes, escaping the embedded, awk-level double quotes:
$ awk "BEGIN { print \"Here is a single quote <>\" }"
a Here is a single quote <>
This option is also painful, because double quotes, backslashes, and dollar signs are very
common in more advanced awk programs.
A third option is to use the octal escape sequence equivalents (see Section 3.2 [Escape
Sequences], page 38) for the single- and double-quote characters, like so:
$ awk BEGIN { print "Here is a single quote <\47>" }
a Here is a single quote <>
$ awk BEGIN { print "Here is a double quote <\42>" }
a Here is a double quote <">
This works nicely, except that you should comment clearly what the escapes mean.
A fourth option is to use command-line variable assignment, like this:
$ awk -v sq="" BEGIN { print "Here is a single quote <" sq ">" }
a Here is a single quote <>
If you really need both single and double quotes in your awk program, it is probably best
to move it into a separate file, where the shell wont be part of the picture, and you can say
what you mean.
aardvark
alpo-net
barfly
bites
camelot
core
fooey
foot
macfoo
sdace
sabafoo
555-5553
555-3412
555-7685
555-1675
555-0542
555-2912
555-1234
555-6699
555-6480
555-3430
555-2127
1200/300
2400/1200/300
1200/300
2400/1200/300
300
1200/300
2400/1200/300
1200/300
1200/300
2400/1200/300
1200/300
17
B
A
A
A
C
C
B
B
A
A
C
The data file inventory-shipped represents information about shipments during the
year. Each record contains the month, the number of green crates shipped, the number of
red boxes shipped, the number of orange bags shipped, and the number of blue packages
shipped, respectively. There are 16 entries, covering the 12 months of last year and the first
four months of the current year.
Jan
Feb
Mar
Apr
May
Jun
Jul
Aug
Sep
Oct
Nov
Dec
13
15
15
31
16
31
24
15
13
29
20
17
25
32
24
52
34
42
34
34
55
54
87
35
15
24
34
63
29
75
67
47
37
68
82
61
115
226
228
420
208
492
436
316
277
525
577
401
Jan
Feb
Mar
Apr
21
26
24
21
36
58
75
70
64
80
70
74
620
652
495
514
expression, which is covered in more detail later (see Chapter 3 [Regular Expressions],
page 37). The pattern is allowed to match parts of words. There are single quotes around
the awk program so that the shell wont interpret any of it as special shell characters.
Here is what this program prints:
$ awk /foo/ { print $0 } BBS-list
555-1234
2400/1200/300
B
a fooey
555-6699
1200/300
B
a foot
555-6480
1200/300
A
a macfoo
555-2127
1200/300
C
a sabafoo
In an awk rule, either the pattern or the action can be omitted, but not both. If the
pattern is omitted, then the action is performed for every input line. If the action is omitted,
the default action is to print all lines that match the pattern.
Thus, we could leave out the action (the print statement and the curly braces) in the
previous example and the result would be the same: awk prints all lines matching the
pattern foo. By comparison, omitting the print statement but retaining the curly braces
makes an empty action that does nothing (i.e., no lines are printed).
Many practical awk programs are just a line or two. Following is a collection of useful,
short programs to get you started. Some of these programs contain constructs that havent
been covered yet. (The description of the program will give you a good idea of what is going
on, but please read the rest of the book to become an awk expert!) Most of the examples
use a data file named data. This is just a placeholder; if you use these programs yourself,
substitute your own file names for data. For future reference, note that there is often
more than one way to do things in awk. At some point, you may want to look back at these
examples and see if you can come up with different ways to do the same things shown here:
Print the length of the longest input line:
awk { if (length($0) > max) max = length($0) }
END { print max } data
Print every line that is longer than 80 characters:
awk length($0) > 80 data
The sole rule has a relational expression as its pattern and it has no actionso the
default action, printing the record, is used.
Print the length of the longest line in data:
expand data | awk { if (x < length()) x = length() }
END { print "maximum line length is " x }
The input is processed by the expand utility to change TABs into spaces, so the widths
compared are actually the right-margin columns.
Print every line that has at least one field:
awk NF > 0 data
This is an easy way to delete blank lines from a file (or rather, to create a new file
similar to the old file but from which the blank lines have been removed).
Print seven random numbers from 0 to 100, inclusive:
awk BEGIN { for (i = 1; i <= 7; i++)
print int(101 * rand()) }
19
bytes: " x }
1024 }
sort
a
a
a
a
a
sdace
sabafoo
sabafoo
Jan 21
Apr 21
36
70
555-3430
555-2127
555-2127
64 620
74 514
2400/1200/300
1200/300
1200/300
A
C
C
Note how the line beginning with sabafoo in BBS-list was printed twice, once for each
rule.
1
1
1
1
1
1
1
1
arnold
arnold
arnold
arnold
arnold
arnold
arnold
arnold
user
user
user
user
user
user
user
user
1933
10809
983
31869
22414
37455
27511
7989
The first field contains read-write permissions, the second field contains the number of links
to the file, and the third field identifies the owner of the file. The fourth field identifies the
group of the file. The fifth field contains the size of the file in bytes. The sixth, seventh, and
eighth fields contain the month, day, and time, respectively, that the file was last modified.
Finally, the ninth field contains the file name.5
The $6 == "Nov" in our awk program is an expression that tests whether the sixth field
of the output from ls -l matches the string Nov. Each time a line has the string Nov
for its sixth field, the action sum += $5 is performed. This adds the fifth field (the files
size) to the variable sum. As a result, when awk has finished reading all the input lines, sum
is the total of the sizes of the files whose lines matched the pattern. (This works because
awk variables are automatically initialized to zero.)
After the last line of output from ls has been processed, the END rule executes and prints
the value of sum. In this example, the value of sum is 80600.
These more advanced awk techniques are covered in later sections (see Section 7.3 [Actions], page 117). Before you can move on to more advanced awk programming, you have to
5
21
know how awk interprets your input and displays your output. By manipulating fields and
using print statements, you can produce some very useful and impressive-looking reports.
The ? and : referred to here is the three-operand conditional expression described in Section 6.3.4
[Conditional Expressions], page 107. Splitting lines after ? and : is a minor gawk extension; if --posix
is specified (see Section 2.2 [Command-Line Options], page 25), then this extension is disabled.
$ awk BEGIN {
>
print \
>
"hello, world"
> }
a hello, world
awk is a line-oriented language. Each rules action has to begin on the same line as
the pattern. To have the pattern and action on separate lines, you must use backslash
continuation; there is no other option.
Another thing to keep in mind is that backslash continuation and comments do not mix.
As soon as awk sees the # that starts a comment, it ignores everything on the rest of the
line. For example:
$ gawk BEGIN { print "dont panic" # a friendly \
>
BEGIN rule
> }
BEGIN rule
error gawk: cmd. line:2:
^ parse error
error gawk: cmd. line:2:
In this case, it looks like the backslash would continue the comment onto the next line.
However, the backslash-newline combination is never even noticed because it is hidden
inside the comment. Thus, the BEGIN is noted as a syntax error.
When awk statements within one rule are short, you might want to put more than one of
them on a line. This is accomplished by separating the statements with a semicolon (;).
This also applies to the rules themselves. Thus, the program shown at the start of this
section could also be written this way:
/12/ { print $0 } ; /21/ { print $0 }
NOTE: The requirement that states that rules on the same line must be separated with a semicolon was not in the original awk language; it was added for
consistency with the treatment of statements within an action.
23
awk language is very useful for producing reports from large amounts of raw data, such as
summarizing information from the output of other utility programs like ls. (See Section 1.5
[A More Complex Example], page 20.)
Programs written with awk are usually much smaller than they would be in other languages. This makes awk programs easy to compose and use. Often, awk programs can
be quickly composed at your keyboard, used once, and thrown away. Because awk programs are interpreted, you can avoid the (usually lengthy) compilation part of the typical
edit-compile-test-debug cycle of software development.
Complex programs have been written in awk, including a complete retargetable assembler for eight-bit microprocessors (see [Glossary], page 347, for more information), and a
microcode assembler for a special-purpose Prolog computer. While the original awks capabilities were strained by tasks of such complexity, modern versions are more capable. Even
Brian Kernighans version of awk has fewer predefined limits, and those that it has are much
larger than they used to be.
If you find yourself writing awk scripts of more than, say, a few hundred lines, you might
consider using a different programming language. Emacs Lisp is a good choice if you need
sophisticated string or pattern matching capabilities. The shell is also good at string and
pattern matching; in addition, it allows powerful use of the system utilities. More conventional languages, such as C, C++, and Java, offer better facilities for system programming
and for managing the complexity of large programs. Programs in these languages may
require more lines of source code than the equivalent awk programs, but they are easier to
maintain and usually run more efficiently.
-v var=val
--assign var=val
Set the variable var to the value val before execution of the program begins.
Such variable values are available inside the BEGIN rule (see Section 2.3 [Other
Command-Line Arguments], page 30).
The -v option can only set one variable, but it can be used more than once,
setting another variable each time, like this: awk -v foo=1 -v bar=2 ....
CAUTION: Using -v to set the values of the built-in variables
may lead to surprising results. awk will reset the values of those
variables as it needs to, possibly ignoring any predefined value you
may have given.
-W gawk-opt
Provide an implementation-specific option. This is the POSIX convention for
providing implementation-specific options. These options also have corresponding GNU-style long options. Note that the long options may be abbreviated, as
long as the abbreviations remain unique. The full list of gawk-specific options
is provided next.
--
Signal the end of the command-line options. The following arguments are not
treated as options even if they begin with -. This interpretation of -- follows
the POSIX argument parsing conventions.
This is useful if you have file names that start with -, or in shell scripts, if
you have file names that will be specified by the user that could start with -.
It is also useful for passing options on to the awk program; see Section 12.4
[Processing Command-Line Options], page 225.
The following list describes gawk-specific options:
-b
--characters-as-bytes
Cause gawk to treat all input data as single-byte characters. Normally, gawk
follows the POSIX standard and attempts to process its input data according
to the current locale. This can often involve converting multibyte characters
into wide characters (internally), and can lead to problems or confusion if the
input data does not contain valid multibyte characters. This option is an easy
way to tell gawk: hands off my data!.
-c
--traditional
Specify compatibility mode, in which the GNU extensions to the awk language
are disabled, so that gawk behaves just like Brian Kernighans version awk. See
Section A.5 [Extensions in gawk Not in POSIX awk], page 303, which summarizes the extensions. Also see Section C.1 [Downward Compatibility and
Debugging], page 325.
-C
--copyright
Print the short version of the General Public License and then exit.
-d[file]
--dump-variables[=file]
Print a sorted list of global variables, their types, and final values to file. If no
file is provided, print this list to the file named awkvars.out in the current
directory. No space is allowed between the -d and file, if file is supplied.
Having a list of all global variables is a good way to look for typographical
errors in your programs. You would also use this option if you have a large
program with a lot of functions, and you want to be sure that your functions
dont inadvertently use global variables that you meant to be local. (This is a
particularly easy mistake to make with simple variable names like i, j, etc.)
-e program-text
--source program-text
Provide program source code in the program-text. This option allows you to mix
source code in files with source code that you enter on the command line. This is
particularly useful when you have library functions that you want to use from
your command-line programs (see Section 2.5.1 [The AWKPATH Environment
Variable], page 32).
-E file
--exec file
Similar to -f, read awk program text from file. There are two differences from
-f:
This option terminates option processing; anything else on the command
line is passed on directly to the awk program.
Command-line variable assignments of the form var=value are disallowed.
This option is particularly necessary for World Wide Web CGI applications
that pass arguments through the URL; using this option prevents a malicious
(or other) user from passing in options, assignments, or awk source code (via
--source) to the CGI application. This option should be used with #! scripts
(see Section 1.1.4 [Executable awk Programs], page 13), like so:
#! /usr/local/bin/gawk -E
awk program here ...
-g
--gen-pot
Analyze the source program and generate a GNU gettext Portable Object
Template file on standard output for all string constants that have been marked
for translation. See Chapter 10 [Internationalization with gawk], page 185, for
information about this option.
-h
--help
Print a usage message summarizing the short and long style options that
gawk accepts and then exit.
-L [value]
--lint[=value]
Warn about constructs that are dubious or nonportable to other awk implementations. Some warnings are issued when gawk first reads your program. Others
are issued at runtime, as your program executes. With an optional argument
of fatal, lint warnings become fatal errors. This may be drastic, but its use
will certainly encourage the development of cleaner awk programs. With an
optional argument of invalid, only warnings about things that are actually
invalid are issued. (This is not fully implemented yet.)
Some warnings are only printed once, even if the dubious constructs they warn
about occur multiple times in your awk program. Thus, when eliminating problems pointed out by --lint, you should take care to search for all occurrences
of each inappropriate construct. As awk programs are usually short, doing so
is not burdensome.
-n
--non-decimal-data
Enable automatic interpretation of octal and hexadecimal values in input data
(see Section 11.1 [Allowing Nondecimal Input Data], page 195).
CAUTION: This option can severely break old programs. Use with
care.
-N
--use-lc-numeric
Force the use of the locales decimal point character when parsing numeric input
data (see Section 6.6 [Where You Are Makes A Difference], page 110).
-O
--optimize
Enable some optimizations on the internal representation of the program. At
the moment this includes just simple constant folding. The gawk maintainer
hopes to add more optimizations over time.
-p[file]
--profile[=file]
Enable profiling of awk programs (see Section 11.5 [Profiling Your awk
Programs], page 206). By default, profiles are created in a file named
awkprof.out. The optional file argument allows you to specify a different
file name for the profile file. No space is allowed between the -p and file, if
file is supplied.
When run with gawk, the profile is just a pretty printed version of the program. When run with pgawk, the profile contains execution counts for each
statement in the program in the left margin, and function call counts for each
function.
-P
--posix
Operate in strict POSIX mode. This disables all gawk extensions (just like
--traditional) and disables all extensions not allowed by POSIX. See
Section A.6 [Common Extensions Summary], page 305, for a summary of
the extensions in gawk that are disabled by this option. Also, the following
additional restrictions apply:
Newlines do not act as whitespace to separate fields when FS is equal to a
single space (see Section 4.2 [Examining Fields], page 52).
Newlines are not allowed after ? or : (see Section 6.3.4 [Conditional
Expressions], page 107).
Specifying -Ft on the command-line does not set the value of FS to be
a single TAB character (see Section 4.5 [Specifying How Fields Are Separated], page 56).
The locales decimal point character is used for parsing input data (see
Section 6.6 [Where You Are Makes A Difference], page 110).
If you supply both --traditional and --posix on the command line,
--posix takes precedence. gawk also issues a warning if both options are
supplied.
-r
--re-interval
Allow interval expressions (see Section 3.3 [Regular Expression Operators],
page 40) in regexps. This is now gawks default behavior. Nevertheless, this
option remains both for backward compatibility, and for use in combination
with the --traditional option.
-R file
--command=file
dgawk only. Read dgawk debugger options and commands from file. See
Section 14.3.5 [Obtaining Information About The Program and The Debugger State], page 295, for more information.
-S
--sandbox
Disable the system() function, input redirections with getline, output redirections with print and printf, and dynamic extensions. This is particularly
useful when you want to run awk scripts from questionable sources and need to
make sure the scripts cant access your system (other than the specified input
data file).
-t
--lint-old
Warn about constructs that are not available in the original version of awk from
Version 7 Unix (see Section A.1 [Major Changes Between V7 and SVR3.1],
page 301).
-V
--version
Print version information for this particular copy of gawk. This allows you to
determine if your copy of gawk is up to date with respect to whatever the Free
Software Foundation is currently distributing. It is also useful for bug reports
(see Section B.4 [Reporting Problems and Bugs], page 320).
As long as program text has been supplied, any other options are flagged as invalid with
a warning message but are otherwise ignored.
In compatibility mode, as a special case, if the value of fs supplied to the -F option is
t, then FS is set to the TAB character ("\t"). This is true only for --traditional and
not for --posix (see Section 4.5 [Specifying How Fields Are Separated], page 56).
The -f option may be used more than once on the command line. If it is, awk reads
its program source from all of the named files, as if they had been concatenated together
into one big file. This is useful for creating libraries of awk functions. These functions can
be written once and then retrieved from a standard place, instead of having to be included
into each individual program. (As mentioned in Section 9.2.1 [Function Definition Syntax],
page 170, function names must be unique.)
With standard awk, library functions can still be used, even if the program is entered
at the terminal, by specifying -f /dev/tty. After typing your program, type Ctrl-d (the
end-of-file character) to terminate it. (You may also use -f - to read program source from
the standard input but then you will not be able to also use the standard input as a source
of data.)
Because it is clumsy using the standard awk mechanisms to mix source file and commandline awk programs, gawk provides the --source option. This does not require you to preempt the standard input for your source code; it allows you to easily mix command-line
and library source code (see Section 2.5.1 [The AWKPATH Environment Variable], page 32).
The --source option may also be used multiple times on the command line.
If no -f or --source option is specified, then gawk uses the first non-option commandline argument as the text of the program source code.
If the environment variable POSIXLY_CORRECT exists, then gawk behaves in strict POSIX
mode, exactly as if you had supplied the --posix command-line option. Many GNU
programs look for this environment variable to turn on strict POSIX mode. If --lint
is supplied on the command line and gawk turns on POSIX mode because of POSIXLY_
CORRECT, then it issues a warning message indicating that POSIX mode is in effect. You
would typically set this variable in your shells startup file. For a Bourne-compatible shell
(such as Bash), you would add these lines to the .profile file in your home directory:
POSIXLY_CORRECT=true
export POSIXLY_CORRECT
For a C shell-compatible shell,1 you would add this line to the .login file in your home
directory:
setenv POSIXLY_CORRECT true
Having POSIXLY_CORRECT set is not recommended for daily use, but it is good for testing
the portability of your programs to other environments.
Not recommended.
All these arguments are made available to your awk program in the ARGV array (see
Section 7.5 [Built-in Variables], page 126). Command-line options and the program text (if
present) are omitted from ARGV. All other arguments, including variable assignments, are
included. As each element of ARGV is processed, gawk sets the variable ARGIND to the index
in ARGV of the current element.
The distinction between file name arguments and variable-assignment arguments is made
when awk is about to open the next input file. At that point in execution, it checks the file
name to see whether it is really a variable assignment; if so, awk sets the variable instead
of reading a file.
Therefore, the variables actually receive the given values after all previously specified
files have been read. In particular, the values of variables assigned in this fashion are
not available inside a BEGIN rule (see Section 7.1.4 [The BEGIN and END Special Patterns],
page 114), because such rules are run before awk begins scanning the argument list.
The variable values given on the command line are processed for escape sequences (see
Section 3.2 [Escape Sequences], page 38).
In some earlier implementations of awk, when a variable assignment occurred before
any file names, the assignment would happen before the BEGIN rule was executed. awks
behavior was thus inconsistent; some command-line assignments were available inside the
BEGIN rule, while others were not. Unfortunately, some applications came to depend upon
this feature. When awk was changed to be more consistent, the -v option was added to
accommodate applications that depended upon the old behavior.
The variable assignment feature is most useful for assigning to variables such as RS, OFS,
and ORS, which control input and output formats before scanning the data files. It is also
useful for controlling state if multiple passes are needed over a data file. For example:
awk pass == 1 { pass 1 stuff }
pass == 2 { pass 2 stuff } pass=1 mydata pass=2 mydata
Given the variable assignment feature, the -F option for setting the value of FS is not
strictly necessary. It remains for historical compatibility.
Your version of gawk may use a different directory; it will depend upon how gawk was built and installed.
The actual directory is the value of $(datadir) generated when gawk was configured. You probably
dont need to worry about this, though.
GAWK_SOCK_RETRIES
Controls the number of time gawk will attempt to retry a two-way TCP/IP
(socket) connection before giving up. See Section 11.4 [Using gawk for Network
Programming], page 205.
GAWK_MSEC_SLEEP
Specifies the interval between connection retries, in milliseconds. On systems
that do not support the usleep() system call, the value is rounded up to an
integral number of seconds.
The environment variables in the following list are meant for use by the gawk developers
for testing and tuning. They are subject to change. The variables are:
AVG_CHAIN_MAX
The average number of items gawk will maintain on a hash chain for managing
arrays.
AWK_HASH
If this variable exists with a value of gst, gawk will switch to using the
hash function from GNU Smalltalk for managing arrays. This function may
be marginally faster than the standard function.
AWKREADFUNC
If this variable exists, gawk switches to reading source files one line at a time,
instead of reading in blocks. This exists for debugging problems on filesystems
on non-POSIX operating systems where I/O is performed in records, not in
blocks.
GAWK_NO_DFA
If this variable exists, gawk does not use the DFA regexp matcher for does it
match kinds of tests. This can cause gawk to be slower. Its purpose is to help
isolate differences between the two regexp matchers that gawk uses internally.
(There arent supposed to be differences, but occasionally theory and practice
dont coordinate with each other.)
GAWK_STACKSIZE
This specifies the amount by which gawk should grow its internal evaluation
stack, when needed.
TIDYMEM
If this variable exists, gawk uses the mtrace() library calls from GNU LIBC to
help track down possible memory leaks.
are valid. The AWKPATH environment variable can be of great value when using @include.
The same rules for the use of the AWKPATH variable in command-line file searches (see
Section 2.5.1 [The AWKPATH Environment Variable], page 32) apply to @include also.
This is very helpful in constructing gawk function libraries. If you have a large script
with useful, general purpose awk functions, you can break it down into library files and put
those files in a special directory. You can then include those libraries, using either the
full pathnames of the files, or by setting the AWKPATH environment variable accordingly and
then using @include with just the file part of the full pathname. Of course you can have
more than one directory to keep library files; the more complex the working environment
is, the more directories you may need to organize the files to be included.
Given the ability to specify multiple -f options, the @include mechanism is not
strictly necessary. However, the @include keyword can help you in constructing selfcontained gawk programs, thus reducing the need for writing complex and tedious command
lines. In particular, @include is very useful for writing CGI scripts to be run from web
pages.
As mentioned in Section 2.5.1 [The AWKPATH Environment Variable], page 32, the current
directory is always searched first for source files, before searching in AWKPATH, and this also
applies to files named with @include.
3 Regular Expressions
A regular expression, or regexp, is a way of describing a set of strings. Because regular
expressions are such a fundamental part of awk programming, their format and use deserve
a separate chapter.
A regular expression enclosed in slashes (/) is an awk pattern that matches every input
record whose text belongs to that set. The simplest regular expression is a sequence of
letters, numbers, or both. Such a regexp matches any string that contains that sequence.
Thus, the regexp foo matches any string containing foo. Therefore, the pattern /foo/
matches any input record containing the three characters foo anywhere in the record.
Other kinds of regexps let you specify more complicated classes of strings.
Initially, the examples in this chapter are simple. As we explain more about how regular
expressions work, we present more complicated instances.
/J/ inventory-shipped
25 15 115
42 75 492
34 67 436
36 64 620
So does this:
awk { if ($1 ~ /J/) print } inventory-shipped
This next example is true if the expression exp (taken as a character string) does not
match regexp:
exp !~ /regexp/
The following example matches, or selects, all input records whose first field does not
contain the uppercase letter J:
$ awk $1 !~ /J/ inventory-shipped
a Feb 15 32 24 226
a Mar 15 24 34 228
a Apr 31 52 63 420
a May 16 34 29 208
...
When a regexp is enclosed in slashes, such as /foo/, we call it a regexp constant, much
like 5.27 is a numeric constant and "foo" is a string constant.
A literal backslash, \.
\a
The alert character, Ctrl-g, ASCII code 7 (BEL). (This usually makes some
sort of audible noise.)
\b
\f
\n
\r
\t
\v
\nnn
The octal value nnn, where nnn stands for 1 to 3 digits between 0 and 7. For
example, the code for the ASCII ESC (escape) character is \033.
\xhh...
The hexadecimal value hh, where hh stands for a sequence of hexadecimal digits
(09, and either AF or af). Like the same construct in ISO C, the
escape sequence continues until the first nonhexadecimal digit is seen. (c.e.)
However, using more than two hexadecimal digits produces undefined results.
(The \x escape sequence is not allowed in POSIX awk.)
\/
A literal slash (necessary for regexp constants only). This sequence is used
when you want to write a regexp constant that contains a slash. Because the
regexp is delimited by slashes, you need to escape the slash that is part of the
pattern, in order to tell awk to keep processing the rest of the regexp.
\"
A literal double quote (necessary for string constants only). This sequence is
used when you want to write a string constant that contains a double quote.
Because the string is delimited by double quotes, you need to escape the quote
that is part of the string, in order to tell awk to keep processing the rest of the
string.
In gawk, a number of additional two-character sequences that begin with a backslash have
special meaning in regexps. See Section 3.5 [gawk-Specific Regexp Operators], page 44.
In a regexp, a backslash before any character that is not in the previous list and not listed
in Section 3.5 [gawk-Specific Regexp Operators], page 44, means that the next character
should be taken literally, even if it would normally be a regexp operator. For example,
/a\+b/ matches the three characters a+b.
For complete portability, do not use a backslash before any character not shown in the
previous list.
To summarize:
The escape sequences in the table above are always processed first, for both string
constants and regexp constants. This happens very early, as soon as awk reads your
program.
gawk processes both regexp constants and dynamic regexps (see Section 3.8 [Using
Dynamic Regexps], page 47), for the special operators listed in Section 3.5 [gawkSpecific Regexp Operators], page 44.
A backslash before any other character means to treat that character literally.
This is used to suppress the special meaning of a character when matching. For
example, \$ matches the character $.
This is similar to ^, but it matches only at the end of a string. For example,
p$ matches a record that ends with a p. The $ is an anchor and does not
match the end of a line embedded in a string. The condition in the following
example is not true:
if ("line1\nLINE 2" ~ /1$/) ...
. (period) This matches any single character, including the newline character. For example, .P matches any single character followed by a P in a string. Using
concatenation, we can make a regular expression such as U.A, which matches
any three-character sequence that begins with U and ends with A.
In strict POSIX mode (see Section 2.2 [Command-Line Options], page 25), .
does not match the nul character, which is a character with all bits equal to
zero. Otherwise, nul is just another character. Other versions of awk may not
be able to match the nul character.
[...]
This is called a bracket expression.1 It matches any one of the characters that
are enclosed in the square brackets. For example, [MVX] matches any one
of the characters M, V, or X in a string. A full discussion of what can be
inside the square brackets of a bracket expression is given in Section 3.4 [Using
Bracket Expressions], page 42.
[^ ...]
(...)
This symbol means that the preceding regular expression should be repeated
as many times as necessary to find a match. For example, ph* applies the *
symbol to the preceding h and looks for matches of one p followed by any
number of hs. This also matches just p if no hs are present.
The * repeats the smallest possible preceding expression. (Use parentheses
if you want to repeat a larger expression.) It finds as many repetitions as
possible. For example, awk /\(c[ad][ad]*r x\)/ { print } sample prints
every record in sample containing a string of the form (car x), (cdr x),
(cadr x), and so on. Notice the escaping of the parentheses by preceding
them with backslashes.
{n}
{n,}
{n,m}
1
One or two numbers inside braces denote an interval expression. If there is one
number in the braces, the preceding regexp is repeated n times. If there are
In other literature, you may see a bracket expression referred to as either a character set, a character
class, or a character list.
wh{3,5}y
wh{2,}y
Interval expressions were not traditionally available in awk. They were added
as part of the POSIX standard to make awk and egrep consistent with each
other.
Initially, because old programs may use { and } in regexp constants, gawk
did not match interval expressions in regexps.
However, beginning with version 4.0, gawk does match interval expressions by
default. This is because compatibility with POSIX has become more important
to most gawk users than compatibility with old programs.
For programs that use { and } in regexp constants, it is good practice to
always escape them with a backslash. Then the regexp constants are valid and
work the way you want them to, using any version of awk.2
In regular expressions, the *, +, and ? operators, as well as the braces { and },
have the highest precedence, followed by concatenation, and finally by |. As in arithmetic,
parentheses can change how operators are grouped.
In POSIX awk and gawk, the *, +, and ? operators stand for themselves when there
is nothing in the regexp that precedes them. For example, /+/ matches a literal plus sign.
However, many other versions of awk treat such a usage as a syntax error.
If gawk is in compatibility mode (see Section 2.2 [Command-Line Options], page 25),
interval expressions are not available in regular expressions.
Use two backslashes if youre using a string constant with a regexp operator or function.
specification for Extended Regular Expressions (EREs). POSIX EREs are based on the
regular expressions accepted by the traditional egrep utility.
Character classes are a feature introduced in the POSIX standard. A character class is
a special notation for describing lists of characters that have a specific attribute, but the
actual characters can vary from country to country and/or from character set to character
set. For example, the notion of what is an alphabetic character differs between the United
States and France.
A character class is only valid in a regexp inside the brackets of a bracket expression.
Character classes consist of [:, a keyword denoting the class, and :]. Table 3.1 lists the
character classes defined by the POSIX standard.
Class
[:alnum:]
[:alpha:]
[:blank:]
[:cntrl:]
[:digit:]
[:graph:]
[:lower:]
[:print:]
[:punct:]
[:space:]
[:upper:]
[:xdigit:]
Meaning
Alphanumeric characters.
Alphabetic characters.
Space and TAB characters.
Control characters.
Numeric characters.
Characters that are both printable and visible. (A space is printable but
not visible, whereas an a is both.)
Lowercase alphabetic characters.
Printable characters (characters that are not control characters).
Punctuation characters (characters that are not letters, digits, control characters, or space characters).
Space characters (such as space, TAB, and formfeed, to name a few).
Uppercase alphabetic characters.
Characters that are hexadecimal digits.
resent all of e, `e, and e. In this case, [[=e=]] is a regexp that matches
any of e,
e, or `
e.
These features are very valuable in non-English-speaking locales.
CAUTION: The library functions that gawk uses for regular expression matching currently recognize only POSIX character classes; they do not recognize
collating symbols or equivalence classes.
\S
\w
\W
\<
Matches the empty string at the beginning of a word. For example, /\<away/
matches away but not stowaway.
\>
Matches the empty string at the end of a word. For example, /stow\>/ matches
stow but not stowaway.
\y
Matches the empty string at either the beginning or the end of a word (i.e., the
word boundary). For example, \yballs?\y matches either ball or balls,
as a separate word.
\B
Matches the empty string that occurs between two word-constituent characters.
For example, /\Brat\B/ matches crate but it does not match dirty rat.
\B is essentially the opposite of \y.
There are two other operators that work on buffers. In Emacs, a buffer is, naturally, an
Emacs buffer. For other programs, gawks regexp library routines consider the entire string
to match as the buffer. The operators are:
\
Because ^ and $ always work in terms of the beginning and end of strings, these
operators dont add any new capabilities for awk. They are provided for compatibility with
other GNU software.
In other GNU software, the word-boundary operator is \b. However, that conflicts
with the awk languages definition of \b as backspace, so gawk uses a different letter. An
alternative method would have been to require two backslashes in the GNU operators, but
this was deemed too confusing. The current method of using \y for the GNU \b appears
to be the lesser of two evils.
The various command-line options (see Section 2.2 [Command-Line Options], page 25)
control how gawk interprets characters in regexps:
No options
In the default case, gawk provides all the facilities of POSIX regexps and the
previously described GNU regexp operators.
--posix
Only POSIX regexps are supported; the GNU operators are not special (e.g.,
\w matches a literal w). Interval expressions are allowed.
--traditional
Traditional Unix awk regexps are matched. The GNU operators are not special, and interval expressions are not available. The POSIX character classes
([[:alnum:]], etc.) are supported, as Brian Kernighans awk does support
them. Characters described by octal and hexadecimal escape sequences are
treated literally, even if they represent regexp metacharacters.
--re-interval
Allow interval expressions in regexps, if --traditional has been provided.
Otherwise, interval expressions are available by default.
IGNORECASE = 1
if (x ~ /ab/) ...
In general, you cannot use IGNORECASE to make certain rules case-insensitive and other
rules case-sensitive, because there is no straightforward way to set IGNORECASE just for
the pattern of a particular rule.3 To do this, use either bracket expressions or tolower().
However, one thing you can do with IGNORECASE only is dynamically turn case-sensitivity
on or off for all the rules at once.
IGNORECASE can be set on the command line or in a BEGIN rule (see Section 2.3 [Other
Command-Line Arguments], page 30; also see Section 7.1.4.1 [Startup and Cleanup Actions],
page 114). Setting IGNORECASE from the command line is a way to make a program caseinsensitive without having to edit it.
Both regexp and string comparison operations are affected by IGNORECASE.
In multibyte locales, the equivalences between upper- and lowercase characters are tested
based on the wide-character values of the locales character set. Otherwise, the characters
are tested based on the ISO-8859-1 (ISO Latin-1) character set. This character set is a
superset of the traditional 128 ASCII characters, which also provides a number of characters
suitable for use with European languages.4
The value of IGNORECASE has no effect if gawk is in compatibility mode (see Section 2.2
[Command-Line Options], page 25). Case is always significant in compatibility mode.
Experienced C and C++ programmers will note that it is possible, using something like IGNORECASE =
1 && /foObAr/ { ... } and IGNORECASE = 0 || /foobar/ { ... }. However, this is somewhat obscure
and we dont recommend it.
If you dont understand this, dont worry about it; it just means that gawk does the right thing.
49
B
a 300
555-3412
2400
a alpo-net
a 1200
A
a 300
555-7685
1200
a barfly
A
a 300
555-1675
2400
a bites
1200
a
A
a 300
555-0542
300
C
a camelot
555-2912
1200
a core
C
a 300
555-1234
2400
a fooey
a 1200
B
a 300
555-6699
1200
a foot
B
a 300
555-6480
1200
a macfoo
A
a 300
555-3430
2400
a sdace
a 1200
A
a 300
555-2127
1200
a sabafoo
C
a 300
a
Note that the entry for the camelot BBS is not split. In the original data file (see
Section 1.2 [Data Files for the Examples], page 16), the line looks like this:
camelot
555-0542
300
C
It has one baud rate only, so there are no slashes in the record, unlike the others which have
two or more baud rates. In fact, this record is treated as part of the record for the core
BBS; the newline separating them in the output is the original newline in the data file, not
the one added by awk when it printed the record!
Another way to change the record separator is on the command line, using the variableassignment feature (see Section 2.3 [Other Command-Line Arguments], page 30):
awk { print $0 } RS="/" BBS-list
This sets RS to / before processing BBS-list.
Using an unusual character such as / for the record separator produces correct behavior
in the vast majority of cases. However, the following (extreme) pipeline prints a surprising
1:
$ echo | awk BEGIN { RS = "a" } ; { print NF }
a 1
There is one field, consisting of a newline. The value of the built-in variable NF is the
number of fields in the current record.
Reaching the end of an input file terminates the current input record, even if the last
character in the file is not the character in RS.
51
The empty string "" (a string without any characters) has a special meaning as the value
of RS. It means that records are separated by one or more blank lines and nothing else. See
Section 4.8 [Multiple-Line Records], page 64, for more details.
If you change the value of RS in the middle of an awk run, the new value is used to
delimit subsequent records, but the record currently being processed, as well as records
already processed, are not affected.
After the end of the record has been determined, gawk sets the variable RT to the text
in the input that matched RS.
When using gawk, the value of RS is not limited to a one-character string. It can be
any regular expression (see Chapter 3 [Regular Expressions], page 37). (c.e.) In general,
each record ends at the next string that matches the regular expression; the next record
starts at the end of the matching string. This general rule is actually at work in the usual
case, where RS contains just a newline: a record ends at the beginning of the next matching
string (the next newline in the input), and the following record starts just after the end of
this string (at the first character of the following line). The newline, because it matches RS,
is not part of either record.
When RS is a single character, RT contains the same single character. However, when RS is
a regular expression, RT contains the actual input text that matched the regular expression.
If the input file ended without any text that matches RS, gawk sets RT to the null string.
The following example illustrates both of these features. It sets RS equal to a regular
expression that matches either a newline or a series of one or more uppercase letters with
optional leading and/or trailing whitespace:
$ echo record 1 AAAA record 2 BBBB record 3 |
> gawk BEGIN { RS = "\n|( *[[:upper:]]+ *)" }
>
{ print "Record =", $0, "and RT =", RT }
a Record = record 1 and RT = AAAA
a Record = record 2 and RT = BBBB
a Record = record 3 and RT =
a
The final line of output has an extra blank line. This is because the value of RT is a newline,
and the print statement supplies its own terminating newline. See Section 13.3.8 [A Simple
Stream Editor], page 275, for a more useful example of RS as a regexp and RT.
If you set RS to a regular expression that allows optional trailing text, such as RS =
"abc(XYZ)?" it is possible, due to implementation constraints, that gawk may match the
leading part of the regular expression, but not the trailing part, particularly if the input
text that could match the trailing part is fairly long. gawk attempts to avoid this problem,
but currently, theres no guarantee that this will never happen.
NOTE: Remember that in awk, the ^ and $ anchor metacharacters match the
beginning and end of a string, and not the beginning and end of a line. As a
result, something like RS = "^[[:upper:]]" can only match at the beginning
of a file. This is because gawk views the input file as one long string that
happens to contain newline characters in it. It is thus best to avoid anchor
characters in the value of RS.
The use of RS as a regular expression and the RT variable are gawk extensions; they are
not available in compatibility mode (see Section 2.2 [Command-Line Options], page 25). In
compatibility mode, only the first character of the value of RS is used to determine the end
of the record.
gawk in fact accepts this, and uses the nul character for the record separator. However,
this usage is not portable to other awk implementations.
All other awk implementations1 store strings internally as C-style strings. C strings use
the nul character as the string terminator. In effect, this means that RS = "\0" is the
same as RS = "".
The best way to treat a whole file as a single record is to simply read the file in, one
record at a time, concatenating each record onto the end of the previous ones.
53
the record has only seven fields), you get the empty string. (If used in a numeric operation,
you get zero.)
The use of $0, which looks like a reference to the zero-th field, is a special case: it
represents the whole input record when you are not interested in specific fields. Here are
some more examples:
$ awk $1 ~ /foo/ { print $0 } BBS-list
555-1234
2400/1200/300
B
a fooey
555-6699
1200/300
B
a foot
555-6480
1200/300
A
a macfoo
555-2127
1200/300
C
a sabafoo
This example prints each record in the file BBS-list whose first field contains the string
foo. The operator ~ is called a matching operator (see Section 3.1 [How to Use Regular
Expressions], page 37); it tests whether a string (here, the field $1) matches a given regular
expression.
By contrast, the following example looks for foo in the entire record and prints the
first field and the last field for each matching input record:
$ awk /foo/ { print $1, $NF } BBS-list
a fooey B
a foot B
a macfoo A
a sabafoo C
reference a negative field number. gawk notices this and terminates your program. Other
awk implementations may behave differently.)
As mentioned in Section 4.2 [Examining Fields], page 52, awk stores the current records
number of fields in the built-in variable NF (also see Section 7.5 [Built-in Variables],
page 126). The expression $NF is not a special featureit is the direct consequence of
evaluating NF and using its value as a field number.
55
Creating a new field changes awks internal copy of the current input record, which is
the value of $0. Thus, if you do print $0 after adding a field, the record printed includes
the new field, with the appropriate number of field separators between it and the previously
existing fields.
This recomputation affects and is affected by NF (the number of fields; see Section 4.2
[Examining Fields], page 52). For example, the value of NF is set to the number of the
highest field you create. The exact format of $0 is also affected by a feature that has
not been discussed yet: the output field separator, OFS, used to separate the fields (see
Section 5.3 [Output Separators], page 75).
Note, however, that merely referencing an out-of-range field does not change the value
of either $0 or NF. Referencing an out-of-range field only produces an empty string. For
example:
if ($(NF+1) != "")
print "cant happen"
else
print "everything is normal"
should print everything is normal, because NF+1 is certain to be out of range. (See
Section 7.4.1 [The if-else Statement], page 118, for more information about awks if-else
statements. See Section 6.3.2 [Variable Typing and Comparison Expressions], page 102, for
more information about the != operator.)
It is important to note that making an assignment to an existing field changes the value
of $0 but does not change the value of NF, even when you assign the empty string to a field.
For example:
$ echo a b c d | awk { OFS = ":"; $2 = ""
>
print $0; print NF }
a a::c:d
a 4
The field is still there; it just has an empty value, denoted by the two colons between a
and c. This example shows what happens if you create a new field:
$ echo a b c d | awk { OFS = ":"; $2 = ""; $6 = "new"
>
print $0; print NF }
a a::c:d::new
a 6
The intervening field, $5, is created with an empty value (indicated by the second pair of
adjacent colons), and NF is updated with the value six.
Decrementing NF throws away the values of the fields after the new value of NF and
recomputes $0. Here is an example:
$ echo a b c d e f | awk { print "NF =", NF;
>
NF = 3; print $0 }
a NF = 6
a a b c
CAUTION: Some versions of awk dont rebuild $0 when NF is decremented.
Caveat emptor.
Finally, there are times when it is convenient to force awk to rebuild the entire record,
using the current value of the fields and OFS. To do this, use the seemingly innocuous
assignment:
$1 = $1
print $0
This forces awk rebuild the record. It does help to add a comment, as weve shown here.
There is a flip side to the relationship between $0 and the fields. Any assignment to $0
causes the record to be reparsed into fields using the current value of FS. This also applies
to any built-in function that updates $0, such as sub() and gsub() (see Section 9.1.3
[String-Manipulation Functions], page 149).
57
$ echo a
>
a a
Traditionally, the behavior of FS equal to "" was not defined. In this case, most versions
of Unix awk simply treat the entire record as only having one field. In compatibility mode
(see Section 2.2 [Command-Line Options], page 25), if FS is the null string, then gawk also
behaves this way.
59
{ print $1 }
Lets also set FS to be the - character and run the program on the file BBS-list. The
following command prints a list of the names of the bulletin boards that operate at 300
baud and the first three digits of their phone numbers:
$ awk -F- -f baud.awk BBS-list
555
a aardvark
a alpo
555
a barfly
555
a bites
555
a camelot
555
a core
555
a fooey
555
a foot
555
a macfoo
555
a sdace
555
a sabafoo
Note the second line of output. The second line in the original file looked like this:
alpo-net
555-3412
2400/1200/300
The - as part of the systems name was used as the field separator, instead of the -
in the phone number that was originally intended. This demonstrates why you have to be
careful in choosing your field and record separators.
Perhaps the most common use of a single character as the field separator occurs when
processing the Unix system password file. On many Unix systems, each user has a separate
entry in the system password file, one line per user. The information in these lines is
separated by colons. The first field is the users login name and the second is the users
(encrypted or shadow) password. A password file entry might look like this:
arnold:xyzzy:2076:10:Arnold Robbins:/home/arnold:/bin/bash
The following program searches the system password file and prints the entries for users
who have no password:
awk -F: $2 == "" /etc/passwd
61
the difference between the two methods. (The sed3 command prints just the first line of
/etc/passwd.)
sed 1q /etc/passwd | awk { FS = ":" ; print $1 }
which usually prints:
root
on an incorrect implementation of awk, while gawk prints something like:
root:nSijPlPhZZwgE:0:0:Root:/:
The sed utility is a stream editor. Its behavior is also defined by the POSIX standard.
10:06pm
User
hzuo
hzang
eklye
dportein
gierd
dave
brent
dave
PCPU what
5 vi p24.tex
-csh
1 em thes.tex
-csh
elm
4 w
4:41 bash
46 wnewmail
The following program takes the above input, converts the idle time to number of seconds,
and prints out the first two fields and the calculated idle time:
NOTE: This program uses a number of awk features that havent been introduced yet.
BEGIN { FIELDWIDTHS = "9 6 10 6 7 7 35" }
NR > 2 {
idle = $4
sub(/^ */, "", idle)
# strip leading spaces
if (idle == "")
idle = 0
if (idle ~ /:/) {
split(idle, t, ":")
idle = t[1] * 60 + t[2]
}
if (idle ~ /days/)
idle *= 24 * 60 * 60
print $1, $2, idle
}
Running the program on the data produces the following results:
hzuo
hzang
eklye
dportein
gierd
dave
brent
dave
ttyV0
ttyV3
ttyV5
ttyV6
ttyD3
ttyD4
ttyp0
ttyq4
0
50
0
107
1
0
286
1296000
Another (possibly more practical) example of fixed-width input data is the input from
a deck of balloting cards. In some parts of the United States, voters mark their choices by
punching holes in computer cards. These cards are then processed to count the votes for
any particular candidate or on any particular issue. Because a voter may choose not to vote
on some issue, any column on the card may be empty. An awk program for processing such
data could use the FIELDWIDTHS feature to simplify reading the data. (Of course, getting
gawk to run on a system with card readers is another story!)
63
Assigning a value to FS causes gawk to use FS for field splitting again. Use FS = FS to
make this happen, without having to know the current value of FS. In order to tell which
kind of field splitting is in effect, use PROCINFO["FS"] (see Section 7.5.2 [Built-in Variables
That Convey Information], page 129). The value is "FS" if regular field splitting is being
used, or it is "FIELDWIDTHS" if fixed-width field splitting is being used:
if (PROCINFO["FS"] == "FS")
regular field splitting ...
else if (PROCINFO["FS"] == "FIELDWIDTHS")
fixed-width field splitting ...
else
content-based field splitting ... (see next section)
This information is useful when writing a function that needs to temporarily change FS
or FIELDWIDTHS, read some records, and then restore the original settings (see Section 12.5
[Reading the User Database], page 230, for an example of such a function).
{
print "NF = ", NF
for (i = 1; i <= NF; i++) {
printf("$%d = <%s>\n", i, $i)
}
}
When run, we get the following:
$ gawk -f simple-csv.awk addresses.csv
NF = 7
$1 = <Robbins>
$2 = <Arnold>
$3 = <"1234 A Pretty Street, NE">
$4 = <MyTown>
$5 = <MyState>
$6 = <12345-6789>
$7 = <USA>
Note the embedded comma in the value of $3.
A straightforward improvement when processing CSV data of this sort would be to
remove the quotes when they occur, with something like this:
if (substr($i, 1, 1) == "\"") {
len = length($i)
$i = substr($i, 2, len - 2)
# Get text within the two quotes
}
As with FS, the IGNORECASE variable (see Section 7.5.1 [Built-in Variables That Control
awk], page 127) affects field splitting with FPAT.
Similar to FIELDWIDTHS, the value of PROCINFO["FS"] will be "FPAT" if content-based
field splitting is being used.
NOTE: Some programs export CSV data that contains embedded newlines
between the double quotes. gawk provides no way to deal with this. Since there
is no formal specification for CSV data, there isnt much more to be done; the
FPAT mechanism provides an elegant solution for the majority of cases, and the
gawk maintainer is satisfied with that.
As written, the regexp used for FPAT requires that each field have a least one character.
A straightforward modification (changing changed the first + to *) allows fields to be
empty:
FPAT = "([^,]*)|(\"[^\"]+\")"
Finally, the patsplit() function makes the same functionality available for splitting
regular strings (see Section 9.1.3 [String-Manipulation Functions], page 149).
65
One technique is to use an unusual character or string to separate records. For example,
you could use the formfeed character (written \f in awk, as in C) to separate them, making
each record a page of the file. To do this, just set the variable RS to "\f" (a string containing
the formfeed character). Any other character could equally well be used, as long as it wont
be part of the data in a record.
Another technique is to have blank lines separate records. By a special dispensation, an
empty string as the value of RS indicates that records are separated by one or more blank
lines. When RS is set to the empty string, each record always ends at the first blank line
encountered. The next record doesnt start until the first nonblank line that follows. No
matter how many blank lines appear in a row, they all act as one record separator. (Blank
lines must be completely empty; lines that contain only whitespace do not count.)
You can achieve the same effect as RS = "" by assigning the string "\n\n+" to RS. This
regexp matches the newline at the end of the record and one or more blank lines after the
record. In addition, a regular expression always matches the longest possible sequence when
there is a choice (see Section 3.7 [How Much Text Matches?], page 46). So the next record
doesnt start until the first nonblank line that followsno matter how many blank lines
appear in a row, they are considered one record separator.
There is an important difference between RS = "" and RS = "\n\n+". In the first case,
leading newlines in the input data file are ignored, and if a file ends without extra blank
lines after the last record, the final newline is removed from the record. In the second case,
this special processing is not done.
Now that the input is separated into records, the second step is to separate the fields
in the record. One way to do this is to divide each of the lines into fields in the normal
manner. This happens by default as the result of a special feature. When RS is set to the
empty string, and FS is set to a single character, the newline character always acts as a
field separator. This is in addition to whatever field separations result from FS.5
The original motivation for this special exception was probably to provide useful behavior
in the default case (i.e., FS is equal to " "). This feature can be a problem if you really
dont want the newline character to separate fields, because there is no way to prevent
it. However, you can work around this by using the split() function to break up the
record manually (see Section 9.1.3 [String-Manipulation Functions], page 149). If you have
a single character field separator, you can work around the special feature in a different way,
by making FS into a regexp for that single character. For example, if the field separator is
a percent character, instead of FS = "%", use FS = "[%]".
Another way to separate fields is to put each field on a separate line: to do this, just
set the variable FS to the string "\n". (This single character separator matches a single
newline.) A practical example of a data file organized this way might be a mailing list, where
each entry is separated by blank lines. Consider a mailing list in a file named addresses,
which looks like this:
Jane Doe
123 Main Street
Anywhere, SE 12345-6789
5
When FS is the null string ("") or a regexp, this special feature of RS does not apply. It does apply to
the default field separator of a single space: FS = " ".
John Smith
456 Tree-lined Avenue
Smallville, MW 98765-4321
...
A simple program to process this file is as follows:
# addrs.awk --- simple mailing list program
# Records are separated by blank lines.
# Each line is one field.
BEGIN { RS = "" ; FS = "\n" }
{
print
print
print
print
"Name is:", $1
"Address is:", $2
"City and State are:", $3
""
}
Running the program produces the following output:
$ awk -f addrs.awk addresses
a Name is: Jane Doe
a Address is: 123 Main Street
a City and State are: Anywhere, SE 12345-6789
a
a Name is: John Smith
a Address is: 456 Tree-lined Avenue
a City and State are: Smallville, MW 98765-4321
a
...
See Section 13.3.4 [Printing Mailing Labels], page 267, for a more realistic program that
deals with address lists. The following table summarizes how records are split, based on
the value of RS:
RS == "\n"
Records are separated by the newline character (\n). In effect, every line in
the data file is a separate record, including blank lines. This is the default.
RS == any single character
Records are separated by each occurrence of the character. Multiple successive
occurrences delimit empty records.
RS == ""
Records are separated by runs of blank lines. When FS is a single character, then
the newline character always serves as a field separator, in addition to whatever
value FS may have. Leading and trailing newlines in a file are ignored.
RS == regexp
Records are separated by occurrences of characters that match regexp. Leading
and trailing matches of regexp delimit empty records. (This is a gawk extension;
it is not specified by the POSIX standard.)
67
In all cases, gawk sets RT to the input text that matched the value specified by RS. But if
the input file ended without any text that matches RS, then gawk sets RT to the null string.
69
Section 13.3.9 [An Easy Way to Use Library Functions], page 276, for a program that does
handle nested @include statements.
ttyv0
ttyp0
ttyp1
Jul 13 14:22
Jul 13 14:23
Jul 13 14:23
(murphy:0)
(murphy:0)
Notice that this program ran the command who and printed the previous result. (If you try
this program yourself, you will of course get different results, depending upon who is logged
in on your system.)
This variation of getline splits the record into fields, sets the value of NF, and recomputes the value of $0. The values of NR and FNR are not changed.
According to POSIX, expression | getline is ambiguous if expression contains unparenthesized operators other than $for example, "echo " "date" | getline is ambiguous because the concatenation operator is not parenthesized. You should write it as
("echo " "date") | getline if you want your program to be portable to all awk implementations.
71
When getline changes the value of $0 and NF, awk does not automatically jump to the
start of the program and start testing the new record against every pattern. However,
the new record is tested against any subsequent rules.
Many awk implementations limit the number of pipelines that an awk program may
have open to just one. In gawk, there is no such limit. You can open as many pipelines
(and coprocesses) as the underlying operating system permits.
An interesting side effect occurs if you use getline without a redirection inside a BEGIN
rule. Because an unredirected getline reads from the command-line data files, the first
getline command causes awk to set the value of FILENAME. Normally, FILENAME does
not have a value inside BEGIN rules, because you have not yet started to process the
command-line data files. (See Section 7.1.4 [The BEGIN and END Special Patterns],
page 114, also see Section 7.5.2 [Built-in Variables That Convey Information], page 129.)
Using FILENAME with getline (getline < FILENAME) is likely to be a source for confusion. awk opens a separate input stream from the current input file. However, by
not using a variable, $0 and NR are still updated. If youre doing this, its probably by
accident, and you should reconsider what it is youre trying to accomplish.
Section 4.9.10 [Summary of getline Variants], page 72, presents a table summarizing
the getline variants and which variables they can affect. It is worth noting that those
variants which do not use redirection can cause FILENAME to be updated if they cause
awk to start reading a new input file.
Variant
getline
getline var
getline < file
getline var < file
command | getline
command | getline var
command |& getline
command |& getline var
Effect
Sets $0, NF, FNR, and NR
Sets var, FNR, and NR
Sets $0 and NF
Sets var
Sets $0 and NF
Sets var
Sets $0 and NF
Sets var
Standard / Extension
Standard
Standard
Standard
Standard
Standard
Standard
Extension
Extension
5 Printing Output
One of the most common programming actions is to print, or output, some or all of the
input. Use the print statement for simple output, and the printf statement for fancier
formatting. The print statement is not limited when computing which values to print.
However, with two exceptions, you cannot specify how to print themhow many columns,
whether to use exponential notation or not, and so on. (For the exceptions, see Section 5.3
[Output Separators], page 75, and Section 5.4 [Controlling Numeric Output with print],
page 75.) For printing with specifications, you need the printf statement (see Section 5.5
[Using printf Statements for Fancier Printing], page 76).
Besides basic and formatted printing, this chapter also covers I/O redirections to files
and pipes, introduces the special file names that gawk processes internally, and discusses
the close() built-in function.
The next example, which is run on the inventory-shipped file, prints the first two
fields of each input record, with a space between them:
$ awk { print $1, $2 } inventory-shipped
a Jan 13
a Feb 15
a Mar 15
...
A common mistake in using the print statement is to omit the comma between two
items. This often has the effect of making the items run together in the output, with
no space. The reason for this is that juxtaposing two string expressions in awk means to
concatenate them. Here is the same program, without the comma:
$ awk { print $1 $2 } inventory-shipped
a Jan13
a Feb15
a Mar15
...
To someone unfamiliar with the inventory-shipped file, neither examples output
makes much sense. A heading line at the beginning would make it clearer. Lets add some
headings to our table of months ($1) and green crates shipped ($2). We do this using the
BEGIN pattern (see Section 7.1.4 [The BEGIN and END Special Patterns], page 114) so that
the headings are only printed once:
awk BEGIN {
{
According to the POSIX standard, awks behavior is undefined if OFMT contains anything
but a floating-point conversion specification.
%c
%d, %i
Print a decimal integer. The two control letters are equivalent. (The %i
specification is for compatibility with ISO C.)
%e, %E
%f
%F
Like %f but the infinity and not a number values are spelled using uppercase
letters.
The %F format is a POSIX extension to ISO C; not all systems support it. On
those that dont, gawk uses %f instead.
%g, %G
Print a number in either scientific notation or in floating-point notation, whichever uses fewer characters; if the result is printed in scientific notation, %G uses
E instead of e.
%o
Print an unsigned octal integer (see Section 6.1.1.2 [Octal and Hexadecimal
Numbers], page 89).
%s
Print a string.
%u
%x, %X
%%
Print a single %. This does not consume an argument and it ignores any
modifiers.
NOTE: When using the integer format-control letters for values that are outside
the range of the widest C integer type, gawk switches to the %g format specifier.
If --lint is provided on the command line (see Section 2.2 [Command-Line
Options], page 25), gawk warns about this. Other versions of awk may print
invalid values or do something else entirely.
The minus sign, used before the width modifier (see later on in this list), says
to left-justify the argument within its specified width. Normally, the argument
is printed right-justified in the specified width. Thus:
printf "%-4s", "foo"
prints foo.
space
For numeric conversions, prefix positive values with a space and negative values
with a minus sign.
The plus sign, used before the width modifier (see later on in this list), says
to always supply a sign for numeric conversions, even if the data to format is
positive. The + overrides the space modifier.
Use an alternate form for certain control letters. For %o, supply a leading
zero. For %x and %X, supply a leading 0x or 0X for a nonzero result. For
%e, %E, %f, and %F, the result always contains a decimal point. For %g
and %G, trailing zeros are not removed from the result.
A leading 0 (zero) acts as a flag that indicates that output should be padded
with zeros instead of spaces. This applies only to the numeric output formats.
This flag only has an effect when the field width is wider than the value to
print.
width
.prec
%s
In this case, the phone numbers had to be printed as strings because the numbers are
separated by a dash. Printing the phone numbers as numbers would have produced just
the first three digits: 555. This would have been pretty confusing.
It wasnt necessary to specify a width for the phone numbers because they are last on
their lines. They dont need to have spaces after them.
The table could be made to look even nicer by adding headings to the tops of the
columns. This is done using the BEGIN pattern (see Section 7.1.4 [The BEGIN and END
Special Patterns], page 114) so that the headers are only printed once, at the beginning of
the awk program:
awk BEGIN { print "Name
Number"
print "---------" }
{ printf "%-10s %s\n", $1, $2 } BBS-list
The above example mixes print and printf statements in the same program. Using
just printf statements can produce the same results:
awk BEGIN { printf "%-10s %s\n", "Name", "Number"
printf "%-10s %s\n", "----", "------" }
{ printf "%-10s %s\n", $1, $2 } BBS-list
Printing each column heading with the same format specification used for the column elements ensures that the headings are aligned just like the columns.
The fact that the same format specification is used three times can be emphasized by
storing it in a variable, like this:
awk BEGIN { format = "%-10s %s\n"
printf format, "Name", "Number"
printf format, "----", "------" }
{ printf format, $1, $2 } BBS-list
At this point, it would be a worthwhile exercise to use the printf statement to line up
the headings and table data for the inventory-shipped example that was covered earlier
in the section on the print statement (see Section 5.1 [The print Statement], page 73).
where all the file names are stored in uppercase, and you wish to rename them to have
names in all lowercase. The following program is both simple and efficient:
{ printf("mv %s %s\n", $0, tolower($0)) | "sh" }
END { close("sh") }
The tolower() function returns its argument string with all uppercase characters converted to lowercase (see Section 9.1.3 [String-Manipulation Functions], page 149). The
program builds up a list of command lines, using the mv utility to rename the files. It then
sends the list to the shell for execution.
/dev/stdout
The standard output (file descriptor 1).
/dev/stderr
The standard error output (file descriptor 2).
/dev/fd/N
The file associated with file descriptor N. Such a file must be opened by the
program initiating the awk execution (typically the shell). Unless special pains
are taken in the shell from which gawk is invoked, only descriptors 0, 1, and 2
are available.
The file names /dev/stdin, /dev/stdout, and /dev/stderr are aliases for
/dev/fd/0, /dev/fd/1, and /dev/fd/2, respectively. However, they are more
self-explanatory. The proper way to write an error message in a gawk program is to use
/dev/stderr, like this:
print "Serious error detected!" > "/dev/stderr"
Note the use of quotes around the file name. Like any other redirection, the value must
be a string. It is a common error to omit the quotes, which leads to confusing results.
Finally, using the close() function on a file name of the form "/dev/fd/N", for file
descriptor numbers above two, will actually close the given file descriptor.
The /dev/stdin, /dev/stdout, and /dev/stderr special files are also recognized
internally by several other versions of awk.
To run the same program a second time, with the same arguments. This is not the
same thing as giving more input to the first run!
For example, suppose a program pipes output to the mail program. If it outputs
several lines redirected to this pipe without closing it, they make a single message of
several lines. By contrast, if the program closes the pipe after each line of output, then
each line makes a separate message.
If you use more files than the system allows you to have open, gawk attempts to multiplex
the available open files among your data files. gawks ability to do this depends upon the
facilities of your operating system, so it may not always work. It is therefore both good
practice and good portability advice to always use close() on your files when you are done
with them. In fact, if you are using a lot of pipes, it is essential that you close commands
when done. For example, consider something like this:
{
...
command = ("grep " $1 " /some/file | my_prog -q " $3)
while ((command | getline) > 0) {
process output of command
}
# need close(command) here
}
This example creates a new pipeline based on data in each record. Without the call to
close() indicated in the comment, awk creates child processes to run the commands, until
it eventually runs out of file descriptors for more pipelines.
Even though each command has finished (as indicated by the end-of-file return status
from getline), the child process is not terminated;2 more importantly, the file descriptor
for the pipe is not closed and released until close() is called or awk exits.
close() will silently do nothing if given an argument that does not represent a file, pipe
or coprocess that was opened with a redirection.
Note also that close(FILENAME) has no magic effects on the implicit loop that reads
through the files named on the command line. It is, more likely, a close of a file that was
never opened, so awk silently does nothing.
When using the |& operator to communicate with a coprocess, it is occasionally useful
to be able to close one end of the two-way pipe without closing the other. This is done
by supplying a second argument to close(). As in any other call to close(), the first
argument is the name of the command or special file used to start the coprocess. The
second argument should be a string, with either of the values "to" or "from". Case does
not matter. As this is an advanced feature, a more complete discussion is delayed until
Section 11.3 [Two-Way Communications with Another Process], page 203, which discusses
it in more detail and gives an example.
The technical terminology is rather morbid. The finished child is called a zombie, and cleaning up
after it is referred to as reaping.
command = "..."
command | getline info
retval = close(command) # syntax error in many Unix awks
gawk treats close() as a function. The return value is 1 if the argument names
something that was never opened with a redirection, or if there is a system problem closing
the file or process. In these cases, gawk sets the built-in variable ERRNO to a string describing
the problem.
In gawk, when closing a pipe or coprocess (input or output), the return value is the exit
status of the command.3 Otherwise, it is the return value from the systems close() or
fclose() C functions when closing input or output files, respectively. This value is zero if
the close succeeds, or 1 if it fails.
The POSIX standard is very vague; it says that close() returns zero on success and
nonzero otherwise. In general, different implementations vary in what they report when
closing pipes; thus the return value cannot be used portably.
In POSIX mode (see
Section 2.2 [Command-Line Options], page 25), gawk just returns zero when closing a pipe.
This is a full 16-bit value as returned by the wait() system call. See the system manual pages for
information on how to decode this value.
Chapter 6: Expressions
89
6 Expressions
Expressions are the basic building blocks of awk patterns and actions. An expression evaluates to a value that you can print, test, or pass to a function. Additionally, an expression
can assign a new value to a variable or a field by using an assignment operator.
An expression can serve as a pattern or action statement on its own. Most other kinds
of statements contain one or more expressions that specify the data on which to operate.
As in other languages, expressions in awk include variables, array references, constants, and
function calls, as well as combinations of these with various operators.
The internal representation of all numbers, including integers, uses double precision floating-point numbers. On most modern systems, these are in IEEE 754 standard format.
irrelevant; hexadecimal a and A have the same value.) Thus, 11, in hexadecimal, is 1
times 16 plus 1, which equals 17 in decimal.
Just by looking at plain 11, you cant tell what base its in. So, in C, C++, and other
languages derived from C, there is a special notation to signify the base. Octal numbers
start with a leading 0, and hexadecimal numbers start with a leading 0x or 0X:
11
011
0x11
Chapter 6: Expressions
91
6.1.3 Variables
Variables are ways of storing values at one point in your program for use later in another
part of your program. They can be manipulated entirely within the program text, and they
can also be assigned values on the awk command line.
Chapter 6: Expressions
93
the variable is set at the very beginning, even before the BEGIN rules execute. The -v
option and its assignment must precede all the file name arguments, as well as the program
text. (See Section 2.2 [Command-Line Options], page 25, for more information about the
-v option.) Otherwise, the variable assignment is performed at a time determined by its
position among the input file argumentsafter the processing of the preceding input file
argument. For example:
awk { print $n } n=4 inventory-shipped n=2 BBS-list
prints the value of field number n for all input records. Before the first file is read, the
command line sets the variable n equal to four. This causes the fourth field to be printed
in lines from inventory-shipped. After the first file has finished, but before the second
file is started, n is set to two, so that the second field is printed in lines from BBS-list:
$ awk { print $n } n=4 inventory-shipped n=2 BBS-list
a 15
a 24
...
a 555-5553
a 555-3412
...
Command-line arguments are made available for explicit examination by the awk program in the ARGV array (see Section 7.5.3 [Using ARGC and ARGV], page 133). awk processes
the values of command-line assignments for escape sequences (see Section 3.2 [Escape Sequences], page 38).
Pathological cases can require up to 752 digits (!), but we doubt that you need to worry about this.
Chapter 6: Expressions
95
The en_DK locale is for English in Denmark, where the comma acts as the decimal point
separator. In the normal "C" locale, gawk treats 4,321 as 4, while in the Danish locale,
its treated as the full number, 4.321.
Some earlier versions of gawk fully complied with this aspect of the standard. However, many users in non-English locales complained about this behavior, since their data
used a period as the decimal point, so the default behavior was restored to use a period as
the decimal point character. You can use the --use-lc-numeric option (see Section 2.2
[Command-Line Options], page 25) to force gawk to use the locales decimal point character. (gawk also uses the locales decimal point character when in POSIX mode, either via
--posix, or the POSIXLY_CORRECT environment variable.)
Table 6.1 describes the cases in which the locales decimal point character is used and
when a period is used. Some of these features have not been described yet.
Feature
%g
%g
Input
strtonum()
Default
Use locale
Use period
Use period
Use period
--posix or --use-lc-numeric
Use locale
Use locale
Use locale
Use locale
The following list provides the arithmetic operators in awk, in order from the highest
precedence to the lowest:
-x
Negation.
+x
x^y
x ** y
Exponentiation; x raised to the y power. 2 ^ 3 has the value eight; the character sequence ** is equivalent to ^. (c.e.)
x*y
Multiplication.
x/y
Division; because all numbers in awk are floating-point numbers, the result is
not rounded to an integer3 / 4 has the value 0.75. (It is a common mistake,
especially for C programmers, to forget that all numbers in awk are floatingpoint, and that division of integer-looking constants produces a real number,
not an integer.)
x%y
Remainder; further discussion is provided in the text, just after this list.
x+y
Addition.
x-y
Subtraction.
Unary plus and minus have the same precedence, the multiplication operators all have
the same precedence, and addition and subtraction have the same precedence.
When computing the remainder of x % y, the quotient is rounded toward zero to an
integer and multiplied by y. This result is subtracted from x; this operation is sometimes
known as trunc-mod. The following relation always holds:
b * int(a / b) + (a % b) == a
One possibly undesirable effect of this definition of remainder is that x % y is negative if
x is negative. Thus:
-17 % 8 = -1
In other awk implementations, the signedness of the remainder may be machinedependent.
NOTE: The POSIX standard only specifies the use of ^ for exponentiation.
For maximum portability, do not use the ** operator.
Chapter 6: Expressions
97
It happens that Brian Kernighans awk, gawk and mawk all get it right, but you should not rely on this.
1
foo
"bar"
foo
When the second assignment gives foo a string value, the fact that it previously had a
numeric value is forgotten.
String values that do not begin with a digit have a numeric value of zero. After executing
the following code, the value of foo is five:
foo = "a string"
foo = foo + 5
NOTE: Using a variable as a number and then later as a string can be confusing
and is poor programming style. The previous two examples illustrate how awk
works, not how you should write your programs!
An assignment is an expression, so it has a valuethe same value that is assigned. Thus,
z = 1 is an expression with the value one. One consequence of this is that you can write
multiple assignments together, such as:
Chapter 6: Expressions
99
x = y = z = 5
This example stores the value five in all three variables (x, y, and z). It does so because
the value of z = 5, which is five, is stored into y and then the value of y = z = 5, which is
five, is stored into x.
Assignments may be used anywhere an expression is called for. For example, it is valid
to write x != (y = 1) to set y to one, and then test whether x equals one. But this style
tends to make programs hard to read; such nesting of assignments should be avoided, except
perhaps in a one-shot program.
Aside from =, there are several other assignment operators that do arithmetic with the
old value of the variable. For example, the operator += computes a new value by adding
the righthand value to the old value of the variable. Thus, the following assignment adds
five to the value of foo:
foo += 5
This is equivalent to the following:
foo = foo + 5
Use whichever makes the meaning of your program clearer.
There are situations where using += (or any assignment operator) is not the same as
simply repeating the lefthand operand in the righthand expression. For example:
# Thanks to Pat Rankin for this example
BEGIN {
foo[rand()] += 5
for (x in foo)
print x, foo[x]
bar[rand()] = bar[rand()] + 5
for (x in bar)
print x, bar[x]
}
The indices of bar are practically guaranteed to be different, because rand() returns different values each time it is called. (Arrays and the rand() function havent been covered yet.
See Chapter 8 [Arrays in awk], page 135, and see Section 9.1.2 [Numeric Functions], page 147,
for more information). This example illustrates an important fact about assignment operators: the lefthand expression is only evaluated once. It is up to the implementation as to
which expression is evaluated first, the lefthand or the righthand. Consider this example:
i = 1
a[i += 2] = i + 1
The value of a[3] could be either two or four.
Table 6.2 lists the arithmetic assignment operators. In each case, the righthand operand
is an expression whose value is converted to a number.
100
Operator
lvalue += increment
lvalue -= decrement
lvalue *= coefficient
lvalue /= divisor
lvalue %= modulus
lvalue ^= power
lvalue **= power
Effect
Adds increment to the value of lvalue.
Subtracts decrement from the value of lvalue.
Multiplies the value of lvalue by coefficient.
Divides the value of lvalue by divisor.
Sets lvalue to its remainder by modulus.
Raises lvalue to the power power. (c.e.)
+ 1 - 1 does not necessarily equal foo. But the difference is minute as long as you stick to
numbers that are fairly small (less than 10e12).
Fields and array elements are incremented just like variables. (Use $(i++) when you
want to do a field reference and a variable increment at the same time. The parentheses
are necessary because of the precedence of the field reference operator $.)
The decrement operator -- works just like ++, except that it subtracts one instead
of adding it. As with ++, it can be used before the lvalue to pre-decrement or after it to
post-decrement. Following is a summary of increment and decrement expressions:
++lvalue
Increment lvalue, returning the new value as the value of the expression.
lvalue++
Increment lvalue, returning the old value of lvalue as the value of the expression.
--lvalue
Decrement lvalue, returning the new value as the value of the expression. (This
expression is like ++lvalue, but instead of adding, it subtracts.)
lvalue--
Decrement lvalue, returning the old value of lvalue as the value of the expression. (This expression is like lvalue++, but instead of adding, it subtracts.)
102
and false from C. In awk, any nonzero numeric value or any nonempty string value is true.
Any other value (zero or the null string, "") is false. The following program prints A
strange truth value three times:
BEGIN {
if (3.1415927)
print "A strange truth value"
if ("Four Score And Seven Years Ago")
print "A strange truth value"
if (j = 57)
print "A strange truth value"
}
There is a surprising consequence of the nonzero or non-null rule: the string constant
"0" is actually true, because it is non-null.
gawk has followed these rules for many years, and it is gratifying that the POSIX standard is also now
correct.
}
When two operands are compared, either string comparison or numeric comparison may
be used. This depends upon the attributes of the operands, according to the following
symmetric matrix:
STRING
NUMERIC
STRNUM
STRING
NUMERIC
STRNUM
string
string
string
string
numeric
numeric
string
numeric
numeric
The basic idea is that user input that looks numericand only user inputshould be
treated as numeric, even though it is actually made of characters and is therefore also
a string. Thus, for example, the string constant " +3.14", when it appears in program
source code, is a stringeven though it looks numericand is never treated as number for
comparison purposes.
In short, when one operand is a pure string, such as a string constant, then a string
comparison is performed. Otherwise, a numeric comparison is performed.
This point bears additional emphasis: All user input is made of characters, and so is
first and foremost of string type; input strings that look numeric are additionally given
the strnum attribute. Thus, the six-character input string +3.14 receives the strnum
attribute. In contrast, the eight-character literal " +3.14" appearing in program text is a
string constant. The following examples print 1 when the comparison between the two
different constants is true, 0 otherwise:
$ echo
a 1
$ echo
a 0
$ echo
a 0
$ echo
a 1
$ echo
a 0
$ echo
a 1
$ echo
a 0
$ echo
a 1
True
False
False
True
False
True
False
True
104
Expression
x <y
x <= y
x >y
x >= y
x == y
x != y
x ~y
x !~ y
subscript in array
Result
True if x is less than y.
True if x is less than or equal to y.
True if x is greater than y.
True if x is greater than or equal to y.
True if x is equal to y.
True if x is not equal to y.
True if the string x matches the regexp denoted by y.
True if the string x does not match the regexp denoted by y.
True if the array array has an element with the subscript subscript.
In this example:
$ echo 1e2 3 | awk { print ($1 < $2) ? "true" : "false" }
a false
the result is false because both $1 and $2 are user input. They are numeric strings
therefore both have the strnum attribute, dictating a numeric comparison. The purpose of
the comparison rules and the use of numeric strings is to attempt to produce the behavior
that is least surprising, while still doing the right thing.
String comparisons and regular expression comparisons are very different. For example:
x == "foo"
has the value one, or is true if the variable x is precisely foo. By contrast:
x ~ /foo/
has the value one if x contains foo, such as "Oh, what a fool am I!".
The righthand operand of the ~ and !~ operators may be either a regexp constant
(/.../) or an ordinary expression. In the latter case, the value of the expression as a string
is used as a dynamic regexp (see Section 3.1 [How to Use Regular Expressions], page 37;
also see Section 3.8 [Using Dynamic Regexps], page 47).
In modern implementations of awk, a constant regular expression in slashes by itself is
also an expression. The regexp /regexp/ is an abbreviation for the following comparison
expression:
$0 ~ /regexp/
One special place where /foo/ is not an abbreviation for $0 ~ /foo/ is when it is the
righthand operand of ~ or !~. See Section 6.1.2 [Using Regular Expression Constants],
page 91, where this is discussed in more detail.
Technically, string comparison is supposed to behave the same way as if the strings are compared with
the C strcoll() function.
106
to control nesting. The truth value of the Boolean expression is computed by combining
the truth values of the component expressions. Boolean expressions are also referred to as
logical expressions. The terms are equivalent.
Boolean expressions can be used wherever comparison and matching expressions can be
used. They can be used in if, while, do, and for statements (see Section 7.4 [Control
Statements in Actions], page 118). They have numeric values (one if true, zero if false)
that come into play if the result of the Boolean expression is stored in a variable or used in
arithmetic.
In addition, every Boolean expression is also a valid pattern, so you can use one as a
pattern to control the execution of rules. The Boolean operators are:
boolean1 && boolean2
True if both boolean1 and boolean2 are true. For example, the following statement prints the current input record if it contains both 2400 and foo:
if ($0 ~ /2400/ && $0 ~ /foo/) print
The subexpression boolean2 is evaluated only if boolean1 is true. This can
make a difference when boolean2 contains expressions that have side effects. In
the case of $0 ~ /foo/ && ($2 == bar++), the variable bar is not incremented
if there is no substring foo in the record.
boolean1 || boolean2
True if at least one of boolean1 or boolean2 is true. For example, the following
statement prints all records in the input that contain either 2400 or foo or
both:
if ($0 ~ /2400/ || $0 ~ /foo/) print
The subexpression boolean2 is evaluated only if boolean1 is false. This can
make a difference when boolean2 contains expressions that have side effects.
! boolean True if boolean is false. For example, the following program prints no home!
in the unusual event that the HOME environment variable is not defined:
BEGIN { if (! ("HOME" in ENVIRON))
print "no home!" }
(The in operator is described in Section 8.1.2 [Referring to an Array Element],
page 136.)
The && and || operators are called short-circuit operators because of the way they
work. Evaluation of the full expression is short-circuited if the result can be determined
part way through its evaluation.
Statements that use && or || can be continued simply by putting a newline after them.
But you cannot put a newline in front of either of these operators without using backslash
continuation (see Section 1.6 [awk Statements Versus Lines], page 21).
The actual value of an expression using the ! operator is either one or zero, depending
upon the truth value of the expression it is applied to. The ! operator is often useful for
changing the sense of a flag variable from false to true and back again. For example, the
following program is one way to print lines in between special bracketing lines:
$1 == "START"
{ interested = ! interested; next }
interested == 1 { print }
$1 == "END"
{ interested = ! interested; next }
The variable interested, as with all awk variables, starts out initialized to zero, which is
also false. When a line is seen whose first field is START, the value of interested is toggled
to true, using !. The next rule prints lines as long as interested is true. When a line is
seen whose first field is END, interested is toggled back to false.6
NOTE: The next statement is discussed in Section 7.4.8 [The next Statement],
page 124. next tells awk to skip the rest of the rules, get the next record, and
start processing the rules over again at the top. The reason its there is to avoid
printing the bracketing START and END lines.
This program has a bug; it prints lines starting with END. How would you fix it?
108
use in your program. See Section 9.2 [User-Defined Functions], page 170, for instructions
on how to do this.
The way to use a function is with a function call expression, which consists of the
function name followed immediately by a list of arguments in parentheses. The arguments
are expressions that provide the raw materials for the functions calculations. When there
is more than one argument, they are separated by commas. If there are no arguments, just
write () after the function name. The following examples show function calls with and
without arguments:
sqrt(x^2 + y^2)
one argument
atan2(y, x)
two arguments
rand()
no arguments
CAUTION: Do not put any space between the function name and the
open-parenthesis! A user-defined function name looks just like the name of
a variablea space would make the expression look like concatenation of a
variable with an expression inside parentheses. With built-in functions, space
before the parenthesis is harmless, but it is best not to get into the habit of
using space to avoid mistakes with user-defined functions.
Each function expects a particular number of arguments. For example, the sqrt()
function must be called with a single argument, the number of which to take the square
root:
sqrt(argument)
Some of the built-in functions have one or more optional arguments. If those arguments
are not supplied, the functions use a reasonable default value. See Section 9.1 [Built-in
Functions], page 147, for full details. If arguments are omitted in calls to user-defined
functions, then those arguments are treated as local variables and initialized to the empty
string (see Section 9.2 [User-Defined Functions], page 170).
As an advanced feature, gawk provides indirect function calls, which is a way to choose
the function to call at runtime, instead of when you write the source code to your program.
We defer discussion of this feature until later; see Section 9.3 [Indirect Function Calls],
page 178.
Like every other expression, the function call has a value, which is computed by the
function based on the arguments you give it. In this example, the value of sqrt(argument)
is the square root of argument. The following program reads numbers, one number per line,
and prints the square root of each one:
$ awk { print "The square root of", $1, "is", sqrt($1) }
1
a The square root of 1 is 1
3
a The square root of 3 is 1.73205
5
a The square root of 5 is 2.23607
Ctrl-d
A function can also have side effects, such as assigning values to certain variables or doing
I/O. This program shows how the match() function (see Section 9.1.3 [String-Manipulation
Functions], page 149) changes the variables RSTART and RLENGTH:
{
if (match($1, $2))
print RSTART, RLENGTH
else
print "no match"
}
Here is a sample run:
$ awk -f matchit.awk
aaccdd c+
a 3 2
foo
bar
a no match
abcdefg e
a 5 1
Grouping.
Field reference.
++ --
Increment, decrement.
^ **
+-!
110
*/%
+-
Addition, subtraction.
String Concatenation
There is no special symbol for concatenation. The operands are simply written
side by side (see Section 6.2.2 [String Concatenation], page 96).
< <= == != > >= >> | |&
Relational and redirection. The relational operators and the redirections have
the same precedence level. Characters such as > serve both as relationals and
as redirections; the context distinguishes between the two meanings.
Note that the I/O redirection operators in print and printf statements belong
to the statement level, not to expressions. The redirection does not produce an
expression that could be the operand of another operator. As a result, it does
not make sense to use a redirection operator near another operator of lower
precedence without parentheses. Such combinations (for example, print foo
> a ? b : c), result in syntax errors. The correct way to write this statement
is print foo > (a ? b : c).
~ !~
Matching, nonmatching.
in
Array membership.
&&
Logical and.
||
Logical or.
?:
= += -= *= /= %= ^= **=
Assignment. These operators group right-to-left.
NOTE: The |&, **, and **= operators are not specified by POSIX. For
maximum portability, do not use them.
111
Special patterns for you to supply startup or cleanup actions for your awk
program. (See Section 7.1.4 [The BEGIN and END Special Patterns], page 114.)
BEGINFILE
ENDFILE
Special patterns for you to supply startup or cleanup actions to done on a per
file basis. (See Section 7.1.5 [The BEGINFILE and ENDFILE Special Patterns],
page 115.)
empty
The empty pattern matches every input record. (See Section 7.1.6 [The Empty
Pattern], page 116.)
112
time the rule is tested against a new input record. If the expression uses fields such as $1,
the value depends directly on the new input records text; otherwise, it depends on only
what has happened so far in the execution of the awk program.
Comparison expressions, using the comparison operators described in Section 6.3.2 [Variable Typing and Comparison Expressions], page 102, are a very common kind of pattern.
Regexp matching and nonmatching are also very common expressions. The left operand
of the ~ and !~ operators is a string. The right operand is either a constant regular
expression enclosed in slashes (/regexp/), or any expression whose string value is used as
a dynamic regular expression (see Section 3.8 [Using Dynamic Regexps], page 47). The
following example prints the second field of each input record whose first field is precisely
foo:
$ awk $1 == "foo" { print $2 } BBS-list
(There is no output, because there is no BBS site with the exact name foo.) Contrast
this with the following regular expression match, which accepts any record with a first field
that contains foo:
$ awk $1 ~ /foo/ { print $2 } BBS-list
a 555-1234
a 555-6699
a 555-6480
a 555-2127
A regexp constant as a pattern is also a special case of an expression pattern. The
expression /foo/ has the value one if foo appears in the current input record. Thus, as a
pattern, /foo/ matches any record containing foo.
Boolean expressions are also commonly used as patterns. Whether the pattern matches
an input record depends on whether its subexpressions match. For example, the following
command prints all the records in BBS-list that contain both 2400 and foo:
$ awk /2400/ && /foo/ BBS-list
555-1234
2400/1200/300
B
a fooey
The following command prints all records in BBS-list that contain either 2400 or
foo (or both, of course):
$ awk /2400/ || /foo/ BBS-list
555-3412
2400/1200/300
a alpo-net
555-1675
2400/1200/300
a bites
555-1234
2400/1200/300
a fooey
555-6699
1200/300
a foot
555-6480
1200/300
a macfoo
555-3430
2400/1200/300
a sdace
555-2127
1200/300
a sabafoo
A
A
B
B
A
A
C
The following command prints all records in BBS-list that do not contain the string
foo:
$ awk ! /foo/
a aardvark
a alpo-net
a barfly
BBS-list
555-5553
555-3412
555-7685
1200/300
2400/1200/300
1200/300
B
A
A
113
555-1675
2400/1200/300
A
a bites
555-0542
300
C
a camelot
555-2912
1200/300
C
a core
555-3430
2400/1200/300
A
a sdace
The subexpressions of a Boolean operator in a pattern can be constant regular expressions, comparisons, or any other awk expressions. Range patterns are not expressions, so
they cannot appear inside Boolean patterns. Likewise, the special patterns BEGIN, END,
BEGINFILE and ENDFILE, which never match any input record, are not expressions and
cannot appear inside Boolean patterns.
{ next }
{ print }
This program fails because the range pattern is both turned on and turned off by the first
line, which just has a % on it. To accomplish this task, write the program in the following
manner, using a flag:
/^%$/
{ skip = ! skip; next }
skip == 1 { next } # skip lines with skip set
In a range pattern, the comma (,) has the lowest precedence of all the operators (i.e.,
it is evaluated last). Thus, the following program attempts to combine a range pattern with
another, simpler test:
114
115
functions. See Chapter 12 [A Library of awk Functions], page 211, for a number of useful
library functions.
If an awk program has only BEGIN rules and no other rules, then the program exits after
the BEGIN rule is run.1 However, if an END rule exists, then the input is read, even if there
are no other rules in the program. This is necessary in case the END rule checks the FNR and
NR variables.
The original version of awk kept reading and ignoring input until the end of the file was seen.
116
The BEGINFILE rule provides you the opportunity for two tasks that would otherwise be
difficult or impossible to perform:
You can test if the file is readable. Normally, it is a fatal error if a file named on the
command line cannot be opened for reading. However, you can bypass the fatal error
and move on to the next file on the command line.
You do this by checking if the ERRNO variable is not the empty string; if so, then gawk
was not able to open the file. In this case, your program can execute the nextfile
statement (see Section 7.4.9 [Using gawks nextfile Statement], page 125). This causes
gawk to skip the file entirely. Otherwise, gawk exits with the usual fatal error.
If you have written extensions that modify the record handling (by inserting an open
hook), you can invoke them at this point, before gawk has started processing the file.
(This is a very advanced feature, currently used only by the XMLgawk project.)
The ENDFILE rule is called when gawk has finished processing the last record in an input
file. For the last input file, it will be called before any END rules.
Normally, when an error occurs when reading input in the normal input processing loop,
the error is fatal. However, if an ENDFILE rule is present, the error becomes non-fatal, and
instead ERRNO is set. This makes it possible to catch and process I/O errors at the level of
the awk program.
The next statement (see Section 7.4.8 [The next Statement], page 124) is not allowed
inside either a BEGINFILE or and ENDFILE rule. The nextfile statement (see Section 7.4.9
[Using gawks nextfile Statement], page 125) is allowed only inside a BEGINFILE rule, but
not inside an ENDFILE rule.
The getline statement (see Section 4.9 [Explicit Input with getline], page 67) is
restricted inside both BEGINFILE and ENDFILE. Only the getline variable < file form
is allowed.
BEGINFILE and ENDFILE are gawk extensions. In most other awk implementations, or if
gawk is in compatibility mode (see Section 2.2 [Command-Line Options], page 25), they are
not special.
117
7.3 Actions
An awk program or script consists of a series of rules and function definitions interspersed.
(Functions are described later. See Section 9.2 [User-Defined Functions], page 170.) A rule
contains a pattern and an action, either of which (but not both) may be omitted. The
purpose of the action is to tell awk what to do once a match for the pattern is found. Thus,
in outline, an awk program generally looks like this:
[pattern] { action }
pattern [{ action }]
...
function name(args) { ... }
...
An action consists of one or more awk statements, enclosed in curly braces ({...}).
Each statement specifies one thing to do. The statements are separated by newlines or
semicolons. The curly braces around an action must be used even if the action contains
only one statement, or if it contains no statements at all. However, if you omit the action
entirely, omit the curly braces as well. An omitted action is equivalent to { print $0 }:
/foo/ { }
match foo, do nothing empty action
/foo/
match foo, print the record omitted action
The following types of statements are supported in awk:
118
Expressions
Call functions or assign values to variables (see Chapter 6 [Expressions],
page 89). Executing this kind of statement simply computes the value of the
expression. This is useful when the expression has side effects (see Section 6.2.3
[Assignment Expressions], page 98).
Control statements
Specify the control flow of awk programs. The awk language gives you C-like
constructs (if, for, while, and do) as well as a few special ones (see Section 7.4
[Control Statements in Actions], page 118).
Compound statements
Consist of one or more statements enclosed in curly braces. A compound statement is used in order to put several statements together in the body of an if,
while, do, or for statement.
Input statements
Use the getline command (see Section 4.9 [Explicit Input with getline],
page 67). Also supplied in awk are the next statement (see Section 7.4.8 [The
next Statement], page 124), and the nextfile statement (see Section 7.4.9
[Using gawks nextfile Statement], page 125).
Output statements
Such as print and printf. See Chapter 5 [Printing Output], page 73.
Deletion statements
For deleting array elements. See Section 8.2 [The delete Statement], page 139.
119
120
121
The same is true of the increment part. Incrementing additional variables requires
separate statements at the end of the loop. The C compound expression, using Cs comma
operator, is useful in this context but it is not supported in awk.
Most often, increment is an increment expression, as in the previous example. But this
is not required; it can be any expression whatsoever. For example, the following statement
prints all the powers of two between 1 and 100:
for (i = 1; i <= 100; i *= 2)
print i
If there is nothing to be done, any of the three expressions in the parentheses following
the for keyword may be omitted. Thus, for (; x > 0;) is equivalent to while (x > 0).
If the condition is omitted, it is treated as true, effectively yielding an infinite loop (i.e., a
loop that never terminates).
In most cases, a for loop is an abbreviation for a while loop, as shown here:
initialization
while (condition) {
body
increment
}
The only exception is when the continue statement (see Section 7.4.7 [The continue
Statement], page 123) is used inside the loop. Changing a for statement to a while
statement in this way can change the effect of the continue statement inside the loop.
The awk language has a for statement in addition to a while statement because a for
loop is often both less work to type and more natural to think of. Counting the number
of iterations is very common in loops. It can be easier to think of this counting as part of
looping rather than as something to do inside the loop.
There is an alternate version of the for loop, for iterating over all the indices of an array:
for (i in array)
do something with array[i]
See Section 8.1.5 [Scanning All Elements of an Array], page 138, for more information on
this version of the for loop.
122
default-body
}
Control flow in the switch statement works as it does in C. Once a match to a given
case is made, the case statement bodies execute until a break, continue, next, nextfile
or exit is encountered, or the end of the switch statement itself. For example:
switch (NR * 2 + 1) {
case 3:
case "11":
print NR - 1
break
case /2[[:digit:]]+/:
print NR
default:
print NR + 1
case -1:
print NR * -1
}
Note that if none of the statements specified above halt execution of a matched case
statement, execution falls through to the next case until execution halts. In the above
example, for any case value starting with 2 followed by one or more digits, the print
statement is executed and then falls through into the default section, executing its print
statement. In turn, the 1 case will also be executed since the default does not halt
execution.
This switch statement is a gawk extension. If gawk is in compatibility mode (see
Section 2.2 [Command-Line Options], page 25), it is not available.
123
When the remainder is zero in the first if statement, awk immediately breaks out of the
containing for loop. This means that awk proceeds immediately to the statement following
the loop and continues processing. (This is very different from the exit statement, which
stops the entire awk program. See Section 7.4.10 [The exit Statement], page 125.)
The following program illustrates how the condition of a for or while statement could
be replaced with a break inside an if:
# find smallest divisor of num
{
num = $1
for (div = 2; ; div++) {
if (num % div == 0) {
printf "Smallest divisor of %d is %d\n", num, div
break
}
if (div * div > num) {
printf "%d is prime\n", num
break
}
}
}
The break statement is also used to break out of the switch statement. This is discussed
in Section 7.4.5 [The switch Statement], page 121.
The break statement has no meaning when used outside the body of a loop or switch.
However, although it was never documented, historical implementations of awk treated the
break statement outside of a loop as if it were a next statement (see Section 7.4.8 [The
next Statement], page 124). Recent versions of Brian Kernighans awk no longer allow
this usage, nor does gawk.
124
This program prints all the numbers from 0 to 20except for 5, for which the printf is
skipped. Because the increment x++ is not skipped, x does not remain stuck at 5. Contrast
the for loop from the previous example with the following while loop:
BEGIN {
x = 0
while (x <= 20) {
if (x == 5)
continue
printf "%d ", x
x++
}
print ""
}
This program loops forever once x reaches 5.
The continue statement has no special meaning with respect to the switch statement,
nor does it any meaning when used outside the body of a loop. Historical versions of awk
treated a continue statement outside a loop the same way they treated a break statement
outside a loop: as if it were a next statement (see Section 7.4.8 [The next Statement],
page 124). Recent versions of Brian Kernighans awk no longer work this way, nor does
gawk.
125
If the next statement causes the end of the input to be reached, then the code in any
END rules is executed. See Section 7.1.4 [The BEGIN and END Special Patterns], page 114.
The next statement is not allowed inside BEGINFILE and ENDFILE rules. See Section 7.1.5
[The BEGINFILE and ENDFILE Special Patterns], page 115.
According to the POSIX standard, the behavior is undefined if the next statement is
used in a BEGIN or END rule. gawk treats it as a syntax error. Although POSIX permits it,
some other awk implementations dont allow the next statement inside function bodies (see
Section 9.2 [User-Defined Functions], page 170). Just as with any other next statement, a
next statement inside a function body reads the next record and starts processing it with
the first rule in the program.
126
127
This string controls conversion of numbers to strings (see Section 6.1.4 [Conversion of Strings and Numbers], page 93). It works by being passed, in effect,
as the first argument to the sprintf() function (see Section 9.1.3 [StringManipulation Functions], page 149). Its default value is "%.6g". CONVFMT was
introduced by the POSIX standard.
FIELDWIDTHS #
This is a space-separated list of columns that tells gawk how to split input with
fixed columnar boundaries. Assigning a value to FIELDWIDTHS overrides the use
of FS and FPAT for field splitting. See Section 4.6 [Reading Fixed-Width Data],
page 61, for more information.
If gawk is in compatibility mode (see Section 2.2 [Command-Line Options],
page 25), then FIELDWIDTHS has no special meaning, and field-splitting operations occur based exclusively on the value of FS.
FPAT #
This is a regular expression (as a string) that tells gawk to create the fields
based on text that matches the regular expression. Assigning a value to FPAT
overrides the use of FS and FIELDWIDTHS for field splitting. See Section 4.7
[Defining Fields By Content], page 63, for more information.
If gawk is in compatibility mode (see Section 2.2 [Command-Line Options],
page 25), then FPAT has no special meaning, and field-splitting operations occur
based exclusively on the value of FS.
FS
This is the input field separator (see Section 4.5 [Specifying How Fields Are Separated], page 56). The value is a single-character string or a multi-character regular expression that matches the separations between fields in an input record.
If the value is the null string (""), then each character in the record becomes a
separate field. (This behavior is a gawk extension. POSIX awk does not specify
the behavior when FS is the null string. Nonetheless, some other versions of
awk also treat "" specially.)
128
The default value is " ", a string consisting of a single space. As a special
exception, this value means that any sequence of spaces, TABs, and/or newlines
is a single separator.2 It also causes spaces, TABs, and newlines at the beginning
and end of a record to be ignored.
You can set the value of FS on the command line using the -F option:
awk -F, program input-files
If gawk is using FIELDWIDTHS or FPAT for field splitting, assigning a value to FS
causes gawk to return to the normal, FS-based field splitting. An easy way to
do this is to simply say FS = FS, perhaps with an explanatory comment.
IGNORECASE #
If IGNORECASE is nonzero or non-null, then all string comparisons and all regular
expression matching are case independent. Thus, regexp matching with ~
and !~, as well as the gensub(), gsub(), index(), match(), patsplit(),
split(), and sub() functions, record termination with RS, and field splitting
with FS and FPAT, all ignore case when doing their particular regexp operations.
However, the value of IGNORECASE does not affect array subscripting and it
does not affect field splitting when using a single-character field separator. See
Section 3.6 [Case Sensitivity in Matching], page 45.
If gawk is in compatibility mode (see Section 2.2 [Command-Line Options],
page 25), then IGNORECASE has no special meaning. Thus, string and regexp
operations are always case-sensitive.
LINT #
When this variable is true (nonzero or non-null), gawk behaves as if the --lint
command-line option is in effect. (see Section 2.2 [Command-Line Options],
page 25). With a value of "fatal", lint warnings become fatal errors. With
a value of "invalid", only warnings about things that are actually invalid are
issued. (This is not fully implemented yet.) Any other true value prints nonfatal
warnings. Assigning a false value to LINT turns off the lint warnings.
This variable is a gawk extension. It is not special in other awk implementations.
Unlike the other special variables, changing LINT does affect the production of
lint warnings, even if gawk is in compatibility mode. Much as the --lint
and --traditional options independently control different aspects of gawks
behavior, the control of lint warnings during program execution is independent
of the flavor of awk being executed.
OFMT
This string controls conversion of numbers to strings (see Section 6.1.4 [Conversion of Strings and Numbers], page 93) for printing with the print statement.
It works by being passed as the first argument to the sprintf() function (see
Section 9.1.3 [String-Manipulation Functions], page 149). Its default value is
"%.6g". Earlier versions of awk also used OFMT to specify the format for converting numbers to strings in general expressions; this is now done by CONVFMT.
OFS
This is the output field separator (see Section 5.3 [Output Separators], page 75).
It is output between the fields printed by a print statement. Its default value
is " ", a string consisting of a single space.
129
ORS
This is the output record separator. It is output at the end of every print
statement. Its default value is "\n", the newline character. (See Section 5.3
[Output Separators], page 75.)
RS
This is awks input record separator. Its default value is a string containing a
single newline character, which means that an input record consists of a single
line of text. It can also be the null string, in which case records are separated
by runs of blank lines. If it is a regexp, records are separated by matches of the
regexp in the input text. (See Section 4.1 [How Input Is Split into Records],
page 49.)
The ability for RS to be a regular expression is a gawk extension. In most
other awk implementations, or if gawk is in compatibility mode (see Section 2.2
[Command-Line Options], page 25), just the first character of RSs value is used.
SUBSEP
This is the subscript separator. It has the default value of "\034" and is
used to separate the parts of the indices of a multidimensional array. Thus,
the expression foo["A", "B"] really accesses foo["A\034B"] (see Section 8.5
[Multidimensional Arrays], page 142).
TEXTDOMAIN #
This variable is used for internationalization of programs at the awk level. It
sets the default text domain for specially marked string constants in the source
text, as well as for the dcgettext(), dcngettext() and bindtextdomain()
functions (see Chapter 10 [Internationalization with gawk], page 185). The
default value of TEXTDOMAIN is "messages".
This variable is a gawk extension. In other awk implementations, or if gawk is
in compatibility mode (see Section 2.2 [Command-Line Options], page 25), it
is not special.
130
The names ARGC and ARGV, as well as the convention of indexing the array
from 0 to ARGC 1, are derived from the C languages method of accessing
command-line arguments.
The value of ARGV[0] can vary from system to system. Also, you should note
that the program text is not included in ARGV, nor are any of awks commandline options. See Section 7.5.3 [Using ARGC and ARGV], page 133, for information
about how awk uses these variables.
ARGIND #
The index in ARGV of the current file being processed. Every time gawk opens
a new data file for processing, it sets ARGIND to the index in ARGV of the file
name. When gawk is processing the input files, FILENAME == ARGV[ARGIND]
is always true.
This variable is useful in file processing; it allows you to tell how far along you
are in the list of data files as well as to distinguish between successive instances
of the same file name on the command line.
While you can change the value of ARGIND within your awk program, gawk
automatically sets it to a new value when the next file is opened.
This variable is a gawk extension. In other awk implementations, or if gawk is
in compatibility mode (see Section 2.2 [Command-Line Options], page 25), it
is not special.
ENVIRON
An associative array containing the values of the environment. The array indices are the environment variable names; the elements are the values of the
particular environment variables. For example, ENVIRON["HOME"] might be
/home/arnold. Changing this array does not affect the environment passed
on to any programs that awk may spawn via redirection or the system() function.
Some operating systems may not have environment variables. On such systems,
the ENVIRON array is empty (except for ENVIRON["AWKPATH"], see Section 2.5.1
[The AWKPATH Environment Variable], page 32).
ERRNO #
If a system error occurs during a redirection for getline, during a read for
getline, or during a close() operation, then ERRNO contains a string describing the error.
In addition, gawk clears ERRNO before opening each command-line input file.
This enables checking if the file is readable inside a BEGINFILE pattern (see
Section 7.1.5 [The BEGINFILE and ENDFILE Special Patterns], page 115).
Otherwise, ERRNO works similarly to the C variable errno. Except for the case
just mentioned, gawk never clears it (sets it to zero or ""). Thus, you should
only expect its value to be meaningful when an I/O operation returns a failure
value, such as getline returning 1. You are, of course, free to clear it yourself
before doing an I/O operation.
This variable is a gawk extension. In other awk implementations, or if gawk is
in compatibility mode (see Section 2.2 [Command-Line Options], page 25), it
is not special.
FILENAME
The name of the file that awk is currently reading. When no data files are
listed on the command line, awk reads from the standard input and FILENAME
131
is set to "-". FILENAME is changed each time a new file is read (see Chapter 4
[Reading Input Files], page 49). Inside a BEGIN rule, the value of FILENAME is
"", since there are no input files being processed yet.3 Note, though, that
using getline (see Section 4.9 [Explicit Input with getline], page 67) inside
a BEGIN rule can give FILENAME a value.
FNR
The current record number in the current file. FNR is incremented each time a
new record is read (see Section 4.1 [How Input Is Split into Records], page 49).
It is reinitialized to zero each time a new input file is started.
NF
The number of fields in the current input record. NF is set each time a new
record is read, when a new field is created or when $0 changes (see Section 4.2
[Examining Fields], page 52).
Unlike most of the variables described in this section, assigning a value to NF has
the potential to affect awks internal workings. In particular, assignments to NF
can be used to create or remove fields from the current record. See Section 4.4
[Changing the Contents of a Field], page 54.
The number of input records awk has processed since the beginning of the
programs execution (see Section 4.1 [How Input Is Split into Records], page 49).
NR is incremented each time a new record is read.
NR
PROCINFO #
The elements of this array provide access to information about the running awk
program. The following elements (listed alphabetically) are guaranteed to be
available:
PROCINFO["egid"]
The value of the getegid() system call.
PROCINFO["euid"]
The value of the geteuid() system call.
PROCINFO["FS"]
This is "FS" if field splitting with FS is in effect, "FIELDWIDTHS"
if field splitting with FIELDWIDTHS is in effect, or "FPAT" if field
matching with FPAT is in effect.
PROCINFO["gid"]
The value of the getgid() system call.
PROCINFO["pgrpid"]
The process group ID of the current process.
PROCINFO["pid"]
The process ID of the current process.
PROCINFO["ppid"]
The parent process ID of the current process.
3
Some early implementations of Unix awk initialized FILENAME to "-", even if there were data files to be
processed. This behavior was incorrect and should not be relied upon in your programs.
132
PROCINFO["sorted_in"]
If this element exists in PROCINFO, its value controls the order in
which array indices will be processed by for (index in array)
... loops. Since this is an advanced feature, we defer the full
description until later; see Section 8.1.5 [Scanning All Elements of
an Array], page 138.
PROCINFO["strftime"]
The default time format string for strftime(). Assigning a new
value to this element changes the default. See Section 9.1.5 [Time
Functions], page 163.
PROCINFO["uid"]
The value of the getuid() system call.
PROCINFO["version"]
The version of gawk.
On some systems, there may be elements in the array, "group1" through
"groupN" for some N. N is the number of supplementary groups that the process
has. Use the in operator to test for these elements (see Section 8.1.2 [Referring
to an Array Element], page 136).
The PROCINFO array is also used to cause coprocesses to communicate over
pseudo-ttys instead of through two-way pipes; this is discussed further in
Section 11.3 [Two-Way Communications with Another Process], page 203.
This array is a gawk extension. In other awk implementations, or if gawk is in
compatibility mode (see Section 2.2 [Command-Line Options], page 25), it is
not special.
RLENGTH
The length of the substring matched by the match() function (see Section 9.1.3
[String-Manipulation Functions], page 149). RLENGTH is set by invoking the
match() function. Its value is the length of the matched string, or 1 if no
match is found.
RSTART
RT #
This is set each time a record is read. It contains the input text that matched
the text denoted by RS, the record separator.
This variable is a gawk extension. In other awk implementations, or if gawk is
in compatibility mode (see Section 2.2 [Command-Line Options], page 25), it
is not special.
133
$ echo 1
> 2
> 3
> 4 | awk NR == 2 { NR = 17 }
> { print NR }
a 1
a 17
a 18
a 19
Before FNR was added to the awk language (see Section A.1 [Major Changes Between V7 and
SVR3.1], page 301), many awk programs used this feature to track the number of records
in a file by resetting NR to zero when FILENAME changed.
134
the standard input. Storing additional elements and incrementing ARGC causes additional
files to be read.
If the value of ARGC is decreased, that eliminates input files from the end of the list. By
recording the old value of ARGC elsewhere, a program can treat the eliminated arguments
as something other than file names.
To eliminate a file from the middle of the list, store the null string ("") into ARGV in
place of the files name. As a special feature, awk ignores file names that have been replaced
with the null string. Another option is to use the delete statement to remove elements
from ARGV (see Section 8.2 [The delete Statement], page 139).
All of these actions are typically done in the BEGIN rule, before actual processing of
the input begins. See Section 13.2.4 [Splitting a Large File into Pieces], page 252, and
see Section 13.2.5 [Duplicating Output into Multiple Files], page 254, for examples of each
way of removing elements from ARGV. The following fragment processes ARGV in order to
examine, and then remove, command-line options:
BEGIN {
for (i = 1; i < ARGC; i++) {
if (ARGV[i] == "-v")
verbose = 1
else if (ARGV[i] == "-q")
debug = 1
else if (ARGV[i] ~ /^-./) {
e = sprintf("%s: unrecognized option -- %c",
ARGV[0], substr(ARGV[i], 2, 1))
print e > "/dev/stderr"
} else
break
delete ARGV[i]
}
}
To actually get the options into the awk program, end the awk options with -- and
then supply the awk programs options, in the following manner:
awk -f myprog -- -v -q file1 file2 ...
This is not necessary in gawk. Unless --posix has been specified, gawk silently puts
any unrecognized options into ARGV for the awk program to deal with. As soon as it sees
an unknown option, gawk stops looking for other options that it might otherwise recognize.
The previous example with gawk would be:
gawk -f myprog -q -v file1 file2 ...
Because -q is not a valid gawk option, it and the following -v are passed on to the
awk program. (See Section 12.4 [Processing Command-Line Options], page 225, for an awk
library function that parses command-line options.)
8 Arrays in awk
An array is a table of values called elements. The elements of an array are distinguished
by their indices. Indices may be either numbers or strings.
This chapter describes how arrays work in awk, how to use array elements, how to scan
through every element in an array, and how to remove array elements. It also describes
how awk simulates multidimensional arrays, as well as some of the less obvious points about
array usage. The chapter moves on to discuss gawks facility for sorting arrays, and ends
with a brief description of gawks ability to support true multidimensional arrays.
awk maintains a single set of names that may be used for naming variables, arrays, and
functions (see Section 9.2 [User-Defined Functions], page 170). Thus, you cannot have a
variable and an array with the same name in the same awk program.
"foo"
""
30
Value
Index
136
Only the values are stored; the indices are implicit from the order of the values. Here, 8 is
the value at index zero, because 8 appears in the position with zero elements before it.
Arrays in awk are differentthey are associative. This means that each array is a
collection of pairs: an index and its corresponding array element value:
Index 3
Value 30
Index 1
Value "foo"
Index 0
Value 8
Index 2
Value ""
The pairs are shown in jumbled order because their order is irrelevant.
One advantage of associative arrays is that new pairs can be added at any time. For
example, suppose a tenth element is added to the array whose value is "number ten". The
result is:
Index 10
Value "number ten"
Index 3
Value 30
Index 1
Value "foo"
Index 0
Value 8
Index 2
Value ""
Now the array is sparse, which just means some indices are missing. It has elements 03
and 10, but doesnt have elements 4, 5, 6, 7, 8, or 9.
Another consequence of associative arrays is that the indices dont have to be positive
integers. Any number, or even a string, can be an index. For example, the following is an
array that translates words from English to French:
Index "dog" Value "chien"
Index "cat" Value "chat"
Index "one" Value "un"
Index 1
Value "un"
Here we decided to translate the number one in both spelled-out and numeric formthus
illustrating that a single array can have both numbers and strings as indices. In fact,
array subscripts are always strings; this is discussed in more detail in Section 8.3 [Using
Numbers to Subscript Arrays], page 140. Here, the number 1 isnt double-quoted, since awk
automatically converts it to a string.
The value of IGNORECASE has no effect upon array subscripting. The identical string value
used to store an array element must be used to retrieve it. When awk creates an array (e.g.,
with the split() built-in function), that arrays indices are consecutive integers starting
at one. (See Section 9.1.3 [String-Manipulation Functions], page 149.)
awks arrays are efficientthe time to access an element is independent of the number
of elements in the array.
The value of the array reference is the current value of that array element. For example,
foo[4.3] is an expression for the element of array foo at index 4.3.
A reference to an array element that has no recorded value yields a value of "", the null
string. This includes elements that have not been assigned any value as well as elements
that have been deleted (see Section 8.2 [The delete Statement], page 139).
NOTE: A reference to an element that does not exist automatically creates
that array element, with the null string as its value. (In some cases, this is
unfortunate, because it might waste memory inside awk.)
Novice awk programmers often make the mistake of checking if an element exists
by checking if the value is empty:
# Check if "foo" exists in a:
if (a["foo"] != "") ...
Incorrect!
This is incorrect, since this will create a["foo"] if it didnt exist before!
To determine whether an element exists in an array at a certain index, use the following
expression:
ind in array
This expression tests whether the particular index ind exists, without the side effect of creating that element if it is not present. The expression has the value one (true) if array[ind]
exists and zero (false) if it does not exist. For example, this statement tests whether the
array frequencies contains the index 2:
if (2 in frequencies)
print "Subscript 2 is present."
Note that this is not a test of whether the array frequencies contains an element whose
value is two. There is no way to do that except to scan all the elements. Also, this does
not create frequencies[2], while the following (incorrect) alternative does:
if (frequencies[2] != "")
print "Subscript 2 is present."
138
{
if ($1 > max)
max = $1
arr[$1] = $0
}
END {
for (x = 1; x <= max; x++)
print arr[x]
}
The first rule keeps track of the largest line number seen so far; it also stores each line
into the array arr, at an index that is the lines number. The second rule runs after all the
input has been read, to print out all the lines. When this program is run with the following
input:
5 I am the Five man
2 Who are you? The new number two!
4 . . . And four on the floor
1 Who is number one?
3 I three you.
Its output is:
1 Who is number one?
2 Who are you? The new number two!
3 I three you.
4 . . . And four on the floor
5 I am the Five man
If a line number is repeated, the last line with a given number overrides the others. Gaps
in the line numbers can be handled with an easy improvement to the programs END rule,
as follows:
END {
for (x = 1; x <= max; x++)
if (x in arr)
print arr[x]
}
The following program uses this form of the for statement. The first rule scans the
input records and notes which words appear (at least once) in the input, by storing a
one into the array used with the word as index. The second rule scans the elements of
used to find all the distinct words that appear in the input. It prints each word that is
more than 10 characters long and also prints the number of such words. See Section 9.1.3
[String-Manipulation Functions], page 149, for more information on the built-in function
length().
# Record a 1 for each word that is used at least once
{
for (i = 1; i <= NF; i++)
used[$i] = 1
}
# Find number of distinct words more than 10 characters long
END {
for (x in used) {
if (length(x) > 10) {
++num_long_words
print x
}
}
print num_long_words, "words longer than 10 characters"
}
See Section 13.3.5 [Generating Word-Usage Counts], page 269, for a more detailed example
of this type.
The order in which elements of the array are accessed by this statement is determined
by the internal arrangement of the array elements within awk and normally cannot be
controlled or changed. This can lead to problems if new elements are added to array by
statements in the loop body; it is not predictable whether the for loop will reach them.
Similarly, changing var inside the loop may produce strange results. It is best to avoid such
things.
As an extension, gawk makes it possible for you to loop over the elements of an array in
order, based on the value of PROCINFO["sorted_in"] (see Section 7.5.2 [Built-in Variables
That Convey Information], page 129). This is an advanced feature, so discussion of it is
delayed until Section 11.2.1 [Controlling Array Traversal], page 196.
In addition, gawk provides built-in functions for sorting arrays; see Section 11.2.2 [Sorting
Array Values and Indices with gawk], page 202.
140
for (i in frequencies)
delete frequencies[i]
This example removes all the elements from the array frequencies. Once an element is
deleted, a subsequent for statement to scan the array does not report that element and the
in operator to check for the presence of that element returns zero (i.e., false):
delete foo[4]
if (4 in foo)
print "This will never be printed"
It is important to note that deleting an element is not the same as assigning it a null
value (the empty string, ""). For example:
foo[4] = ""
if (4 in foo)
print "This is printed, even though foo[4] is empty"
It is not an error to delete an element that does not exist. However, if --lint is
provided on the command line (see Section 2.2 [Command-Line Options], page 25), gawk
issues a warning message when an element that is not in the array is deleted.
All the elements of an array may be deleted with a single statement (c.e.) by leaving off
the subscript in the delete statement, as follows:
delete array
This ability is a gawk extension; it is not available in compatibility mode (see Section 2.2
[Command-Line Options], page 25).
Using this version of the delete statement is about three times more efficient than the
equivalent loop that deletes each element one at a time.
The following statement provides a portable but nonobvious way to clear out an array:1
split("", array)
The split() function (see Section 9.1.3 [String-Manipulation Functions], page 149)
clears out the target array first. This call asks it to split apart the null string. Because
there is no data to split out, the function simply clears the array and then returns.
CAUTION: Deleting an array does not change its type; you cannot delete an
array and then use the arrays name as a scalar (i.e., a regular variable). For
example, the following does not work:
a[1] = 3
delete a
a = 3
xyz = 12.153
data[xyz] = 1
CONVFMT = "%2.2f"
if (xyz in data)
printf "%s is in data\n", xyz
else
printf "%s is not in data\n", xyz
This prints 12.15 is not in data. The first statement gives xyz a numeric value. Assigning to data[xyz] subscripts data with the string value "12.153" (using the default
conversion value of CONVFMT, "%.6g"). Thus, the array element data["12.153"] is assigned the value one. The program then changes the value of CONVFMT. The test (xyz in
data) generates a new string value from xyzthis time "12.15"because the value of
CONVFMT only allows two significant digits. This test fails, since "12.15" is different from
"12.153".
According to the rules for conversions (see Section 6.1.4 [Conversion of Strings and
Numbers], page 93), integer values are always converted to strings as integers, no matter
what the value of CONVFMT may happen to be. So the usual case of the following works:
for (i = 1; i <= maxsub; i++)
do something with array[i]
The integer values always convert to strings as integers rule has an additional consequence for array indexing. Octal and hexadecimal constants (see Section 6.1.1.2 [Octal and
Hexadecimal Numbers], page 89) are converted internally into numbers, and their original
form is forgotten. This means, for example, that array[17], array[021], and array[0x11]
all refer to the same element!
As with many things in awk, the majority of the time things work as one would expect
them to. But it is useful to have a precise knowledge of the actual rules since they can
sometimes have a subtle effect on your programs.
142
The issue here is that subscripts for awk arrays are always strings. Uninitialized variables,
when used as strings, have the value "", not zero. Thus, line 1 ends up stored in l[""].
The following version of the program works correctly:
{ l[lines++] = $0 }
END {
for (i = lines - 1; i >= 0; --i)
print l[i]
}
Here, the ++ forces lines to be numeric, thus making the old value numeric zero.
This is then converted to "0" as the array subscript.
Even though it is somewhat unusual, the null string ("") is a valid array subscript.
gawk warns about the use of the null string as a subscript if --lint is provided on the
command line (see Section 2.2 [Command-Line Options], page 25).
{
if (max_nf < NF)
max_nf = NF
max_nr = NR
for (x = 1; x <= NF; x++)
vector[x, NR] = $x
}
END {
for (x = 1; x <= max_nf; x++) {
for (y = max_nr; y >= 1; --y)
printf("%s ", vector[x, y])
printf("\n")
}
}
When given the input:
1 2 3 4 5 6
2 3 4 5 6 1
3 4 5 6 1 2
4 5 6 1 2 3
the program produces the following output:
4 3 2 1
5 4 3 2
6 5 4 3
1 6 5 4
2 1 6 5
3 2 1 6
144
code 034.) Sooner or later, the for statement finds that index and does an iteration with
the variable combined set to "1\034foo". Then the split() function is called as follows:
split("1\034foo", separate, "\034")
The result is to set separate[1] to "1" and separate[2] to "foo". Presto! The original
sequence of separate indices is recovered.
2, 3, 1
The subscript in array expression (see Section 8.1.2 [Referring to an Array Element],
page 136) works similarly for both regular awk-style arrays and arrays of arrays. For example, the tests 1 in a, 3 in a[1], and (1, "name") in a[1][3] all evaluate to one (true)
for our array a.
The for (item in array) statement (see Section 8.1.5 [Scanning All Elements of an
Array], page 138) can be nested to scan all the elements of an array of arrays if it is
rectangular in structure. In order to print the contents (scalar values) of a two-dimensional
array of arrays (i.e., in which each first-level element is itself an array, not necessarily of the
same length) you could use the following code:
for (i in array)
for (j in array[i])
print array[i][j]
The isarray() function (see Section 9.1.7 [Getting Type Information], page 170) lets
you test if an array element is itself an array:
for (i in array) {
if (isarray(array[i]) {
for (j in array[i]) {
print array[i][j]
}
}
}
If the structure of a jagged array of arrays is known in advance, you can often devise
workarounds using control statements. For example, the following code prints the elements
of our main array a:
for (i in a) {
for (j in a[i]) {
if (j == 3) {
for (k in a[i][j])
print a[i][j][k]
} else
print a[i][j]
}
}
See Section 12.7 [Traversing Arrays of Arrays], page 238, for a user-defined function that
will walk an arbitrarily-dimensioned array of arrays.
Recall that a reference to an uninitialized array element yields a value of "", the null
string. This has one important implication when you intend to use a subarray as an argument to a function, as illustrated by the following example:
$ gawk BEGIN { split("a b c d", b[1]); print b[1][1] }
error gawk: cmd. line:1: fatal: split: second argument is not an array
The way to work around this is to first force b[1] to be an array by creating an arbitrary
index:
$ gawk BEGIN { b[1][1] = ""; split("a b c d", b[1]); print b[1][1] }
a a
Chapter 9: Functions
147
9 Functions
This chapter describes awks built-in functions, which fall into three categories: numeric,
string, and I/O. gawk provides additional groups of functions to work with values that
represent time, do bit manipulation, sort arrays, and internationalize and localize programs.
Besides the built-in functions, awk has provisions for writing new functions that the rest
of a program can use. The second half of this chapter describes these user-defined functions.
148
atan2(y, x)
Return the arctangent of y / x in radians.
cos(x)
exp(x)
int(x)
Return the nearest integer to x, located between x and zero and truncated
toward zero.
For example, int(3) is 3, int(3.9) is 3, int(-3.9) is 3, and int(-3) is 3
as well.
log(x)
rand()
The C version of rand() on many Unix systems is known to produce fairly poor sequences of random
numbers. However, nothing requires that an awk implementation use the C rand() to implement the
awk version of rand(). In fact, gawk uses the BSD random() function, which is considerably better than
rand(), to produce random numbers.
mawk uses a different seed each time.
Chapter 9: Functions
149
sqrt(x)
srand([x])
Set the starting point, or seed, for generating random numbers to the value x.
Each seed value leads to a particular sequence of random numbers.3 Thus, if
the seed is set to the same value a second time, the same sequence of random
numbers is produced again.
CAUTION: Different awk implementations use different randomnumber generators internally. Dont expect the same awk program
to produce the same series of random numbers when executed by
different versions of awk.
If the argument x is omitted, as in srand(), then the current date and time
of day are used for a seed. This is the way to get random numbers that are
truly unpredictable.
The return value of srand() is the previous seed. This makes it easy to keep
track of the seeds in case you need to consistently reproduce sequences of random numbers.
Computer-generated random numbers really are not truly random. They are technically known as
pseudorandom. This means that while the numbers in a sequence appear to be random, you can in
fact generate the same sequence of random numbers over and over again.
150
rule for comparing values, and the sort direction. A single space is required
between the comparison mode, string or number, and the direction specification, ascending or descending. You can omit direction and/or mode
in which case it will default to ascending and string, respectively. An
empty string "" is the same as the default "ascending string" for the value
of how. If the source array contains subarrays as values, they will come out
last(first) in the dest array for ascending(descending) order specification.
The value of IGNORECASE affects the sorting. The third argument can also be
a user-defined function name in which case the value returned by the function
is used to order the array elements before constructing the result array. See
Section 11.2.2 [Sorting Array Values and Indices with gawk], page 202, for more
information.
For example, if the contents of a are as follows:
a["last"] = "de"
a["first"] = "sac"
a["middle"] = "cul"
A call to asort():
asort(a)
results in the following contents of a:
a[1] = "cul"
a[2] = "de"
a[3] = "sac"
In order to reverse the direction of the sorted results in the above example,
asort() can be called with three arguments as follows:
asort(a, a, "descending")
The asort() function is described in more detail in Section 11.2.2 [Sorting
Array Values and Indices with gawk], page 202. asort() is a gawk extension; it
is not available in compatibility mode (see Section 2.2 [Command-Line Options],
page 25).
asorti(source [, dest [, how ] ]) #
Return the number of elements in the array source. It works similarly to
asort(), however, the indices are sorted, instead of the values. (Here too,
IGNORECASE affects the sorting.)
The asorti() function is described in more detail in Section 11.2.2 [Sorting
Array Values and Indices with gawk], page 202. asorti() is a gawk extension; it
is not available in compatibility mode (see Section 2.2 [Command-Line Options],
page 25).
gensub(regexp, replacement, how [, target]) #
Search the target string target for matches of the regular expression regexp. If
how is a string beginning with g or G (short for global), then replace all
matches of regexp with replacement. Otherwise, how is treated as a number
indicating which match of regexp to replace. If no target is supplied, use $0. It
returns the modified string as the result of the function and the original target
string is not changed.
Chapter 9: Functions
151
152
index(in, find)
Search the string in for the first occurrence of the string find, and return the
position in characters where that occurrence begins in the string in. Consider
the following example:
$ awk BEGIN { print index("peanut", "an") }
a 3
If find is not found, index() returns zero. (Remember that string indices in
awk start at one.)
length([string])
Return the number of characters in string. If string is a number, the length
of the digit string representing that number is returned. For example,
length("abcde") is five. By contrast, length(15 * 35) works out to three.
In this example, 15 * 35 = 525, and 525 is then converted to the string "525",
which has three characters.
If no argument is supplied, length() returns the length of $0.
NOTE: In older versions of awk, the length() function could be
called without any parentheses. Doing so is considered poor practice, although the 2008 POSIX standard explicitly allows it, to support historical practice. For programs to be maximally portable,
always supply the parentheses.
If length() is called with a variable that has not been used, gawk forces the
variable to be a scalar. Other implementations of awk leave the variable without
a type. Consider:
$ gawk BEGIN { print length(x) ; x[1] = 1 }
a 0
error gawk: fatal: attempt to use scalar x as array
$ nawk BEGIN { print length(x) ; x[1] = 1 }
a 0
If --lint has been specified on the command line, gawk issues a warning about
this.
With gawk and several other awk implementations, when given an array argument, the length() function returns the number of elements in the array. (c.e.)
This is less useful than it might seem at first, as the array is not guaranteed to
be indexed from one to the number of elements in it. If --lint is provided
on the command line (see Section 2.2 [Command-Line Options], page 25), gawk
warns that passing an array argument is not portable. If --posix is supplied, using an array argument is a fatal error (see Chapter 8 [Arrays in awk],
page 135).
match(string, regexp [, array])
Search string for the longest, leftmost substring matched by the regular expression, regexp and return the character position, or index, at which that substring
begins (one, if it starts at the beginning of string). If no match is found, return
zero.
Chapter 9: Functions
153
154
Chapter 9: Functions
155
seps[0] and any trailing whitespace goes into seps[n] where n is the return
value of split() (that is, the number of elements in array).
The split() function splits strings into pieces in a manner similar to the way
input lines are split into fields. For example:
split("cul-de-sac", a, "-", seps)
splits the string cul-de-sac into three fields using - as the separator. It sets
the contents of the array a as follows:
a[1] = "cul"
a[2] = "de"
a[3] = "sac"
and sets the contents of the array seps as follows:
seps[1] = "-"
seps[2] = "-"
The value returned by this call to split() is three.
As with input field-splitting, when the value of fieldsep is " ", leading and
trailing whitespace is ignored in values assigned to the elements of array but
not in seps, and the elements are separated by runs of whitespace. Also as with
input field-splitting, if fieldsep is the null string, each individual character in
the string is split into its own array element. (c.e.)
Note, however, that RS has no effect on the way split() works. Even though
RS = "" causes newline to also be an input field separator, this does not affect
how split() splits strings.
Modern implementations of awk, including gawk, allow the third argument to
be a regexp constant (/abc/) as well as a string. The POSIX standard allows
this as well. See Section 3.8 [Using Dynamic Regexps], page 47, for a discussion
of the difference between using a string constant or a regexp constant, and the
implications for writing your program correctly.
Before splitting the string, split() deletes any previously existing elements in
the arrays array and seps.
If string is null, the array has no elements. (So this is a portable way to delete
an entire array with one statement. See Section 8.2 [The delete Statement],
page 139.)
If string does not match fieldsep at all (but is not null), array has one element
only. The value of that element is the original string.
sprintf(format, expression1, ...)
Return (without printing) the string that printf would have printed out with
the same arguments (see Section 5.5 [Using printf Statements for Fancier
Printing], page 76). For example:
pival = sprintf("pi = %.2f (approx.)", 22/7)
assigns the string pi = 3.14 (approx.) to the variable pival.
strtonum(str) #
Examine str and return its numeric value. If str begins with a leading 0,
strtonum() assumes that str is an octal number. If str begins with a lead-
156
Unless you use the --non-decimal-data option, which isnt recommended. See Section 11.1 [Allowing
Nondecimal Input Data], page 195, for more information.
Note that this means that the record will first be regenerated using the value of OFS if any fields have
been changed, and that the fields will be updated after the substitution, even if the operation is a no-op
such as sub(/^/, "").
Chapter 9: Functions
157
>
print str
> }
a dCaaCbaaa
This shows how & can represent a nonconstant string and also illustrates the
leftmost, longest rule in regexp matching (see Section 3.7 [How Much Text
Matches?], page 46).
The effect of this special character (&) can be turned off by putting a backslash
before it in the string. As usual, to insert one backslash in the string, you must
write two backslashes. Therefore, write \\& in a string constant to include a
literal & in the replacement. For example, the following shows how to replace
the first | on each line with an &:
{ sub(/\|/, "\\&"); print }
As mentioned, the third argument to sub() must be a variable, field or array
element. Some versions of awk allow the third argument to be an expression
that is not an lvalue. In such a case, sub() still searches for the pattern and
returns zero or one, but the result of the substitution (if any) is thrown away
because there is no place to put it. Such versions of awk accept expressions like
the following:
sub(/USA/, "United States", "the USA and Canada")
For historical compatibility, gawk accepts such erroneous code. However, using
any other nonchangeable object as the third parameter causes a fatal error and
your program will not run.
Finally, if the regexp is not a regexp constant, it is converted into a string, and
then the value of that string is treated as the regexp to match.
substr(string, start [, length])
Return a length-character-long substring of string, starting at character number
start. The first character of a string is character number one.6 For example,
substr("washington", 5, 3) returns "ing".
If length is not present, substr() returns the whole suffix of string that begins
at character number start. For example, substr("washington", 5) returns
"ington". The whole suffix is also returned if length is greater than the number
of characters remaining in the string, counting from character start.
If start is less than one, substr() treats it as if it was one. (POSIX doesnt
specify what to do in this case: Brian Kernighans awk acts this way, and
therefore gawk does too.) If start is greater than the number of characters in
the string, substr() returns the null string. Similarly, if length is present but
less than or equal to zero, the null string is returned.
The string returned by substr() cannot be assigned. Thus, it is a mistake to
attempt to change a portion of a string, as shown in the following example:
string = "abcdef"
# try to get "abCDEf", wont work
substr(string, 3, 3) = "CDE"
It is also a mistake to use substr() as the third argument of sub() or gsub():
6
This is different from C and C++, in which the first character is number zero.
158
# WRONG
9.1.3.1 More About \ and & with sub(), gsub(), and gensub()
When using sub(), gsub(), or gensub(), and trying to get literal backslashes and ampersands into the replacement text, you need to remember that there are several levels of
escape processing going on.
First, there is the lexical level, which is when awk reads your program and builds an
internal copy of it that can be executed. Then there is the runtime level, which is when awk
actually scans the replacement string to determine what to generate.
At both levels, awk looks for a defined set of characters that can come after a backslash.
At the lexical level, it looks for the escape sequences listed in Section 3.2 [Escape Sequences],
page 38. Thus, for every \ that awk processes at the runtime level, you must type two
backslashes at the lexical level. When a character that is not valid for an escape sequence
follows the \, Brian Kernighans awk and gawk both simply remove the initial \ and put
the next character into the string. Thus, for example, "a\qb" is treated as "aqb".
At the runtime level, the various functions handle sequences of \ and & differently.
The situation is (sadly) somewhat complex. Historically, the sub() and gsub() functions
treated the two character sequence \& specially; this sequence was replaced in the generated
text with a single &. Any other \ within the replacement string that did not precede an
& was passed through unchanged. This is illustrated in Table 9.1.
Chapter 9: Functions
You type
sub() sees
\&
\\&
\\\&
\\\\&
\\\\\&
\\\\\\&
\\q
&
\&
\&
\\&
\\&
\\\&
\q
159
sub() generates
the matched text
a literal &
a literal &
a literal \&
a literal \&
a literal \\&
a literal \q
Table 9.1: Historical Escape Sequence Processing for sub() and gsub()
This table shows both the lexical-level processing, where an odd number of backslashes
becomes an even number at the runtime level, as well as the runtime processing done by
sub(). (For the sake of simplicity, the rest of the following tables only show the case of
even numbers of backslashes entered at the lexical level.)
The problem with the historical approach is that there is no way to get a literal \
followed by the matched text.
The POSIX rules state that \& in the replacement string produces a literal &, \\
produces a literal \, and \ followed by anything else is not special; the \ is placed
straight into the output. These rules are presented in Table 9.2.
You type
sub() sees
\\\\\\&
\\\\&
\\&
\\q
\\\\
\\\&
\\&
\&
\q
\\
sub() generates
a
a
a
a
\
literal
literal
literal
literal
\&
\, followed by the matched text
&
\q
160
You type
gensub() sees
&
\\&
\\\\
\\\\&
\\\\\\&
\\q
&
\&
\\
\\&
\\\&
\q
gensub() generates
the matched text
a literal &
a literal \
a literal \, then the matched text
a literal \&
a literal q
Chapter 9: Functions
161
to send the data to the output device. This is often more efficient than writing
every little bit of information as soon as it is ready. However, sometimes it is
necessary to force a program to flush its buffers; that is, write the information to
its destination, even if a buffer is not full. This is the purpose of the fflush()
functiongawk also buffers its output and the fflush() function forces gawk
to flush its buffers.
fflush() was added to Brian Kernighans version of awk in 1994; it is not part
of the POSIX standard and is not available if --posix has been specified on
the command line (see Section 2.2 [Command-Line Options], page 25).
gawk extends the fflush() function in two ways. The first is to allow no
argument at all. In this case, the buffer for the standard output is flushed.
The second is to allow the null string ("") as the argument. In this case, the
buffers for all open output files and pipes are flushed. Brian Kernighans awk
also supports these extensions.
fflush() returns zero if the buffer is successfully flushed; otherwise, it returns
1. In the case where all buffers are flushed, the return value is zero only if
all buffers were flushed successfully. Otherwise, it is 1, and gawk warns about
the problem filename.
gawk also issues a warning message if you attempt to flush a file or pipe that
was opened for reading (such as with getline), or if filename is not an open
file, pipe, or coprocess. In such a case, fflush() returns 1, as well.
system(command)
Execute the operating-system command command and then return to the awk
program. Return commands exit status.
For example, if the following fragment of code is put in your awk program:
END {
system("date | mail -s awk run done root")
}
the system administrator is sent mail when the awk program finishes processing
input and begins its end-of-input processing.
Note that redirecting print or printf into a pipe is often enough to accomplish
your task. If you need to run many commands, it is more efficient to simply
print them down a pipeline to the shell:
while (more stuff to do)
print command | "/bin/sh"
close("/bin/sh")
However, if your awk program is interactive, system() is useful for running large
self-contained programs, such as a shell or an editor. Some operating systems
cannot implement the system() function. system() causes a fatal error if it is
not supported.
NOTE: When --sandbox is specified, the system() function is
disabled (see Section 2.2 [Command-Line Options], page 25).
162
# flush output
gawk treats this use of the system() function as a special case and is smart enough not to
run a shell (or other command interpreter) with the empty command. Therefore, with gawk,
this idiom is not only useful, it is also efficient. While this method should work with other
awk implementations, it does not necessarily avoid starting an unnecessary shell. (Other
implementations may only flush the buffer associated with the standard output and not
necessarily all buffered output.)
If you think about what a programmer expects, it makes sense that system() should
flush any pending output. The following program:
BEGIN {
print "first print"
system("echo system echo")
print "second print"
}
must print:
7
A program is interactive if the standard output is connected to a terminal device. On modern systems,
this means your keyboard and screen.
Chapter 9: Functions
163
first print
system echo
second print
and not:
system echo
first print
second print
If awk did not flush its buffers before calling system(), you would see the latter (undesirable) output.
See [Glossary], page 347, especially the entries Epoch and UTC.
The GNU date utility can also do many of the things described here. Its use may be preferable for
simple time-related operations in shell scripts.
Occasionally there are minutes in a year with a leap second, which is why the seconds can go up to 60.
164
%A
%b
%B
%c
%C
The century part of the current year. This is the year divided by 100 and
truncated to the next lower integer.
11
Unfortunately, not every systems strftime() necessarily supports all of the conversions listed here.
Chapter 9: Functions
165
%d
%D
%e
The day of the month, padded with a space if it is only one digit.
%F
%g
The year modulo 100 of the ISO 8601 week number, as a decimal number (00
99). For example, January 1, 1993 is in week 53 of 1992. Thus, the year of
its ISO 8601 week number is 1992, even though its year is 1993. Similarly,
December 31, 1973 is in week 1 of 1974. Thus, the year of its ISO week number
is 1974, even though its year is 1973.
%G
%h
Equivalent to %b.
%H
%I
%j
%m
%M
%n
%p
%r
The locales 12-hour clock time. (This is %I:%M:%S %p in the "C" locale.)
%R
%S
%t
A TAB character.
%T
%u
%U
The week number of the year (the first Sunday as the first day of week one) as
a decimal number (0053).
%V
The week number of the year (the first Monday as the first day of week one) as
a decimal number (0153). The method for determining the week number is as
specified by ISO 8601. (To wit: if the week containing January 1 has four or
more days in the new year, then it is week one; otherwise it is week 53 of the
previous year and the next week is week one.)
%w
%W
The week number of the year (the first Monday as the first day of week one) as
a decimal number (0053).
%x
166
%X
%y
%Y
%z
The timezone offset in a +HHMM format (e.g., the format necessary to produce
RFC 822/RFC 1036 date headers).
%Z
A literal %.
The hour (24-hour clock) as a decimal number (023). Single-digit numbers are
padded with a space.
%l
The hour (12-hour clock) as a decimal number (112). Single-digit numbers are
padded with a space.
%s
Additionally, the alternate representations are recognized but their normal representations are used.
The following example is an awk implementation of the POSIX date utility. Normally,
the date utility prints the current date and time of day in a well-known format. However,
if you provide an argument to it that begins with a +, date copies nonformat specifier
characters to the standard output and interprets the current time according to the format
specifiers in the string. For example:
12
13
If you dont understand any of this, dont worry about it; these facilities are meant to make it easier to
internationalize programs. Other internationalization features are described in Chapter 10 [Internationalization with gawk], page 185.
This is because ISO C leaves the behavior of the C version of strftime() undefined and gawk uses the
systems version of strftime() if its there. Typically, the conversion specifier either does not appear in
the returned string or appears literally.
Chapter 9: Functions
167
# use UTC
gawk BEGIN {
format = "%a %b %e %H:%M:%S %Z %Y"
exitval = 0
if (ARGC > 2)
exitval = 1
else if (ARGC == 2) {
format = ARGV[1]
if (format ~ /^\+/)
format = substr(format, 2)
}
print strftime(format)
exit exitval
} "$@"
# remove leading +
Operands
0
1
Table 9.4: Bitwise Operations
Bit operator
AND
OR
XOR
0
1
0
1
0
1
0
0
0
1
0
1
0
1
1
1
1
0
168
As you can see, the result of an AND operation is 1 only when both bits are 1. The
result of an OR operation is 1 if either bit is 1. The result of an XOR operation is 1 if
either bit is 1, but not both. The next operation is the complement; the complement of 1
is 0 and the complement of 0 is 1. Thus, this operation flips all the bits of a given value.
Finally, two other common operations are to shift the bits left or right. For example,
if you have a bit string 10111001 and you shift it right by three bits, you end up with
00010111.14 If you start over again with 10111001 and shift it left by three bits, you end
up with 11001000. gawk provides built-in functions that implement the bitwise operations
just described. They are:
and(v1, v2)
Return the bitwise AND of the values provided by v1 and v2.
compl(val)
Return the bitwise complement of val.
lshift(val, count)
Return the value of val, shifted left by count bits.
or(v1, v2)
Return the bitwise OR of the values provided by v1 and v2.
rshift(val, count)
Return the value of val, shifted right by count bits.
xor(v1, v2)
Return the bitwise XOR of the values provided by v1 and v2.
For all of these functions, first the double precision floating-point value is converted to
the widest C unsigned integer type, then the bitwise operation is performed. If the result
cannot be represented exactly as a C double, leading nonzero bits are removed one by one
until it can be represented exactly. The result is then converted back into a C double. (If
you dont understand this paragraph, dont worry about it.)
Here is a user-defined function (see Section 9.2 [User-Defined Functions], page 170) that
illustrates the use of these functions:
14
This example shows that 0s come in on the left side. For gawk, this is always true, but in some languages,
its possible to have the left side fill with 1s. Caveat emptor.
Chapter 9: Functions
169
data, mask)
mask = 1
for (; bits != 0; bits = rshift(bits, 1))
data = (and(bits, mask) ? "1" : "0") data
while ((length(data) % 8) != 0)
data = "0" data
return data
}
BEGIN {
printf "123 = %s\n", bits2str(123)
printf "0123 = %s\n", bits2str(0123)
printf "0x99 = %s\n", bits2str(0x99)
comp = compl(0x99)
printf "compl(0x99) = %#x = %s\n", comp, bits2str(comp)
shift = lshift(0x99, 2)
printf "lshift(0x99, 2) = %#x = %s\n", shift, bits2str(shift)
shift = rshift(0x99, 2)
printf "rshift(0x99, 2) = %#x = %s\n", shift, bits2str(shift)
}
This program produces the following output when run:
$ gawk -f testbits.awk
a 123 = 01111011
a 0123 = 01010011
a 0x99 = 10011001
a compl(0x99) = 0xffffff66 = 11111111111111111111111101100110
a lshift(0x99, 2) = 0x264 = 0000001001100100
a rshift(0x99, 2) = 0x26 = 00100110
The bits2str() function turns a binary number into a string. The number 1 represents
a binary value where the rightmost bit is set to 1. Using this mask, the function repeatedly
checks the rightmost bit. ANDing the mask with the value indicates whether the rightmost
bit is 1 or not. If so, a "1" is concatenated onto the front of the string. Otherwise, a "0"
is added. The value is then shifted right by one bit and the loop continues until there are
no more 1 bits.
If the initial value is zero it returns a simple "0". Otherwise, at the end, it pads the value
with zeros to represent multiples of 8-bit quantities. This is typical in modern computers.
170
The main code in the BEGIN rule shows the difference between the decimal and octal values for the same numbers (see Section 6.1.1.2 [Octal and Hexadecimal Numbers], page 89),
and then demonstrates the results of the compl(), lshift(), and rshift() functions.
Chapter 9: Functions
171
172
Statement], page 177. Many of the subsequent examples in this section use the return
statement.
In many awk implementations, including gawk, the keyword function may be abbreviated func. (c.e.) However, POSIX only specifies the use of the keyword function.
This actually has some practical implications. If gawk is in POSIX-compatibility mode
(see Section 2.2 [Command-Line Options], page 25), then the following statement does not
define a function:
func foo() { a = sqrt($1) ; print a }
Instead it defines a rule that, for each record, concatenates the value of the variable func
with the return value of the function foo. If the resulting string is non-null, the action
is executed. This is probably not what is desired. (awk accepts this input as syntactically
valid, because functions may be used before they are defined in awk programs.15 )
To ensure that your awk programs are portable, always use the keyword function when
defining a function.
{ myprint($3) }
This program prints, in our special format, all the third fields that contain a positive number
in our input. Therefore, when given the following input:
1.2
3.4
5.6
7.8
9.10 11.12 -13.14 15.16
17.18 19.20 21.22 23.24
this program, using our function to format the results, prints:
5.6
21.2
This function deletes all the elements in an array:
function delarray(a,
{
for (i in a)
delete a[i]
}
i)
When working with arrays, it is often necessary to delete all the elements in an array and
start over with a new list of elements (see Section 8.2 [The delete Statement], page 139).
Instead of having to repeat this loop everywhere that you need to clear out an array, your
15
Chapter 9: Functions
173
program can just call delarray. (This guarantees portability. The use of delete array
to delete the contents of an entire array is a nonstandard extension.)
The following is an example of a recursive function. It takes a string as an input parameter and returns the string in backwards order. Recursive functions must always have a test
that stops the recursion. In this case, the recursion terminates when the starting position
is zero, i.e., when there are no more characters left in the string.
function rev(str, start)
{
if (start == 0)
return ""
return (substr(str, start, 1) rev(str, start - 1))
}
If this function is in a file named rev.awk, it can be tested this way:
$ echo "Dont Panic!" |
> gawk --source { print rev($0, length($0)) } -f rev.awk
a !cinaP tnoD
The C ctime() function takes a timestamp and returns it in a string, formatted in
a well-known fashion. The following example uses the built-in strftime() function (see
Section 9.1.5 [Time Functions], page 163) to create an awk version of ctime():
# ctime.awk
#
# awk version of C ctime(3) function
function ctime(ts,
format)
{
format = "%a %b %e %H:%M:%S %Z %Y"
if (ts == 0)
ts = systime()
# use current time as default
return strftime(format, ts)
}
174
whitespace by mistake, awk might think that you mean to concatenate a variable
with an expression in parentheses. However, it notices that you used a function
name and not a variable name, and reports an error.
i=10
i=1
i=0
i=1
i=2
i=3
i=3
If you want i to be local to both foo() and bar() do as follows (the extra-space before
i is a coding convention to indicate that i is a local variable, not an argument):
function bar(
{
i)
Chapter 9: Functions
175
i=10
i=1
i=0
i=1
i=2
i=1
i=10
176
{
print str
str = "zzz"
print str
}
to change its first argument variable str, it does not change the value of foo in the caller.
The role of foo in calling myfunc() ended when its value ("bar") was computed. If str
also exists outside of myfunc(), the function body cannot alter this outer value, because it
is shadowed during the execution of myfunc() and cannot be seen or changed from there.
However, when arrays are the parameters to functions, they are not copied. Instead, the
array itself is made available for direct manipulation by the function. This is usually termed
call by reference. Changes made to an array parameter inside the body of a function are
visible outside that function.
NOTE: Changing an array parameter inside a function can be very dangerous
if you do not watch what you are doing. For example:
function changeit(array, ind, nvalue)
{
array[ind] = nvalue
}
BEGIN {
a[1] = 1; a[2] = 2; a[3] = 3
changeit(a, 2, "two")
printf "a[1] = %s, a[2] = %s, a[3] = %s\n",
a[1], a[2], a[3]
}
prints a[1] = 1, a[2] = two, a[3] = 3, because changeit stores "two" in the
second element of a.
Some awk implementations allow you to call a function that has not been defined. They
only report a problem at runtime when the program actually tries to call the function. For
example:
BEGIN {
if (0)
foo()
else
bar()
}
function bar() { ... }
# note that foo is not defined
Because the if statement will never be true, it is not really a problem that foo() has not
been defined. Usually, though, it is a problem if a program calls an undefined function.
If --lint is specified (see Section 2.2 [Command-Line Options], page 25), gawk reports
calls to undefined functions.
Chapter 9: Functions
177
Some awk implementations generate a runtime error if you use the next statement (see
Section 7.4.8 [The next Statement], page 124) inside a user-defined function. gawk does not
have this limitation.
178
}
# Load all fields of each record into nums.
{
for(i = 1; i <= NF; i++)
nums[NR, i] = $i
}
END {
print maxelt(nums)
}
Given the following input:
1 5 23 8 16
44 3 5 2 8 26
256 291 1396 2962 100
-6 467 998 1101
99385 11 0 225
the program reports (predictably) that 99,385 is the largest value in the array.
}
Usually, such things arent a big issue, but its worth being aware of them.
Chapter 9: Functions
179
to a marker field data:. Following the marker, to the end of the record, are the various
numeric test scores.
Here is the initial file; you wish to get the sum and the average of your test scores:
Biology_101 sum average data: 87.0 92.4 78.5 94.9
Chemistry_305 sum average data: 75.2 98.3 94.7 88.2
English_401 sum average data: 100.0 95.6 87.1 93.4
To process the data, you might write initially:
{
class = $1
for (i = 2; $i != "data:"; i++) {
if ($i == "sum")
sum()
# processes the whole record
else if ($i == "average")
average()
...
# and so on
}
}
This style of programming works, but can be awkward. With indirect function calls, you
tell gawk to use the value of a variable as the name of the function to call.
The syntax is similar to that of a regular function call: an identifier immediately followed
by a left parenthesis, any arguments, and then a closing right parenthesis, with the addition
of a leading @ character:
the_func = "sum"
result = @the_func()
# calls the sum function
Here is a full program that processes the previously shown data, using indirect function
calls.
# indirectcall.awk --- Demonstrate indirect function calls
# average --- return the average of the values in fields $first - $last
function average(first, last,
sum, i)
{
sum = 0;
for (i = first; i <= last; i++)
sum += $i
return sum / (last - first + 1)
}
# sum --- return the sum of the values in fields $first - $last
function sum(first, last,
ret, i)
{
ret = 0;
for (i = first; i <= last; i++)
180
ret += $i
return ret
}
These two functions expect to work on fields; thus the parameters first and last indicate where in the fields to start and end. Otherwise they perform the expected computations
and are not unusual.
# For each record, print the class name and the requested statistics
{
class_name = $1
gsub(/_/, " ", class_name)
# find start
for (i = 1; i <= NF; i++) {
if ($i == "data:") {
start = i + 1
break
}
}
printf("%s:\n", class_name)
for (i = 2; $i != "data:"; i++) {
the_function = $i
printf("\t%s: <%s>\n", $i, @the_function(start, NF) "")
}
print ""
}
This is the main processing for each record. It prints the class name (with underscores
replaced with spaces). It then finds the start of the actual data, saving it in start. The
last part of the code loops through each function name (from $2 up to the marker, data:),
calling the function named by the field. The indirect function call itself occurs as a parameter in the call to printf. (The printf format string uses %s as the format specifier so
that we can use functions that return strings, as well as numbers. Note that the result from
the indirect call is concatenated with the empty string, in order to force it to be a string
value.)
Here is the result of running the program:
$ gawk -f indirectcall.awk class_data1
a Biology 101:
sum: <352.8>
a
average: <88.2>
a
a
a Chemistry 305:
sum: <356.4>
a
average: <89.1>
a
a
Chapter 9: Functions
181
a English 401:
sum: <376.1>
a
average: <94.025>
a
The ability to use indirect function calls is more powerful than you may think at first.
The C and C++ languages provide function pointers, which are a mechanism for calling
a function chosen at runtime. One of the most well-known uses of this ability is the C
qsort() function, which sorts an array using the famous quick sort algorithm (see the
Wikipedia article for more information). To use this function, you supply a pointer to a
comparison function. This mechanism allows you to sort arbitrary data in an arbitrary
fashion.
We can do something similar using gawk, like this:
# quicksort.awk --- Quicksort algorithm, with user-supplied
#
comparison function
# quicksort --- C.A.R. Hoares quick sort algorithm. See Wikipedia
#
or almost any algorithms or computer science text
function quicksort(data, left, right, less_than,
i, last)
{
if (left >= right) # do nothing if array contains fewer
return
# than two elements
quicksort_swap(data, left, int((left + right) / 2))
last = left
for (i = left + 1; i <= right; i++)
if (@less_than(data[i], data[left]))
quicksort_swap(data, ++last, i)
quicksort_swap(data, left, last)
quicksort(data, left, last - 1, less_than)
quicksort(data, last + 1, right, less_than)
}
# quicksort_swap --- helper function for quicksort, should really be inline
function quicksort_swap(data, i, j, temp)
{
temp = data[i]
data[i] = data[j]
data[j] = temp
}
The quicksort() function receives the data array, the starting and ending indices to
sort (left and right), and the name of a function that performs a less than comparison.
It then implements the quick sort algorithm.
To make use of the sorting function, we return to our previous example. The first thing
to do is write some comparison functions:
# num_lt --- do a numeric less than comparison
182
data, i, retval)
Chapter 9: Functions
183
# rsort --- sort the data in descending order and return it as a string
function rsort(first, last)
{
return do_sort(first, last, "num_ge")
}
Here is an extended version of the data file:
Biology_101 sum average sort rsort data: 87.0 92.4 78.5 94.9
Chemistry_305 sum average sort rsort data: 75.2 98.3 94.7 88.2
English_401 sum average sort rsort data: 100.0 95.6 87.1 93.4
Finally, here are the results when the enhanced program is run:
$ gawk -f quicksort.awk -f indirectcall.awk class_data2
a Biology 101:
sum: <352.8>
a
average: <88.2>
a
sort: <78.5 87.0 92.4 94.9>
a
rsort: <94.9 92.4 87.0 78.5>
a
a
a Chemistry 305:
sum: <356.4>
a
average: <89.1>
a
sort: <75.2 88.2 94.7 98.3>
a
rsort: <98.3 94.7 88.2 75.2>
a
a
a English 401:
sum: <376.1>
a
average: <94.025>
a
sort: <87.1 93.4 95.6 100.0>
a
rsort: <100.0 95.6 93.4 87.1>
a
Remember that you must supply a leading @ in front of an indirect function call.
Unfortunately, indirect function calls cannot be used with the built-in functions. However, you can generally write wrapper functions which call the built-in ones, and those
can be called indirectly. (Other than, perhaps, the mathematical functions, there is not a
lot of reason to try to call the built-in functions indirectly.)
gawk does its best to make indirect function calls efficient. For example, in the following
case:
for (i = 1; i <= n; i++)
@the_func()
gawk will look up the actual function to call only once.
For some operating systems, the gawk port doesnt support GNU gettext. Therefore, these features are
not available if you are using one of those operating systems. Sorry.
186
4. For each language with a translator, guide.pot is copied to a portable object file
(.po) and translations are created and shipped with the application. For example,
there might be a fr.po for a French translation.
5. Each languages .po file is converted into a binary message object (.mo) file. A
message object file contains the original messages and their translations in a binary
format that allows fast lookup of translations at runtime.
6. When guide is built and installed, the binary translation files are installed in a standard
place.
7. For testing and development, it is possible to tell gettext to use .mo files in a different
directory than the standard one by using the bindtextdomain() function.
8. At runtime, guide looks up each string via a call to gettext(). The returned string
is the translated string if available, or the original string if not.
9. If necessary, it is possible to access messages from a different text domain than the one
belonging to the application, without having to switch the applications default text
domain back and forth.
In C (or C++), the string marking and dynamic translation lookup are accomplished by
wrapping each string in a call to gettext():
printf("%s", gettext("Dont Panic!\n"));
The tools that extract messages from source code pull out all strings enclosed in calls to
gettext().
The GNU gettext developers, recognizing that typing gettext(...) over and over
again is both painful and ugly to look at, use the macro _ (an underscore) to make things
easier:
/* In the standard header file: */
#define _(str) gettext(str)
/* In the program text: */
printf("%s", _("Dont Panic!\n"));
This reduces the typing overhead to just three extra characters per string and is considerably
easier to read as well.
There are locale categories for different types of locale-related information. The defined
locale categories that gettext knows about are:
LC_MESSAGES
Text messages. This is the default category for gettext operations, but it is
possible to supply a different one explicitly, if necessary. (It is almost never
necessary to supply a different category.)
LC_COLLATE
Text-collation information; i.e., how different characters and/or groups of characters sort in a given language.
LC_CTYPE
LC_MONETARY
Monetary information, such as the currency symbol, and whether the symbol
goes before or after a number.
LC_NUMERIC
Numeric information, such as which characters to use for the decimal point and
the thousands separator.2
LC_RESPONSE
Response information, such as how yes and no appear in the local language,
and possibly other information as well.
LC_TIME
Time- and date-related information, such as 12- or 24-hour clock, month printed
before or after the day in a date, local month abbreviations, and so on.
LC_ALL
Americans use a comma every three decimal places and a period for the decimal point, while many
Europeans do exactly the opposite: 1,234.56 versus 1.234,56.
188
bindtextdomain(directory [, domain])
Change the directory in which gettext looks for .mo files, in case they will
not or cannot be placed in the standard locations (e.g., during testing). Return
the directory in which domain is bound.
The default domain is the value of TEXTDOMAIN. If directory is the null string
(""), then bindtextdomain() returns the current binding for the given domain.
To use these facilities in your awk program, follow the steps outlined in the previous
section, like so:
1. Set the variable TEXTDOMAIN to the text domain of your program. This is best done
in a BEGIN rule (see Section 7.1.4 [The BEGIN and END Special Patterns], page 114), or
it can also be done via the -v command-line option (see Section 2.2 [Command-Line
Options], page 25):
BEGIN {
TEXTDOMAIN = "guide"
...
}
2. Mark all translatable strings with a leading underscore (_) character. It must be
adjacent to the opening quote of the string. For example:
print _"hello, world"
x = _"you goofed"
printf(_"Number of users is %d\n", nusers)
3. If you are creating strings dynamically, you can still translate them, using the
dcgettext() built-in function:
message = nusers " users logged in"
message = dcgettext(message, "adminprog")
print message
Here, the call to dcgettext() supplies a different text domain ("adminprog") in which
to find the message, but it uses the default "LC_MESSAGES" category.
4. During development, you might want to put the .mo file in a private directory for
testing. This is done with the bindtextdomain() built-in function:
BEGIN {
TEXTDOMAIN = "guide"
# our text domain
if (Testing) {
# where to find our files
bindtextdomain("testdir")
# joe is in charge of adminprog
bindtextdomain("../joe/testdir", "adminprog")
}
...
}
See Section 10.5 [A Simple Internationalization Example], page 191, for an example
program showing the steps to create and use translations from awk.
The xgettext utility that comes with GNU gettext can handle .awk files.
This example is borrowed from the GNU gettext manual.
190
> }
a 10 characters live in "Dont Panic"
If present, positional specifiers come first in the format specification, before the flags,
the field width, and/or the precision.
Positional specifiers can be used with the dynamic field width and precision capability:
$ gawk BEGIN {
>
printf("%*.*s\n", 10, 20, "hello")
>
printf("%3$*2$.*1$s\n", 20, 10, "hello")
> }
hello
a
hello
a
NOTE: When using * with a positional specifier, the * comes first, then the
integer position, and then the $. This is somewhat counterintuitive.
gawk does not allow you to mix regular format specifiers and those with positional
specifiers in the same string:
$ gawk BEGIN { printf _"%d %3$s\n", 1, 2, "hi" }
error gawk: cmd. line:1: fatal: must use count$ on all formats or none
NOTE: There are some pathological cases that gawk may fail to diagnose. In
such cases, the output may not be what you expect. Its still a bad idea to try
mixing them, even if gawk doesnt detect it.
Although positional specifiers can be used directly in awk programs, their primary purpose is to help in producing correct translations of format strings into languages different
from the one in which the program is first written.
192
196
198
$ gawk -f compdemo.awk
a Sort function: cmp_num_idx
data[two] = 20
a
data[one] = 10
a
data[10] = one
a
data[20] = two
a
data[100] = 100
a
a
a Sort function: cmp_str_val
data[one] = 10
a
data[100] = 100
a
data[two] = 20
a
data[10] = one
a
data[20] = two
a
a
a Sort function: cmp_num_str_val
data[one] = 10
a
data[two] = 20
a
data[100] = 100
a
data[10] = one
a
data[20] = two
a
Consider sorting the entries of a GNU/Linux system password file according to login
names. The following program sorts records by a specific field position and can be used for
this purpose:
# sort.awk --- simple program to sort by field position
# field position is specified by the global variable POS
function cmp_field(i1, v1, i2, v2)
{
# comparison by value, as string, and ascending order
return v1[POS] < v2[POS] ? -1 : (v1[POS] != v2[POS])
}
{
for (i = 1; i <= NF; i++)
a[NR][i] = $i
}
END {
PROCINFO["sorted_in"] = "cmp_field"
if (POS < 1 || POS > NF)
POS = 1
for (i in a) {
for (j = 1; j <= NF; j++)
printf("%s%c", a[i][j], j < NF ? ":" : "")
print ""
}
}
The first field in each entry of the password file is the users login name, and the fields
are seperated by colons. Each record defines a subarray (see Section 8.6 [Arrays of Arrays],
page 144), with each field as an element in the subarray. Running the program produces
the following output:
$ gawk -vPOS=1 -F: -f sort.awk /etc/passwd
a adm:x:3:4:adm:/var/adm:/sbin/nologin
a apache:x:48:48:Apache:/var/www:/sbin/nologin
a avahi:x:70:70:Avahi daemon:/:/sbin/nologin
...
The comparison should normally always return the same value when given a specific
pair of array elements as its arguments. If inconsistent results are returned then the order
is undefined. This behavior can be exploited to introduce random order into otherwise
seemingly ordered data:
function cmp_randomize(i1, v1, i2, v2)
{
# random order
return (2 - 4 * rand())
}
As mentioned above, the order of the indices is arbitrary if two elements compare equal.
This is usually not a problem, but letting the tied elements come out in arbitrary order
can be an issue, especially when comparing item values. The partial ordering of the equal
elements may change during the next loop traversal, if other elements are added or removed
from the array. One way to resolve ties when comparing elements with otherwise equal
values is to include the indices in the comparison rules. Note that doing this may make
the loop traversal less efficient, so consider it only if necessary. The following comparison
functions force a deterministic order, and are based on the fact that the indices of two
elements are never equal:
function cmp_numeric(i1, v1, i2, v2)
{
# numerical value (and index) comparison, descending order
return (v1 != v2) ? (v2 - v1) : (i2 - i1)
}
function cmp_string(i1, v1, i2, v2)
{
# string value (and index) comparison, descending order
v1 = v1 i1
v2 = v2 i2
return (v1 > v2) ? -1 : (v1 != v2)
}
A custom comparison function can often simplify ordered loop traversal, and the sky is
really the limit when it comes to designing such a function.
200
When string comparisons are made during a sort, either for element values where one
or both arent numbers, or for element indices handled as strings, the value of IGNORECASE
(see Section 7.5 [Built-in Variables], page 126) controls whether the comparisons treat corresponding uppercase and lowercase letters as equivalent or distinct.
Another point to keep in mind is that in the case of subarrays the element values can
themselves be arrays; a production comparison function should use the isarray() function
(see Section 9.1.7 [Getting Type Information], page 170), to check for this, and choose a
defined sorting order for subarrays.
All sorting based on PROCINFO["sorted_in"] is disabled in POSIX mode, since the
PROCINFO array is not special in that case.
As a side note, sorting the array indices before traversing the array has been reported to
add 15% to 20% overhead to the execution time of awk programs. For this reason, sorted
array traversal is not the default.
the string values are used to provide an ordering: this guarantees consistent
results across different versions of the C qsort() function.1
"@ind_str_desc"
Reverse order from the most basic sort.
"@ind_num_desc"
Numeric indices ordered from high to low.
"@val_type_desc"
Element values, based on type, in descending order.
"@val_str_desc"
Element values, treated as strings, ordered from high to low. Subarrays, if
present, come out first.
"@val_num_desc"
Element values, treated as numbers, ordered from high to low. Subarrays, if
present, come out first.
"@unsorted"
Array elements are processed in arbitrary order, which is the normal awk behavior. You can also get the normal behavior by just deleting the "sorted_in"
element from the PROCINFO array, if it previously had a value assigned to it.
The array traversal order is determined before the for loop starts to run. Changing
PROCINFO["sorted_in"] in the loop body will not affect the loop.
For example:
$ gawk BEGIN {
>
a[4] = 4
>
a[3] = 3
>
for (i in a)
>
print i, a[i]
> }
a 4 4
a 3 3
$ gawk BEGIN {
>
PROCINFO["sorted_in"] = "@str_ind_asc"
>
a[4] = 4
>
a[3] = 3
>
for (i in a)
>
print i, a[i]
> }
a 3 3
a 4 4
When sorting an array by element values, if a value happens to be a subarray then it is
considered to be greater than any string or numeric value, regardless of what the subarray
1
When two elements compare as equal, the C qsort() function does not guarantee that they will maintain
their original relative order after sorting. Using the string value to provide a unique ordering when the
numeric values are equal ensures that gawk behaves consistently across different environments.
202
itself contains, and all subarrays are treated as being equal to each other. Their order
relative to each other is determined by their index strings.
}
Similar to asort(), in all cases, the sorted element values consist of the original arrays
indices. The ability to control comparison merely affects the way in which they are sorted.
Sorting the array by replacing the indices provides maximal flexibility. To traverse the
elements in decreasing order, use a loop that goes from n down to 1, either over the elements
or over the indices.2
Copying array indices and elements isnt expensive in terms of memory. Internally, gawk
maintains reference counts to data. For example, when asort() copies the first array to
the second one, there is only one copy of the original array elements data, even though
both arrays use the values.
Because IGNORECASE affects string comparisons, the value of IGNORECASE also affects
sorting for both asort() and asorti(). Note also that the locales sorting order does not
come into play; comparisons are based on character values only.3 Caveat Emptor.
It is often useful to be able to send data to a separate program for processing and then
read the result. This can always be done with temporary files:
# Write the data for processing
tempfile = ("mydata." PROCINFO["pid"])
while (not done with data)
print data | ("subprogram > " tempfile)
close("subprogram > " tempfile)
# Read the results, remove tempfile when done
while ((getline newdata < tempfile) > 0)
process newdata appropriately
close(tempfile)
system("rm " tempfile)
2
3
You may also use one of the predefined sorting names that sorts in decreasing order.
This is true because locale-based comparison occurs only when in POSIX compatibility mode, and since
asort() and asorti() are gawk extensions, they are not available in that case.
204
This works, but not elegantly. Among other things, it requires that the program be run in
a directory that cannot be shared among users; for example, /tmp will not do, as another
user might happen to be using a temporary file with the same name.
However, with gawk, it is possible to open a two-way pipe to another process. The second
process is termed a coprocess, since it runs in parallel with gawk. The two-way connection
is created using the |& operator (borrowed from the Korn shell, ksh):4
do {
print data |& "subprogram"
"subprogram" |& getline results
} while (data left to process)
close("subprogram")
The first time an I/O operation is executed using the |& operator, gawk creates a twoway pipeline to a child process that runs the other program. Output created with print
or printf is written to the programs standard input, and output from the programs
standard output can be read by the gawk program using getline. As is the case with
processes started by |, the subprogram can be any program, or pipeline of programs, that
can be started by the shell.
There are some cautionary items to be aware of:
As the code inside gawk currently stands, the coprocesss standard error goes to the
same place that the parent gawks standard error goes. It is not possible to read the
childs standard error separately.
I/O buffering may be a problem. gawk automatically flushes all output down the pipe
to the coprocess. However, if the coprocess does not flush its output, gawk may hang
when doing a getline in order to read the coprocesss results. This could lead to a
situation known as deadlock, where each process is waiting for the other one to do
something.
It is possible to close just one end of the two-way pipe to a coprocess, by supplying a
second argument to the close() function of either "to" or "from" (see Section 5.8 [Closing
Input and Output Redirections], page 86). These strings tell gawk to close the end of the
pipe that sends data to the coprocess or the end that reads from it, respectively.
This is particularly necessary in order to use the system sort utility as part of a coprocess; sort must read all of its input data before it can produce any output. The sort
program does not receive an end-of-file indication until gawk closes the write end of the
pipe.
When you have finished writing data to the sort utility, you can close the "to" end of
the pipe, and then start reading sorted data via getline. For example:
BEGIN {
command = "LC_ALL=C sort"
n = split("abcdefghijklmnopqrstuvwxyz", a, "")
for (i = n; i > 0; i--)
print a[i] |& command
close(command, "to")
4
Specifies the kind of Internet connection to make. Use /inet4/ to force IPv4,
and /inet6/ to force IPv6. Plain /inet/ (which used to be the only option)
uses the system default, most likely IPv4.
206
protocol
The protocol to use over IP. This must be either tcp, or udp, for a TCP or
UDP IP connection, respectively. The use of TCP is recommended for most
applications.
local-port
The local TCP or UDP port number to use. Use a port number of 0 when
you want the system to pick a port. This is what you should do when writing
a TCP or UDP client. You may also use a well-known service name, such as
smtp or http, in which case gawk attempts to determine the predefined port
number using the C getaddrinfo() function.
remote-host
The IP address or fully-qualified domain name of the Internet host to which
you want to connect.
remote-port
The TCP or UDP port number to use on the given remote-host. Again, use 0
if you dont care, or else a well-known service name.
NOTE: Failure in opening a two-way socket will result in a non-fatal error
being returned to the calling code. The value of ERRNO indicates the error (see
Section 7.5.2 [Built-in Variables That Convey Information], page 129).
Consider the following very simple example:
BEGIN {
Service = "/inet/tcp/0/localhost/daytime"
Service |& getline
print $0
close(Service)
}
This program reads the current date and time from the local systems TCP daytime
server. It then prints the results and closes the connection.
Because this topic is extensive, the use of gawk for TCP/IP programming is documented
separately. See TCP/IP Internetworking with gawk, which comes as part of the gawk
distribution, for a much more complete introduction and discussion, as well as extensive
examples.
5
2
/foo/
{ # 2
print "matched /foo/, gosh"
208
6
6
5
5
2
3
3
{
if (/foo/) { # 2
print "if is true"
} else {
print "else is true"
}
}
# END block(s)
END {
1
1
6
6
function sing(dummy)
{
print "I gotta be me!"
}
This example illustrates many of the basic features of profiling output. They are as
follows:
The program is printed in the order BEGIN rule, BEGINFILE rule, pattern/action rules,
ENDFILE rule, END rule and functions, listed alphabetically. Multiple BEGIN and END
rules are merged together, as are multiple BEGINFILE and ENDFILE rules.
Pattern-action rules have two counts. The first count, to the left of the rule, shows
how many times the rules pattern was tested. The second count, to the right of the
rules opening left brace in a comment, shows how many times the rules action was
executed. The difference between the two indicates how many times the rules pattern
evaluated to false.
Similarly, the count for an if-else statement shows how many times the condition was
tested. To the right of the opening left brace for the ifs body is a count showing how
many times the condition was true. The count for the else indicates how many times
the test failed.
The count for a loop header (such as for or while) shows how many times the loop test
was executed. (Because of this, you cant just look at the count on the first statement
in a rule to determine how many times the rule was executed. If the first statement is
a loop, the count is misleading.)
For user-defined functions, the count next to the function keyword indicates how
many times the function was called. The counts next to the statements in the body
show how many times those statements were executed.
The layout uses K&R style with TABs. Braces are used everywhere, even when the
body of an if, else, or loop is only a single statement.
Parentheses are used only where needed, as indicated by the structure of the program
and the precedence rules. For example, (3 + 5) * 4 means add three plus five, then
multiply the total by four. However, 3 + 5 * 4 has no parentheses, and means 3 + (5
* 4).
Parentheses are used around the arguments to print and printf only when the print
or printf statement is followed by a redirection. Similarly, if the target of a redirection
isnt a scalar, it gets parenthesized.
pgawk supplies leading comments in front of the BEGIN and END rules, the pattern/action
rules, and the functions.
The profiled version of your program may not look exactly like what you typed when
you wrote it. This is because pgawk creates the profiled version by pretty printing its
internal representation of the program. The advantage to this is that pgawk can produce a
standard representation. The disadvantage is that all source-code comments are lost, as are
the distinctions among multiple BEGIN, END, BEGINFILE, and ENDFILE rules. Also, things
such as:
/foo/
come out as:
/foo/
{
print $0
}
which is correct, but possibly surprising.
Besides creating profiles when a program has completed, pgawk can produce a profile
while it is running. This is useful if your awk program goes into an infinite loop and you
want to see what has been executed. To use this feature, run pgawk in the background:
$ pgawk -f myprog &
[1] 13992
The shell prints a job number and process ID number; in this case, 13992. Use the kill
command to send the USR1 signal to pgawk:
$ kill -USR1 13992
As usual, the profiled version of the program is written to awkprof.out, or to a different
file if you use the --profile option.
Along with the regular profile, as shown earlier, the profile includes a trace of any active
functions:
# Function Call Stack:
#
3. baz
#
2. bar
#
1. foo
# -- main --
210
You may send pgawk the USR1 signal as many times as you like. Each time, the profile
and function call trace are appended to the output profile file.
If you use the HUP signal instead of the USR1 signal, pgawk produces the profile and the
function call trace and then exits.
When pgawk runs on MS-Windows systems, it uses the INT and QUIT signals for producing the profile and, in the case of the INT signal, pgawk exits. This is because these systems
dont support the kill command, so the only signals you can deliver to a program are those
generated by the keyboard. The INT signal is generated by the Ctrl-C or Ctrl-BREAK key,
while the QUIT signal is generated by the Ctrl-\ key.
Finally, regular gawk also accepts the --profile option. When called this way, gawk
pretty prints the program into awkprof.out, without any execution counts.
The effects are not identical. Output of the transformed record will be in all lowercase, while IGNORECASE
preserves the original contents of the input record.
212
Section 12.4 [Processing Command-Line Options], page 225). Such variables are called
private, since the only functions that need to use them are the ones in the library.
When writing a library function, you should try to choose names for your private variables that will not conflict with any variables used by either another library function or a
users main program. For example, a name like i or j is not a good choice, because user
programs often use variable names like these for their own purposes.
The example programs shown in this chapter all start the names of their private variables
with an underscore (_). Users generally dont use leading underscores in their variable
names, so this convention immediately decreases the chances that the variable name will be
accidentally shared with the users program.
In addition, several of the library functions use a prefix that helps indicate what function
or set of functions use the variablesfor example, _pw_byname in the user database routines
(see Section 12.5 [Reading the User Database], page 230). This convention is recommended,
since it even further decreases the chance of inadvertent conflict among variable names. Note
that this convention is used equally well for variable names and for private function names.2
As a final note on variable naming, if a function makes global variables available for use
by a main program, it is a good convention to start that variables name with a capital
letterfor example, getopt()s Opterr and Optind variables (see Section 12.4 [Processing
Command-Line Options], page 225). The leading capital letter indicates that it is global,
while the fact that the variable name is not all capital letters indicates that the variable is
not one of awks built-in variables, such as FS.
It is also important that all variables in library functions that do not need to save state
are, in fact, declared local.3 If this is not done, the variable could accidentally be used in
the users program, leading to bugs that are very difficult to track down:
function lib_func(x, y,
l1, l2)
{
...
use variable some_var
# some_var should be local
...
# but is not by oversight
}
A different convention, common in the Tcl community, is to use a single associative
array to hold the values needed by the library function(s), or package. This significantly
decreases the number of actual global names in use. For example, the functions described
in Section 12.5 [Reading the User Database], page 230, might have used array elements
PW_data["inited"], PW_data["total"], PW_data["count"], and PW_data["awklib"],
instead of _pw_inited, _pw_awklib, _pw_total, and _pw_count.
The conventions presented in this section are exactly that: conventions. You are not
required to write your programs this waywe merely recommend that you do so.
While all the library routines could have been rewritten to use this convention, this was not done, in order
to show how our own awk programming style has evolved and to provide some basis for this discussion.
gawks --dump-variables command-line option is useful for verifying this.
214
#
a[2] = ".31"
#
a[3] = "0123"
#
a[4] = "0xdeadBEEF"
#
a[5] = "123.45"
#
a[6] = "1.e3"
#
a[7] = "1.32"
#
a[7] = "1.32E2"
#
#
for (i = 1; i in a; i++)
#
print a[i], strtonum(a[i]), mystrtonum(a[i])
# }
The function first looks for C-style octal numbers (base 8). If the input string matches a
regular expression describing octal numbers, then mystrtonum() loops through each character in the string. It sets k to the index in "01234567" of the current octal digit. Since
the return value is one-based, the k-- adjusts k so it can be used in computing the return
value.
Similar logic applies to the code that checks for and converts a hexadecimal value, which
starts with 0x or 0X. The use of tolower() simplifies the computation for finding the
correct numeric value for each hexadecimal digit.
Finally, if the string matches the (rather complicated) regexp for a regular decimal integer
or floating-point number, the computation ret = str + 0 lets awk convert the value to a
number.
A commented-out test program is included, so that the function can be tested with gawk
and the results compared to the built-in strtonum() function.
12.2.2 Assertions
When writing large programs, it is often useful to know that a condition or set of conditions
is true. Before proceeding with a particular computation, you make a statement about
what you believe to be the case. Such a statement is known as an assertion. The C
language provides an <assert.h> header file and corresponding assert() macro that the
programmer can use to make assertions. If an assertion fails, the assert() macro arranges
to print a diagnostic message describing the condition that should have been true but was
not, and then it kills the program. In C, using assert() looks this:
#include <assert.h>
int myfunc(int a, double b)
{
assert(a <= 5 && b >= 17.1);
...
}
If the assertion fails, the program prints a message similar to this:
prog.c:5: assertion failed: a <= 5 && b >= 17.1
The C language makes it possible to turn the condition into a string for use in printing
the diagnostic message. This is not possible in awk, so this assert() function also requires
a string version of the condition that is being tested. Following is the function:
216
if (_cliff_seed < 0)
_cliff_seed = - _cliff_seed
return _cliff_seed
}
This algorithm requires an initial seed of 0.1. Each new value uses the current seed
as input for the calculation. If the built-in rand() function (see Section 9.1.2 [Numeric
Functions], page 147) isnt random enough, you might try using this function instead.
{ _ord_init() }
function _ord_init(
low, high, i, t)
{
low = sprintf("%c", 7) # BEL is ascii 7
if (low == "\a") {
# regular ascii
low = 0
high = 127
} else if (sprintf("%c", 128 + 7) == "\a") {
# ascii, mark parity
low = 128
high = 255
} else {
# ebcdic(!)
low = 0
high = 255
}
for (i = low; i <= high; i++) {
t = sprintf("%c", i)
_ord_[t] = i
}
}
218
Some explanation of the numbers used by chr is worthwhile. The most prominent
character set in use today is ASCII.4 Although an 8-bit byte can hold 256 distinct values
(from 0 to 255), ASCII only defines characters that use the values from 0 to 127.5 In the now
distant past, at least one minicomputer manufacturer used ASCII, but with mark parity,
meaning that the leftmost bit in the byte is always 1. This means that on those systems,
characters have numeric values from 128 to 255. Finally, large mainframe systems use the
EBCDIC character set, which uses all 256 values. While there are other character sets in
use on some older systems, they are not really worth worrying about:
function ord(str,
c)
{
# only first character is of interest
c = substr(str, 1, 1)
return _ord_[c]
}
function chr(c)
{
# force c to be numeric by adding 0
return sprintf("%c", c + 0)
}
#### test code ####
# BEGIN
\
# {
#
for (;;) {
#
printf("enter a character: ")
#
if (getline var <= 0)
#
break
#
printf("ord(%s) = %d\n", var, ord(var))
#
}
# }
An obvious improvement to these functions is to move the code for the _ord_init function into the body of the BEGIN rule. It was written this way initially for ease of development.
There is a test program in a BEGIN rule, to test the function. It is commented out for
production use.
This is changing; many systems use Unicode, a very large character set that includes ASCII as a subset.
On systems with full Unicode support, a character can occupy up to 32 bits, making simple tests such
as used here prohibitively expensive.
ASCII has been extended in many countries to use the values from 128 to 255 for country-specific
characters. If your system uses these extensions, you can simplify _ord_init to loop from 0 to 255.
Good function design is important; this function needs to be general but it should also
have a reasonable default behavior. It is called with an array as well as the beginning and
ending indices of the elements in the array to be merged. This assumes that the array indices
are numerica reasonable assumption since the array was likely created with split() (see
Section 9.1.3 [String-Manipulation Functions], page 149):
# join.awk --- join an array into a string
function join(array, start, end, sep,
result, i)
{
if (sep == "")
sep = " "
else if (sep == SUBSEP) # magic value
sep = ""
result = array[start]
for (i = start + 1; i <= end; i++)
result = result sep array[i]
return result
}
An optional additional argument is the separator to use when joining the strings back
together. If the caller supplies a nonempty value, join() uses it; if it is not supplied, it has
a null value. In this case, join() uses a single space as a default separator for the strings.
If the value is equal to SUBSEP, then join() joins the strings with no separator between
them. SUBSEP serves as a magic value to indicate that there should be no separation
between the component strings.6
It would be nice if awk had an assignment operator for concatenation. The lack of an explicit operator
for concatenation makes string operations more difficult than they really need to be.
220
#
#
#
#
#
#
#
#
#
#
#
#
#
time["monthname"]
time["shortmonth"]
time["year"]
time["fullyear"]
time["weekday"]
time["altweekday"]
time["dayname"]
time["shortdayname"]
time["yearday"]
time["timezone"]
time["ampm"]
time["weeknum"]
time["altweeknum"]
--------------
function gettimeofday(time,
ret, now, i)
{
# get time once, avoids unnecessary system calls
now = systime()
# return date(1)-style output
ret = strftime("%a %b %e %H:%M:%S %Z %Y", now)
# clear out target array
delete time
# fill in values, force numeric values to be
# numeric by adding 0
time["second"]
= strftime("%S", now) +
time["minute"]
= strftime("%M", now) +
time["hour"]
= strftime("%H", now) +
time["althour"]
= strftime("%I", now) +
time["monthday"]
= strftime("%d", now) +
time["month"]
= strftime("%m", now) +
time["monthname"]
= strftime("%B", now)
time["shortmonth"]
= strftime("%b", now)
time["year"]
= strftime("%y", now) +
time["fullyear"]
= strftime("%Y", now) +
time["weekday"]
= strftime("%w", now) +
time["altweekday"]
= strftime("%u", now) +
time["dayname"]
= strftime("%A", now)
time["shortdayname"] = strftime("%a", now)
time["yearday"]
= strftime("%j", now) +
time["timezone"]
= strftime("%Z", now)
time["ampm"]
= strftime("%p", now)
time["weeknum"]
= strftime("%U", now) +
time["altweeknum"]
= strftime("%W", now) +
0
0
0
0
0
0
0
0
0
0
0
0
return ret
}
The string indices are easier to use and read than the various formats required by
strftime(). The alarm program presented in Section 13.3.2 [An Alarm Clock Program],
page 262, uses this function. A more general design for the gettimeofday() function would
have allowed the user to supply an optional timestamp value to use instead of the current
time.
transfile.awk
Give the user a hook for filename transitions
The user must supply functions beginfile() and endfile()
that each take the name of the file being started or
finished, respectively.
FILENAME != _oldfilename \
{
if (_oldfilename != "")
endfile(_oldfilename)
_oldfilename = FILENAME
beginfile(FILENAME)
}
END
{ endfile(FILENAME) }
This file must be loaded before the users main program, so that the rule it supplies
is executed first.
222
This rule relies on awks FILENAME variable that automatically changes for each new
data file. The current file name is saved in a private variable, _oldfilename. If FILENAME
does not equal _oldfilename, then a new data file is being processed and it is necessary to
call endfile() for the old file. Because endfile() should only be called if a file has been
processed, the program first checks to make sure that _oldfilename is not the null string.
The program then assigns the current file name to _oldfilename and calls beginfile()
for the file. Because, like all awk variables, _oldfilename is initialized to the null string,
this rule executes correctly even for the first data file.
The program also supplies an END rule to do the final processing for the last file. Because
this END rule comes before any END rules supplied in the main program, endfile() is called
first. Once again the value of multiple BEGIN and END rules should be clear.
If the same data file occurs twice in a row on the command line, then endfile() and
beginfile() are not executed at the end of the first pass and at the beginning of the second
pass. The following version solves the problem:
# ftrans.awk --- handle data file transitions
#
# user supplies beginfile() and endfile() functions
FNR == 1 {
if (_filename_ != "")
endfile(_filename_)
_filename_ = FILENAME
beginfile(FILENAME)
}
END
{ endfile(_filename_) }
Section 13.2.7 [Counting Things], page 259, shows how this library function can be used
and how it simplifies writing the main program.
However, as long as you are not in the END rule, it is quite easy to arrange to immediately
close the current input file and then start over with it from the top. For lack of a better
name, well call it rewind():
# rewind.awk --- rewind the current file and start over
function rewind(
i)
{
# shift remaining arguments up
for (i = ARGC; i > ARGIND; i--)
ARGV[i] = ARGV[i-1]
# make sure gawk knows to keep going
ARGC++
# make current file next to get done
ARGV[ARGIND+1] = FILENAME
# do it
nextfile
}
This code relies on the ARGIND variable (see Section 7.5.2 [Built-in Variables That Convey
Information], page 129), which is specific to gawk. If you are not using gawk, you can use
ideas presented in the previous section to either update ARGIND on your own or modify this
code as appropriate.
The rewind() function also relies on the nextfile keyword (see Section 7.4.9 [Using
gawks nextfile Statement], page 125).
224
This works, because the getline wont be fatal. Removing the element from ARGV with
delete skips the file (since its no longer in the list). See also Section 7.5.3 [Using ARGC
and ARGV], page 133.
226
When using getopt(), options that do not take arguments can be grouped together.
Furthermore, options that take arguments require that the argument be present. The
argument can immediately follow the option letter, or it can be a separate command-line
argument.
Given a hypothetical program that takes three command-line options, -a, -b, and
-c, where -b requires an argument, all of the following are valid ways of invoking the
program:
prog -a -b foo -c data1 data2 data3
prog -ac -bfoo -- data1 data2 data3
prog -acbfoo data1 data2 data3
Notice that when the argument is grouped with its option, the rest of the argument is
considered to be the options argument. In this example, -acbfoo indicates that all of the
-a, -b, and -c options were supplied, and that foo is the argument to the -b option.
getopt() provides four external variables that the programmer can use:
optind
The index in the argument value array (argv) where the first nonoption
command-line argument can be found.
optarg
opterr
Usually getopt() prints an error message when it finds an invalid option. Setting opterr to zero disables this feature. (An application might want to print
its own error message.)
optopt
The following C fragment shows how getopt() might process command-line arguments
for awk:
int
main(int argc, char *argv[])
{
...
/* print our own message */
opterr = 0;
while ((c = getopt(argc, argv, "v:f:F:W:")) != -1) {
switch (c) {
case f:
/* file */
...
break;
case F:
/* field separator */
...
break;
case v:
/* variable assignment */
...
break;
case W:
/* extension */
...
break;
case ?:
default:
usage();
break;
}
}
...
}
As a side point, gawk actually uses the GNU getopt_long() function to process both
normal and GNU-style long options (see Section 2.2 [Command-Line Options], page 25).
The abstraction provided by getopt() is very useful and is quite handy in awk programs
as well. Following is an awk version of getopt(). This function highlights one of the greatest
weaknesses in awk, which is that it is very poor at manipulating single characters. Repeated
calls to substr() are necessary for accessing individual characters (see Section 9.1.3 [StringManipulation Functions], page 149).7
The discussion that follows walks through the code a bit at a time:
# getopt.awk --- Do C library getopt(3) function in awk
# External variables:
#
Optind -- index in ARGV of first nonoption argument
#
Optarg -- string value of argument to current option
#
Opterr -- if nonzero, print our own diagnostic
#
Optopt -- current option letter
# Returns:
#
-1
#
"?"
#
<c>
at end of options
for unrecognized option
a character representing the current option
# Private Data:
#
_opti -- index in multi-flag option, e.g., -abc
The function starts out with comments presenting a list of the global variables it uses,
what the return values are, what they mean, and any global variables that are private to
this library function. Such documentation is essential for any program, and particularly for
library functions.
The getopt() function first checks that it was indeed called with a string of options (the
options parameter). If options has a zero length, getopt() immediately returns 1:
function getopt(argc, argv, options,
thisopt, i)
{
if (length(options) == 0)
# no options given
return -1
7
This function was written before gawk acquired the ability to split strings into single characters using ""
as the separator. We have left it alone, since using substr() is more portable.
228
In any case, because the option is invalid, getopt() returns "?". The main program can
examine Optopt if it needs to know what the invalid option letter actually is. Continuing
on:
if (substr(options, i + 1, 1) == ":") {
# get option argument
if (length(substr(argv[Optind], _opti + 1)) > 0)
Optarg = substr(argv[Optind], _opti + 1)
else
Optarg = argv[++Optind]
_opti = 0
} else
Optarg = ""
If the option requires an argument, the option letter is followed by a colon in the
options string. If there are remaining characters in the current command-line argument
(argv[Optind]), then the rest of that string is assigned to Optarg. Otherwise, the next
command-line argument is used (-xFOO versus -x FOO). In either case, _opti is reset
to zero, because there are no more characters left to examine in the current command-line
argument. Continuing:
if (_opti == 0 || _opti >= length(argv[Optind])) {
Optind++
_opti = 0
} else
_opti++
return thisopt
}
Finally, if _opti is either zero or greater than the length of the current commandline argument, it means this element in argv is through being processed, so Optind is
incremented to point to the next element in argv. If neither condition is true, then only
_opti is incremented, so that the next option letter can be processed on the next call to
getopt().
The BEGIN rule initializes both Opterr and Optind to one. Opterr is set to one, since
the default behavior is for getopt() to print a diagnostic message upon seeing an invalid
option. Optind is set to one, since theres no reason to look at the program name, which is
in ARGV[0]:
BEGIN {
Opterr = 1
Optind = 1
# default is to diagnose
# skip ARGV[0]
# test program
if (_getopt_test) {
while ((_go_c = getopt(ARGC, ARGV, "ab:cd")) != -1)
printf("c = <%c>, optarg = <%s>\n",
_go_c, Optarg)
printf("non-option arguments:\n")
for (; Optind < ARGC; Optind++)
230
printf("\tARGV[%d] = <%s>\n",
Optind, ARGV[Optind])
}
}
The rest of the BEGIN rule is a simple test program. Here is the result of two sample
runs of the test program:
$ awk -f getopt.awk -v _getopt_test=1 -- -a -cbARG bax -x
a c = <a>, optarg = <>
a c = <c>, optarg = <>
a c = <b>, optarg = <ARG>
a non-option arguments:
ARGV[3] = <bax>
a
ARGV[4] = <-x>
a
$ awk -f getopt.awk -v _getopt_test=1 -- -a -x -- xyz abc
a c = <a>, optarg = <>
error x -- invalid option
a c = <?>, optarg = <>
a non-option arguments:
ARGV[4] = <xyz>
a
ARGV[5] = <abc>
a
In both runs, the first -- terminates the arguments to awk, so that it does not try to
interpret the -a, etc., as its own options.
NOTE: After getopt() is through, it is the responsibility of the user level code
to clear out all the elements of ARGV from 1 to Optind, so that awk does not try
to process the command-line options as file names.
Several of the sample programs presented in Chapter 13 [Practical awk Programs],
page 241, use getopt() to process their arguments.
While an awk program could simply read /etc/passwd directly, this file may not contain
complete information about the systems set of users.8 To be sure you are able to produce
a readable and complete version of the user database, it is necessary to write a small C
program that calls getpwent(). getpwent() is defined as returning a pointer to a struct
passwd. Each time it is called, it returns the next entry in the database. When there are no
more entries, it returns NULL, the null pointer. When this happens, the C program should
call endpwent() to close the database. Following is pwcat, a C program that cats the
password database:
/*
* pwcat.c
*
* Generate a printable version of the password database
*/
#include <stdio.h>
#include <pwd.h>
int
main(int argc, char **argv)
{
struct passwd *p;
while ((p = getpwent()) != NULL)
printf("%s:%s:%ld:%ld:%s:%s:%s\n",
p->pw_name, p->pw_passwd, (long) p->pw_uid,
(long) p->pw_gid, p->pw_gecos, p->pw_dir, p->pw_shell);
endpwent();
return 0;
}
If you dont understand C, dont worry about it. The output from pwcat is the user
database, in the traditional /etc/passwd format of colon-separated fields. The fields are:
Login name
The users login name.
Encrypted password
The users encrypted password. This may not be available on some systems.
User-ID
The users numeric user ID number. (On some systems its a C long, and not
an int. Thus we cast it to long for all cases.)
Group-ID
The users numeric group ID number. (Similar comments about long vs. int
apply here.)
Full name The users full name, and perhaps other information associated with the user.
Home directory
The users login (or home) directory (familiar to shell programmers as $HOME).
8
232
Login shell
The program that is run when the user logs in. This is usually a shell, such as
Bash.
A few lines representative of pwcats output are as follows:
$ pwcat
a root:3Ov02d5VaUPB6:0:1:Operator:/:/bin/sh
a nobody:*:65534:65534::/:
a daemon:*:1:1::/:
a sys:*:2:2::/:/bin/csh
a bin:*:3:3::/bin:
a arnold:xyzzy:2076:10:Arnold Robbins:/home/arnold:/bin/sh
a miriam:yxaay:112:10:Miriam Robbins:/home/miriam:/bin/sh
a andy:abcca2:113:10:Andy Jacobs:/home/andy:/bin/sh
...
With that introduction, following is a group of functions for getting user information.
There are several functions here, corresponding to the C functions of the same names:
# passwd.awk --- access password file information
BEGIN {
# tailor this to suit your system
_pw_awklib = "/usr/local/libexec/awk/"
}
function _pw_init(
{
if (_pw_inited)
return
oldfs = FS
oldrs = RS
olddol0 = $0
using_fw = (PROCINFO["FS"] == "FIELDWIDTHS")
using_fpat = (PROCINFO["FS"] == "FPAT")
FS = ":"
RS = "\n"
pwcat = _pw_awklib "pwcat"
while ((pwcat | getline) > 0) {
_pw_byname[$1] = $0
_pw_byuid[$3] = $0
_pw_bycount[++_pw_total] = $0
}
close(pwcat)
_pw_count = 0
_pw_inited = 1
FS = oldfs
if (using_fw)
FIELDWIDTHS = FIELDWIDTHS
else if (using_fpat)
FPAT = FPAT
RS = oldrs
$0 = olddol0
}
The BEGIN rule sets a private variable to the directory where pwcat is stored.
Because it is used to help out an awk library routine, we have chosen to put it in
/usr/local/libexec/awk; however, you might want it to be in a different directory on
your system.
The function _pw_init() keeps three copies of the user information in three associative
arrays. The arrays are indexed by username (_pw_byname), by user ID number (_pw_byuid),
and by order of occurrence (_pw_bycount). The variable _pw_inited is used for efficiency,
since _pw_init() needs to be called only once.
Because this function uses getline to read information from pwcat, it first saves the
values of FS, RS, and $0. It notes in the variable using_fw whether field splitting with
FIELDWIDTHS is in effect or not. Doing so is necessary, since these functions could be called
from anywhere within a users program, and the user may have his or her own way of
splitting records and fields.
The using_fw variable checks PROCINFO["FS"], which is "FIELDWIDTHS" if field splitting
is being done with FIELDWIDTHS. This makes it possible to restore the correct field-splitting
mechanism later. The test can only be true for gawk. It is false if using FS or FPAT, or on
some other awk implementation.
The code that checks for using FPAT, using using_fpat and PROCINFO["FS"] is similar.
The main part of the function uses a loop to read database lines, split the line into
fields, and then store the line into each array as necessary. When the loop is done,
_pw_init() cleans up by closing the pipeline, setting _pw_inited to one, and restoring
FS (and FIELDWIDTHS or FPAT if necessary), RS, and $0. The use of _pw_count is explained
shortly.
The getpwnam() function takes a username as a string argument. If that user is in the
database, it returns the appropriate line. Otherwise, it relies on the array reference to a
nonexistent element to create the element with the null string as its value:
function getpwnam(name)
{
_pw_init()
return _pw_byname[name]
}
Similarly, the getpwuid function takes a user ID number argument. If that user number
is in the database, it returns the appropriate line. Otherwise, it returns the null string:
function getpwuid(uid)
{
_pw_init()
return _pw_byuid[uid]
}
234
The getpwent() function simply steps through the database, one entry at a time. It
uses _pw_count to track its current position in the _pw_bycount array:
function getpwent()
{
_pw_init()
if (_pw_count < _pw_total)
return _pw_bycount[++_pw_count]
return ""
}
The endpwent() function resets _pw_count to zero, so that subsequent calls to
getpwent() start over again:
function endpwent()
{
_pw_count = 0
}
A conscious design decision in this suite is that each subroutine calls _pw_init() to
initialize the database arrays. The overhead of running a separate process to generate the
user database, and the I/O to scan it, are only incurred if the users main program actually
calls one of these functions. If this library file is loaded along with a users program, but none
of the routines are ever called, then there is no extra runtime overhead. (The alternative is
move the body of _pw_init() into a BEGIN rule, which always runs pwcat. This simplifies
the code but runs an extra process that may never be needed.)
In turn, calling _pw_init() is not too expensive, because the _pw_inited variable keeps
the program from reading the data more than once. If you are worried about squeezing
every last cycle out of your awk program, the check of _pw_inited could be moved out of
_pw_init() and duplicated in all the other functions. In practice, this is not necessary,
since most awk programs are I/O-bound, and such a change would clutter up the code.
The id program in Section 13.2.3 [Printing out User Information], page 250, uses these
functions.
int
main(int argc, char **argv)
{
struct group *g;
int i;
while ((g = getgrent()) != NULL) {
printf("%s:%s:%ld:", g->gr_name, g->gr_passwd,
(long) g->gr_gid);
for (i = 0; g->gr_mem[i] != NULL; i++) {
printf("%s", g->gr_mem[i]);
if (g->gr_mem[i+1] != NULL)
putchar(,);
}
putchar(\n);
}
endgrent();
return 0;
}
Each line in the group database represents one group. The fields are separated with
colons and represent the following information:
Group Name
The groups name.
Group Password
The groups encrypted password. In practice, this field is never used; it is
usually empty or set to *.
Group ID Number
The groups numeric group ID number; this number must be unique within the
file. (On some systems its a C long, and not an int. Thus we cast it to long
for all cases.)
Group Member List
A comma-separated list of user names. These users are members of the group.
Modern Unix systems allow users to be members of several groups simultaneously. If your system does, then there are elements "group1" through "groupN"
in PROCINFO for those group ID numbers. (Note that PROCINFO is a gawk extension; see Section 7.5 [Built-in Variables], page 126.)
Here is what running grcat might produce:
$ grcat
a wheel:*:0:arnold
a nogroup:*:65534:
a daemon:*:1:
a kmem:*:2:
a staff:*:10:arnold,miriam,andy
236
a other:*:20:
...
Here are the functions for obtaining information from the group database. There are
several, modeled after the C library functions of the same names:
# group.awk --- functions for dealing with the group file
BEGIN
\
{
# Change to suit your system
_gr_awklib = "/usr/local/libexec/awk/"
}
function _gr_init(
{
if (_gr_inited)
return
oldfs = FS
oldrs = RS
olddol0 = $0
using_fw = (PROCINFO["FS"] == "FIELDWIDTHS")
using_fpat = (PROCINFO["FS"] == "FPAT")
FS = ":"
RS = "\n"
grcat = _gr_awklib "grcat"
while ((grcat | getline) > 0) {
if ($1 in _gr_byname)
_gr_byname[$1] = _gr_byname[$1] "," $4
else
_gr_byname[$1] = $0
if ($3 in _gr_bygid)
_gr_bygid[$3] = _gr_bygid[$3] "," $4
else
_gr_bygid[$3] = $0
n = split($4, a, "[ \t]*,[ \t]*")
for (i = 1; i <= n; i++)
if (a[i] in _gr_groupsbyuser)
_gr_groupsbyuser[a[i]] = \
_gr_groupsbyuser[a[i]] " " $1
else
_gr_groupsbyuser[a[i]] = $1
_gr_bycount[++_gr_count] = $0
}
close(grcat)
_gr_count = 0
_gr_inited++
FS = oldfs
if (using_fw)
FIELDWIDTHS = FIELDWIDTHS
else if (using_fpat)
FPAT = FPAT
RS = oldrs
$0 = olddol0
}
The BEGIN rule sets a private variable to the directory where grcat is stored.
Because it is used to help out an awk library routine, we have chosen to put it in
/usr/local/libexec/awk. You might want it to be in a different directory on your
system.
These routines follow the same general outline as the user database routines (see
Section 12.5 [Reading the User Database], page 230). The _gr_inited variable is used to
ensure that the database is scanned no more than once. The _gr_init() function first
saves FS, RS, and $0, and then sets FS and RS to the correct values for scanning the group
information. It also takes care to note whether FIELDWIDTHS or FPAT is being used, and to
restore the appropriate field splitting mechanism.
The group information is stored is several associative arrays. The arrays are indexed
by group name (_gr_byname), by group ID number (_gr_bygid), and by position
in the database (_gr_bycount). There is an additional array indexed by user name
(_gr_groupsbyuser), which is a space-separated list of groups to which each user belongs.
Unlike the user database, it is possible to have multiple records in the database for the
same group. This is common when a group has a large number of members. A pair of such
entries might look like the following:
tvpeople:*:101:johnny,jay,arsenio
tvpeople:*:101:david,conan,tom,joan
For this reason, _gr_init() looks to see if a group name or group ID number is already
seen. If it is, then the user names are simply concatenated onto the previous list of users.
(There is actually a subtle problem with the code just presented. Suppose that the first
time there were no names. This code adds the names with a leading comma. It also doesnt
check that there is a $4.)
Finally, _gr_init() closes the pipeline to grcat, restores FS (and FIELDWIDTHS or FPAT
if necessary), RS, and $0, initializes _gr_count to zero (it is used later), and makes _gr_
inited nonzero.
The getgrnam() function takes a group name as its argument, and if that group exists,
it is returned. Otherwise, it relies on the array reference to a nonexistent element to create
the element with the null string as its value:
function getgrnam(group)
{
_gr_init()
238
return _gr_byname[group]
}
The getgrgid() function is similar; it takes a numeric group ID and looks up the
information associated with that group ID:
function getgrgid(gid)
{
_gr_init()
return _gr_bygid[gid]
}
The getgruser() function does not have a C counterpart. It takes a user name and
returns the list of groups that have the user as a member:
function getgruser(user)
{
_gr_init()
return _gr_groupsbyuser[user]
}
The getgrent() function steps through the database one entry at a time. It uses _gr_
count to track its position in the list:
function getgrent()
{
_gr_init()
if (++_gr_count in _gr_bycount)
return _gr_bycount[_gr_count]
return ""
}
The endgrent() function resets _gr_count to zero so that getgrent() can start over
again:
function endgrent()
{
_gr_count = 0
}
As with the user database routines, each function calls _gr_init() to initialize the
arrays. Doing so only incurs the extra overhead of running grcat if these functions are
used (as opposed to moving the body of _gr_init() into a BEGIN rule).
Most of the work is in scanning the database and building the various associative arrays.
The functions that the user calls are themselves very simple, relying on awks associative
arrays to do work.
The id program in Section 13.2.3 [Printing out User Information], page 250, uses these
functions.
array from a scalar. The following function, walk_array(), recursively traverses an array,
printing each elements indices and value. You call it with the array and a string representing
the name of the array:
function walk_array(arr, name,
i)
{
for (i in arr) {
if (isarray(arr[i]))
walk_array(arr[i], (name "[" i "]"))
else
printf("%s[%s] = %s\n", name, i, arr[i])
}
}
It works by looping over each element of the array. If any given element is itself an array,
the function calls itself recursively, passing the subarray and a new string representing the
current index. Otherwise, the function simply prints the elements name, index, and value.
Here is a main program to demonstrate:
BEGIN {
a[1] = 1
a[2][1] = 21
a[2][2] = 22
a[3] = 3
a[4][1][1] = 411
a[4][2] = 42
walk_array(a, "a")
}
When run, the program produces the following output:
$ gawk -f walk_array.awk
a a[4][1][1] = 411
a a[4][2] = 42
a a[1] = 1
a a[2][1] = 21
a a[2][2] = 22
a a[3] = 3
241
242
a command-line option to change the field delimiter (i.e., the field-separator character).
cuts definition of fields is less general than awks.
A common use of cut might be to pull out just the login name of logged-on users from
the output of who. For example, the following pipeline generates a sorted, unique list of the
logged-on users:
who | cut -c1-8 | sort | uniq
The options for cut are:
-c list
Use list as the list of characters to cut out. Items within the list may be
separated by commas, and ranges of characters can be separated with dashes.
The list 1-8,15,22-35 specifies characters 1 through 8, 15, and 22 through
35.
-f list
-d delim
-s
The awk implementation of cut uses the getopt() library function (see Section 12.4
[Processing Command-Line Options], page 225) and the join() library function (see
Section 12.2.6 [Merging an Array into a String], page 218).
The program begins with a comment describing the options, the library functions needed,
and a usage() function that prints out a usage message and exits. usage() is called if
invalid arguments are supplied:
# cut.awk --- implement cut in awk
# Options:
#
-f list
Cut fields
#
-d c
Field delimiter character
#
-c list
Cut characters
#
#
-s
Suppress lines without the delimiter
#
# Requires getopt() and join() library functions
function usage(
e1, e2)
{
e1 = "usage: cut [-f list] [-d c] [-s] [files...]"
e2 = "usage: cut [-c list] [files...]"
print e1 > "/dev/stderr"
print e2 > "/dev/stderr"
exit 1
}
The variables e1 and e2 are used so that the function fits nicely on the page.
Next comes a BEGIN rule that parses the command-line options. It sets FS to a single
TAB character, because that is cuts default field separator. The rule then sets the output
field separator to be the same as the input field separator. A loop using getopt() steps
243
through the command-line options. Exactly one of the variables by_fields or by_chars is
set to true, to indicate that processing should be done by fields or by characters, respectively.
When cutting by characters, the output field separator is set to the null string:
BEGIN
\
{
FS = "\t"
# default
OFS = FS
while ((c = getopt(ARGC, ARGV, "sf:c:d:")) != -1) {
if (c == "f") {
by_fields = 1
fieldlist = Optarg
} else if (c == "c") {
by_chars = 1
fieldlist = Optarg
OFS = ""
} else if (c == "d") {
if (length(Optarg) > 1) {
printf("Using first character of %s" \
" for delimiter\n", Optarg) > "/dev/stderr"
Optarg = substr(Optarg, 1, 1)
}
FS = Optarg
OFS = FS
if (FS == " ")
# defeat awk semantics
FS = "[ ]"
} else if (c == "s")
suppress++
else
usage()
}
# Clear out options
for (i = 1; i < Optind; i++)
ARGV[i] = ""
The code must take special care when the field delimiter is a space. Using a single space
(" ") for the value of FS is incorrectawk would separate fields with runs of spaces, TABs,
and/or newlines, and we want them to be separated with individual spaces. Also remember
that after getopt() is through (as described in Section 12.4 [Processing Command-Line
Options], page 225), we have to clear out all the elements of ARGV from 1 to Optind, so that
awk does not try to process the command-line options as file names.
After dealing with the command-line options, the program verifies that the options make
sense. Only one or the other of -c and -f should be used, and both require a field list.
Then the program calls either set_fieldlist() or set_charlist() to pull apart the list
of fields or characters:
if (by_fields && by_chars)
usage()
244
245
22 through 35. You would use -c 1-8,15,22-35. The necessary value for FIELDWIDTHS
is "8 6 1 6 14". This yields five fields, and the fields to print are $1, $3, and $5. The
intermediate fields are filler, which is stuff in between the desired data. flist lists the
fields to print, and t tracks the complete field list, including filler fields:
function set_charlist(
field, i, j, f, g, t,
filler, last, len)
{
field = 1
# count total fields
n = split(fieldlist, f, ",")
j = 1
# index in flist
for (i = 1; i <= n; i++) {
if (index(f[i], "-") != 0) { # range
m = split(f[i], g, "-")
if (m != 2 || g[1] >= g[2]) {
printf("bad character list: %s\n",
f[i]) > "/dev/stderr"
exit 1
}
len = g[2] - g[1] + 1
if (g[1] > 1) # compute length of filler
filler = g[1] - last - 1
else
filler = 0
if (filler)
t[field++] = filler
t[field++] = len # length of field
last = g[2]
flist[j++] = field - 1
} else {
if (f[i] > 1)
filler = f[i] - last - 1
else
filler = 0
if (filler)
t[field++] = filler
t[field++] = 1
last = f[i]
flist[j++] = field - 1
}
}
FIELDWIDTHS = join(t, 1, field - 1)
nfields = j - 1
}
Next is the rule that actually processes the data. If the -s option is given, then
suppress is true. The first if statement makes sure that the input record does have the
246
field separator. If cut is processing fields, suppress is true, and the field separator character
is not in the record, then the record is skipped.
If the record is valid, then gawk has split the data into fields, either using the character
in FS or using fixed-length fields and FIELDWIDTHS. The loop goes through the list of fields
that should be printed. The corresponding field is printed if it contains data. If the next
field also has data, then the separator character is written out between the fields:
{
if (by_fields && suppress && index($0, FS) != 0)
next
for (i = 1; i <= nfields; i++) {
if ($flist[i] != "") {
printf "%s", $flist[i]
if (i < nfields && $flist[i+1] != "")
printf "%s", OFS
}
}
print ""
}
This version of cut relies on gawks FIELDWIDTHS variable to do the character-based
cutting. While it is possible in other awk implementations to use substr() (see Section 9.1.3
[String-Manipulation Functions], page 149), it is also extremely painful. The FIELDWIDTHS
variable supplies an elegant solution to the problem of picking the input line apart by
characters.
Print out a count of the lines that matched the pattern, instead of the lines
themselves.
-s
Be silent. No output is produced and the exit value indicates whether the
pattern was matched.
-v
Invert the sense of the test. egrep prints the lines that do not match the pattern
and exits successfully if the pattern is not matched.
-i
Ignore case distinctions in both the pattern and the input data.
-l
Only print (list) the names of the files that matched, not the lines that matched.
247
-e pattern
Use pattern as the regexp to match. The purpose of the -e option is to allow
patterns that start with a -.
This version uses the getopt() library function (see Section 12.4 [Processing CommandLine Options], page 225) and the file transition library program (see Section 12.3.1 [Noting
Data File Boundaries], page 221).
The program begins with a descriptive comment and then a BEGIN rule that processes
the command-line arguments with getopt(). The -i (ignore case) option is particularly
easy with gawk; we just use the IGNORECASE built-in variable (see Section 7.5 [Built-in
Variables], page 126):
# egrep.awk --- simulate egrep in awk
#
# Options:
#
-c
count of lines
#
-s
silent - use exit value
#
-v
invert test, success if no match
#
-i
ignore case
#
-l
print filenames only
#
-e
argument is pattern
#
# Requires getopt and file transition library functions
BEGIN {
while ((c = getopt(ARGC, ARGV, "ce:svil")) != -1) {
if (c == "c")
count_only++
else if (c == "s")
no_print++
else if (c == "v")
invert++
else if (c == "i")
IGNORECASE = 1
else if (c == "l")
filenames_only++
else if (c == "e")
pattern = Optarg
else
usage()
}
Next comes the code that handles the egrep-specific behavior. If no pattern is supplied
with -e, the first nonoption on the command line is used. The awk command-line arguments up to ARGV[Optind] are cleared, so that awk wont try to process them as files. If
no files are specified, the standard input is used, and if multiple files are specified, we make
sure to note this so that the file names can precede the matched lines in the output:
if (pattern == "")
248
pattern = ARGV[Optind++]
for (i = 1; i < Optind; i++)
ARGV[i] = ""
if (Optind >= ARGC) {
ARGV[1] = "-"
ARGC = 2
} else if (ARGC - Optind > 1)
do_filenames++
#
#
}
if (IGNORECASE)
pattern = tolower(pattern)
The last two lines are commented out, since they are not needed in gawk. They should
be uncommented if you have to use another version of awk.
The next set of lines should be uncommented if you are not using gawk. This rule
translates all the characters in the input line into lowercase if the -i option is specified.1
The rule is commented out since it is not necessary with gawk:
#{
#
#
#}
if (IGNORECASE)
$0 = tolower($0)
The beginfile() function is called by the rule in ftrans.awk when each new file
is processed. In this case, it is very simple; all it does is initialize a variable fcount to
zero. fcount tracks how many lines in the current file matched the pattern. Naming the
parameter junk shows we know that beginfile() is called with a parameter, but that
were not interested in its value:
function beginfile(junk)
{
fcount = 0
}
The endfile() function is called after each file has been processed. It affects the output
only when the user wants a count of the number of lines that matched. no_print is true
only if the exit status is desired. count_only is true if line counts are desired. egrep
therefore only prints line counts if printing and counting are enabled. The output format
must be adjusted depending upon the number of files to process. Finally, fcount is added
to total, so that we know the total number of lines that matched the pattern:
function endfile(file)
{
if (! no_print && count_only) {
if (do_filenames)
print file ":" fcount
else
1
It also introduces a subtle bug; if a match happens, we output the translated line, not the original.
249
print fcount
}
total += fcount
}
The following rule does most of the work of matching lines. The variable matches is
true if the line matched the pattern. If the user wants lines that did not match, the sense
of matches is inverted using the ! operator. fcount is incremented with the value of
matches, which is either one or zero, depending upon a successful or unsuccessful match.
If the line does not match, the next statement just moves on to the next record.
A number of additional tests are made, but they are only done if we are not counting
lines. First, if the user only wants exit status (no_print is true), then it is enough to
know that one line in this file matched, and we can skip on to the next file with nextfile.
Similarly, if we are only printing file names, we can print the file name, and then skip to the
next file with nextfile. Finally, each line is printed, with a leading file name and colon if
necessary:
{
matches = ($0 ~ pattern)
if (invert)
matches = ! matches
fcount += matches
# 1 or 0
if (! matches)
next
if (! count_only) {
if (no_print)
nextfile
if (filenames_only) {
print FILENAME
nextfile
}
if (do_filenames)
print FILENAME ":" $0
else
print
}
}
The END rule takes care of producing the correct exit status. If there are no matches,
the exit status is one; otherwise it is zero:
END
\
{
if (total == 0)
250
exit 1
exit 0
}
The usage() function prints a usage message in case of invalid options, and then exits:
function usage(
e)
{
e = "Usage: egrep [-csvil] [-e pat] [files ...]"
e = e "\n\tegrep [-csvil] pat [files ...]"
print e > "/dev/stderr"
exit 1
}
The variable e is used so that the function fits nicely on the printed page.
Just a note on programming style: you may have noticed that the END rule uses backslash
continuation, with the open brace on a line by itself. This is so that it more closely resembles
the way functions are written. Many of the examples in this chapter use this style. You
can decide for yourself if you like writing your BEGIN and END rules this way or not.
BEGIN
\
{
uid = PROCINFO["uid"]
euid = PROCINFO["euid"]
gid = PROCINFO["gid"]
egid = PROCINFO["egid"]
printf("uid=%d", uid)
pw = getpwuid(uid)
if (pw != "") {
split(pw, a, ":")
printf("(%s)", a[1])
}
if (euid != uid) {
printf(" euid=%d", euid)
pw = getpwuid(euid)
if (pw != "") {
split(pw, a, ":")
printf("(%s)", a[1])
}
}
printf(" gid=%d", gid)
pw = getgrgid(gid)
if (pw != "") {
split(pw, a, ":")
printf("(%s)", a[1])
}
if (egid != gid) {
printf(" egid=%d", egid)
pw = getgrgid(egid)
if (pw != "") {
split(pw, a, ":")
printf("(%s)", a[1])
}
}
for (i = 1; ("group" i) in PROCINFO; i++) {
if (i == 1)
printf(" groups=")
group = PROCINFO["group" i]
printf("%d", group)
pw = getgrgid(group)
if (pw != "") {
split(pw, a, ":")
251
252
printf("(%s)", a[1])
}
if (("group" (i+1)) in PROCINFO)
printf(",")
}
print ""
}
The test in the for loop is worth noting. Any supplementary groups in the PROCINFO
array have the indices "group1" through "groupN" for some N, i.e., the total number of
supplementary groups. However, we dont know in advance how many of these groups there
are.
This loop works by starting at one, concatenating the value with "group", and then
using in to see if that value is in the array. Eventually, i is incremented past the last group
in the array and the loop exits.
The loop is also correct if there are no supplementary groups; then the condition is false
the first time its tested, and the loop body never executes.
# default
This is the traditional usage. The POSIX usage is different, but not relevant for what the program aims
to demonstrate.
253
if (ARGC > 4)
usage()
i = 1
if (ARGV[i] ~ /^-[[:digit:]]+$/) {
count = -ARGV[i]
ARGV[i] = ""
i++
}
# test argv in case reading from stdin instead of file
if (i in ARGV)
i++
# skip data file name
if (i in ARGV) {
outfile = ARGV[i]
ARGV[i] = ""
}
s1 = s2 = "a"
out = (outfile s1 s2)
}
The next rule does most of the work. tcount (temporary count) tracks how many lines
have been printed to the output file so far. If it is greater than count, it is time to close
the current file and start a new one. s1 and s2 track the current suffixes for the file name.
If they are both z, the file is just too big. Otherwise, s1 moves to the next letter in the
alphabet and s2 starts over again at a:
{
if (++tcount > count) {
close(out)
if (s2 == "z") {
if (s1 == "z") {
printf("split: %s is too large to split\n",
FILENAME) > "/dev/stderr"
exit 1
}
s1 = chr(ord(s1) + 1)
s2 = "a"
}
else
s2 = chr(ord(s2) + 1)
out = (outfile s1 s2)
tcount = 1
}
print > out
}
The usage() function simply prints an error message and exits:
function usage(
e)
254
{
e = "usage: split [-num] [file] [outname]"
print e > "/dev/stderr"
exit 1
}
The variable e is used so that the function fits nicely on the page.
This program is a bit sloppy; it relies on awk to automatically close the last file instead
of doing it in an END rule. It also assumes that letters are contiguous in the character set,
which isnt true for EBCDIC systems.
255
}
The following single rule does all the work. Since there is no pattern, it is executed for
each line of input. The body of the rule simply prints the line into each file on the command
line, and then to the standard output:
{
# moving the if outside the loop makes it run faster
if (append)
for (i in copy)
print >> copy[i]
else
for (i in copy)
print > copy[i]
print
}
It is also possible to write the loop this way:
for (i in copy)
if (append)
print >> copy[i]
else
print > copy[i]
This is more concise but it is also less efficient. The if is tested for each record and for
each output file. By duplicating the loop body, the if is only tested once for each input
record. If there are N input records and M output files, the first method only executes N
if statements, while the second executes N *M if statements.
Finally, the END rule cleans up by closing all the output files:
END
\
{
for (i in copy)
close(copy[i])
}
-u
-c
Count lines. This option overrides -d and -u. Both repeated and nonrepeated
lines are counted.
-n
Skip n fields before comparing lines. The definition of fields is similar to awks
default: nonwhitespace characters separated by runs of spaces and/or TABs.
256
Skip n characters before comparing lines. Any fields specified with -n are
skipped first.
+n
input file
Data is read from the input file named on the command line, instead of from
the standard input.
output file
The generated output is sent to the named output file, instead of to the standard
output.
Normally uniq behaves as if both the -d and -u options are provided.
uniq uses the getopt() library function (see Section 12.4 [Processing Command-Line
Options], page 225) and the join() library function (see Section 12.2.6 [Merging an Array
into a String], page 218).
The program begins with a usage() function and then a brief outline of the options and
their meanings in comments. The BEGIN rule deals with the command-line arguments and
options. It uses a trick to get getopt() to handle options of the form -25, treating such
an option as the option letter 2 with an argument of 5. If indeed two or more digits
are supplied (Optarg looks like a number), Optarg is concatenated with the option digit
and then the result is added to zero to make it into a number. If there is only one digit in
the option, then Optarg is not needed. In this case, Optind must be decremented so that
getopt() processes it next time. This code is admittedly a bit tricky.
If no options are supplied, then the default is taken, to print both repeated and nonrepeated lines. The output file, if provided, is assigned to outputfile. Early on, outputfile
is initialized to the standard output, /dev/stdout:
# uniq.awk --- do uniq in awk
#
# Requires getopt() and join() library functions
function usage(
e)
{
e = "Usage: uniq [-udc [-n]] [+n] [ in [ out ]]"
print e > "/dev/stderr"
exit 1
}
#
#
#
#
#
-c
-d
-u
-n
+n
BEGIN
\
{
count = 1
outputfile = "/dev/stdout"
opts = "udc0:1:2:3:4:5:6:7:8:9:"
257
258
function are_equal(
n, m, clast, cline, alast, aline)
{
if (fcount == 0 && charcount == 0)
return (last == $0)
if (fcount > 0) {
n = split(last, alast)
m = split($0, aline)
clast = join(alast, fcount+1, n)
cline = join(aline, fcount+1, m)
} else {
clast = last
cline = $0
}
if (charcount) {
clast = substr(clast, charcount + 1)
cline = substr(cline, charcount + 1)
}
return (clast == cline)
}
The following two rules are the body of the program. The first one is executed only for
the very first line of data. It sets last equal to $0, so that subsequent lines of text have
something to be compared to.
The second rule does the work. The variable equal is one or zero, depending upon the
results of are_equal()s comparison. If uniq is counting repeated lines, and the lines are
equal, then it increments the count variable. Otherwise, it prints the line and resets count,
since the two lines are not equal.
If uniq is not counting, and if the lines are equal, count is incremented. Nothing is
printed, since the point is to remove duplicates. Otherwise, if uniq is counting repeated
lines and more than one line is seen, or if uniq is counting nonrepeated lines and only one
line is seen, then the line is printed, and count is reset.
Finally, similar logic is used in the END rule to print the final line of input data:
NR == 1 {
last = $0
next
}
{
equal = are_equal()
if (do_count) {
# overrides -d and -u
if (equal)
count++
else {
printf("%4d %s\n", count, last) > outputfile
last = $0
count = 1
259
# reset
}
next
}
if (equal)
count++
else {
if ((repeated_only && count > 1) ||
(non_repeated_only && count == 1))
print last > outputfile
last = $0
count = 1
}
}
END {
if (do_count)
printf("%4d %s\n", count, last) > outputfile
else if ((repeated_only && count > 1) ||
(non_repeated_only && count == 1))
print last > outputfile
close(outputfile)
}
-w
Count only words. A word is a contiguous sequence of nonwhitespace characters, separated by spaces and/or TABs. Luckily, this is the normal way awk
separates fields in its input data.
-c
Implementing wc in awk is particularly elegant, since awk does a lot of the work for us;
it splits lines into words (i.e., fields) and counts them, it counts lines (i.e., records), and it
can easily tell us how long a line is.
This program uses the getopt() library function (see Section 12.4 [Processing
Command-Line Options], page 225) and the file-transition functions (see Section 12.3.1
[Noting Data File Boundaries], page 221).
260
This version has one notable difference from traditional versions of wc: it always prints
the counts in the order lines, words, and characters. Traditional versions note the order of
the -l, -w, and -c options on the command line, and print the counts in that order.
The BEGIN rule does the argument processing. The variable print_total is true if more
than one file is named on the command line:
# wc.awk --- count lines, words, characters
# Options:
#
-l
only count lines
#
-w
only count words
#
-c
only count characters
#
# Default is to count lines, words, characters
#
# Requires getopt() and file transition library functions
BEGIN {
# let getopt() print a message about
# invalid options. we ignore them
while ((c = getopt(ARGC, ARGV, "lwc")) != -1) {
if (c == "l")
do_lines = 1
else if (c == "w")
do_words = 1
else if (c == "c")
do_chars = 1
}
for (i = 1; i < Optind; i++)
ARGV[i] = ""
# if no options, do all
if (! do_lines && ! do_words && ! do_chars)
do_lines = do_words = do_chars = 1
print_total = (ARGC - i > 2)
}
The beginfile() function is simple; it just resets the counts of lines, words, and characters to zero, and saves the current file name in fname:
function beginfile(file)
{
lines = words = chars = 0
fname = FILENAME
}
261
The endfile() function adds the current files numbers to the running totals of lines,
words, and characters.3 It then prints out those numbers for the file that was just read. It
relies on beginfile() to reset the numbers for the following data file:
function endfile(file)
{
tlines += lines
twords += words
tchars += chars
if (do_lines)
printf "\t%d", lines
if (do_words)
printf "\t%d", words
if (do_chars)
printf "\t%d", chars
printf "\t%s\n", fname
}
There is one rule that is executed for each line. It adds the length of the record, plus
one, to chars.4 Adding one plus the record length is needed because the newline character
separating records (the value of RS) is not part of the record itself, and thus not included
in its length. Next, lines is incremented for each line read, and words is incremented by
the value of NF, which is the number of words on this line:
# do per line
{
chars += length($0) + 1
lines++
words += NF
}
# get newline
Finally, the END rule simply prints the totals for all the files:
END {
if (print_total) {
if (do_lines)
printf "\t%d", tlines
if (do_words)
printf "\t%d", twords
if (do_chars)
printf "\t%d", tchars
print "\ttotal"
}
}
3
4
wc cant just use the value of FNR in endfile(). If you examine the code in Section 12.3.1 [Noting Data
File Boundaries], page 221, you will see that FNR has already been reset by the time endfile() is called.
Since gawk understands multibyte locales, this code counts characters, not bytes.
262
263
This program uses the gettimeofday() function from Section 12.2.7 [Managing the
Time of Day], page 219.
All the work is done in the BEGIN rule. The first part is argument checking and setting
of defaults: the delay, the count, and the message to print. If the user supplied a message
without the ASCII BEL character (known as the alert character, "\a"), then it is added
to the message. (On many systems, printing the ASCII BEL generates an audible alert.
Thus when the alarm goes off, the system calls attention to itself in case the user is not
looking at the computer.) Just for a change, this program uses a switch statement (see
Section 7.4.5 [The switch Statement], page 121), but the processing could be done with a
series of if-else statements instead. Here is the program:
# alarm.awk --- set an alarm
#
# Requires gettimeofday() library function
# usage: alarm time [ "message" [ count [ delay ] ] ]
BEGIN
\
{
# Initial argument sanity checking
usage1 = "usage: alarm time [message [count [delay]]]"
usage2 = sprintf("\t(%s) time ::= hh:mm", ARGV[1])
if (ARGC < 2) {
print usage1 > "/dev/stderr"
print usage2 > "/dev/stderr"
exit 1
}
switch (ARGC) {
case 5:
delay = ARGV[4] + 0
# fall through
case 4:
count = ARGV[3] + 0
# fall through
case 3:
message = ARGV[2]
break
default:
if (ARGV[1] !~ /[[:digit:]]?[[:digit:]]:[[:digit:]]{2}/) {
print usage1 > "/dev/stderr"
print usage2 > "/dev/stderr"
exit 1
}
break
}
# set defaults for once we reach the desired time
264
if (delay == 0)
delay = 180
# 3 minutes
if (count == 0)
count = 5
if (message == "")
message = sprintf("\aIt is now %s!\a", ARGV[1])
else if (index(message, "\a") == 0)
message = "\a" message "\a"
The next section of code turns the alarm time into hours and minutes, converts it (if
necessary) to a 24-hour clock, and then turns that time into a count of the seconds since
midnight. Next it turns the current time into a count of seconds since midnight. The
difference between the two is how long to wait before setting off the alarm:
# split up alarm time
split(ARGV[1], atime, ":")
hour = atime[1] + 0
# force numeric
minute = atime[2] + 0 # force numeric
# get current broken down time
gettimeofday(now)
# if time given is 12-hour hours and its after that
# hour, e.g., alarm 5:30 at 9 a.m. means 5:30 p.m.,
# then add 12 to real hour
if (hour < 12 && now["hour"] > hour)
hour += 12
# set target time in seconds since midnight
target = (hour * 60 * 60) + (minute * 60)
# get current time in seconds since midnight
current = (now["hour"] * 60 * 60) + \
(now["minute"] * 60) + now["second"]
# how long to sleep for
naptime = target - current
if (naptime <= 0) {
print "time is in the past!" > "/dev/stderr"
exit 1
}
Finally, the program uses the system() function (see Section 9.1.4 [Input/Output Functions], page 160) to call the sleep utility. The sleep utility simply pauses for the given
number of seconds. If the exit status is not zero, the program assumes that sleep was
interrupted and exits. If sleep exited with an OK status (zero), then the program prints
the message in a loop, again using sleep to delay for however many seconds are necessary:
# zzzzzz..... go away if interrupted
if (system(sprintf("sleep %d", naptime)) != 0)
265
exit 1
# time to notify!
command = sprintf("sleep %d", delay)
for (i = 1; i <= count; i++) {
print message
# if sleep command interrupted, go away
if (system(command) != 0)
break
}
exit 0
}
to
target
Associative arrays make the translation part fairly easy. t_ar holds the to characters,
indexed by the from characters. Then a simple loop goes through from, one character at
a time. For each character in from, if the character appears in target, it is replaced with
the corresponding to character.
5
On some older systems, tr may require that the lists be written as range expressions enclosed in square
brackets ([a-z]) and quoted, to prevent the shell from attempting a file name expansion. This is not
a feature.
This program was written before gawk acquired the ability to split each character in a string into separate
array elements.
266
The translate() function simply calls stranslate() using $0 as the target. The main
program sets two global variables, FROM and TO, from the command line, and then changes
ARGV so that awk reads from the standard input.
Finally, the processing rule simply calls translate() for each record:
#
#
#
#
{
lf = length(from)
lt = length(to)
ltarget = length(target)
for (i = 1; i <= lt; i++)
t_ar[substr(from, i, 1)] = substr(to, i, 1)
if (lt < lf)
for (; i <= lf; i++)
t_ar[substr(from, i, 1)] = substr(to, lt, 1)
for (i = 1; i <= ltarget; i++) {
c = substr(target, i, 1)
if (c in t_ar)
c = t_ar[c]
result = result c
}
return result
}
function translate(from, to)
{
return $0 = stranslate(from, to, $0)
}
# main program
BEGIN {
if (ARGC < 3) {
print "usage: translate from to" > "/dev/stderr"
exit
}
FROM = ARGV[1]
TO = ARGV[2]
ARGC = 2
ARGV[1] = "-"
}
267
{
translate(FROM, TO)
print
}
While it is possible to do character transliteration in a user-level function, it is not
necessarily efficient, and we (the gawk authors) started to consider adding a built-in function.
However, shortly after writing this program, we learned that the System V Release 4 awk
had added the toupper() and tolower() functions (see Section 9.1.3 [String-Manipulation
Functions], page 149). These functions handle the vast majority of the cases where character
transliteration is necessary, and so we chose to simply add those functions to gawk as well
and then leave well enough alone.
An obvious improvement to this program would be to set up the t_ar array only once,
in a BEGIN rule. However, this assumes that the from and to lists will never change
throughout the lifetime of the program.
1
2
3
4
5
line
line
line
line
line
6
7
8
9
10
The printf format string %-41s left-aligns the data and prints it within a fixed-width
field.
As a final note, an extra blank line is printed at lines 21 and 61, to keep the output
lined up on the labels. This is dependent on the particular brand of labels in use when the
7
268
program was written. You will also note that there are two blank lines at the top and two
blank lines at the bottom.
The END rule arranges to flush the final page of labels; there may not have been an even
multiple of 20 labels in the data:
# labels.awk --- print mailing labels
# Each label is 5 lines of data that may have blank lines.
# The label sheets have 2 blank lines at the top and 2 at
# the bottom.
BEGIN
function printpage(
{
if (Nlines <= 0)
return
printf "\n\n"
i, j)
# header
# footer
delete line
}
# main rule
{
if (Count >= 20) {
printpage()
Count = 0
Nlines = 0
}
n = split($0, a, "\n")
for (i = 1; i <= n; i++)
line[++Nlines] = a[i]
for (; i <= 5; i++)
269
line[++Nlines] = ""
Count++
}
END
{
\
printpage()
270
271
This simple program does the job. It uses two arrays. The data array is indexed by
the text of each line. For each line, data[$0] is incremented. If a particular line has not
been seen before, then data[$0] is zero. In this case, the text of the line is stored in
lines[count]. Each element of lines is a unique command, and the indices of lines
indicate the order in which those lines are encountered. The END rule simply prints out the
lines, in order:
# histsort.awk --- compact a shell history file
# Thanks to Byron Rakitzis for the general idea
{
if (data[$0]++ == 0)
lines[++count] = $0
}
END {
for (i = 1; i <= count; i++)
print lines[i]
}
This program also provides a foundation for generating other useful information. For
example, using the following print statement in the END rule indicates how often a particular
command is used:
print data[lines[i]], lines[i]
This works because data[$0] is incremented each time a line is seen.
272
system() function (see Section 9.1.4 [Input/Output Functions], page 160). Upon seeing
@c file filename, each subsequent line is sent to the file filename, until @c endfile is
encountered. The rules in extract.awk match either @c or @comment by letting the
omment part be optional. Lines containing @group and @end group are simply removed.
extract.awk uses the join() library function (see Section 12.2.6 [Merging an Array into
a String], page 218).
The example programs in the online Texinfo source for GAWK: Effective AWK Programming (gawk.texi) have all been bracketed inside file and endfile lines. The
gawk distribution uses a copy of extract.awk to extract the sample programs and install
many of them in a standard directory where gawk can find them. The Texinfo file looks
something like this:
...
This program has a @code{BEGIN} rule,
that prints a nice message:
@example
@c file examples/messages.awk
BEGIN @{ print "Dont panic!" @}
@c end file
@end example
It also prints some final advice:
@example
@c file examples/messages.awk
END @{ print "Always avoid bored archeologists!" @}
@c end file
@end example
...
extract.awk begins by setting IGNORECASE to one, so that mixed upper- and lowercase
letters in the directives wont matter.
The first rule handles calling system(), checking that a command is given (NF is at least
three) and also checking that the command exits with a zero exit status, signifying OK:
# extract.awk --- extract files and run programs
#
from texinfo files
BEGIN
{ IGNORECASE = 1 }
/^@c(omment)?[ \t]+system/
\
{
if (NF < 3) {
e = (FILENAME ":" FNR)
e = (e ": badly formed system line")
print e > "/dev/stderr"
next
}
273
$1 = ""
$2 = ""
stat = system($0)
if (stat != 0) {
e = (FILENAME ":" FNR)
e = (e ": warning: system returned " stat)
print e > "/dev/stderr"
}
}
The variable e is used so that the rule fits nicely on the page.
The second rule handles moving data into files. It verifies that a file name is given in the
directive. If the file named is not the current file, then the current file is closed. Keeping
the current file open until a new file is encountered allows the use of the > redirection for
printing the contents, keeping open file management simple.
The for loop does the work. It reads lines using getline (see Section 4.9 [Explicit Input
with getline], page 67). For an unexpected end of file, it calls the unexpected_eof()
function. If the line is an endfile line, then it breaks out of the loop. If the line is an
@group or @end group line, then it ignores it and goes on to the next line. Similarly,
comments within examples are also ignored.
Most of the work is in the following few lines. If the line has no @ symbols, the program
can print it directly. Otherwise, each leading @ must be stripped off. To remove the @
symbols, the line is split into separate elements of the array a, using the split() function
(see Section 9.1.3 [String-Manipulation Functions], page 149). The @ symbol is used as the
separator character. Each element of a that is empty indicates two successive @ symbols
in the original line. For each two empty elements (@@ in the original file), we have to add
a single @ symbol back in.8
When the processing of the array is finished, join() is called with the value of SUBSEP,
to rejoin the pieces back into a single line. That line is then printed to the output file:
/^@c(omment)?[ \t]+file/
\
{
if (NF != 3) {
e = (FILENAME ":" FNR ": badly formed file line")
print e > "/dev/stderr"
next
}
if ($3 != curfile) {
if (curfile != "")
close(curfile)
curfile = $3
}
for (;;) {
if ((getline line) <= 0)
8
This program was written before gawk had the gensub() function. Consider how you might use it to
simplify the code.
274
unexpected_eof()
if (line ~ /^@c(omment)?[ \t]+endfile/)
break
else if (line ~ /^@(end[ \t]+)?group/)
continue
else if (line ~ /^@c(omment+)?[ \t]+/)
continue
if (index(line, "@") == 0) {
print line > curfile
continue
}
n = split(line, a, "@")
# if a[1] == "", means leading @,
# dont add one back in.
for (i = 2; i <= n; i++) {
if (a[i] == "") { # was an @@
a[i] = "@"
if (a[i+1] == "")
i++
}
}
print join(a, 1, n, SUBSEP) > curfile
}
}
An important thing to note is the use of the > redirection. Output done with >
only opens the file once; it stays open and subsequent output is appended to the file (see
Section 5.6 [Redirecting Output of print and printf], page 81). This makes it easy to
mix program text and explanatory prose for the same sample source file (as has been done
here!) without any hassle. The file is only closed when a new data file name is encountered
or at the end of the input file.
Finally, the function unexpected_eof() prints an appropriate error message and then
exits. The END rule handles the final cleanup, closing the open file:
function unexpected_eof()
{
printf("%s:%d: unexpected EOF or error\n",
FILENAME, FNR) > "/dev/stderr"
exit 1
}
END {
if (curfile)
close(curfile)
}
275
276
setting ORS to the replacement text, a simple print statement outputs the text we want to
keep, followed by the replacement text.
There is one wrinkle to this scheme, which is what to do if the last record doesnt end
with text that matches RS. Using a print statement unconditionally prints the replacement
text, which is not correct. However, if the file did not end in text that matches RS, RT is
set to the null string. In this case, we can print $0 using printf (see Section 5.5 [Using
printf Statements for Fancier Printing], page 76).
The BEGIN rule handles the setup, checking for the right number of arguments and calling
usage() if there is a problem. Then it sets RS and ORS from the command-line arguments
and sets ARGV[1] and ARGV[2] to the null string, so that they are not treated as file names
(see Section 7.5.3 [Using ARGC and ARGV], page 133).
The usage() function prints an error message and exits. Finally, the single rule handles
the printing scheme outlined above, using print or printf as appropriate, depending upon
the value of RT.
277
The program is written using the POSIX Shell (sh) command language.9 It works as
follows:
1. Loop through the arguments, saving anything that doesnt represent awk source code
for later, when the expanded program is run.
2. For any arguments that do represent awk text, put the arguments into a shell variable
that will be expanded. There are two cases:
a. Literal text, provided with --source or --source=. This text is just appended
directly.
b. Source file names, provided with -f. We use a neat trick and append @include
filename to the shell variables contents. Since the file-inclusion program works
the way gawk does, this gets the text of the file included into the program at the
correct point.
3. Run an awk program (naturally) over the shell variables contents to expand @include
statements. The expanded program is placed in a second shell variable.
4. Run the expanded program with gawk and any other original command-line arguments
that the user supplied (such as the data file names).
This program uses shell variables extensively: for storing command-line arguments, the
text of the awk program that will expand the users program, for the users original program,
and for the expanded program. Doing so removes some potential problems that might arise
were we to use temporary files instead, at the cost of making the script somewhat more
complicated.
The initial part of the program turns on shell tracing if the first argument is debug.
The next part loops through all the command-line arguments. There are several cases
of interest:
--
This ends the arguments to igawk. Anything else should be passed on to the
users awk program without being evaluated.
-W
This indicates that the next option is specific to gawk. To make argument
processing easier, the -W is appended to the front of the remaining arguments
and the loop continues. (This is an sh programming trick. Dont worry about
it if you are not familiar with sh.)
-v, -F
Fully explaining the sh language is beyond the scope of this book. We provide some minimal explanations,
but see a good shell programming book if you wish to understand things in more depth.
278
--version, -Wversion
igawk prints its version number, runs gawk --version to get the gawk version
information, and then exits.
If none of the -f, --file, -Wfile, --source, or -Wsource arguments are supplied,
then the first nonoption argument should be the awk program. If there are no commandline arguments left, igawk prints an error message and exits. Otherwise, the first argument
is appended to program. In any case, after the arguments have been processed, program
contains the complete text of the original awk program.
The program is as follows:
#! /bin/sh
# igawk --- like gawk but do @include processing
if [ "$1" = debug ]
then
set -x
shift
fi
# A literal newline, so that program text is formatted correctly
n=
shift
# The ${x?message here} construct prints a
# diagnostic if $x is the null string
set -- -W"${@?missing operand}"
continue ;;
-[vF])
-f*)
279
-[W-]file=*)
f=$(expr "$1" : -.file=\(.*\))
program="$program$n@include $f" ;;
-[W-]file)
program="$program$n@include ${2?missing operand}"
shift ;;
-[W-]source=*)
t=$(expr "$1" : -.source=\(.*\))
program="$program$n$t" ;;
-[W-]source)
program="$program$n${2?missing operand}"
shift ;;
-[W-]version)
echo igawk: version 3.0 1>&2
gawk --version
exit 0 ;;
-[W-]*) opts="$opts $1" ;;
*)
esac
shift
done
break ;;
if [ -z "$program" ]
then
program=${1?missing program}
shift
fi
# At this point, program has the program.
The awk program to process @include directives is stored in the shell variable expand_
prog. Doing this keeps the shell script readable. The awk program reads through the users
program, one line at a time, using getline (see Section 4.9 [Explicit Input with getline],
page 67). The input file names and @include statements are managed using a stack. As
each @include is encountered, the current file name is pushed onto the stack and the file
named in the @include directive becomes the current file name. As each file is finished,
the stack is popped, and the previous input file becomes the current input file again. The
process is started by making the original file the first one on the stack.
280
The pathto() function does the work of finding the full path to a file. It simulates
gawks behavior when searching the AWKPATH environment variable (see Section 2.5.1 [The
AWKPATH Environment Variable], page 32). If a file name has a / in it, no path search is
done. Similarly, if the file name is "-", then that string is used as-is. Otherwise, the file
name is concatenated with the name of each directory in the path, and an attempt is made
to open the generated file name. The only way to test if a file can be read in awk is to go
ahead and try to read it with getline; this is what pathto() does.10 If the file can be
read, it is closed and the file name is returned:
expand_prog=
function pathto(file,
i, t, junk)
{
if (index(file, "/") != 0)
return file
if (file == "-")
return file
for (i = 1; i <= ndirs; i++) {
t = (pathlist[i] "/" file)
if ((getline junk < t) > 0) {
# found it
close(t)
return t
}
}
return ""
}
The main program is contained inside one BEGIN rule. The first thing it does is set up
the pathlist array that pathto() uses. After splitting the path on :, null elements are
replaced with ".", which represents the current directory:
BEGIN {
path = ENVIRON["AWKPATH"]
ndirs = split(path, pathlist, ":")
for (i = 1; i <= ndirs; i++) {
if (pathlist[i] == "")
pathlist[i] = "."
}
The stack is initialized with ARGV[1], which will be /dev/stdin. The main loop comes
next. Input lines are read in succession. Lines that do not start with @include are printed
verbatim. If the line does start with @include, the file name is in $2. pathto() is called to
generate the full path. If it cannot, then the program prints an error message and continues.
10
On some very old versions of awk, the test getline junk < t can loop forever if the file exists but is
empty. Caveat emptor.
281
The next thing to check is if the file is included already. The processed array is indexed
by the full file name of each included file and it tracks this information for us. If the file is
seen again, a warning message is printed. Otherwise, the new file name is pushed onto the
stack and processing continues.
Finally, when getline encounters the end of the input file, the file is closed and the
stack is popped. When stackptr is less than zero, the program is done:
stackptr = 0
input[stackptr] = ARGV[1] # ARGV[1] is first file
282
The expanded program is saved in the variable processed_program. Its done in these
steps:
1. Run gawk with the @include-processing program (the value of the expand_prog shell
variable) on standard input.
2. Standard input is the contents of the users program, from the shell variable program.
Its contents are fed to gawk via a here document.
3. The results of this processing are saved in the shell variable processed_program by
using command substitution.
The last step is to call gawk with the expanded program, along with the original options
and command-line arguments that the user supplied.
eval gawk $opts -- "$processed_program" "$@"
The eval command is a shell construct that reruns the shells parsing process. This
keeps things properly quoted.
This version of igawk represents my fifth version of this program. There are four key
simplifications that make the program work better:
Using @include even for the files named with -f makes building the initial collected
awk program much simpler; all the @include processing can be done once.
Not trying to save the line read with getline in the pathto() function when testing
for the files accessibility for use with the main program simplifies things considerably.
Using a getline loop in the BEGIN rule does it all in one place. It is not necessary to
call out to a separate loop for processing nested @include statements.
Instead of saving the expanded program in a temporary file, putting it in a shell variable
avoids some potential security problems. This has the disadvantage that the script relies
upon more features of the sh language, making it harder to follow for those who arent
familiar with sh.
Also, this program illustrates that it is often worthwhile to combine sh and awk programming together. You can usually accomplish quite a lot, without having to resort to
low-level programming in C or C++, and it is frequently easier to do certain kinds of string
and argument manipulation using the shell than it is in awk.
Finally, igawk shows that it is not always necessary to add new features to a program;
they can often be layered on top.
As an additional example of this, consider the idea of having two files in a directory in
the search path:
default.awk
This file contains a set of default library functions, such as getopt() and
assert().
site.awk
This file contains library functions that are specific to a site or installation;
i.e., locally developed functions. Having a separate file allows default.awk to
change with new gawk releases, without requiring the system administrator to
update it each time by adding the local functions.
283
One user suggested that gawk be modified to automatically read these files upon startup.
Instead, it would be very simple to modify igawk to do this. Since igawk can process nested
@include directives, default.awk could simply contain @include statements for the
desired library functions.
a, i, n, result)
284
END {
sort = "sort"
for (key in data) {
# Sort words with same key
nwords = asorti(data[key], words)
if (nwords == 1)
continue
# And print. Minor glitch: trailing space at end of each line
for (j = 1; j <= nwords; j++)
printf("%s ", words[j]) | sort
print "" | sort
}
close(sort)
}
Here is some partial output when the program is run:
$ gawk -f anagram.awk /usr/share/dict/words | grep ^b
...
babbled blabbed
babbler blabber brabble
babblers blabbers brabbles
babbling blabbing
babbly blabby
babel bable
babels beslab
babery yabber
...
286
view the chain of called functions (main program calls A, which calls B, which
calls C), as a stack of executing functions: the currently running function is the
topmost one on the stack, and when it finishes (returns), the next one down
then becomes the active function. Such a stack is termed a call stack.
For each function on the call stack, the system maintains a data area that
contains the functions parameters, local variables, and return value, as well as
any other bookkeeping information needed to manage the call stack. This
data area is termed a stack frame.
gawk also follows this model, and dgawk gives you access to the call stack and
to each stack frame. You can see the call stack, as well as from where each
function on the stack was invoked. Commands that print the call stack print
information about each stack frame (as detailed later on).
Breakpoint
During debugging, you often wish to let the program run until it reaches a
certain point, and then continue execution from there one statement (or instruction) at a time. The way to do this is to set a breakpoint within the
program. A breakpoint is where the execution of the program should break off
(stop), so that you can take over control of the programs execution. You can
add and remove as many breakpoints as you like.
Watchpoint
A watchpoint is similar to a breakpoint. The difference is that breakpoints are
oriented around the code: stop when a certain point in the code is reached. A
watchpoint, however, specifies that program execution should stop when a data
value is changed. This is useful, since sometimes it happens that a variable
receives an erroneous value, and its hard to track down where this happens
just by looking at the code. By using a watchpoint, you can stop whenever a
variable is assigned to, and usually find the errant code quite quickly.
288
a 64
dgawk>
at awklib/eg/prog/uniq.awk:64
if (fcount == 0 && charcount == 0)
Now we can look at whats going on inside our program. First of all, lets see how we got
to where we are. At the prompt, we type bt (short for backtrace), and dgawk responds
with a listing of the current stack frames:
dgawk> bt
a #0 are_equal(n, m, clast, cline, alast, aline)
at awklib/eg/prog/uniq.awk:69
a #1 in main() at awklib/eg/prog/uniq.awk:89
This tells us that are_equal() was called by the main program at line 89 of uniq.awk.
(This is not a big surprise, since this is the only call to are_equal() in the program, but
in more complex programs, knowing who called a function and with what parameters can
be the key to finding the source of the problem.)
Now that were in are_equal(), we can start looking at the values of some variables.
Lets say we type p n (p is short for print). We would expect to see the value of n, a
parameter to are_equal(). Actually, dgawk gives us:
dgawk> p n
a n = untyped variable
In this case, n is an uninitialized local variable, since the function was called without
arguments (see Section 6.4 [Function Calls], page 107).
A more useful variable to display might be the current record:
dgawk> p $0
a $0 = string ("gawk is a wonderful program!")
This might be a bit puzzling at first since this is the second line of our test input above.
Lets look at NR:
dgawk> p NR
a NR = number (2)
So we can see that are_equal() was only called for the second record of the file. Of course,
this is because our program contained a rule for NR == 1:
NR == 1 {
last = $0
next
}
OK, lets just check that that rule worked correctly:
dgawk> p last
a last = string ("awk is a wonderful program!")
Everything we have done so far has verified that the program has worked as planned, up
to and including the call to are_equal(), so the problem must be inside this function. To
investigate further, we must begin stepping through the lines of are_equal(). We start
by typing n (for next):
dgawk> n
a 67
if (fcount > 0) {
This tells us that gawk is now ready to execute line 67, which decides whether to give
the lines the special field skipping treatment indicated by the -f command-line option.
(Notice that we skipped from where we were before at line 64 to here, since the condition
in line 64
if (fcount == 0 && charcount == 0)
was false.)
Continuing to step, we now get to the splitting of the current and last records:
dgawk> n
n = split(last, alast)
a 68
dgawk> n
m = split($0, aline)
a 69
At this point, we should be curious to see what our records were split into, so we try to
look:
dgawk> p n m alast aline
a n = number (5)
a m = number (5)
a alast = array, 5 elements
a aline = array, 5 elements
(The p command can take more than one argument, similar to awks print statement.)
This is kind of disappointing, though. All we found out is that there are five elements in
each of our arrays. Useful enough (we now know that none of the words were accidentally
left out), but what if we want to see inside the array?
The first choice would be to use subscripts:
dgawk> p alast[0]
a "0" not in array alast
Oops!
dgawk> p alast[1]
a alast["1"] = string ("awk")
This would be kind of slow for a 100-member array, though, so dgawk provides a shortcut
(reminiscent of another language not to be mentioned):
dgawk> p @alast
a alast["1"] = string ("awk")
a alast["2"] = string ("is")
a alast["3"] = string ("a")
a alast["4"] = string ("wonderful")
a alast["5"] = string ("program!")
It looks like we got this far OK. Lets take another step or two:
dgawk> n
clast = join(alast, fcount, n)
a 70
dgawk> n
cline = join(aline, fcount, m)
a 71
Well, here we are at our error (sorry to spoil the suspense). What we had in mind was
to join the fields starting from the second one to make the virtual record to compare, and
if the first field was numbered zero, this would work. Lets look at what weve got:
290
filename:n
Set a breakpoint at line number n in source file filename.
function
Each breakpoint is assigned a number which can be used to delete it from the
breakpoint list using the delete command.
With a breakpoint, you may also supply a condition. This is an awk expression
(enclosed in double quotes) that dgawk evaluates whenever the breakpoint is
reached. If the condition is true, then dgawk stops execution and prompts for
a command. Otherwise, dgawk continues executing the program.
clear [[filename:]n | function]
Without any argument, delete any breakpoint at the next instruction to be
executed in the selected stack frame. If the program stops at a breakpoint,
this deletes that breakpoint so that the program does not stop at that location
again. Arguments can be one of the following:
n
filename:n
Delete breakpoint(s) set at line number n in source file filename.
function
condition n "expression"
Add a condition to existing breakpoint or watchpoint n. The condition is an
awk expression that dgawk evaluates whenever the breakpoint or watchpoint
is reached. If the condition is true, then dgawk stops execution and prompts
for a command. Otherwise, dgawk continues executing the program. If the
condition expression is not specified, any existing condition is removed; i.e., the
breakpoint or watchpoint is made unconditional.
delete [n1 n2 . . . ] [nm]
d [n1 n2 . . . ] [nm]
Delete specified breakpoints or a range of breakpoints. Deletes all defined breakpoints if no argument is supplied.
disable [n1 n2 . . . | nm]
Disable specified breakpoints or a range of breakpoints. Without any argument,
disables all breakpoints.
enable [del | once] [n1 n2 . . . ] [nm]
e [del | once] [n1 n2 . . . ] [nm]
Enable specified breakpoints or a range of breakpoints. Without any argument, enables all breakpoints. Optionally, you can specify how to enable the
breakpoint:
del
Enable the breakpoint(s) temporarily, then delete it when the program stops at the breakpoint.
once
Enable the breakpoint(s) temporarily, then disable it when the program stops at the breakpoint.
ignore n count
Ignore breakpoint number n the next count times it is hit.
292
Execute until the selected stack frame returns. Print the returned value.
next [count]
n [count] Continue execution to the next source line, stepping over function calls. The
argument count controls how many times to repeat the action, as in step.
nexti [count]
ni [count] Execute one (or count) instruction(s), stepping over function calls.
return [value]
Cancel execution of a function call. If value (either a string or a number) is
specified, it is used as the functions return value. If used in a frame other
than the innermost one (the currently executing function, i.e., frame number
0), discard all inner frames in addition to the selected one, and the caller of
that frame becomes the innermost frame.
run
r
Start/restart execution of the program. When restarting, dgawk retains the current breakpoints, watchpoints, command history, automatic display variables,
and debugger options.
step [count]
s [count] Continue execution until control reaches a different source line in the current
stack frame. step steps inside any function called within the line. If the
argument count is supplied, steps that many times before stopping, unless it
encounters a breakpoint or watchpoint.
stepi [count]
si [count] Execute one (or count) instruction(s), stepping inside function calls. (For illustration of what is meant by an instruction in gawk, see the output shown
under dump in Section 14.3.6 [Miscellaneous Commands], page 296.)
until [[filename:]n | function]
u [[filename:]n | function]
Without any argument, continue execution until a line past the current line in
current stack frame is reached. With an argument, continue execution until the
specified location is reached, or the current stack frame returns.
294
displays the name and arguments to each function, the source file name, and
the line number.
down [count]
Move count (default 1) frames down the stack toward the innermost frame.
Then select and print the frame.
frame [n]
f [n]
Select and print (frame number, function and argument names, source file, and
the source line) stack frame n. Frame 0 is the currently executing, or innermost,
frame (function call), frame 1 is the frame that called the innermost one. The
highest numbered frame is the one for the main program.
up [count] Move count (default 1) frames up the stack toward the outermost frame. Then
select and print the frame.
break
display
frame
functions
List all function definitions including source file names and line
numbers.
locals
source
The name of the current source file. Each time the program stops,
the current source file is the file containing the current instruction.
When dgawk first starts, the current source file is the first file included via the -f option. The list filename:lineno command
can be used at any time to change the current source.
sources
variables
List all global variables.
watch
Additional commands give you control over the debugger, the ability to save the debuggers state, and the ability to run debugger commands from a file. The commands
are:
296
option [name[=value]]
o [name[=value]]
Without an argument, display the available debugger options and their current
values. option name shows the current value of the named option. option
name=value assigns a new value to the named option. The available options
are:
history_size
The maximum number of lines to keep in the history file
./.dgawk_history. The default is 100.
listsize
outfile
prompt
dgawk> dump
# BEGIN
a
a
2:0x89faef4] Op_rule
a [
3:0x89fa428] Op_push_i
a [
3:0x89fa464] Op_push_i
a [
3:0x89fa450] Op_match
a [
3:0x89fa3ec] Op_store_var
a [
4:0x89fa48c] Op_push_i
a [
4:0x89fa4c8] Op_push_i
a [
4:0x89fa4b4] Op_equal
a [
4:0x89fa400] Op_store_var
a [
5:0x89fa4f0] Op_push
a [
5:0x89fa4dc] Op_plus_i
a [
5:0x89fa414] Op_push_lhs
a [
5:0x89fa4a0] Op_assign_plus
a [
:0x89fa478] Op_pop
a [
6:0x89fa540] Op_push
a [
6:0x89fa554] Op_push_i
a [
:0x89fa5a4] Op_no_op
a [
6:0x89fa590] Op_push
a [
:0x89fa5b8] Op_concat
a [
6:0x89fa518] Op_store_var
a [
7:0x89fa504] Op_push_loop
a [
get_break = 0x89fa680]
7:0x89fa568] Op_push_lhs
a [
7:0x89fa52c] Op_postincrement
a [
7:0x89fa5e0] Op_push
a [
7:0x89fa61c] Op_push
a [
7:0x89fa5f4] Op_plus
a [
7:0x89fa644] Op_push
a [
7:0x89fa630] Op_plus
a [
7:0x89fa5cc] Op_leq
a [
:0x89fa57c] Op_jmp_false
a [
7:0x89fa694] Op_push_i
a [
:0x89fa6d0] Op_no_op
a [
7:0x89fa608] Op_assign_concat
a [
:0x89fa6a8] Op_jmp
a [
:0x89fa680] Op_pop_loop
a [
a
...
a
8:0x89fa658] Op_K_printf
a [
:0x89fa374] Op_no_op
a [
:0x89fa3d8] Op_atexit
a [
:0x89fa6bc] Op_stop
a [
:0x89fa39c] Op_no_op
a [
:0x89fa3b0] Op_after_beginfile
a [
:0x89fa388] Op_no_op
a [
:0x89fa3c4] Op_after_endfile
a [
dgawk>
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
X [do_reference = TRUE]
O [do_reference = FALSE]
"==" [PERM|STRING|STRCUR]
"==" [PERM|STRING|STRCUR]
o [do_reference = FALSE]
o
0 [PERM|NUMCUR|NUMBER]
o [do_reference = TRUE]
O
"" [PERM|STRING|STRCUR]
O
[expr_count = 3] [concat_flag = 0]
x [do_reference = FALSE]
[target_continue = 0x89fa568] [tar-
x
o
o
[target_jmp = 0x89fa680]
"%c" [PERM|STRING|STRCUR]
c
[target_jmp = 0x89fa568]
298
help
h
Print a list of all of the dgawk commands with a short summary of their usage.
help command prints the information about the command command.
Print lines after the lines last printed. list without any argument
does the same thing.
nm
filename:n
Print lines centered around line number n in source file filename.
This command may change the current source file.
function
quit
q
Exit the debugger. Debugging is great fun, but sometimes we all have to tend
to other obligations in life, and sometimes we find the bug, and are free to go
on to the next one! As we saw above, if you are running a program, dgawk
warns you if you accidentally type q or quit, to make sure you really want
to quit.
trace on | off
Turn on or off a continuous printing of instructions which are about to be
executed, along with printing the awk line which they implement. The default
is off.
It is to be hoped that most of the opcodes in these instructions are fairly
self-explanatory, and using stepi and nexti while trace is on will make them
into familiar friends.
Argument completion
Non-numeric arguments to a command. Relevant commands are enable and
info.
Variable name completion
Global variable names, and function arguments in the current context if the
program is running. Relevant commands are display, print, set, and watch.
302
The escape sequences \b, \f, and \r (see Section 3.2 [Escape Sequences], page 38).
(Some vendors have updated their old versions of awk to recognize \b, \f, and \r,
but this is not something you can rely on.)
Redirection of input for the getline function (see Section 4.9 [Explicit Input with
getline], page 67).
Multiple BEGIN and END rules (see Section 7.1.4 [The BEGIN and END Special Patterns],
page 114).
Multidimensional arrays (see Section 8.5 [Multidimensional Arrays], page 142).
The use of built-in variables as function parameter names is forbidden (see Section 9.2.1
[Function Definition Syntax], page 170.
More complete documentation of many of the previously undocumented features of the
language.
See Section A.6 [Common Extensions Summary], page 305, for a list of common extensions not permitted by the POSIX standard.
The 2008 POSIX standard can be found online at http://www.opengroup.org/onlinepubs/9699919799/.
304
The ability for RS to be a regexp (see Section 4.1 [How Input Is Split into Records],
page 49).
The ability to use octal and hexadecimal constants in awk program source code
(see Section 6.1.1.2 [Octal and Hexadecimal Numbers], page 89).
The |& operator for two-way I/O to a coprocess (see Section 11.3 [Two-Way
Communications with Another Process], page 203).
Indirect function calls (see Section 9.3 [Indirect Function Calls], page 178).
Directories on the command line produce a warning and are skipped (see
Section 4.10 [Directories On The Command Line], page 72).
New keywords:
The BEGINFILE and ENDFILE special patterns. (see Section 7.1.5 [The BEGINFILE
and ENDFILE Special Patterns], page 115).
The ability to delete all of an array at once with delete array (see Section 8.2
[The delete Statement], page 139).
The nextfile statement (see Section 7.4.9 [Using gawks nextfile Statement],
page 125).
The switch statement (see Section 7.4.5 [The switch Statement], page 121).
Changes to standard awk functions:
The optional second argument to close() that allows closing one end of a twoway pipe to a coprocess (see Section 11.3 [Two-Way Communications with Another
Process], page 203).
POSIX compliance for gsub() and sub().
The length() function accepts an array argument and returns the number of
elements in the array (see Section 9.1.3 [String-Manipulation Functions], page 149).
The optional third argument to the match() function for capturing text-matching
subexpressions within a regexp (see Section 9.1.3 [String-Manipulation Functions],
page 149).
Positional specifiers in printf formats for making translations easier (see
Section 10.4.2 [Rearranging printf Arguments], page 189).
The split() functions additional optional fourth argument which is an array
to hold the text of the field separators. (see Section 9.1.3 [String-Manipulation
Functions], page 149).
Additional functions only in gawk:
The and(), compl(), lshift(), or(), rshift(), and xor() functions for bit
manipulation (see Section 9.1.6 [Bit-Manipulation Functions], page 167).
The asort() and asorti() functions for sorting arrays (see Section 11.2 [Controlling Array Traversal and Array Sorting], page 196).
The bindtextdomain(), dcgettext() and dcngettext() functions for internationalization (see Section 10.3 [Internationalizing awk Programs], page 187).
The extension() built-in function and the ability to add new functions dynamically (see Section C.3 [Adding New Built-in Functions to gawk], page 328).
The fflush() function from Brian Kernighans version of awk (see Section 9.1.4
[Input/Output Functions], page 160).
The gensub(), patsplit(), and strtonum() functions for more powerful text
manipulation (see Section 9.1.3 [String-Manipulation Functions], page 149).
The mktime(), systime(), and strftime() functions for working with timestamps (see Section 9.1.5 [Time Functions], page 163).
Changes and/or additions in the command-line options:
The AWKPATH environment variable for specifying a path search for the -f
command-line option (see Section 2.2 [Command-Line Options], page 25).
The ability to use GNU-style long-named options that start with -- and
the --characters-as-bytes, --compat, --dump-variables, --exec,
--gen-pot, --lint, --lint-old, --non-decimal-data, --posix,
--profile, --re-interval, --sandbox, --source, --traditional, and
--use-lc-numeric options (see Section 2.2 [Command-Line Options], page 25).
Support for the following obsolete systems was removed from the code and the documentation for gawk version 4.0:
Amiga
Atari
BeOS
Cray
MIPS RiscOS
MS-DOS with the Microsoft Compiler
MS-Windows with the Microsoft Compiler
NeXT
SunOS 3.x, Sun 386 (Road Runner)
Tandem (non-POSIX)
Prestandard VAX C compiler for VAX/VMS
BWK Awk
X
X
X
X
X
X
X
X
X
X
Mawk
X
X
X
X
X
X
X
GNU Awk
X
X
X
X
X
X
X
X
X
X
X
306
fflush() function
BINMODE variable
X
X
X
X
When gawk switched to using locale-aware regexp matchers, the problems began; especially as both GNU/Linux and commercial Unix vendors started implementing non-ASCII
locales, and making them the default. Perhaps the most frequently asked question became
something like why does [A-Z] match lowercase letters?!?
This situation existed for close to 10 years, if not more, and the gawk maintainer grew
weary of trying to explain that gawk was being nicely standards-compliant, and that the
issue was in the users locale. During the development of version 4.0, he modified gawk
to always treat ranges in the original, pre-POSIX fashion, unless --posix was used (see
Section 2.2 [Command-Line Options], page 25).
Fortunately, shortly before the final release of gawk 4.0, the maintainer learned that the
2008 standard had changed the definition of ranges, such that outside the "C" and "POSIX"
locales, the meaning of range expressions was undefined.1
By using this lovely technical term, the standard gives license to implementors to implement ranges in whatever way they choose. The gawk maintainer chose to apply the
pre-POSIX meaning in all cases: the default regexp matching; with --traditional, and
with --posix; in all cases, gawk remains POSIX compliant.
308
Michal Jaegermann provided the port to Atari systems and its documentation. (This
port is no longer supported.) He continues to provide portability checking with DEC
Alpha systems, and has done a lot of work to make sure gawk works on non-32-bit
systems.
Fred Fish provided the port to Amiga systems and its documentation. (With Freds
sad passing, this is no longer supported.)
Scott Deifik currently maintains the MS-DOS port using DJGPP.
Eli Zaretskii currently maintains the MS-Windows port using MinGW.
Juan Grigera provided a port to Windows32 systems. (This is no longer supported.)
For many years, Dr. Darrel Hankerson acted as coordinator for the various ports to different PC platforms and created binary distributions for various PC operating systems.
He was also instrumental in keeping the documentation up to date for the various PC
platforms.
Christos Zoulas provided the extension() built-in function for dynamically adding
new modules.
J
urgen Kahrs contributed the initial version of the TCP/IP networking code and documentation, and motivated the inclusion of the |& operator.
Stephen Davies provided the initial port to Tandem systems and its documentation.
(However, this is no longer supported.) He was also instrumental in the initial work to
integrate the byte-code internals into the gawk code base.
Matthew Woehlke provided improvements for Tandems POSIX-compliant systems.
Martin Brown provided the port to BeOS and its documentation. (This is no longer
supported.)
Arno Peters did the initial work to convert gawk to use GNU Automake and GNU
gettext.
Alan J. Broder provided the initial version of the asort() function as well as the code
for the optional third argument to the match() function.
Andreas Buening updated the gawk port for OS/2.
Isamu Hasegawa, of IBM in Japan, contributed support for multibyte characters.
Michael Benzinger contributed the initial code for switch statements.
Patrick T.J. McPhee contributed the code for dynamic loading in Windows32 environments. (This is no longer supported)
John Haque reworked the gawk internals to use a byte-code engine, providing the dgawk
debugger for awk programs.
Efraim Yawitz contributed the original text for Chapter 14 [dgawk: The awk Debugger],
page 285.
Arnold Robbins has been working on gawk since 1988, at first helping David Trueman,
and as the primary maintainer since around 1994.
310
ChangeLog
A detailed list of source code changes as bugs are fixed or improvements made.
ChangeLog.0
An older list of source code changes.
NEWS
NEWS.0
COPYING
FUTURES
A brief list of features and changes being contemplated for future releases, with
some indication of the time frame for the feature, based on its difficulty.
LIMITATIONS
A list of those factors that limit gawks performance. Most of these depend on
the hardware or operating system software and are not limits in gawk itself.
POSIX.STD
A description of behaviors in the POSIX standard for awk which are left undefined, or where gawk may not comply fully, as well as a list of things that the
POSIX standard should describe but does not.
doc/awkforai.txt
A short article describing why gawk is a good language for Artificial Intelligence
(AI) programming.
doc/bc_notes
A brief description of gawks byte code internals.
doc/README.card
doc/ad.block
doc/awkcard.in
doc/cardfonts
doc/colors
doc/macros
doc/no.colors
doc/setter.outline
The troff source for a five-color awk reference card. A modern version of troff
such as GNU troff (groff) is needed to produce the color version. See the file
README.card for instructions if you have an older troff.
doc/gawk.1
The troff source for a manual page describing gawk. This is distributed for
the convenience of Unix users.
doc/gawk.texi
The Texinfo source file for this book. It should be processed with TEX (via
texi2dvi or texi2pdf) to produce a printed document, and with makeinfo to
produce an Info or HTML file.
doc/gawk.info
The generated Info file for this book.
doc/gawkinet.texi
The Texinfo source file for TCP/IP Internetworking with gawk. It should be
processed with TEX (via texi2dvi or texi2pdf) to produce a printed document
and with makeinfo to produce an Info or HTML file.
doc/gawkinet.info
The generated Info file for TCP/IP Internetworking with gawk.
doc/igawk.1
The troff source for a manual page describing the igawk program presented
in Section 13.3.9 [An Easy Way to Use Library Functions], page 276.
doc/Makefile.in
The input file used during the configuration process to generate the actual
Makefile for creating the documentation.
Makefile.am
*/Makefile.am
Files used by the GNU automake software for generating the Makefile.in
files used by autoconf and configure.
312
Makefile.in
aclocal.m4
configh.in
configure.ac
configure
custom.h
missing_d/*
m4/*
These files and subdirectories are used when configuring gawk for various Unix
systems. They are explained in Section B.2 [Compiling and Installing gawk on
Unix-like Systems], page 312.
po/*
awklib/extract.awk
awklib/Makefile.am
awklib/Makefile.in
awklib/eg/*
The awklib directory contains a copy of extract.awk (see Section 13.3.7
[Extracting Programs from Texinfo Source Files], page 271), which can be used
to extract the sample programs from the Texinfo source file for this book. It also
contains a Makefile.in file, which configure uses to generate a Makefile.
Makefile.am is used by GNU Automake to create Makefile.in. The library
functions from Chapter 12 [A Library of awk Functions], page 211, and the
igawk program from Section 13.3.9 [An Easy Way to Use Library Functions],
page 276, are included as ready-to-use files in the gawk distribution. They are
installed as part of the installation process. The rest of the programs in this
book are available in appropriate subdirectories of awklib/eg.
posix/*
pc/*
Files needed for building gawk under MS-Windows and OS/2 (see Section B.3.1
[Installation on PC Operating Systems], page 314, for details).
vms/*
Files needed for building gawk under VMS (see Section B.3.2 [How to Compile
and Install gawk on VMS], page 318, for details).
test/*
A test suite for gawk. You can use make check from the top-level gawk directory to run your version of gawk against the test suite. If gawk successfully
passes make check, then you can be confident of a successful port.
314
gnu/bin, libraries in gnu/lib/awk, and manual pages under gnu/man. This is designed
for easy installation to a /gnu directory on your drivehowever, the files can be installed
anywhere provided AWKPATH is set properly. Regardless of the installation directory, the
first line of igawk.cmd and igawk.bat (in gnu/bin) may need to be edited.
The binary distribution contains a separate file describing the contents. In particular, it
may include more than one version of the gawk executable.
OS/2 (32 bit, EMX) binary distributions are prepared for the /usr directory of your
preferred drive. Set UNIXROOT to your installation drive (e.g., e:) if you want to install
gawk onto another drive than the hardcoded default c:. Executables appear in /usr/bin,
libraries under /usr/share/awk, manual pages under /usr/man, Texinfo documentation
under /usr/info, and NLS files under /usr/share/locale. Note that the files can be
installed anywhere provided AWKPATH is set properly.
If you already have a file /usr/info/dir from another package do not overwrite it!
Instead enter the following commands at your prompt (replace x: by your installation
drive):
install-info --info-dir=x:/usr/info x:/usr/info/gawk.info
install-info --info-dir=x:/usr/info x:/usr/info/gawkinet.info
The binary distribution may contain a separate file containing additional or more detailed
installation instructions.
316
$
$
$
$
$
$
$
export CFLAGS
LDFLAGS="-s -Zcrtdll -Zlinker /exepack:2 -Zlinker /pm:vio -Zstack 0x6000"
export LDFLAGS
RANLIB="echo"
export RANLIB
./configure --prefix=c:/usr
make AR=emxomfar
These are just suggestions for use with GCC 2.x. You may use any other set of (selfconsistent) environment variables and compiler flags.
If you use GCC 2.95 it is recommended to use also:
$ LIBS="-lgcc"
$ export LIBS
You can also get an a.out executable if you prefer:
$
$
$
$
$
$
$
CFLAGS="-O2 -Zmt"
export CFLAGS
LDFLAGS="-s -Zstack 0x6000"
LIBS="-lgcc"
unset RANLIB
./configure --prefix=c:/usr
make
NOTE: Compilation of a.out executables also works with GCC 3.2. Versions
later than GCC 3.2 have not been tested successfully.
make install works as expected with the EMX build.
NOTE: Ancient OS/2 ports of GNU make are not able to handle the
Makefiles of this package. If you encounter any problems with make, try
GNU Make 3.79.1 or later versions. You should find the latest version on
ftp://hobbes.nmsu.edu/pub/os2/.
318
To illustrate, the following examples set binary mode on writes for standard output and
other files, and set ORS as the usual MS-DOS-style end-of-line:
gawk -v BINMODE=2 -v ORS="\r\n" ...
or:
gawk -v BINMODE=w -f binmode2.awk ...
These give the same result as the -W BINMODE=2 option in mawk. The following changes the
record separator to "\r\n" and sets binary mode on reads, but does not affect the mode
on standard input:
gawk -v RS="\r\n" --source "BEGIN { BINMODE = 1 }" ...
or:
gawk -f binmode1.awk ...
With proper quoting, in the first example the setting of RS can be moved into the BEGIN
rule.
$ @[.VMS]VMSBUILD.COM
or:
$ MMS/DESCRIPTION=[.VMS]DESCRIP.MMS GAWK
Older versions of gawk could be built with VAX C or GNU C on VAX/VMS, as well
as with DEC C, but that is no longer supported. DEC C (also briefly known as Compaq
C and now known as HP C, but referred to here as DEC C) is required. Both
VMSBUILD.COM and DESCRIP.MMS contain some obsolete support for the older compilers but
are set up to use DEC C by default.
gawk has been tested under Alpha/VMS 7.3-1 using Compaq C V6.4, and on Alpha/VMS
7.3, Alpha/VMS 7.3-2, and IA64/VMS 8.3.1
320
this newsgroup, there is no guarantee that we will see your posting. The steps
described above are the official recognized ways for reporting bugs. Really.
NOTE: Many distributions of GNU/Linux and the various BSD-based operating systems have their own bug reporting systems. If you report a bug
using your distributions bug reporting system, please also send a copy to
[email protected].
This is for two reasons. First, while some distributions forward bug reports
upstream to the GNU mailing list, many dont, so there is a good chance
that the gawk maintainer wont even see the bug report! Second, mail to the
GNU list is archived, and having everything at the GNU project keeps things
self-contained and not dependant on other web sites.
Non-bug suggestions are always welcome as well. If you have questions about things
that are unclear in the documentation or are just obscure features, ask me; I will try to help
you out, although I may not have the time to fix the problem. You can send me electronic
mail at the Internet address noted previously.
If you find bugs in one of the non-Unix ports of gawk, please send an electronic mail
message to the person who maintains that port. They are named in the following list, as
well as in the README file in the gawk distribution. Information in the README file should
be considered authoritative if it conflicts with this book.
The people maintaining the non-Unix ports of gawk are as follows:
MS-DOS with DJGPP
OS/2
VMS
z/OS (OS/390)
Dave Pitts, [email protected].
If your bug is also reproducible under Unix, please send a copy of your report to the
[email protected] email list as well.
Brian Kernighan, one of the original designers of Unix awk, has made his implementation of awk freely available. You can retrieve this version via the World
Wide Web from his home page. It is available in several archive formats:
Shell archive
http://www.cs.princeton.edu/~bwk/btl.mirror/awk.shar
322
http://www.cs.princeton.edu/~bwk/btl.mirror/awk.zip
This version requires an ISO C (1990 standard) compiler; the C compiler from
GCC (the GNU Compiler Collection) works quite nicely.
See Section A.6 [Common Extensions Summary], page 305, for a list of extensions in this awk that are not in POSIX awk.
mawk
awka
pawk
Nelson H.F. Beebe at the University of Utah has modified Brian Kernighans
awk to provide timing and profiling information. It is different from pgawk
(see Section 11.5 [Profiling Your awk Programs], page 206), in that it
uses CPU-based profiling, not line-count profiling. You may find it at
either
ftp://ftp.math.utah.edu/pub/pawk/pawk-20030606.tar.gz
or
http://www.math.utah.edu/pub/pawk/pawk-20030606.tar.gz.
Busybox Awk
Busybox is a GPL-licensed program providing small versions of many applications within a single executable. It is aimed at embedded systems. It includes a full implementation of POSIX awk. When building it, be careful not
to do make install as it will overwrite copies of other applications in your
/usr/local/bin. For more information, see the projects home page.
The OpenSolaris POSIX awk
The version of awk in /usr/xpg4/bin on Solaris is more-or-less POSIXcompliant. It is based on the awk from Mortice Kern Systems for PCs. The
source code can be downloaded from the OpenSolaris web site. This author
was able to make it compile and work under GNU/Linux with 12 hours
of work. Making it more generally portable (using GNU Autoconf and/or
Automake) would take more work, and this has not been done, at least to our
knowledge.
jawk
Libmawk
This is an embeddable awk interpreter derived from mawk. For more information
see http://repo.hu/projects/libmawk/.
xgawk
XML gawk. This is a fork of the gawk 3.1.6 source base to support processing
XML files. It has a number of interesting extensions which should one day
be integrated into the main gawk code base. For more information, see the
XMLgawk project web site.
325
326
327
Do not use the alloca() function for allocating memory off the stack. Its use
causes more portability trouble than is worth the minor benefit of not having to
free the storage. Instead, use malloc() and free().
Do not use comparisons of the form ! strcmp(a, b) or similar. As Henry Spencer
once said, strcmp() is not a boolean! Instead, use strcmp(a, b) == 0.
If adding new bit flag values, use explicit hexadecimal constants (0x001, 0x002,
0x004, and son on) instead of shifting one left by successive amounts ((1<<0),
(1<<1), and so on).
NOTE: If I have to reformat your code to follow the coding style used in
gawk, I may not bother to integrate your changes at all.
6. Update the documentation. Along with your new code, please supply new sections
and/or chapters for this book. If at all possible, please use real Texinfo, instead of just
supplying unformatted ASCII text (although even that is better than no documentation at all). Conventions to be followed in GAWK: Effective AWK Programming are
provided after the @bye at the end of the Texinfo source file. If possible, please update
the man page as well.
You will also have to sign paperwork for your documentation changes.
7. Submit changes as unified diffs. Use diff -u -r -N to compare the original gawk
source tree with your version. I recommend using the GNU version of diff. Send
the output produced by either run of diff to me when you submit your changes.
(See Section B.4 [Reporting Problems and Bugs], page 320, for the electronic mail
information.)
Using this format makes it easy for me to apply your changes to the master version of
the gawk source code (using patch). If I have to apply the changes manually, using a
text editor, I may not do so, particularly if there are lots of changes.
8. Include an entry for the ChangeLog file with your submission. This helps further
minimize the amount of work I have to do, making it easier for me to accept patches.
Although this sounds like a lot of work, please remember that while you may write the
new code, I have to maintain it and support it. If it isnt possible for me to do that with a
minimum of extra work, then I probably will not.
328
4.
5.
6.
7.
8.
your own, as long as you comply with the GPL (see [GNU General Public License],
page 357).
A number of the files that come with gawk are maintained by other people. Thus,
you should not change them unless it is for a very good reason; i.e., changes are
not out of the question, but changes to these files are scrutinized extra carefully.
The files are dfa.c, dfa.h, getopt1.c, getopt.c, getopt.h, install-sh,
mkinstalldirs, regcomp.c, regex.c, regexec.c, regexex.c, regex.h,
regex_internal.c, and regex_internal.h.
Be willing to continue to maintain the port. Non-Unix operating systems are supported
by volunteers who maintain the code needed to compile and run gawk on their systems.
If noone volunteers to maintain a port, it becomes unsupported and it may be necessary
to remove it from the distribution.
Supply an appropriate gawkmisc.??? file. Each port has its own gawkmisc.???
that implements certain operating system specific functions. This is cleaner than a
plethora of #ifdefs scattered throughout the code. The gawkmisc.c in the main
source directory includes the appropriate gawkmisc.??? file from each subdirectory.
Be sure to update it as well.
Each ports gawkmisc.??? file has a suffix reminiscent of the machine or operating
system for the portfor example, pc/gawkmisc.pc and vms/gawkmisc.vms. The
use of separate suffixes, instead of plain gawkmisc.c, makes it possible to move files
from a ports subdirectory into the main subdirectory, without accidentally destroying
the real gawkmisc.c file. (Currently, this is only an issue for the PC operating system
ports.)
Supply a Makefile as well as any other C source and header files that are necessary for
your operating system. All your code should be in a separate subdirectory, with a name
that is the same as, or reminiscent of, either your operating system or the computer
system. If possible, try to structure things so that it is not necessary to move files out
of the subdirectory into the main source directory. If that is not possible, then be sure
to avoid using names for your files that duplicate the names of files in the main source
directory.
Update the documentation. Please write a section (or sections) for this book describing
the installation and compilation steps needed to compile and/or install gawk for your
system.
Following these steps makes it much easier to integrate your changes into gawk and have
them coexist happily with other operating systems code that is already there.
In the code that you supply and maintain, feel free to use a coding style and brace layout
that suits your taste.
329
and dlsym() functions. This section describes how to write and use dynamically loaded
extensions for gawk. Experience with programming in C or C++ is necessary when reading
this section.
CAUTION: The facilities described in this section are very much subject to
change in a future gawk release. Be aware that you may have to re-do everything, at some future time.
If you have written your own dynamic extensions, be sure to recompile them for
each new gawk release. There is no guarantee of binary compatibility between
different releases, nor will there ever be such a guarantee.
NOTE: When --sandbox is specified, extensions are disabled (see Section 2.2
[Command-Line Options], page 25.
NODE
Just about everything is done using objects of type NODE. These contain both
strings and numbers, as well as variables and arrays.
330
nargs
n->stptr
n->stlen
Inside an extension function, this is the maximum number of expected parameters, as set by the make_builtin() function.
The data and length of a NODEs string value, respectively. The string is not
guaranteed to be zero-terminated. If you need to pass the string value to a C
library function, save the value in n->stptr[n->stlen], assign \0 to it, call
the routine, and then restore the value.
n->wstptr
n->wstlen
The data and length of a NODEs wide-string value, respectively. Use force_
wstring() to make sure these values are current.
n->type
The type of the NODE. This is a C enum. Values should be one of Node_var,
Node_var_new, or Node_var_array for function parameters.
n->vname
The variable name of a node. This is not of much use inside externally written
extensions.
331
332
additional state associated with the input processing), and no further open
hooks are called.
The function called will most likely want to set the IOBUFs get_record method
to indicate that future input records should be retrieved by calling that method
instead of using the standard gawk input processing.
And the function will also probably want to set the IOBUFs close_func method
to be called when the file is closed to clean up any state associated with the
input.
Finally, hook functions should be prepared to receive an IOBUF structure where
the fd field is set to INVALID_HANDLE, meaning that gawk was not able to open
the file itself. In this case, the hook function must be able to successfully open
the file and place a valid file descriptor there.
Currently, for example, the hook function facility is used to implement the XML
parser shared library extension. For more info, please look in awk.h and in
io.c.
An argument that is supposed to be an array needs to be handled with some extra code,
in case the array being passed in is actually from a function parameter.
The following boilerplate code shows how to do this:
NODE *the_arg;
/* assume need 3rd arg, 0-based */
the_arg = get_array_argument(2, FALSE);
Again, you should spend time studying the gawk internals; dont just blindly copy this
code.
333
...
newdir = "/home/arnold/funstuff"
ret = chdir(newdir)
if (ret < 0) {
printf("could not change to %s: %s\n",
newdir, ERRNO) > "/dev/stderr"
exit 1
}
...
The return value is negative if the chdir failed, and ERRNO (see Section 7.5 [Built-in
Variables], page 126) is set to a string indicating the error.
Using stat() is a bit more complicated. The C stat() function fills in a structure
that has a fair amount of information. The right way to model this in awk is to fill in an
associative array with the appropriate information:
file = "/home/arnold/.profile"
fdata[1] = "x"
# force fdata to be an array
ret = stat(file, fdata)
if (ret < 0) {
printf("could not stat %s: %s\n",
file, ERRNO) > "/dev/stderr"
exit 1
}
printf("size of %s is %d bytes\n", file, fdata["size"])
The stat() function always clears the data array, even if the stat() fails. It fills in the
following elements:
"name"
"dev"
"ino"
"mode"
The files mode, as a numeric value. This includes both the files type and its
permissions.
"nlink"
"uid"
"gid"
"size"
"blocks"
The number of disk blocks the file actually occupies. This may not be a function
of the files size if the file has holes.
"atime"
"mtime"
"ctime"
"pmode"
The files last access, modification, and inode update times, respectively.
These are numeric timestamps, suitable for formatting with strftime() (see
Section 9.1 [Built-in Functions], page 147).
The files printable mode. This is a string representation of the files type and
permissions, such as what is produced by ls -lfor example, "drwxr-xr-x".
334
"type"
A printable string representation of the files type. The value is one of the
following:
"blockdev"
"chardev"
The file is a block or character device (special file).
"directory"
The file is a directory.
"fifo"
"file"
"socket"
"symlink"
The file is a symbolic link.
Several additional elements may be present depending upon the operating system and
the type of the file. You can test for them in your awk program by using the in operator
(see Section 8.1.2 [Referring to an Array Element], page 136):
"blksize"
The preferred block size for I/O to the file. This field is not present on all
POSIX-like systems in the C stat structure.
"linkval"
If the file is a symbolic link, this element is the name of the file the link points
to (i.e., the value of the link).
"rdev"
"major"
"minor"
If the file is a block or character device file, then these values represent the
numeric device number and the major and minor components of that number,
respectively.
static NODE *
1
This version is edited slightly for presentation. See extension/filefuncs.c in the gawk distribution
for the complete version.
335
do_chdir(int nargs)
{
NODE *newdir;
int ret = -1;
if (do_lint && get_curfunc_arg_count() != 1)
lintwarn("chdir: called with incorrect number of arguments");
newdir = get_scalar_argument(0, FALSE);
The file includes the "awk.h" header file for definitions for the gawk internals. It includes
<sys/sysmacros.h> for access to the major() and minor() macros.
By convention, for an awk function foo, the function that implements it is called do_foo.
The function should take a int argument, usually called nargs, that represents the number
of defined arguments for the function. The newdir variable represents the new directory
to change to, retrieved with get_scalar_argument(). Note that the first argument is
numbered zero.
This code actually accomplishes the chdir(). It first forces the argument to be a string
and passes the string value to the chdir() system call. If the chdir() fails, ERRNO is
updated.
(void) force_string(newdir);
ret = chdir(newdir->stptr);
if (ret < 0)
update_ERRNO();
Finally, the function returns the return value to the awk level:
return make_number((AWKNUM) ret);
}
The stat() built-in is more involved. First comes a function that turns a numeric mode
into a printable representation (e.g., 644 becomes -rw-r--r--). This is omitted here for
brevity:
/* format_mode --- turn a stat mode field into something readable */
static char *
format_mode(unsigned long fmode)
{
...
}
Next comes the do_stat() function. It starts with variable declarations and argument
checking:
/* do_stat --- provide a stat() function for gawk */
static NODE *
do_stat(int nargs)
{
NODE *file, *array, *tmp;
struct stat sbuf;
336
int ret;
NODE **aptr;
char *pmode;
/* printable mode */
char *type = "unknown";
if (do_lint && get_curfunc_arg_count() > 2)
lintwarn("stat: called with too many arguments");
Then comes the actual work. First, the function gets the arguments. Then, it always
clears the array. The code use lstat() (instead of stat()) to get the file information, in
case the file is a symbolic link. If theres an error, it sets ERRNO and returns:
/* file is first arg, array to hold results is second */
file = get_scalar_argument(0, FALSE);
array = get_array_argument(1, FALSE);
/* empty out the array */
assoc_clear(array);
/* lstat the file, if error, set ERRNO and return */
(void) force_string(file);
ret = lstat(file->stptr, & sbuf);
if (ret < 0) {
update_ERRNO();
return make_number((AWKNUM) ret);
}
Now comes the tedious part: filling in the array. Only a few of the calls are shown here,
since they all follow the same pattern:
/* fill in the array */
aptr = assoc_lookup(array, tmp = make_string("name", 4), FALSE);
*aptr = dupnode(file);
unref(tmp);
aptr = assoc_lookup(array, tmp = make_string("mode", 4), FALSE);
*aptr = make_number((AWKNUM) sbuf.st_mode);
unref(tmp);
aptr = assoc_lookup(array, tmp = make_string("pmode", 5), FALSE);
pmode = format_mode(sbuf.st_mode);
*aptr = make_string(pmode, strlen(pmode));
unref(tmp);
When done, return the lstat() return value:
return make_number((AWKNUM) ret);
}
Finally, its necessary to provide the glue that loads the new function(s) into gawk.
By convention, each library has a routine named dlload() that does the job:
337
# no-op
338
$ gawk -f testff.awk
a Info for testff.awk
a ret = 0
a data["size"] = 607
a data["ino"] = 14945891
a data["name"] = testff.awk
a data["pmode"] = -rw-rw-r-a data["nlink"] = 1
a data["atime"] = 1293993369
a data["mtime"] = 1288520752
a data["mode"] = 33204
a data["blksize"] = 4096
a data["dev"] = 2054
a data["type"] = file
a data["gid"] = 500
a data["uid"] = 500
a data["blocks"] = 8
a data["ctime"] = 1290113572
a testff.awk modified: 10 31 10 12:25:52
a
a Info for JUNK
a ret = -1
a JUNK modified: 01 01 70 02:00:00
339
Data
Program
Results
The program in the figure can be either a compiled program1 (such as ls), or it may
be interpreted. In the latter case, a machine-executable program such as awk reads your
program, and then uses the instructions in your program to process the data.
When you write a program, it usually consists of the following, very basic set of steps:
Initialization
More
Data
?
No
Clean Up
Yes
Process
Initialization
These are the things you do before actually starting to process data, such as
checking arguments, initializing any data you need to work with, and so on.
This step corresponds to awks BEGIN rule (see Section 7.1.4 [The BEGIN and
END Special Patterns], page 114).
If you were baking a cake, this might consist of laying out all the mixing bowls
and the baking pan, and making sure you have all the ingredients that you
need.
1
Compiled programs are typically written in lower-level languages such as C, C++, or Ada, and then
translated, or compiled, into a form that the computer can execute directly.
342
Processing This is where the actual work is done. Your program reads data, one logical
chunk at a time, and processes it as appropriate.
In most programming languages, you have to manually manage the reading
of data, checking to see if there is more each time you read a chunk. awks
pattern-action paradigm (see Chapter 1 [Getting Started with awk], page 11)
handles the mechanics of this for you.
In baking a cake, the processing corresponds to the actual labor: breaking eggs,
mixing the flour, water, and other ingredients, and then putting the cake into
the oven.
Clean Up
Once youve processed all the data, you may have things you need to do before
exiting. This step corresponds to awks END rule (see Section 7.1.4 [The BEGIN
and END Special Patterns], page 114).
After the cake comes out of the oven, you still have to wrap it in plastic wrap
to keep anyone from tasting it, as well as wash the mixing bowls and utensils.
represent values exactly. The disadvantage is that their range is limited. On most systems,
this range is 2,147,483,648 to 2,147,483,647. However, many systems now support a range
from 9,223,372,036,854,775,808 to 9,223,372,036,854,775,807.
Integer values come in two flavors: signed and unsigned. Signed values may be negative
or positive, with the range of values just described. Unsigned values are always positive. On
most systems, the range is from 0 to 4,294,967,295. However, many systems now support a
range from 0 to 18,446,744,073,709,551,615.
Floating-point numbers represent what are called real numbers; i.e., those that do have
a fractional part, such as 3.1415927. The advantage to floating-point numbers is that they
can represent a much larger range of values. The disadvantage is that there are numbers
that they cannot represent exactly. awk uses double precision floating-point numbers, which
can hold more digits than single precision floating-point numbers. Floating-point issues are
discussed more fully in Section D.3 [Floating-Point Number Caveats], page 343.
At the very lowest level, computers store values as groups of binary digits, or bits.
Modern computers group bits into groups of eight, called bytes. Advanced applications
sometimes have to manipulate bits directly, and gawk provides functions for doing so.
While you are probably used to the idea of a number without a value (i.e., zero), it takes
a bit more getting used to the idea of zero-length character data. Nevertheless, such a thing
exists. It is called the null string. The null string is character data that has no value. In
other words, it is empty. It is written in awk programs like this: "".
Humans are used to working in decimal; i.e., base 10. In base 10, numbers go from 0 to
9, and then roll over into the next column. (Remember grade school? 42 is 4 times 10
plus 2.)
There are other number bases though. Computers commonly use base 2 or binary, base
8 or octal, and base 16 or hexadecimal. In binary, each column represents two times the
value in the column to its right. Each column may contain either a 0 or a 1. Thus, binary
1010 represents 1 times 8, plus 0 times 4, plus 1 times 2, plus 0 times 1, or decimal 10. Octal
and hexadecimal are discussed more in Section 6.1.1.2 [Octal and Hexadecimal Numbers],
page 89.
Programs are written in programming languages. Hundreds, if not thousands, of programming languages exist. One of the most popular is the C programming language. The
C language had a very strong influence on the design of the awk language.
There have been several versions of C. The first is often referred to as K&R C, after
the initials of Brian Kernighan and Dennis Ritchie, the authors of the first book on C.
(Dennis Ritchie created the language, and Brian Kernighan was one of the creators of awk.)
In the mid-1980s, an effort began to produce an international standard for C. This work
culminated in 1989, with the production of the ANSI standard for C. This standard became
an ISO standard in 1990. In 1999, a revised ISO C standard was approved and released.
Where it makes sense, POSIX awk is compatible with 1999 ISO C.
344
There is a very nice paper on floating-point arithmetic by David Goldberg, What Every Computer Scientist Should Know About Floating-point Arithmetic, ACM Computing
Surveys 23, 1 (1991-03), 5-48. This is worth reading if you are interested in the details, but
it does require a background in computer science.
This makes it clear that the full numeric value is different from what the default string
representations show.
CONVFMTs default value is "%.6g", which yields a value with at least six significant digits.
For some applications, you might want to change it to specify more precision. On most
modern machines, most of the time, 17 digits is enough to capture a floating-point numbers
value exactly.2
Pathological cases can require up to 752 digits (!), but we doubt that you need to worry about this.
346
Allowing completely alphabetic strings to have valid numeric values is also a very severe
departure from historical practice.
The second problem is that the gawk maintainer feels that this interpretation of the
standard, which requires a certain amount of language lawyering to arrive at in the first
place, was not even intended by the standard developers. In other words, we see how you
got where you are, but we dont think that thats where you want to be.
The 2008 POSIX standard added explicit wording to allow, but not require, that awk
support hexadecimal floating point values and special values for Not A Number and
infinity.
Although the gawk maintainer continues to feel that providing those features is inadvisable, nevertheless, on systems that support IEEE floating point, it seems reasonable to
provide some way to support NaN and Infinity values. The solution implemented in gawk
is as follows:
With the --posix command-line option, gawk becomes hands off. String values are
passed directly to the system librarys strtod() function, and if it successfully returns
a numeric value, that is whats used.3 By definition, the results are not portable across
different systems. They are also a little surprising:
$ echo nanny | gawk --posix { print $1 + 0 }
a nan
$ echo 0xDeadBeef | gawk --posix { print $1 + 0 }
a 3735928559
Without --posix, gawk interprets the four strings +inf, -inf, +nan, and -nan
specially, producing the corresponding special numeric values. The leading sign acts
a signal to gawk (and the user) that the value is really numeric. Hexadecimal floating point is not supported (unless you also use --non-decimal-data, which is not
recommended). For example:
$ echo nanny | gawk { print $1 + 0 }
a 0
$ echo +nan | gawk { print $1 + 0 }
a nan
$ echo 0xDeadBeef | gawk { print $1 + 0 }
a 0
gawk does ignore case in the four special values. Thus +nan and +NaN are the same.
Glossary
347
Glossary
Action
The regexp metacharacters ^ and $, which force the match to the beginning
or end of the string, respectively.
ANSI
Array
A grouping of multiple values under the same name. Most languages just provide sequential arrays. awk provides associative arrays.
Assertion
Assignment
An awk expression that changes the value of some awk variable or data object.
An object that you can assign to is called an lvalue. The assigned values are
called rvalues. See Section 6.2.3 [Assignment Expressions], page 98.
Associative Array
Arrays in which the indices may be numbers or strings, not just sequential
integers in a fixed range.
awk Language
The language in which awk programs are written.
awk Program
An awk program consists of a series of patterns and actions, collectively known
as rules. For each input record given to the program, the programs rules are
all processed in turn. awk programs may also contain function definitions.
awk Script Another name for an awk program.
348
Bash
The GNU version of the standard shell (the Bourne-Again SHell). See also
Bourne Shell.
BBS
Bit
Short for Binary Digit. All values in computer memory ultimately reduce
to binary digits: values that are either zero or one. Groups of bits may be
interpreted differentlyas integers, floating-point numbers, character data, addresses of other memory objects, or other data. awk lets you work with floatingpoint numbers and strings. gawk lets you manipulate bit values with the built-in
functions described in Section 9.1.6 [Bit-Manipulation Functions], page 167.
Computers are often defined by how many bits they use to represent integer
values. Typical systems are 32-bit systems, but 64-bit systems are becoming
increasingly popular, and 16-bit systems have essentially disappeared.
Boolean Expression
Named after the English mathematician Boole. See also Logical Expression.
Bourne Shell
The standard shell (/bin/sh) on Unix and Unix-like systems, originally written by Steven R. Bourne. Many shells (Bash, ksh, pdksh, zsh) are generally
upwardly compatible with the Bourne shell.
Built-in Function
The awk language provides built-in functions that perform various numerical,
I/O-related, and string computations. Examples are sqrt() (for the square
root of a number) and substr() (for a substring of a string). gawk provides
functions for timestamp management, bit manipulation, array sorting, type
checking, and runtime string translation. (See Section 9.1 [Built-in Functions],
page 147.)
Built-in Variable
ARGC, ARGV, CONVFMT, ENVIRON, FILENAME, FNR, FS, NF, NR, OFMT, OFS, ORS,
RLENGTH, RSTART, RS, and SUBSEP are the variables that have special meaning
to awk. In addition, ARGIND, BINMODE, ERRNO, FIELDWIDTHS, FPAT, IGNORECASE,
LINT, PROCINFO, RT, and TEXTDOMAIN are the variables that have special meaning to gawk. Changing some of them affects awks running environment. (See
Section 7.5 [Built-in Variables], page 126.)
Braces
The system programming language that most GNU software is written in. The
awk programming language has C-like syntax, and this book points out similarities between awk and C when appropriate.
In general, gawk attempts to be as similar to the 1990 version of ISO C as makes
sense.
C++
Glossary
349
Character Set
The set of numeric codes used by a computer system to represent the characters (letters, numbers, punctuation, etc.) of a particular country or place.
The most common character set in use today is ASCII (American Standard
Code for Information Interchange). Many European countries use an extension
of ASCII known as ISO-8859-1 (ISO Latin-1). The Unicode character set is
becoming increasingly popular and standard, and is particularly widely used
on GNU/Linux systems.
CHEM
Compound Statement
A series of awk statements, enclosed in curly braces. Compound statements
may be nested. (See Section 7.4 [Control Statements in Actions], page 118.)
Concatenation
Concatenating two strings means sticking them together, one after another,
producing a new string. For example, the string foo concatenated with the
string bar gives the string foobar. (See Section 6.2.2 [String Concatenation],
page 96.)
Conditional Expression
An expression using the ?: ternary operator, such as expr1 ? expr2 : expr3.
The expression expr1 is evaluated; if the result is true, the value of the whole
expression is the value of expr2; otherwise the value is expr3. In either case,
only one of expr2 and expr3 is evaluated. (See Section 6.3.4 [Conditional Expressions], page 107.)
Comparison Expression
A relation that is either true or false, such as a < b. Comparison expressions
are used in if, while, do, and for statements, and in patterns to select which
input records to process. (See Section 6.3.2 [Variable Typing and Comparison
Expressions], page 102.)
Curly Braces
The characters { and }. Curly braces are used in awk for delimiting actions,
compound statements, and function bodies.
Dark Corner
An area in the language where specifications often were (or still are) not clear,
leading to unexpected or undesirable behavior. Such areas are marked in this
book with the picture of a flashlight in the margin and are indexed under the
heading dark corner.
350
Data Driven
A description of awk programs, where you specify the data you are interested
in processing, and what to do when that data is seen.
Data Objects
These are numbers and strings of characters. Numbers are converted into strings
and vice versa, as needed. (See Section 6.1.4 [Conversion of Strings and Numbers], page 93.)
Deadlock
The situation in which two communicating processes are each waiting for the
other to perform an action.
Debugger
A program used to help developers remove bugs from (de-bug) their programs.
Double Precision
An internal representation of numbers that can have fractional parts. Double
precision numbers keep track of more digits than do single precision numbers,
but operations on them are sometimes more expensive. This is the way awk
stores numeric values. It is the C type double.
Dynamic Regular Expression
A dynamic regular expression is a regular expression written as an ordinary
expression. It could be a string constant, such as "foo", but it may also be an
expression whose value can vary. (See Section 3.8 [Using Dynamic Regexps],
page 47.)
Environment
A collection of strings, of the form name=val, that each program has available
to it. Users generally place values into the environment in order to provide information to various programs. Typical examples are the environment variables
HOME and PATH.
Empty String
See Null String.
Epoch
The date used as the beginning of time for timestamps. Time values in
most systems are represented as seconds since the epoch, with library functions
available for converting these values into standard date and time formats.
The epoch on Unix and POSIX systems is 1970-01-01 00:00:00 UTC. See also
GMT and UTC.
Escape Sequences
A special sequence of characters used for describing nonprinting characters,
such as \n for newline or \033 for the ASCII ESC (Escape) character. (See
Section 3.2 [Escape Sequences], page 38.)
Extension An additional feature or change to a programming language or utility not defined by that languages or utilitys standard. gawk has (too) many extensions
over POSIX awk.
FDL
Glossary
351
Field
When awk reads an input record, it splits the record into pieces separated by
whitespace (or by a separator regexp that you can change by setting the built-in
variable FS). Such pieces are called fields. If the pieces are of fixed length, you
can use the built-in variable FIELDWIDTHS to describe their lengths. If you wish
to specify the contents of fields instead of the field separator, you can use the
built-in variable FPAT to do so. (See Section 4.5 [Specifying How Fields Are
Separated], page 56, Section 4.6 [Reading Fixed-Width Data], page 61, and
Section 4.7 [Defining Fields By Content], page 63.)
Flag
Floating-Point Number
Often referred to in mathematical terms as a rational or real number, this is
just a number that can have a fractional part. See also Double Precision and
Single Precision.
Format
Format strings are used to control the appearance of output in the strftime()
and sprintf() functions, and are used in the printf statement as well. Also,
data conversions from numbers to strings are controlled by the format strings
contained in the built-in variables CONVFMT and OFMT. (See Section 5.5.2
[Format-Control Letters], page 76.)
A specialized group of statements used to encapsulate general or programspecific tasks. awk has a number of built-in functions, and also allows you
to define your own. (See Chapter 9 [Functions], page 147.)
FSF
Greenwich Mean Time. This is the old term for UTC. It is the time of day
used internally for Unix and POSIX systems. See also Epoch and UTC.
GNU
352
GNU/Linux
A variant of the GNU system using the Linux kernel, instead of the Free Software Foundations Hurd kernel. The Linux kernel is a stable, efficient, fullfeatured clone of Unix that has been ported to a variety of architectures. It is
most popular on PC-class systems, but runs well on a variety of other systems
too. The Linux kernel source code is available under the terms of the GNU
General Public License, which is perhaps its most important aspect.
GPL
Hexadecimal
Base 16 notation, where the digits are 09 and AF, with A representing 10, B
representing 11, and so on, up to F for 15. Hexadecimal numbers are written
in C using a leading 0x, to indicate their base. Thus, 0x12 is 18 (1 times 16
plus 2). See Section 6.1.1.2 [Octal and Hexadecimal Numbers], page 89.
I/O
Abbreviation for Input/Output, the act of moving data into and/or out of a
running program.
Input Record
A single chunk of data that is read in by awk. Usually, an awk input record
consists of one line of text. (See Section 4.1 [How Input Is Split into Records],
page 49.)
Integer
A whole number, i.e., a number that does not have a fractional part.
Internationalization
The process of writing or modifying a program so that it can use multiple
languages without requiring further source code changes.
Interpreter
A program that reads human-readable source code directly, and uses the instructions in it to process data and produce results. awk is typically (but not
always) implemented as an interpreter. See also Compiler.
Interval Expression
A component of a regular expression that lets you specify repeated matches of
some part of the regexp. Interval expressions were not originally available in
awk programs.
ISO
The International Standards Organization. This organization produces international standards for many things, including programming languages, such as
C and C++. In the computer arena, important standards like those for C, C++,
and POSIX become both American national and ISO international standards
simultaneously. This book refers to Standard C as ISO C throughout.
Java
Keyword
In the awk language, a keyword is a word that has special meaning. Keywords
are reserved and may not be used as variable names.
Glossary
353
gawks keywords are: BEGIN, BEGINFILE, END, ENDFILE, break, case, continue,
default delete, do...while, else, exit, for...in, for, function, func, if,
nextfile, next, switch, and while.
Lesser General Public License
This document describes the terms under which binary library archives or
shared objects, and their source code may be distributed.
Linux
See GNU/Linux.
LGPL
Localization
The process of providing the data necessary for an internationalized program
to work in a particular language.
Logical Expression
An expression using the operators for logic, AND, OR, and NOT, written &&,
||, and ! in awk. Often called Boolean expressions, after the mathematician
who pioneered this kind of mathematical logic.
Lvalue
Matching
The act of testing a string against a regular expression. If the regexp describes
the contents of the string, it is said to match it.
Metacharacters
Characters used within a regexp that do not stand for themselves. Instead,
they denote regular expression operations, such as repetition, grouping, or alternation.
No-op
Null String
A string with no characters in it. It is represented explicitly in awk programs
by placing two double quote characters next to each other (""). It can appear
in input data by having two successive occurrences of the field separator appear
next to each other.
Number
A numeric-valued data object. Modern awk implementations use double precision floating-point to represent numbers. Ancient awk implementations used
single precision floating-point.
Octal
Base-eight notation, where the digits are 07. Octal numbers are written in C
using a leading 0, to indicate their base. Thus, 013 is 11 (one times 8 plus 3).
See Section 6.1.1.2 [Octal and Hexadecimal Numbers], page 89.
P1003.1, P1003.2
See POSIX.
Pattern
Patterns tell awk which input records are interesting to which rules.
A pattern is an arbitrary conditional expression against which input is tested.
If the condition is satisfied, the pattern is said to match the input record. A
354
typical pattern might compare the input record against a regular expression.
(See Section 7.1 [Pattern Elements], page 111.)
POSIX
The name for a series of standards that specify a Portable Operating System
interface. The IX denotes the Unix heritage of these standards. The main
standard of interest for awk users is IEEE Standard for Information Technology, Standard 1003.1-2008. The 2008 POSIX standard can be found online at
http://www.opengroup.org/onlinepubs/9699919799/.
Precedence
The order in which operations are performed when operators are used without
explicit parentheses.
Private
Variables and/or functions that are meant for use exclusively by library functions and not for the main awk program. Special care must be taken when
naming such variables and functions. (See Section 12.1 [Naming Library Function Global Variables], page 211.)
Regular Expression
A regular expression (regexp for short) is a pattern that denotes a set of
strings, possibly an infinite set. For example, the regular expression R.*xp
matches any string starting with the letter R and ending with the letters xp.
In awk, regular expressions are used in patterns and in conditional expressions.
Regular expressions may contain escape sequences. (See Chapter 3 [Regular
Expressions], page 37.)
Regular Expression Constant
A regular expression constant is a regular expression written within slashes, such
as /foo/. This regular expression is chosen when you write the awk program
and cannot be changed during its execution. (See Section 3.1 [How to Use
Regular Expressions], page 37.)
Glossary
355
Rule
A segment of an awk program that specifies how to process single input records.
A rule consists of a pattern and an action. awk reads an input record; then, for
each rule, if the input record satisfies the rules pattern, awk executes the rules
action. Otherwise, the rule does nothing for that input record.
Rvalue
A value that can appear on the right side of an assignment operator. In awk,
essentially every expression has a value. These values are rvalues.
Scalar
Search Path
In gawk, a list of directories to search for awk program source files. In the shell,
a list of directories to search for executable programs.
Seed
sed
Shell
The command interpreter for Unix and POSIX-compliant systems. The shell
works both interactively, and as a programming language for batch files, or shell
scripts.
Short-Circuit
The nature of the awk logical operators && and ||. If the value of the entire expression is determinable from evaluating just the lefthand side of these
operators, the righthand side is not evaluated. (See Section 6.3.3 [Boolean
Expressions], page 105.)
Side Effect
A side effect occurs when an expression has an effect aside from merely producing a value. Assignment expressions, increment and decrement expressions,
and function calls have side effects. (See Section 6.2.3 [Assignment Expressions],
page 98.)
Single Precision
An internal representation of numbers that can have fractional parts. Single
precision numbers keep track of fewer digits than do double precision numbers,
but operations on them are sometimes less expensive in terms of CPU time.
This is the type used by some very old versions of awk to store numeric values.
It is the C type float.
Space
Special File
A file name interpreted internally by gawk, instead of being handed directly to
the underlying operating systemfor example, /dev/stderr. (See Section 5.7
[Special File Names in gawk], page 84.)
Stream Editor
A program that reads records from an input stream and processes them one or
more at a time. This is in contrast with batch programs, which may expect to
read their input files in entirety before starting to do anything, as well as with
interactive programs which require input from the user.
356
String
A datum consisting of a sequence of characters, such as I am a string. Constant strings are written with double quotes in the awk language and may
contain escape sequences. (See Section 3.2 [Escape Sequences], page 38.)
Tab
The character generated by hitting the TAB key on the keyboard. It usually
expands to up to eight spaces upon output.
Text Domain
A unique name that identifies an application. Used for grouping messages that
are translated at runtime into the local language.
Timestamp
A value in the seconds since the epoch format used by Unix and POSIX
systems. Used for the gawk functions mktime(), strftime(), and systime().
See also Epoch and UTC.
Unix
UTC
Whitespace
A sequence of space, TAB, or newline characters occurring inside an input
record or a string.
Preamble
The GNU General Public License is a free, copyleft license for software and other kinds of
works.
The licenses for most software and other practical works are designed to take away your
freedom to share and change the works. By contrast, the GNU General Public License is
intended to guarantee your freedom to share and change all versions of a programto make
sure it remains free software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to any other work
released this way by its authors. You can apply it to your programs, too.
When we speak of free software, we are referring to freedom, not price. Our General
Public Licenses are designed to make sure that you have the freedom to distribute copies
of free software (and charge for them if you wish), that you receive source code or can get
it if you want it, that you can change the software or use pieces of it in new free programs,
and that you know you can do these things.
To protect your rights, we need to prevent others from denying you these rights or asking
you to surrender the rights. Therefore, you have certain responsibilities if you distribute
copies of the software, or if you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether gratis or for a fee, you
must pass on to the recipients the same freedoms that you received. You must make sure
that they, too, receive or can get the source code. And you must show them these terms so
they know their rights.
Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy,
distribute and/or modify it.
For the developers and authors protection, the GPL clearly explains that there is no
warranty for this free software. For both users and authors sake, the GPL requires that
modified versions be marked as changed, so that their problems will not be attributed
erroneously to authors of previous versions.
Some devices are designed to deny users access to install or run modified versions of the
software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL
to prohibit the practice for those products. If such problems arise substantially in other
domains, we stand ready to extend this provision to those domains in future versions of the
GPL, as needed to protect the freedom of users.
358
Finally, every program is threatened constantly by software patents. States should not
allow patents to restrict development and use of software on general-purpose computers, but
in those that do, we wish to avoid the special danger that patents applied to a free program
could make it effectively proprietary. To prevent this, the GPL assures that patents cannot
be used to render the program non-free.
The precise terms and conditions for copying, distribution and modification follow.
The System Libraries of an executable work include anything, other than the work as
a whole, that (a) is included in the normal form of packaging a Major Component, but
which is not part of that Major Component, and (b) serves only to enable use of the
work with that Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A Major Component,
in this context, means a major essential component (kernel, window system, and so
on) of the specific operating system (if any) on which the executable work runs, or a
compiler used to produce the work, or an object code interpreter used to run it.
The Corresponding Source for a work in object code form means all the source code
needed to generate, install, and (for an executable work) run the object code and to
modify the work, including scripts to control those activities. However, it does not
include the works System Libraries, or general-purpose tools or generally available
free programs which are used unmodified in performing those activities but which are
not part of the work. For example, Corresponding Source includes interface definition
files associated with source files for the work, and the source code for shared libraries
and dynamically linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those subprograms
and other parts of the work.
The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source.
The Corresponding Source for a work in source code form is that same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of copyright on the
Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output
from running a covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your rights of fair use
or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not convey, without
conditions so long as your license otherwise remains in force. You may convey covered
works to others for the sole purpose of having them make modifications exclusively
for you, or provide you with facilities for running those works, provided that you
comply with the terms of this License in conveying all material for which you do not
control copyright. Those thus making or running the covered works for you must do
so exclusively on your behalf, under your direction and control, on terms that prohibit
them from making any copies of your copyrighted material outside their relationship
with you.
Conveying under any other circumstances is permitted solely under the conditions
stated below. Sublicensing is not allowed; section 10 makes it unnecessary.
3. Protecting Users Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological measure under
any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty
adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention
of such measures.
360
When you convey a covered work, you waive any legal power to forbid circumvention of
technological measures to the extent such circumvention is effected by exercising rights
under this License with respect to the covered work, and you disclaim any intention
to limit operation or modification of the work as a means of enforcing, against the
works users, your or third parties legal rights to forbid circumvention of technological
measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Programs source code as you receive it, in any
medium, provided that you conspicuously and appropriately publish on each copy an
appropriate copyright notice; keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code; keep intact all
notices of the absence of any warranty; and give all recipients a copy of this License
along with the Program.
You may charge any price or no price for each copy that you convey, and you may offer
support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to produce it from
the Program, in the form of source code under the terms of section 4, provided that
you also meet all of these conditions:
a. The work must carry prominent notices stating that you modified it, and giving a
relevant date.
b. The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the
requirement in section 4 to keep intact all notices.
c. You must license the entire work, as a whole, under this License to anyone who
comes into possession of a copy. This License will therefore apply, along with any
applicable section 7 additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no permission to license
the work in any other way, but it does not invalidate such permission if you have
separately received it.
d. If the work has interactive user interfaces, each must display Appropriate Legal
Notices; however, if the Program has interactive interfaces that do not display
Appropriate Legal Notices, your work need not make them do so.
A compilation of a covered work with other separate and independent works, which
are not by their nature extensions of the covered work, and which are not combined
with it such as to form a larger program, in or on a volume of a storage or distribution
medium, is called an aggregate if the compilation and its resulting copyright are
not used to limit the access or legal rights of the compilations users beyond what the
individual works permit. Inclusion of a covered work in an aggregate does not cause
this License to apply to the other parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms of sections 4 and
5, provided that you also convey the machine-readable Corresponding Source under
the terms of this License, in one of these ways:
a. Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a
durable physical medium customarily used for software interchange.
b. Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three
years and valid for as long as you offer spare parts or customer support for that
product model, to give anyone who possesses the object code either (1) a copy of
the Corresponding Source for all the software in the product that is covered by this
License, on a durable physical medium customarily used for software interchange,
for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network
server at no charge.
c. Convey individual copies of the object code with a copy of the written offer to
provide the Corresponding Source. This alternative is allowed only occasionally
and noncommercially, and only if you received the object code with such an offer,
in accord with subsection 6b.
d. Convey the object code by offering access from a designated place (gratis or for
a charge), and offer equivalent access to the Corresponding Source in the same
way through the same place at no further charge. You need not require recipients
to copy the Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source may be on
a different server (operated by you or a third party) that supports equivalent
copying facilities, provided you maintain clear directions next to the object code
saying where to find the Corresponding Source. Regardless of what server hosts
the Corresponding Source, you remain obligated to ensure that it is available for
as long as needed to satisfy these requirements.
e. Convey the object code using peer-to-peer transmission, provided you inform other
peers where the object code and Corresponding Source of the work are being offered
to the general public at no charge under subsection 6d.
A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object
code work.
A User Product is either (1) a consumer product, which means any tangible personal property which is normally used for personal, family, or household purposes, or
(2) anything designed or sold for incorporation into a dwelling. In determining whether
a product is a consumer product, doubtful cases shall be resolved in favor of coverage.
For a particular product received by a particular user, normally used refers to a
typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is
expected to use, the product. A product is a consumer product regardless of whether
the product has substantial commercial, industrial or non-consumer uses, unless such
uses represent the only significant mode of use of the product.
Installation Information for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a
covered work in that User Product from a modified version of its Corresponding Source.
362
The information must suffice to ensure that the continued functioning of the modified
object code is in no case prevented or interfered with solely because modification has
been made.
If you convey an object code work under this section in, or with, or specifically for
use in, a User Product, and the conveying occurs as part of a transaction in which
the right of possession and use of the User Product is transferred to the recipient in
perpetuity or for a fixed term (regardless of how the transaction is characterized),
the Corresponding Source conveyed under this section must be accompanied by the
Installation Information. But this requirement does not apply if neither you nor any
third party retains the ability to install modified object code on the User Product (for
example, the work has been installed in ROM).
The requirement to provide Installation Information does not include a requirement
to continue to provide support service, warranty, or updates for a work that has been
modified or installed by the recipient, or for the User Product in which it has been
modified or installed. Access to a network may be denied when the modification itself
materially and adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided, in accord with
this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password
or key for unpacking, reading or copying.
7. Additional Terms.
Additional permissions are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are
applicable to the entire Program shall be treated as though they were included in this
License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those
permissions, but the entire Program remains governed by this License without regard
to the additional permissions.
When you convey a copy of a covered work, you may at your option remove any
additional permissions from that copy, or from any part of it. (Additional permissions
may be written to require their own removal in certain cases when you modify the
work.) You may place additional permissions on material, added by you to a covered
work, for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you add to a covered
work, you may (if authorized by the copyright holders of that material) supplement
the terms of this License with terms:
a. Disclaiming warranty or limiting liability differently from the terms of sections 15
and 16 of this License; or
b. Requiring preservation of specified reasonable legal notices or author attributions
in that material or in the Appropriate Legal Notices displayed by works containing
it; or
c. Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the
original version; or
d. Limiting the use for publicity purposes of names of licensors or authors of the
material; or
e. Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or
f. Requiring indemnification of licensors and authors of that material by anyone who
conveys the material (or modified versions of it) with contractual assumptions
of liability to the recipient, for any liability that these contractual assumptions
directly impose on those licensors and authors.
All other non-permissive additional terms are considered further restrictions within
the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a
further restriction, you may remove that term. If a license document contains a further
restriction but permits relicensing or conveying under this License, you may add to a
covered work material governed by the terms of that license document, provided that
the further restriction does not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you must place, in the
relevant source files, a statement of the additional terms that apply to those files, or a
notice indicating where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either
way.
8. Termination.
You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will
automatically terminate your rights under this License (including any patent licenses
granted under the third paragraph of section 11).
However, if you cease all violation of this License, then your license from a particular
copyright holder is reinstated (a) provisionally, unless and until the copyright holder
explicitly and finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means prior to 60 days
after the cessation.
Moreover, your license from a particular copyright holder is reinstated permanently if
the copyright holder notifies you of the violation by some reasonable means, this is the
first time you have received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after your receipt of the
notice.
Termination of your rights under this section does not terminate the licenses of parties
who have received copies or rights from you under this License. If your rights have
been terminated and not permanently reinstated, you do not qualify to receive new
licenses for the same material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or run a copy of the
Program. Ancillary propagation of a covered work occurring solely as a consequence of
using peer-to-peer transmission to receive a copy likewise does not require acceptance.
364
However, nothing other than this License grants you permission to propagate or modify
any covered work. These actions infringe copyright if you do not accept this License.
Therefore, by modifying or propagating a covered work, you indicate your acceptance
of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically receives a license
from the original licensors, to run, modify and propagate that work, subject to this
License. You are not responsible for enforcing compliance by third parties with this
License.
An entity transaction is a transaction transferring control of an organization, or
substantially all assets of one, or subdividing an organization, or merging organizations.
If propagation of a covered work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever licenses to the work
the partys predecessor in interest had or could give under the previous paragraph, plus
a right to possession of the Corresponding Source of the work from the predecessor in
interest, if the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the rights granted or
affirmed under this License. For example, you may not impose a license fee, royalty, or
other charge for exercise of rights granted under this License, and you may not initiate
litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent
claim is infringed by making, using, selling, offering for sale, or importing the Program
or any portion of it.
11. Patents.
A contributor is a copyright holder who authorizes use under this License of the
Program or a work on which the Program is based. The work thus licensed is called
the contributors contributor version.
A contributors essential patent claims are all patent claims owned or controlled by
the contributor, whether already acquired or hereafter acquired, that would be infringed
by some manner, permitted by this License, of making, using, or selling its contributor
version, but do not include claims that would be infringed only as a consequence of
further modification of the contributor version. For purposes of this definition, control includes the right to grant patent sublicenses in a manner consistent with the
requirements of this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free patent license
under the contributors essential patent claims, to make, use, sell, offer for sale, import
and otherwise run, modify and propagate the contents of its contributor version.
In the following three paragraphs, a patent license is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission
to practice a patent or covenant not to sue for patent infringement). To grant such
a patent license to a party means to make such an agreement or commitment not to
enforce a patent against the party.
If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under
the terms of this License, through a publicly available network server or other readily
accessible means, then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the patent license for this
particular work, or (3) arrange, in a manner consistent with the requirements of this
License, to extend the patent license to downstream recipients. Knowingly relying
means you have actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipients use of the covered work in a country,
would infringe one or more identifiable patents in that country that you have reason
to believe are valid.
If, pursuant to or in connection with a single transaction or arrangement, you convey,
or propagate by procuring conveyance of, a covered work, and grant a patent license
to some of the parties receiving the covered work authorizing them to use, propagate,
modify or convey a specific copy of the covered work, then the patent license you grant
is automatically extended to all recipients of the covered work and works based on it.
A patent license is discriminatory if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the
rights that are specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is in the business of
distributing software, under which you make payment to the third party based on the
extent of your activity of conveying the work, and under which the third party grants,
to any of the parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work conveyed by you (or
copies made from those copies), or (b) primarily for and in connection with specific
products or compilations that contain the covered work, unless you entered into that
arrangement, or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting any implied license or
other defenses to infringement that may otherwise be available to you under applicable
patent law.
12. No Surrender of Others Freedom.
If conditions are imposed on you (whether by court order, agreement or otherwise) that
contradict the conditions of this License, they do not excuse you from the conditions
of this License. If you cannot convey a covered work so as to satisfy simultaneously
your obligations under this License and any other pertinent obligations, then as a
consequence you may not convey it at all. For example, if you agree to terms that
obligate you to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this License would
be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have permission to link or
combine any covered work with a work licensed under version 3 of the GNU Affero
General Public License into a single combined work, and to convey the resulting work.
The terms of this License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License, section 13,
concerning interaction through a network will apply to the combination as such.
14. Revised Versions of this License.
366
The Free Software Foundation may publish revised and/or new versions of the GNU
General Public License from time to time. Such new versions will be similar in spirit
to the present version, but may differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the Program specifies that
a certain numbered version of the GNU General Public License or any later version
applies to it, you have the option of following the terms and conditions either of that
numbered version or of any later version published by the Free Software Foundation.
If the Program does not specify a version number of the GNU General Public License,
you may choose any version ever published by the Free Software Foundation.
If the Program specifies that a proxy can decide which future versions of the GNU
General Public License can be used, that proxys public statement of acceptance of a
version permanently authorizes you to choose that version for the Program.
Later license versions may give you additional or different permissions. However, no
additional obligations are imposed on any author or copyright holder as a result of your
choosing to follow a later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN
WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE
THE PROGRAM AS IS WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE
OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR
CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO
MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE
LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR
INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO
LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM
TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR
OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided above cannot be given
local legal effect according to their terms, reviewing courts shall apply local law that
most closely approximates an absolute waiver of all civil liability in connection with
the Program, unless a warranty or assumption of liability accompanies a copy of the
Program in return for a fee.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short notice like this when it
starts in an interactive mode:
program Copyright (C) year name of author
This program comes with ABSOLUTELY NO WARRANTY; for details type show w.
This is free software, and you are welcome to redistribute it
under certain conditions; type show c for details.
The hypothetical commands show w and show c should show the appropriate parts of
the General Public License. Of course, your programs commands might be different; for a
GUI interface, you would use an about box.
You should also get your employer (if you work as a programmer) or school, if any, to
sign a copyright disclaimer for the program, if necessary. For more information on this,
and how to apply and follow the GNU GPL, see http://www.gnu.org/licenses/.
The GNU General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may consider it more
useful to permit linking proprietary applications with the library. If this is what you want
to do, use the GNU Lesser General Public License instead of this License. But first, please
read http://www.gnu.org/philosophy/why-not-lgpl.html.
369
370
under this License. If a section does not fit the above definition of Secondary then it is
not allowed to be designated as Invariant. The Document may contain zero Invariant
Sections. If the Document does not identify any Invariant Sections then there are none.
The Cover Texts are certain short passages of text that are listed, as Front-Cover
Texts or Back-Cover Texts, in the notice that says that the Document is released under
this License. A Front-Cover Text may be at most 5 words, and a Back-Cover Text may
be at most 25 words.
A Transparent copy of the Document means a machine-readable copy, represented
in a format whose specification is available to the general public, that is suitable for
revising the document straightforwardly with generic text editors or (for images composed of pixels) generic paint programs or (for drawings) some widely available drawing
editor, and that is suitable for input to text formatters or for automatic translation to
a variety of formats suitable for input to text formatters. A copy made in an otherwise
Transparent file format whose markup, or absence of markup, has been arranged to
thwart or discourage subsequent modification by readers is not Transparent. An image
format is not Transparent if used for any substantial amount of text. A copy that is
not Transparent is called Opaque.
Examples of suitable formats for Transparent copies include plain ascii without
markup, Texinfo input format, LaTEX input format, SGML or XML using a publicly
available DTD, and standard-conforming simple HTML, PostScript or PDF designed
for human modification. Examples of transparent image formats include PNG, XCF
and JPG. Opaque formats include proprietary formats that can be read and edited
only by proprietary word processors, SGML or XML for which the DTD and/or
processing tools are not generally available, and the machine-generated HTML,
PostScript or PDF produced by some word processors for output purposes only.
The Title Page means, for a printed book, the title page itself, plus such following
pages as are needed to hold, legibly, the material this License requires to appear in the
title page. For works in formats which do not have any title page as such, Title Page
means the text near the most prominent appearance of the works title, preceding the
beginning of the body of the text.
The publisher means any person or entity that distributes copies of the Document
to the public.
A section Entitled XYZ means a named subunit of the Document whose title either
is precisely XYZ or contains XYZ in parentheses following text that translates XYZ in
another language. (Here XYZ stands for a specific section name mentioned below, such
as Acknowledgements, Dedications, Endorsements, or History.) To Preserve
the Title of such a section when you modify the Document means that it remains a
section Entitled XYZ according to this definition.
The Document may include Warranty Disclaimers next to the notice which states that
this License applies to the Document. These Warranty Disclaimers are considered to
be included by reference in this License, but only as regards disclaiming warranties:
any other implication that these Warranty Disclaimers may have is void and has no
effect on the meaning of this License.
2. VERBATIM COPYING
371
You may copy and distribute the Document in any medium, either commercially or
noncommercially, provided that this License, the copyright notices, and the license
notice saying this License applies to the Document are reproduced in all copies, and
that you add no other conditions whatsoever to those of this License. You may not use
technical measures to obstruct or control the reading or further copying of the copies
you make or distribute. However, you may accept compensation in exchange for copies.
If you distribute a large enough number of copies you must also follow the conditions
in section 3.
You may also lend copies, under the same conditions stated above, and you may publicly
display copies.
3. COPYING IN QUANTITY
If you publish printed copies (or copies in media that commonly have printed covers) of
the Document, numbering more than 100, and the Documents license notice requires
Cover Texts, you must enclose the copies in covers that carry, clearly and legibly, all
these Cover Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
the back cover. Both covers must also clearly and legibly identify you as the publisher
of these copies. The front cover must present the full title with all words of the title
equally prominent and visible. You may add other material on the covers in addition.
Copying with changes limited to the covers, as long as they preserve the title of the
Document and satisfy these conditions, can be treated as verbatim copying in other
respects.
If the required texts for either cover are too voluminous to fit legibly, you should put
the first ones listed (as many as fit reasonably) on the actual cover, and continue the
rest onto adjacent pages.
If you publish or distribute Opaque copies of the Document numbering more than 100,
you must either include a machine-readable Transparent copy along with each Opaque
copy, or state in or with each Opaque copy a computer-network location from which
the general network-using public has access to download using public-standard network
protocols a complete Transparent copy of the Document, free of added material. If
you use the latter option, you must take reasonably prudent steps, when you begin
distribution of Opaque copies in quantity, to ensure that this Transparent copy will
remain thus accessible at the stated location until at least one year after the last time
you distribute an Opaque copy (directly or through your agents or retailers) of that
edition to the public.
It is requested, but not required, that you contact the authors of the Document well
before redistributing any large number of copies, to give them a chance to provide you
with an updated version of the Document.
4. MODIFICATIONS
You may copy and distribute a Modified Version of the Document under the conditions
of sections 2 and 3 above, provided that you release the Modified Version under precisely
this License, with the Modified Version filling the role of the Document, thus licensing
distribution and modification of the Modified Version to whoever possesses a copy of
it. In addition, you must do these things in the Modified Version:
A. Use in the Title Page (and on the covers, if any) a title distinct from that of the
Document, and from those of previous versions (which should, if there were any,
372
be listed in the History section of the Document). You may use the same title as
a previous version if the original publisher of that version gives permission.
B. List on the Title Page, as authors, one or more persons or entities responsible for
authorship of the modifications in the Modified Version, together with at least five
of the principal authors of the Document (all of its principal authors, if it has fewer
than five), unless they release you from this requirement.
C. State on the Title page the name of the publisher of the Modified Version, as the
publisher.
D. Preserve all the copyright notices of the Document.
E. Add an appropriate copyright notice for your modifications adjacent to the other
copyright notices.
F. Include, immediately after the copyright notices, a license notice giving the public
permission to use the Modified Version under the terms of this License, in the form
shown in the Addendum below.
G. Preserve in that license notice the full lists of Invariant Sections and required Cover
Texts given in the Documents license notice.
H. Include an unaltered copy of this License.
I. Preserve the section Entitled History, Preserve its Title, and add to it an item
stating at least the title, year, new authors, and publisher of the Modified Version
as given on the Title Page. If there is no section Entitled History in the Document, create one stating the title, year, authors, and publisher of the Document
as given on its Title Page, then add an item describing the Modified Version as
stated in the previous sentence.
J. Preserve the network location, if any, given in the Document for public access to
a Transparent copy of the Document, and likewise the network locations given in
the Document for previous versions it was based on. These may be placed in the
History section. You may omit a network location for a work that was published
at least four years before the Document itself, or if the original publisher of the
version it refers to gives permission.
K. For any section Entitled Acknowledgements or Dedications, Preserve the Title
of the section, and preserve in the section all the substance and tone of each of the
contributor acknowledgements and/or dedications given therein.
L. Preserve all the Invariant Sections of the Document, unaltered in their text and
in their titles. Section numbers or the equivalent are not considered part of the
section titles.
M. Delete any section Entitled Endorsements. Such a section may not be included
in the Modified Version.
N. Do not retitle any existing section to be Entitled Endorsements or to conflict in
title with any Invariant Section.
O. Preserve any Warranty Disclaimers.
If the Modified Version includes new front-matter sections or appendices that qualify
as Secondary Sections and contain no material copied from the Document, you may at
your option designate some or all of these sections as invariant. To do this, add their
373
titles to the list of Invariant Sections in the Modified Versions license notice. These
titles must be distinct from any other section titles.
You may add a section Entitled Endorsements, provided it contains nothing but
endorsements of your Modified Version by various partiesfor example, statements of
peer review or that the text has been approved by an organization as the authoritative
definition of a standard.
You may add a passage of up to five words as a Front-Cover Text, and a passage of up
to 25 words as a Back-Cover Text, to the end of the list of Cover Texts in the Modified
Version. Only one passage of Front-Cover Text and one of Back-Cover Text may be
added by (or through arrangements made by) any one entity. If the Document already
includes a cover text for the same cover, previously added by you or by arrangement
made by the same entity you are acting on behalf of, you may not add another; but
you may replace the old one, on explicit permission from the previous publisher that
added the old one.
The author(s) and publisher(s) of the Document do not by this License give permission
to use their names for publicity for or to assert or imply endorsement of any Modified
Version.
5. COMBINING DOCUMENTS
You may combine the Document with other documents released under this License,
under the terms defined in section 4 above for modified versions, provided that you
include in the combination all of the Invariant Sections of all of the original documents,
unmodified, and list them all as Invariant Sections of your combined work in its license
notice, and that you preserve all their Warranty Disclaimers.
The combined work need only contain one copy of this License, and multiple identical
Invariant Sections may be replaced with a single copy. If there are multiple Invariant
Sections with the same name but different contents, make the title of each such section
unique by adding at the end of it, in parentheses, the name of the original author or
publisher of that section if known, or else a unique number. Make the same adjustment
to the section titles in the list of Invariant Sections in the license notice of the combined
work.
In the combination, you must combine any sections Entitled History in the various original documents, forming one section Entitled History; likewise combine any
sections Entitled Acknowledgements, and any sections Entitled Dedications. You
must delete all sections Entitled Endorsements.
6. COLLECTIONS OF DOCUMENTS
You may make a collection consisting of the Document and other documents released
under this License, and replace the individual copies of this License in the various
documents with a single copy that is included in the collection, provided that you
follow the rules of this License for verbatim copying of each of the documents in all
other respects.
You may extract a single document from such a collection, and distribute it individually under this License, provided you insert a copy of this License into the extracted
document, and follow this License in all other respects regarding verbatim copying of
that document.
374
375
If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts, replace the
with. . . Texts. line with this:
376
If you have Invariant Sections without Cover Texts, or some other combination of the
three, merge those two alternatives to suit the situation.
If your document contains nontrivial examples of program code, we recommend releasing
these examples in parallel under your choice of free software license, such as the GNU
General Public License, to permit their use in free software.
Index 377
Index
!
! (exclamation point), ! operator . . . 106, 109, 113,
249
! (exclamation point), != operator . . . . . . . 103, 110
! (exclamation point), !~ operator . . 37, 45, 47, 90,
103, 105, 110, 112
160
109
110
110
+
"
" (double quote) . . . . . . . . . . . . . . . . . . . . . . . . . . . 12, 15
" (double quote), regexp constants . . . . . . . . . . . . . 47
#
# (number sign), #! (executable scripts) . . . . . . . . 13
# (number sign), #! (executable scripts),
portability issues with . . . . . . . . . . . . . . . . . . . . . 13
# (number sign), commenting . . . . . . . . . . . . . . . . . . 14
$
$ (dollar sign) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
$ (dollar sign), $ field operator . . . . . . . . . . . . 52, 109
$ (dollar sign), incrementing fields and arrays
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
%
% (percent sign), % operator . . . . . . . . . . . . . . . . . . . 109
% (percent sign), %= operator . . . . . . . . . . . . . . 99, 110
&
& (ampersand), && operator . . . . . . . . . . . . . . 106, 110
& (ampersand), gsub()/gensub()/sub() functions
and . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158
(
() (parentheses) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
() (parentheses), pgawk program . . . . . . . . . . . . . . 209
*
* (asterisk), * operator, as multiplication operator
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109
* (asterisk), * operator, as regexp operator . . . . . 41
+ (plus sign) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
+ (plus sign), + operator . . . . . . . . . . . . . . . . . 109, 110
+ (plus sign), ++ (decrement/increment operators)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100
+ (plus sign), ++ operator . . . . . . . . . . . . . . . . 101, 109
+ (plus sign), += operator . . . . . . . . . . . . . . . . . 99, 110
,
, (comma), in range patterns . . . . . . . . . . . . . . . . . 113
378
.
. (period) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
.mo files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 186
.mo files, converting from .po . . . . . . . . . . . . . . . . . 192
.mo files, specifying directory of . . . . . . . . . . 186, 187
.po files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 185, 189
.po files, converting to .mo . . . . . . . . . . . . . . . . . . . 192
.pot files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 185
;
; (semicolon) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
; (semicolon), AWKPATH variable and. . . . . . . . . . . 317
; (semicolon), separating statements in actions
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117, 118
<
< (left angle bracket), < operator . . . . . . . . . 103, 110
< (left angle bracket), < operator (I/O) . . . . . . . . . 69
< (left angle bracket), <= operator . . . . . . . . 103, 110
=
= (equals sign), = operator . . . . . . . . . . . . . . . . . . . . . 98
= (equals sign), == operator . . . . . . . . . . . . . . 103, 110
>
>
>
>
>
?
? (question mark) regexp operator . . . . . . . . . 41, 44
? (question mark), ?: operator. . . . . . . . . . . . . . . . 110
[
[] (square brackets) . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
^
^ (caret) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40, 44
^ (caret), ^ operator . . . . . . . . . . . . . . . . . . . . . . . . . . 109
^ (caret), ^= operator . . . . . . . . . . . . . . . . . . . . . 99, 110
^ (caret), in bracket expressions . . . . . . . . . . . . . . . . 42
^, in FS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
/
(forward slash) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
(forward slash), / operator . . . . . . . . . . . . . . . . . . 109
(forward slash), /= operator . . . . . . . . . . . . . 99, 110
(forward slash), /= operator, vs. /=.../ regexp
constant . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100
/ (forward slash), patterns and . . . . . . . . . . . . . . . 112
/= operator vs. /=.../ regexp constant . . . . . . . 100
/dev/... special files (gawk) . . . . . . . . . . . . . . . . . . . 84
/dev/fd/N special files . . . . . . . . . . . . . . . . . . . . . . . . . 84
/inet/... special files (gawk) . . . . . . . . . . . . . . . . . 205
/
/
/
/
_ (underscore), _ C macro . . . . . . . . . . . . . . . . . . . .
_ (underscore), in names of private variables . .
_ (underscore), translatable string . . . . . . . . . . . .
_gr_init() user-defined function . . . . . . . . . . . . .
_pw_init() user-defined function . . . . . . . . . . . . .
186
212
188
236
232
\
\ (backslash) . . . . . . . . . . . . . . . . . . . . . . . 12, 14, 15, 40
\ (backslash), \" escape sequence . . . . . . . . . . . . . . 39
Index 379
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
\
|
| (vertical bar) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
| (vertical bar), | operator (I/O) . . . . . . 70, 82, 110
| (vertical bar), |& operator (I/O) . . . . 71, 83, 110,
204
| (vertical bar), |& operator (I/O), pipes, closing
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87
| (vertical bar), || operator. . . . . . . . . . . . . . 106, 110
{} (braces), actions and . . . . . . . . . . . . . . . . . . . . . . 117
{} (braces), pgawk program . . . . . . . . . . . . . . . . . . . 209
{} (braces), statements, grouping . . . . . . . . . . . . . 118
~
~ (tilde), ~ operator . . 37, 45, 47, 90, 103, 105, 110,
112
A
accessing fields . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
account information . . . . . . . . . . . . . . . . . . . . . 230, 234
actions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117
actions, control statements in . . . . . . . . . . . . . . . . . 118
actions, default . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
actions, empty . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
Ada programming language . . . . . . . . . . . . . . . . . . . 347
adding, features to gawk . . . . . . . . . . . . . . . . . . . . . . 326
adding, fields . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
adding, functions to gawk . . . . . . . . . . . . . . . . . . . . . 328
advanced features, buffering . . . . . . . . . . . . . . . . . . 162
advanced features, close() function . . . . . . . . . . . 87
advanced features, constants, values of . . . . . . . . . 90
advanced features, data files as single record . . . 52
advanced features, fixed-width data . . . . . . . . . . . . 61
advanced features, FNR/NR variables . . . . . . . . . . . 132
advanced features, gawk . . . . . . . . . . . . . . . . . . . . . . 195
advanced features, gawk, network programming
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 205
advanced features, gawk, nondecimal input data
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 195
advanced features, gawk, processes, communicating
with . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 203
advanced features, network connections, See Also
networks, connections . . . . . . . . . . . . . . . . . . . . 195
advanced features, null strings, matching . . . . . . 160
advanced features, operators, precedence . . . . . . 101
advanced features, piping into sh . . . . . . . . . . . . . . 83
advanced features, regexp constants . . . . . . . . . . . 100
advanced features, specifying field content . . . . . . 63
Aho, Alfred . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4, 307
alarm clock example program . . . . . . . . . . . . . . . . . 262
alarm.awk program . . . . . . . . . . . . . . . . . . . . . . . . . . . 263
algorithms. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 342
Alpha (DEC) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
amazing awk assembler (aaa) . . . . . . . . . . . . . . . . . 347
amazingly workable formatter (awf) . . . . . . . . . . . 347
ambiguity, syntactic: /= operator vs. /=.../ regexp
constant . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100
ampersand (&), && operator . . . . . . . . . . . . . . 106, 110
ampersand (&), gsub()/gensub()/sub() functions
and . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158
anagram.awk program . . . . . . . . . . . . . . . . . . . . . . . . 283
AND bitwise operation . . . . . . . . . . . . . . . . . . . . . . . 167
and Boolean-logic operator . . . . . . . . . . . . . . . . . . . 105
and() function (gawk) . . . . . . . . . . . . . . . . . . . . . . . . 168
ANSI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 347
archeologists . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 320
ARGC/ARGV variables. . . . . . . . . . . . . . . . . . . . . . 129, 133
ARGC/ARGV variables, command-line arguments
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
ARGC/ARGV variables, portability and . . . . . . . . . . . 14
ARGIND variable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 130
ARGIND variable, command-line arguments . . . . . . 30
arguments, command-line . . . . . . . . . . . . 30, 129, 133
arguments, command-line, invoking awk . . . . . . . . 25
arguments, in function calls . . . . . . . . . . . . . . . . . . . 108
arguments, processing . . . . . . . . . . . . . . . . . . . . . . . . 225
arguments, retrieving . . . . . . . . . . . . . . . . . . . . . . . . . 331
arithmetic operators . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
arrays . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135
arrays, as parameters to functions . . . . . . . . . . . . 176
arrays, associative . . . . . . . . . . . . . . . . . . . . . . . . . . . . 136
380
B
b debugger command (alias for break) . . . . . . . . 290
backslash (\) . . . . . . . . . . . . . . . . . . . . . . . 12, 14, 15, 40
backslash (\), \" escape sequence . . . . . . . . . . . . . . 39
backslash (\), \ operator (gawk) . . . . . . . . . . . . . . 44
backslash (\), \/ escape sequence . . . . . . . . . . . . . . 39
backslash (\), \< operator (gawk) . . . . . . . . . . . . . . 44
backslash (\), \> operator (gawk) . . . . . . . . . . . . . . 44
backslash (\), \ operator (gawk) . . . . . . . . . . . . . . 44
backslash (\), \a escape sequence . . . . . . . . . . . . . . 38
backslash (\), \b escape sequence . . . . . . . . . . . . . . 38
backslash (\), \B operator (gawk) . . . . . . . . . . . . . . 44
backslash (\), \f escape sequence . . . . . . . . . . . . . . 38
backslash (\), \n escape sequence . . . . . . . . . . . . . . 38
backslash (\), \nnn escape sequence . . . . . . . . . . . 38
backslash (\), \r escape sequence . . . . . . . . . . . . . . 38
backslash (\), \s operator (gawk) . . . . . . . . . . . . . . 44
backslash (\), \S operator (gawk) . . . . . . . . . . . . . . 44
Index 381
C
call by reference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 176
call by value . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 175
caret (^) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40, 44
caret (^), ^ operator . . . . . . . . . . . . . . . . . . . . . . . . . . 109
caret (^), ^= operator . . . . . . . . . . . . . . . . . . . . . 99, 110
caret (^), in bracket expressions . . . . . . . . . . . . . . . . 42
case keyword . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121
case sensitivity, array indices and . . . . . . . . . . . . . 136
case sensitivity, converting case . . . . . . . . . . . . . . . 158
case sensitivity, example programs . . . . . . . . . . . . 211
case sensitivity, gawk. . . . . . . . . . . . . . . . . . . . . . . . . . . 45
case sensitivity, regexps and . . . . . . . . . . . . . . . 45, 128
case sensitivity, string comparisons and . . . . . . . 128
CGI, awk scripts for . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
character lists, See bracket expressions . . . . . . . . . 40
character sets (machine character encodings)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217, 348
character sets, See Also bracket expressions . . . . 40
characters, counting . . . . . . . . . . . . . . . . . . . . . . . . . . 259
characters, transliterating. . . . . . . . . . . . . . . . . . . . . 265
382
D
d debugger command (alias for delete) . . . . . . . 291
d.c., See dark corner . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
dark corner . . . . . . . . . . . . . . . . . . . . . . . 7, 100, 102, 349
dark corner, ^, in FS . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
dark corner, array subscripts. . . . . . . . . . . . . . . . . . 142
dark corner, break statement . . . . . . . . . . . . . . . . . 123
dark corner, close() function . . . . . . . . . . . . . . . . . 87
dark corner, command-line arguments . . . . . . . . . . 93
dark corner, continue statement . . . . . . . . . . . . . . 124
dark corner, CONVFMT variable . . . . . . . . . . . . . . . . . . 94
dark corner, escape sequences . . . . . . . . . . . . . . . . . . 31
Index 383
384
documentation, online . . . . . . . . . . . . . . . . . . . . . . . . . . 7
documents, searching . . . . . . . . . . . . . . . . . . . . . . . . . 262
dollar sign ($) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
dollar sign ($), $ field operator . . . . . . . . . . . . 52, 109
dollar sign ($), incrementing fields and arrays
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
double precision floating-point . . . . . . . . . . . . . . . . 343
double quote (") . . . . . . . . . . . . . . . . . . . . . . . . . . . 12, 15
double quote ("), regexp constants . . . . . . . . . . . . . 47
down debugger command . . . . . . . . . . . . . . . . . . . . . 295
Drepper, Ulrich . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
DuBois, John . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
dump debugger command . . . . . . . . . . . . . . . . . . . . . 296
dupnode() internal function . . . . . . . . . . . . . . . . . . 330
dupword.awk program . . . . . . . . . . . . . . . . . . . . . . . . 262
E
e debugger command (alias for enable) . . . . . . . 291
EBCDIC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217
egrep utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42, 246
egrep.awk program . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
elements in arrays . . . . . . . . . . . . . . . . . . . . . . . . . . . . 136
elements in arrays, assigning . . . . . . . . . . . . . . . . . . 137
elements in arrays, deleting . . . . . . . . . . . . . . . . . . . 139
elements in arrays, order of . . . . . . . . . . . . . . . . . . . 139
elements in arrays, scanning . . . . . . . . . . . . . . . . . . 138
email address for bug reports, [email protected]
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 320
EMISTERED . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 205
empty pattern . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116
empty strings, See null strings . . . . . . . . . . . . . . . . . 58
enable debugger command . . . . . . . . . . . . . . . . . . . 291
end debugger command . . . . . . . . . . . . . . . . . . . . . . . 292
END pattern . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114
END pattern, assert() user-defined function and
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215
END pattern, backslash continuation and . . . . . . 250
END pattern, Boolean patterns and . . . . . . . . . . . . 113
END pattern, exit statement and . . . . . . . . . . . . . . 126
END pattern, next/nextfile statements and . . 115,
125
END pattern, operators and. . . . . . . . . . . . . . . . . . . . 114
END pattern, pgawk program . . . . . . . . . . . . . . . . . . 207
END pattern, print statement and. . . . . . . . . . . . . 115
ENDFILE pattern . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115
ENDFILE pattern, Boolean patterns and . . . . . . . 113
endfile() user-defined function . . . . . . . . . . . . . . 222
endgrent() function (C library) . . . . . . . . . . . . . . 238
endgrent() user-defined function . . . . . . . . . . . . . 238
endpwent() function (C library) . . . . . . . . . . . . . . 234
endpwent() user-defined function . . . . . . . . . . . . . 234
ENVIRON array . . . . . . . . . . . . . . . . . . . . . . . . . . . 130, 331
environment variables . . . . . . . . . . . . . . . . . . . . . . . . 130
epoch, definition of . . . . . . . . . . . . . . . . . . . . . . . . . . . 350
equals sign (=), = operator . . . . . . . . . . . . . . . . . . . . . 98
equals sign (=), == operator . . . . . . . . . . . . . . 103, 110
EREs (Extended Regular Expressions) . . . . . . . . . 42
Index 385
F
f debugger command (alias for frame) . . . . . . . . 295
false, logical . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
386
files,
files,
files,
files,
files,
G
G-d . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
Garfinkle, Scott . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
gawk, ARGIND variable in . . . . . . . . . . . . . . . . . . . . . . . 30
gawk, awk and . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3, 5
gawk, bitwise operations in. . . . . . . . . . . . . . . . . . . . 168
gawk, break statement in . . . . . . . . . . . . . . . . . . . . . 123
gawk, built-in variables and . . . . . . . . . . . . . . . . . . . 126
gawk, character classes and . . . . . . . . . . . . . . . . . . . . 44
gawk, coding style in . . . . . . . . . . . . . . . . . . . . . . . . . . 326
gawk, command-line options . . . . . . . . . . . . . . . . . . . 45
gawk, comparison operators and . . . . . . . . . . . . . . 104
gawk, configuring . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 314
gawk, configuring, options. . . . . . . . . . . . . . . . . . . . . 313
Index 387
388
H
h debugger command (alias for help) . . . . . . . . . 297
Hankerson, Darrel . . . . . . . . . . . . . . . . . . . . . . . . . 9, 308
Haque, John . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9, 308
Hartholz, Elaine . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
Hartholz, Marshall . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
Hasegawa, Isamu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
help debugger command . . . . . . . . . . . . . . . . . . . . . 297
hexadecimal numbers . . . . . . . . . . . . . . . . . . . . . . . . . . 89
hexadecimal values, enabling interpretation of . . 28
histsort.awk program . . . . . . . . . . . . . . . . . . . . . . . 271
Hughes, Phil . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
HUP signal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 210
hyphen (-), - operator . . . . . . . . . . . . . . . . . . . 109, 110
hyphen (-), -- (decrement/increment) operators
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109
hyphen (-), -- operator . . . . . . . . . . . . . . . . . . . . . . 101
hyphen (-), -= operator . . . . . . . . . . . . . . . . . . . 99, 110
hyphen (-), filenames beginning with . . . . . . . . . . 26
hyphen (-), in bracket expressions . . . . . . . . . . . . . 42
I
i debugger command (alias for info) . . . . . . . . . 295
id utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 250
id.awk program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 250
if statement. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37, 118
if statement, actions, changing . . . . . . . . . . . . . . . 113
igawk.sh program . . . . . . . . . . . . . . . . . . . . . . . . . . . . 278
ignore debugger command . . . . . . . . . . . . . . . . . . . 291
IGNORECASE variable . . . . . . . . 45, 128, 136, 149, 203
IGNORECASE variable, array sorting and . . . . . . . . 203
IGNORECASE variable, array subscripts and. . . . . 136
IGNORECASE variable, in example programs . . . . 211
implementation issues, gawk . . . . . . . . . . . . . . . . . . 325
implementation issues, gawk, limits . . . . . . . . . 72, 83
implementation issues, gawk, debugging . . . . . . . 325
in operator . . . . . . . . . . . . . . . . . . . . 103, 110, 121, 252
in operator, arrays and . . . . . . . . . . . . . . . . . . 137, 138
increment operators . . . . . . . . . . . . . . . . . . . . . . . . . . 100
index() function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152
indexing arrays . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 136
indirect function calls . . . . . . . . . . . . . . . . . . . . . . . . . 178
info debugger command . . . . . . . . . . . . . . . . . . . . . 295
initialization, automatic . . . . . . . . . . . . . . . . . . . . . . . 20
input files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
input files, closing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86
input files, counting elements in. . . . . . . . . . . . . . . 259
input files, examples . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
input files, reading . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
input files, running awk without . . . . . . . . . . . . . . . . 12
input files, variable assignments and . . . . . . . . . . . 31
input pipeline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
input redirection. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69
input, data, nondecimal . . . . . . . . . . . . . . . . . . . . . . 195
input, explicit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
input, files, See input files. . . . . . . . . . . . . . . . . . . . . . 64
input, multiline records . . . . . . . . . . . . . . . . . . . . . . . . 64
input, splitting into records . . . . . . . . . . . . . . . . . . . . 49
input, standard . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12, 84
input/output, binary . . . . . . . . . . . . . . . . . . . . . . . . . 127
input/output, from BEGIN and END . . . . . . . . . . . . 115
input/output, two-way . . . . . . . . . . . . . . . . . . . . . . . 204
insomnia, cure for . . . . . . . . . . . . . . . . . . . . . . . . . . . . 262
installation, VMS. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 318
installing gawk. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 309
INT signal (MS-Windows). . . . . . . . . . . . . . . . . . . . . 210
int() function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 148
integers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 342
integers, unsigned . . . . . . . . . . . . . . . . . . . . . . . . . . . . 343
interacting with other programs . . . . . . . . . . . . . . 161
internal constant, INVALID_HANDLE . . . . . . . . . . . . 331
internal function, assoc_clear() . . . . . . . . . . . . . 330
internal function, assoc_lookup() . . . . . . . . . . . . 330
internal function, dupnode() . . . . . . . . . . . . . . . . . . 330
internal function, force_number() . . . . . . . . . . . . 329
internal function, force_string() . . . . . . . . . . . . 329
internal function, force_wstring() . . . . . . . . . . . 329
internal function, get_actual_argument() . . . . 331
internal function, get_argument() . . . . . . . . . . . . 331
internal function, get_curfunc_arg_count() . . 329
internal function, iop_alloc(). . . . . . . . . . . . . . . . 331
internal function, make_builtin() . . . . . . . . . . . . 330
internal function, make_number() . . . . . . . . . . . . . 330
internal function, make_string() . . . . . . . . . . . . . 330
internal function, register_deferred_variable()
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331
internal function, register_open_hook() . . . . . 331
internal function, unref() . . . . . . . . . . . . . . . . . . . . 330
internal function, update_ERRNO() . . . . . . . . . . . . 331
internal function, update_ERRNO_saved() . . . . . 331
internal macro, get_array_argument() . . . . . . . 331
internal macro, get_scalar_argument() . . . . . . 331
internal structure, IOBUF . . . . . . . . . . . . . . . . . . . . . . 331
internal type, AWKNUM . . . . . . . . . . . . . . . . . . . . . . . . . 329
internal type, NODE . . . . . . . . . . . . . . . . . . . . . . . . . . . 329
internal variable, nargs . . . . . . . . . . . . . . . . . . . . . . . 329
internal variable, stlen . . . . . . . . . . . . . . . . . . . . . . . 330
internal variable, stptr . . . . . . . . . . . . . . . . . . . . . . . 330
internal variable, type . . . . . . . . . . . . . . . . . . . . . . . . 330
internal variable, vname . . . . . . . . . . . . . . . . . . . . . . . 330
internal variable, wstlen . . . . . . . . . . . . . . . . . . . . . . 330
internal variable, wstptr . . . . . . . . . . . . . . . . . . . . . . 330
internationalization . . . . . . . . . . . . . . . . . . . . . . 170, 185
internationalization, localization . . . . . . . . . 129, 185
internationalization, localization, character classes
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
internationalization, localization, gawk and . . . . 185
internationalization, localization, locale categories
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 186
internationalization, localization, marked strings
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187
Index 389
J
Jacobs, Andrew . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 232
Jaegermann, Michal . . . . . . . . . . . . . . . . . . . . . . . . 9, 308
Java implementation of awk . . . . . . . . . . . . . . . . . . . 323
Java programming language . . . . . . . . . . . . . . . . . . 352
jawk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 323
Jedi knights . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
join() user-defined function . . . . . . . . . . . . . . . . . . 219
K
Kahrs, J
urgen . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9, 308
Kasal, Stepan. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
Kenobi, Obi-Wan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
Kernighan, Brian . . 4, 7, 10, 96, 303, 307, 321, 343
kill command, dynamic profiling. . . . . . . . . . . . . 209
Knights, jedi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
Kwok, Conrad . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
L
l debugger command (alias for list) . . . . . . . . . 298
labels.awk program . . . . . . . . . . . . . . . . . . . . . . . . . 268
languages, data-driven . . . . . . . . . . . . . . . . . . . . . . . . 342
LC_ALL locale category . . . . . . . . . . . . . . . . . . . . . . . . 187
LC_COLLATE locale category . . . . . . . . . . . . . . . . . . . 186
LC_CTYPE locale category . . . . . . . . . . . . . . . . . . . . . 186
LC_MESSAGES locale category . . . . . . . . . . . . . . . . . . 186
LC_MESSAGES locale category, bindtextdomain()
function (gawk) . . . . . . . . . . . . . . . . . . . . . . . . . . 188
LC_MONETARY locale category . . . . . . . . . . . . . . . . . . 186
LC_NUMERIC locale category . . . . . . . . . . . . . . . . . . . 187
LC_RESPONSE locale category . . . . . . . . . . . . . . . . . . 187
LC_TIME locale category . . . . . . . . . . . . . . . . . . . . . . 187
left angle bracket (<), < operator . . . . . . . . . 103, 110
left angle bracket (<), < operator (I/O) . . . . . . . . . 69
left angle bracket (<), <= operator . . . . . . . . 103, 110
left shift, bitwise . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 168
leftmost longest match . . . . . . . . . . . . . . . . . . . . . . . . . 65
length() function . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152
Lesser General Public License (LGPL) . . . . . . . . 353
LGPL (Lesser General Public License) . . . . . . . . 353
libmawk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 323
390
M
mailing labels, printing . . . . . . . . . . . . . . . . . . . . . . . 267
mailing list, GNITS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
make_builtin() internal function . . . . . . . . . . . . . 330
make_number() internal function . . . . . . . . . . . . . . 330
make_string() internal function . . . . . . . . . . . . . . 330
mark parity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217
marked string extraction (internationalization)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189
marked strings, extracting . . . . . . . . . . . . . . . . . . . . 189
Marx, Groucho . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
match() function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152
match() function, RSTART/RLENGTH variables . . 153
matching, expressions, See comparison expressions
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102
matching, leftmost longest . . . . . . . . . . . . . . . . . . . . . 65
matching, null strings. . . . . . . . . . . . . . . . . . . . . . . . . 160
mawk program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 322
McPhee, Patrick . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
memory, releasing . . . . . . . . . . . . . . . . . . . . . . . . . . . . 330
message object files . . . . . . . . . . . . . . . . . . . . . . . . . . . 186
message object files, converting from portable
object files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192
message object files, specifying directory of . . . 186,
187
metacharacters, escape sequences for . . . . . . . . . . . 40
mktime() function (gawk) . . . . . . . . . . . . . . . . . . . . . 163
modifiers, in format specifiers . . . . . . . . . . . . . . . . . . 78
monetary information, localization . . . . . . . . . . . . 186
msgfmt utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192
N
n debugger command (alias for next) . . . . . . . . . 292
names, arrays/variables . . . . . . . . . . . . . . . . . . 135, 211
names, functions . . . . . . . . . . . . . . . . . . . . . . . . . 171, 211
namespace issues . . . . . . . . . . . . . . . . . . . . . . . . 135, 211
namespace issues, functions . . . . . . . . . . . . . . . . . . . 171
nargs internal variable . . . . . . . . . . . . . . . . . . . . . . . 329
nawk utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
negative zero . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 345
NetBSD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 356
networks, programming . . . . . . . . . . . . . . . . . . . . . . . 205
networks, support for . . . . . . . . . . . . . . . . . . . . . . . . . . 85
newlines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21, 29, 106
newlines, as field separators . . . . . . . . . . . . . . . . . . . . 57
newlines, as record separators . . . . . . . . . . . . . . . . . . 49
newlines, in dynamic regexps . . . . . . . . . . . . . . . . . . 47
newlines, in regexp constants . . . . . . . . . . . . . . . . . . 47
newlines, printing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
O
o debugger command (alias for option) . . . . . . . 296
oawk utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
obsolete features . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
octal numbers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89
Index 391
P
p debugger command (alias for print) . . . . . . . . 293
P1003.1 POSIX standard . . . . . . . . . . . . . . . . . . . . . 353
P1003.2 POSIX standard . . . . . . . . . . . . . . . . . . . . . 353
parameters, number of . . . . . . . . . . . . . . . . . . . . . . . . 329
parentheses () . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
parentheses (), pgawk program . . . . . . . . . . . . . . . 209
password file . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 230
patsplit() function . . . . . . . . . . . . . . . . . . . . . . . . . . 154
patterns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
patterns, comparison expressions as . . . . . . . . . . . 112
patterns, counts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 208
patterns, default . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
patterns, empty . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116
patterns, expressions as . . . . . . . . . . . . . . . . . . . . . . . 111
patterns, ranges in. . . . . . . . . . . . . . . . . . . . . . . . . . . . 113
patterns, regexp constants as . . . . . . . . . . . . . . . . . 112
patterns, types of . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
pawk (profiling version of Brian Kernighans awk)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 322
PC operating systems, gawk on . . . . . . . . . . . . . . . 317
PC operating systems, gawk on, installing . . . . . 314
percent sign (%), % operator . . . . . . . . . . . . . . . . . . . 109
percent sign (%), %= operator . . . . . . . . . . . . . . 99, 110
period (.) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
Perl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 338
Peters, Arno . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
Peterson, Hal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
pgawk program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 206
pgawk program, awkprof.out file. . . . . . . . . . . . . . 206
pgawk program, dynamic profiling . . . . . . . . . . . . . 209
pipes, closing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86
pipes, input . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
pipes, output . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82
Pitts, Dave . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9, 321
plus sign (+) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
plus sign (+), + operator . . . . . . . . . . . . . . . . . 109, 110
plus sign (+), ++ (decrement/increment operators)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100
plus sign (+), ++ operator . . . . . . . . . . . . . . . . 101, 109
plus sign (+), += operator . . . . . . . . . . . . . . . . . 99, 110
pointers to functions . . . . . . . . . . . . . . . . . . . . . . . . . . 178
portability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
portability, #! (executable scripts) . . . . . . . . . . . . . 13
portability, ** operator and . . . . . . . . . . . . . . . . . . . . 96
portability, **= operator and . . . . . . . . . . . . . . . . . 100
portability, ARGV variable . . . . . . . . . . . . . . . . . . . . . . 14
portability, backslash continuation and . . . . . . . . . 21
portability, backslash in escape sequences . . . . . . 39
portability, close() function and . . . . . . . . . . . . . . 87
portability, data files as single record . . . . . . . . . . . 52
portability, deleting array elements . . . . . . . . . . . 140
portability, example programs . . . . . . . . . . . . . . . . 211
portability, fflush() function and . . . . . . . . . . . . 160
portability, functions, defining . . . . . . . . . . . . . . . . 172
portability, gawk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 327
portability, gettext library and. . . . . . . . . . . . . . . 185
portability, internationalization and . . . . . . . . . . . 190
392
Index 393
Q
q debugger command (alias for quit) . . . . . . . . . 298
QSE Awk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 323
question mark (?) regexp operator . . . . . . . . . 41, 44
question mark (?), ?: operator. . . . . . . . . . . . . . . . 110
QuikTrim Awk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 323
quit debugger command . . . . . . . . . . . . . . . . . . . . . 298
QUIT signal (MS-Windows) . . . . . . . . . . . . . . . . . . . 210
quoting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12, 13, 14
quoting, rules for . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
quoting, tricks for . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
R
r debugger command (alias for run) . . . . . . . . . . 292
Rakitzis, Byron. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 271
rand() function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 148
random numbers, Cliff . . . . . . . . . . . . . . . . . . . . . . . . 216
random numbers, rand()/srand() functions . . 148
random numbers, seed of . . . . . . . . . . . . . . . . . . . . . 148
range expressions (regexps) . . . . . . . . . . . . . . . . . . . . 42
range patterns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113
Rankin, Pat . . . . . . . . . . . . . . . . . . . . . . . 9, 99, 307, 321
readable data files, checking . . . . . . . . . . . . . . . . . . 223
readable.awk program . . . . . . . . . . . . . . . . . . . . . . . 223
recipe for a programming language . . . . . . . . . . . . . . 3
record separators . . . . . . . . . . . . . . . . . . . . . . . . . 49, 129
record separators, changing . . . . . . . . . . . . . . . . . . . . 50
record separators, regular expressions as . . . . . . . 51
record separators, with multiline records . . . . . . . 64
records . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49, 342
records, multiline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
records, printing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
records, splitting input into . . . . . . . . . . . . . . . . . . . . 49
records, terminating . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
records, treating files as . . . . . . . . . . . . . . . . . . . . . . . . 52
recursive functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171
redirection of input . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69
redirection of output . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
reference counting, sorting arrays . . . . . . . . . . . . . 203
regexp constants . . . . . . . . . . . . . . . . . . . . . . 38, 90, 105
regexp constants, /=.../, /= operator and . . . . 100
regexp constants, as patterns . . . . . . . . . . . . . . . . . 112
regexp constants, in gawk . . . . . . . . . . . . . . . . . . . . . . 91
regexp constants, slashes vs. quotes . . . . . . . . . . . . 47
regexp constants, vs. string constants . . . . . . . . . . 47
regexp, See regular expressions . . . . . . . . . . . . . . . . . 37
register_deferred_variable() internal function
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331
register_open_hook() internal function . . . . . . 331
regular expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
regular expressions as field separators . . . . . . . . . . 57
regular expressions, anchors in . . . . . . . . . . . . . . . . . 40
regular expressions, as field separators . . . . . . . . . 57
regular expressions, as patterns . . . . . . . . . . . 37, 111
regular expressions, as record separators . . . . . . . 51
regular expressions, case sensitivity . . . . . . . . 45, 128
regular expressions, computed . . . . . . . . . . . . . . . . . 47
S
s debugger command (alias for step) . . . . . . . . . 293
sandbox mode . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
scalar values . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 342
Schorr, Andrew . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
Schreiber, Bert . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
394
Schreiber, Rita . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
search paths . . . . . . . . . . . . . . . . . . . . . 32, 282, 317, 320
search paths, for source files . . . . . 32, 282, 317, 320
searching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152
searching, files for regular expressions . . . . . . . . . 246
searching, for words . . . . . . . . . . . . . . . . . . . . . . . . . . 262
sed utility . . . . . . . . . . . . . . . . . . . . . . . . . . . 60, 275, 347
semicolon (;) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
semicolon (;), AWKPATH variable and. . . . . . . . . . . 317
semicolon (;), separating statements in actions
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117, 118
separators, field . . . . . . . . . . . . . . . . . . . . . . . . . . 127, 128
separators, field, FIELDWIDTHS variable and. . . . 127
separators, field, FPAT variable and . . . . . . . . . . . . 127
separators, field, POSIX and . . . . . . . . . . . . . . . . . . . 52
separators, for records . . . . . . . . . . . . . . . . . 49, 50, 129
separators, for records, regular expressions as . . 51
separators, for statements in actions . . . . . . . . . . 117
separators, subscript . . . . . . . . . . . . . . . . . . . . . . . . . . 129
set debugger command . . . . . . . . . . . . . . . . . . . . . . . 294
shells, piping commands into . . . . . . . . . . . . . . . . . . . 83
shells, quoting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116
shells, quoting, rules for . . . . . . . . . . . . . . . . . . . . . . . 15
shells, scripts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
shells, variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116
shift, bitwise . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 168
short-circuit operators . . . . . . . . . . . . . . . . . . . . . . . . 106
si debugger command (alias for stepi) . . . . . . . 293
side effects . . . . . . . . . . . . . . . . . . . . . . . . . . . 97, 100, 101
side effects, array indexing . . . . . . . . . . . . . . . . . . . . 137
side effects, asort() function . . . . . . . . . . . . . . . . . 202
side effects, assignment expressions. . . . . . . . . . . . . 98
side effects, Boolean operators . . . . . . . . . . . . . . . . 106
side effects, conditional expressions . . . . . . . . . . . 107
side effects, decrement/increment operators . . . 100
side effects, FILENAME variable . . . . . . . . . . . . . . . . . 72
side effects, function calls . . . . . . . . . . . . . . . . . . . . . 108
side effects, statements . . . . . . . . . . . . . . . . . . . . . . . 118
SIGHUP signal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 210
SIGINT signal (MS-Windows) . . . . . . . . . . . . . . . . . 210
signals, HUP/SIGHUP. . . . . . . . . . . . . . . . . . . . . . . . . . . 210
signals, INT/SIGINT (MS-Windows) . . . . . . . . . . . 210
signals, QUIT/SIGQUIT (MS-Windows) . . . . . . . . . 210
signals, USR1/SIGUSR1 . . . . . . . . . . . . . . . . . . . . . . . . 209
SIGQUIT signal (MS-Windows) . . . . . . . . . . . . . . . . 210
SIGUSR1 signal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209
silent debugger command . . . . . . . . . . . . . . . . . . . 292
sin() function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149
single precision floating-point . . . . . . . . . . . . . . . . . 343
single quote () . . . . . . . . . . . . . . . . . . . . . . . . 11, 13, 15
single quote (), vs. apostrophe . . . . . . . . . . . . . . . . 14
single quote (), with double quotes . . . . . . . . . . . . 15
single-character fields . . . . . . . . . . . . . . . . . . . . . . . . . . 58
Skywalker, Luke . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
sleep utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 264
Solaris, POSIX-compliant awk . . . . . . . . . . . . . . . . 322
sort function, arrays, sorting . . . . . . . . . . . . . . . . . . 202
sort utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269
Index 395
strings, null . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
strings, numeric . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102
strings, splitting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155
strtonum() function (gawk). . . . . . . . . . . . . . . . . . . 155
strtonum() function (gawk), --non-decimal-data
option and . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 195
sub() function . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91, 156
sub() function, arguments of . . . . . . . . . . . . . . . . . 157
sub() function, escape processing . . . . . . . . . . . . . 158
subscript separators . . . . . . . . . . . . . . . . . . . . . . . . . . 129
subscripts in arrays, multidimensional. . . . . . . . . 142
subscripts in arrays, multidimensional, scanning
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143
subscripts in arrays, numbers as . . . . . . . . . . . . . . 140
subscripts in arrays, uninitialized variables as
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
SUBSEP variable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
SUBSEP variable, multidimensional arrays . . . . . . 142
substr() function . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157
Sumner, Andrew . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 322
switch statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121
syntactic ambiguity: /= operator vs. /=.../ regexp
constant . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100
system() function . . . . . . . . . . . . . . . . . . . . . . . . . . . . 161
systime() function (gawk) . . . . . . . . . . . . . . . . . . . . 164
T
t debugger command (alias for tbreak) . . . . . . . 291
tbreak debugger command . . . . . . . . . . . . . . . . . . . 291
Tcl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 212
TCP/IP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 205
TCP/IP, support for . . . . . . . . . . . . . . . . . . . . . . . . . . . 85
tee utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254
tee.awk program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254
terminating records . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
testbits.awk program . . . . . . . . . . . . . . . . . . . . . . . 168
Texinfo . . . . . . . . . . . . . . . . . 6, 211, 262, 271, 311, 327
Texinfo, chapter beginnings in files . . . . . . . . . . . . . 40
Texinfo, extracting programs from source files
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 271
text, printing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
text, printing, unduplicated lines of . . . . . . . . . . . 255
TEXTDOMAIN variable . . . . . . . . . . . . . . . . . . . . . 129, 187
TEXTDOMAIN variable, BEGIN pattern and . . . . . . 188
TEXTDOMAIN variable, portability and . . . . . . . . . . 190
textdomain() function (C library) . . . . . . . . . . . . 185
tilde (~), ~ operator . . 37, 45, 47, 90, 103, 105, 110,
112
time, alarm clock example program . . . . . . . . . . . 262
time, localization and . . . . . . . . . . . . . . . . . . . . . . . . . 187
time, managing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 219
time, retrieving . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163
timestamps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163, 164
timestamps, converting dates to . . . . . . . . . . . . . . 164
timestamps, formatted . . . . . . . . . . . . . . . . . . . . . . . . 219
tolower() function . . . . . . . . . . . . . . . . . . . . . . . . . . . 158
toupper() function . . . . . . . . . . . . . . . . . . . . . . . . . . . 158
tr utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 265
trace debugger command . . . . . . . . . . . . . . . . . . . . 298
translate.awk program . . . . . . . . . . . . . . . . . . . . . . 266
troubleshooting, --non-decimal-data option . . . 28
troubleshooting, == operator . . . . . . . . . . . . . . . . . . 104
troubleshooting, awk uses FS not IFS . . . . . . . . . . . 56
troubleshooting, backslash before nonspecial
character . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
troubleshooting, division . . . . . . . . . . . . . . . . . . . . . . . 96
troubleshooting, fatal errors, field widths,
specifying . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
troubleshooting, fatal errors, printf format strings
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80
troubleshooting, fflush() function . . . . . . . . . . . 161
troubleshooting, function call syntax . . . . . . . . . . 108
troubleshooting, gawk . . . . . . . . . . . . . . . . . . . . . . . . . 325
troubleshooting, gawk, bug reports . . . . . . . . . . . . 320
troubleshooting, gawk, fatal errors, function
arguments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147
troubleshooting, getline function . . . . . . . . . . . . 223
troubleshooting, gsub()/sub() functions . . . . . . 157
troubleshooting, match() function . . . . . . . . . . . . 154
troubleshooting, patsplit() function . . . . . . . . . 154
troubleshooting, print statement, omitting
commas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74
troubleshooting, printing. . . . . . . . . . . . . . . . . . . . . . . 83
troubleshooting, quotes with file names . . . . . . . . 85
troubleshooting, readable data files . . . . . . . . . . . 223
troubleshooting, regexp constants vs. string
constants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47
troubleshooting, string concatenation . . . . . . . . . . 97
troubleshooting, substr() function . . . . . . . . . . . 157
troubleshooting, system() function . . . . . . . . . . . 161
troubleshooting, typographical errors, global
variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
true, logical . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
Trueman, David . . . . . . . . . . . . . . . . . . . . . . . . . 4, 9, 307
trunc-mod operation . . . . . . . . . . . . . . . . . . . . . . . . . . . 96
truth values . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
type conversion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
type internal variable. . . . . . . . . . . . . . . . . . . . . . . . . 330
U
u debugger command (alias for until) . . . . . . . . 293
undefined functions . . . . . . . . . . . . . . . . . . . . . . . . . . . 176
underscore (_), _ C macro . . . . . . . . . . . . . . . . . . . . 186
underscore (_), in names of private variables . . 212
underscore (_), translatable string . . . . . . . . . . . . 188
undisplay debugger command . . . . . . . . . . . . . . . . 294
undocumented features . . . . . . . . . . . . . . . . . . . . . . . . 35
Unicode . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 348
uninitialized variables, as array subscripts . . . . . 141
uniq utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 255
uniq.awk program . . . . . . . . . . . . . . . . . . . . . . . . . . . . 256
Unix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 356
Unix awk, backslashes in escape sequences . . . . . . 39
Unix awk, close() function and . . . . . . . . . . . . . . . 87
396
V
values, numeric . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 342
values, string . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 342
variable typing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102
variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22, 342
variables, assigning on command line . . . . . . . . . . . 92
variables, built-in . . . . . . . . . . . . . . . . . . . . . . . . . 92, 126
variables, built-in, -v option, setting with . . . . . . 26
variables, built-in, conveying information. . . . . . 129
variables, flag . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 106
variables, getline command into, using . . . 68, 69,
71
variables, global, for library functions . . . . . . . . . 211
variables, global, printing list of . . . . . . . . . . . . . . . . 27
variables, initializing . . . . . . . . . . . . . . . . . . . . . . . . . . . 92
variables, local . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 174
variables, names of . . . . . . . . . . . . . . . . . . . . . . . . . . . 135
variables, private . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211
variables, setting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
variables, shadowing . . . . . . . . . . . . . . . . . . . . . . . . . . 171
variables, types of . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
variables, types of, comparison expressions and
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102
variables, uninitialized, as array subscripts . . . . 141
variables, user-defined . . . . . . . . . . . . . . . . . . . . . . . . . 92
vertical bar (|) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
vertical bar (|), | operator (I/O) . . . . . . . . . . 70, 110
vertical bar (|), |& operator (I/O) . . . . 71, 110, 204
vertical bar (|), || operator. . . . . . . . . . . . . . 106, 110
Vinschen, Corinna . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
W
w debugger command (alias for watch) . . . . . . . . 294
w utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
walk_array() user-defined function . . . . . . . . . . . 239
Wall, Larry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135, 338
Wallin, Anders . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
warnings, issuing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
watch debugger command . . . . . . . . . . . . . . . . . . . . 294
wc utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 259
wc.awk program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
Weinberger, Peter . . . . . . . . . . . . . . . . . . . . . . . . . . 4, 307
while statement . . . . . . . . . . . . . . . . . . . . . . . . . . 37, 119
whitespace, as field separators . . . . . . . . . . . . . . . . . 57
whitespace, functions, calling . . . . . . . . . . . . . . . . . 147
whitespace, newlines as . . . . . . . . . . . . . . . . . . . . . . . . 29
Williams, Kent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
Woehlke, Matthew . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
Woods, John . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
word boundaries, matching . . . . . . . . . . . . . . . . . . . . 44
word, regexp definition of . . . . . . . . . . . . . . . . . . . . . . 44
word-boundary operator (gawk) . . . . . . . . . . . . . . . . 44
wordfreq.awk program . . . . . . . . . . . . . . . . . . . . . . . 269
words, counting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 259
words, duplicate, searching for . . . . . . . . . . . . . . . . 262
words, usage counts, generating . . . . . . . . . . . . . . . 269
wstlen internal variable . . . . . . . . . . . . . . . . . . . . . . 330
wstptr internal variable . . . . . . . . . . . . . . . . . . . . . . 330
X
xgawk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
xgettext utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
XML (eXtensible Markup Language) . . . . . . . . .
XOR bitwise operation . . . . . . . . . . . . . . . . . . . . . . .
xor() function (gawk) . . . . . . . . . . . . . . . . . . . . . . . .
323
189
331
167
168
Y
Yawitz, Efraim . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
Z
Zaretskii, Eli . . . . . . . . . . . . . . . . . . . . . . . . . . 9, 308,
zero, negative vs. positive . . . . . . . . . . . . . . . . . . . . .
zerofile.awk program . . . . . . . . . . . . . . . . . . . . . . .
Zoulas, Christos . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
321
345
224
308