GAWK: E Ective AWK Programming
GAWK: E Ective AWK Programming
GAWK: E Ective AWK Programming
Arnold D. Robbins
“To boldly go where no man has gone before” is a Registered Trademark of Paramount
Pictures Corporation.
Published by:
ISBN 1-882114-28-0
Copyright
c 1989, 1991, 1992, 1993, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 Free
Software Foundation, Inc.
This is Edition 3 of GAWK: Effective AWK Programming: A User’s Guide for GNU Awk,
for the 3.1.4 (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.2 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 freedom to copy and modify this GNU Manual, like GNU software. Copies
published by the Free Software Foundation raise funds for GNU development.”
Short Contents
Foreword . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1 Getting Started with awk . . . . . . . . . . . . . . . . . . . . . . . . . 11
2 Regular Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
3 Reading Input Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
4 Printing Output . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
5 Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
6 Patterns, Actions, and Variables . . . . . . . . . . . . . . . . . . . . 93
7 Arrays in awk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116
8 Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
9 Internationalization with gawk . . . . . . . . . . . . . . . . . . . . . 156
10 Advanced Features of gawk . . . . . . . . . . . . . . . . . . . . . . . 165
11 Running awk and gawk . . . . . . . . . . . . . . . . . . . . . . . . . . 173
12 A Library of awk Functions . . . . . . . . . . . . . . . . . . . . . . . 181
13 Practical awk Programs . . . . . . . . . . . . . . . . . . . . . . . . . 210
A The Evolution of the awk Language . . . . . . . . . . . . . . . . . 252
B Installing gawk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
C Implementation Notes . . . . . . . . . . . . . . . . . . . . . . . . . . 279
D Basic Programming Concepts . . . . . . . . . . . . . . . . . . . . . 294
Glossary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299
GNU General Public License . . . . . . . . . . . . . . . . . . . . . . . . . 309
GNU Free Documentation License . . . . . . . . . . . . . . . . . . . . . 315
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 322
ii GAWK: Effective AWK Programming
Table of Contents
Foreword . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
History of awk and gawk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
A Rose by Any Other Name . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
Using This Book . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
Typographical Conventions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
The GNU Project and This Book . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
How to Contribute . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
2 Regular Expressions . . . . . . . . . . . . . . . . . . . . . . 24
2.1 How to Use Regular Expressions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
2.2 Escape Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
2.3 Regular Expression Operators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
2.4 Using Character Lists . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
2.5 gawk-Specific Regexp Operators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
2.6 Case Sensitivity in Matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
2.7 How Much Text Matches? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
2.8 Using Dynamic Regexps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
2.9 Where You Are Makes A Difference. . . . . . . . . . . . . . . . . . . . . . . . . . 35
iii
4 Printing Output . . . . . . . . . . . . . . . . . . . . . . . . . . 57
4.1 The print Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
4.2 Examples of print Statements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
4.3 Output Separators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
4.4 Controlling Numeric Output with print . . . . . . . . . . . . . . . . . . . . . 59
4.5 Using printf Statements for Fancier Printing . . . . . . . . . . . . . . . . 60
4.5.1 Introduction to the printf Statement . . . . . . . . . . . . . . . . . . . 60
4.5.2 Format-Control Letters. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
4.5.3 Modifiers for printf Formats . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
4.5.4 Examples Using printf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
4.6 Redirecting Output of print and printf . . . . . . . . . . . . . . . . . . . . 65
4.7 Special File Names in gawk. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
4.7.1 Special Files for Standard Descriptors . . . . . . . . . . . . . . . . . . . 68
4.7.2 Special Files for Process-Related Information . . . . . . . . . . . . 69
4.7.3 Special Files for Network Communications . . . . . . . . . . . . . . . 69
4.7.4 Special File Name Caveats . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
4.8 Closing Input and Output Redirections . . . . . . . . . . . . . . . . . . . . . . 70
iv GAWK: Effective AWK Programming
5 Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
5.1 Constant Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
5.1.1 Numeric and String Constants . . . . . . . . . . . . . . . . . . . . . . . . . . 73
5.1.2 Octal and Hexadecimal Numbers. . . . . . . . . . . . . . . . . . . . . . . . 73
5.1.3 Regular Expression Constants . . . . . . . . . . . . . . . . . . . . . . . . . . 74
5.2 Using Regular Expression Constants . . . . . . . . . . . . . . . . . . . . . . . . . 74
5.3 Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
5.3.1 Using Variables in a Program . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
5.3.2 Assigning Variables on the Command Line . . . . . . . . . . . . . . . 76
5.4 Conversion of Strings and Numbers . . . . . . . . . . . . . . . . . . . . . . . . . . 77
5.5 Arithmetic Operators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78
5.6 String Concatenation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80
5.7 Assignment Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
5.8 Increment and Decrement Operators . . . . . . . . . . . . . . . . . . . . . . . . . 83
5.9 True and False in awk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85
5.10 Variable Typing and Comparison Expressions . . . . . . . . . . . . . . . 85
5.11 Boolean Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
5.12 Conditional Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89
5.13 Function Calls . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89
5.14 Operator Precedence (How Operators Nest) . . . . . . . . . . . . . . . . . 90
8 Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
8.1 Built-in Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
8.1.1 Calling Built-in Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
8.1.2 Numeric Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
8.1.3 String-Manipulation Functions . . . . . . . . . . . . . . . . . . . . . . . . . 129
8.1.3.1 More About ‘\’ and ‘&’ with sub, gsub, and gensub
.................................................... 136
8.1.4 Input/Output Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140
8.1.5 Using gawk’s Timestamp Functions . . . . . . . . . . . . . . . . . . . . 142
8.1.6 Bit-Manipulation Functions of gawk . . . . . . . . . . . . . . . . . . . . 147
8.1.7 Using gawk’s String-Translation Functions . . . . . . . . . . . . . . 149
8.2 User-Defined Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149
8.2.1 Function Definition Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149
8.2.2 Function Definition Examples. . . . . . . . . . . . . . . . . . . . . . . . . . 151
8.2.3 Calling User-Defined Functions . . . . . . . . . . . . . . . . . . . . . . . . 152
8.2.4 The return Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154
8.2.5 Functions and Their Effects on Variable Typing . . . . . . . . . 155
Glossary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 322
1
Foreword
Arnold Robbins and I are good friends. We were introduced 11 years ago by circumstances—
and 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. AWK’s simple programming paradigm—find a pattern in
the input and then perform an action—often 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, it’s no longer difficult to find a new awk. gawk ships with 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. I’m glad we did meet. He is an AWK expert’s 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 program-
ming that will appeal to a wide audience. It is a definitive reference to the AWK language
as defined by the 1987 Bell Labs release and codified in the 1992 POSIX Utilities standard.
On the other hand, the novice AWK programmer can study a wealth of practical pro-
grams that emphasize the power of AWK’s basic idioms: data driven control-flow, pattern
matching with regular expressions, and associative arrays. Those looking for something
new can try out gawk’s 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
2 GAWK: Effective AWK Programming
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 exper-
imented 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’ pro-
file pinpointed the problem to a single line of code. pgawk is a welcome addition to my
programmer’s 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
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 Pascal 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 System
V Release 4 version of awk. gawk is also compatible with the POSIX specification of the
awk language. This means that all properly written awk programs should work with gawk.
Thus, we usually don’t distinguish between gawk and other awk implementations.
Using awk allows you to:
• Manage small, personal databases
• Generate reports
• Validate data
• Produce indexes and perform other document preparation tasks
• Experiment with algorithms that you can adapt later to other computer languages
In addition, gawk provides facilities that make it easy to:
• Extract bits and pieces of data for processing
• Sort data
• Perform simple network communications
This book teaches you about the awk language and how you can use it effectively. You
should already be familiar with basic system commands, such as cat and ls,1 as well as
basic shell facilities, such as input/output (I/O) redirection and pipes.
Implementations of the awk language are available for many different computing en-
vironments. This book, while describing the awk language in general, also describes the
particular implementation of awk called gawk (which stands for “GNU awk”). gawk runs
on a broad range of Unix systems, ranging from 80386 PC-based computers up through
large-scale systems, such as Crays. gawk has also been ported to Mac OS X, MS-DOS,
Microsoft Windows (all versions) and OS/2 PCs, Atari and Amiga microcomputers, BeOS,
Tandem D20, and VMS.
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. Wein-
berger 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 expres-
sions. This new version became widely available with Unix System V Release 3.1 (SVR3.1).
The version in SVR4 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 Lan-
guage 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 1995, I became the primary maintainer. Current
development focuses on bug fixes, performance improvements, standards compliance, and
occasionally, new features.
In May of 1997, Jürgen 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.
See Section A.6 [Major Contributors to gawk], page 258, for a complete list of those who
made important contributions to gawk.
2
Often, these systems use gawk for their awk implementation!
5
Chapter 8 [Functions], page 127, describes the built-in functions awk and gawk provide,
as well as how to define your own functions.
Chapter 9 [Internationalization with gawk], page 156, describes special features in gawk
for translating program messages into different languages at runtime.
Chapter 10 [Advanced Features of gawk], page 165, 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 11 [Running awk and gawk], page 173, describes how to run gawk, the meaning
of its command-line options, and how it finds awk program source files.
Chapter 12 [A Library of awk Functions], page 181, and Chapter 13 [Practical awk
Programs], page 210, provide many sample awk programs. Reading them allows you to see
awk solving real problems.
Appendix A [The Evolution of the awk Language], page 252, describes how the awk
language has evolved since first release to present. It also describes how gawk has acquired
features over time.
Appendix B [Installing gawk], page 260, describes how to get gawk, how to compile it
under Unix, and how to compile and use it on different non-Unix systems. It also describes
how to report bugs in gawk and where to get three other freely available implementations
of awk.
Appendix C [Implementation Notes], page 279, describes how to disable gawk’s exten-
sions, 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 294, provides some very cursory back-
ground 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 299, defines most, if not all, the significant terms used throughout
the book. If you find terms that you aren’t familiar with, try looking them up here.
[GNU General Public License], page 309, and [GNU Free Documentation License],
page 315, present the licenses that cover the gawk source code and this book, respectively.
Typographical Conventions
This book is written using Texinfo, the GNU documentation formatting language. A single
Texinfo source file is used to produce both the printed and online versions of the documen-
tation. 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 pri-
mary and secondary prompts, ‘$’ and ‘>’. Output from the command is preceded by the
glyph “ a ”. This typically represents the command’s standard output. Error messages, and
other output on the command’s 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
7
In the text, command names appear in this font, while code segments appear in the
same font and quoted, ‘like this’. 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. 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, there’s
always a smaller but darker one.
Brian Kernighan
Until the POSIX standard (and The Gawk Manual), 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,
something that is incomplete.
How to Contribute
As the maintainer of GNU awk, I am starting a collection of publicly available awk programs.
For more information, see ftp://ftp.freefriends.org/arnold/Awkstuff. 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 contact me (arnold@skeeve.com). Making things
available on the Internet helps keep the gawk distribution down to manageable size.
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
9
Arnold Robbins
Nof Ayalon
10 GAWK: Effective AWK Programming
ISRAEL
March, 2001
Chapter 1: Getting Started with awk 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.
passes it to awk. Doing this leads to confusing behavior—most likely a usage diagnostic of
some sort from awk.
Finally, the value of ARGV[0] (see Section 6.5 [Built-in Variables], page 107) varies de-
pending 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’).
Don’t rely on the value of ARGV[0] to provide your script name.
is true whether you are entering the program interactively at the shell prompt, or writing
it as part of a larger shell script:
awk ’program text ’ input-file1 input-file2 ...
Once you are working with the shell, it is helpful to have a basic knowledge of shell
quoting rules. The following rules apply only to POSIX-compliant, Bourne-style shells
(such as bash, the GNU Bourne-Again Shell). If you use csh, you’re on your own.
• Quoted items can be concatenated with nonquoted items as well as with other quoted
items. The shell turns everything into one argument for the command.
• Preceding any single character with a backslash (‘\’) quotes that character. The shell
removes the backslash and passes the quoted character on to the command.
• Single quotes protect everything between the opening and closing quotes. The shell
does no interpretation of the quoted text, passing it on verbatim to the command. It is
impossible to embed a single quote inside single-quoted text. Refer back to Section 1.1.5
[Comments in awk Programs], page 14, for an example of what happens if you try.
• Double quotes protect most things between the opening and closing quotes. The shell
does at least variable and command substitution on the quoted text. Different shells
may do additional kinds of processing on double-quoted text.
Since certain characters within double-quoted text are processed by the shell, they
must be escaped within the text. Of note are the characters ‘$’, ‘‘’, ‘\’, and ‘"’, all
of which must be preceded by a backslash within double-quoted text if they are to be
passed on literally to the program. (The leading backslash is stripped first.) Thus, the
example seen previously in Section 1.1.2 [Running awk Without Input Files], page 12,
is applicable:
$ awk "BEGIN { print \"Don’t Panic!\" }"
a Don’t Panic!
Note that the single quote is not special within double quotes.
• Null strings are removed when they occur as part of a non-null command-line argument,
while explicit non-null objects are kept. For example, to specify that the field separator
FS should be set to the null string, use:
awk -F "" ’program ’ files # correct
Don’t use this:
awk -F"" ’program ’ files # 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:
16 GAWK: Effective AWK Programming
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 13 25 15 115
Feb 15 32 24 226
Mar 15 24 34 228
Apr 31 52 63 420
May 16 34 29 208
Jun 31 42 75 492
Jul 24 34 67 436
Aug 15 34 47 316
Sep 13 55 37 277
Oct 29 54 68 525
Nov 20 87 82 577
Dec 17 35 61 401
Jan 21 36 64 620
Feb 26 58 80 652
Mar 24 75 70 495
Apr 21 70 74 514
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: all lines matching the pattern ‘foo’
are printed. 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 haven’t
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 action—so 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()) }’
• Print the total number of bytes used by files:
ls -l files | awk ’{ x += $5 }
END { print "total bytes: " x }’
• Print the total number of kilobytes used by files:
ls -l files | awk ’{ x += $5 }
END { print "total K-bytes: " (x + 1023)/1024 }’
• Print a sorted list of the login names of all users:
awk -F: ’{ print $1 }’ /etc/passwd | sort
Chapter 1: Getting Started with awk 19
awk is a line-oriented language. Each rule’s 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
> }’
error gawk: cmd. line:2: BEGIN rule
error gawk: cmd. line:2: ^ parse error
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 sepa-
rated with a semicolon was not in the original awk language; it was added for
consistency with the treatment of statements within an action.
be quickly composed at your terminal, used once, and thrown away. Because awk pro-
grams 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 assem-
bler for eight-bit microprocessors (see [Glossary], page 299, for more information), and a
microcode assembler for a special-purpose Prolog computer. More recently, gawk was used
for writing a Wiki clone.7 While the original awk’s capabilities were strained by tasks of
such complexity, modern versions are more capable. Even the Bell Labs 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 conven-
tional 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.
7
Yet Another Wiki Clone.
24 GAWK: Effective AWK Programming
2 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 will present more complicated instances.
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.
\xhh ... The hexadecimal value hh, where hh stands for a sequence of hexadecimal digits
(‘0’–‘9’, and either ‘A’–‘F’ or ‘a’–‘f’). Like the same construct in ISO C, the
escape sequence continues until the first nonhexadecimal digit is seen. 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 expression 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 expression 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 2.5 [gawk-Specific Regexp Operators], page 31.
In a regexp, a backslash before any character that is not in the previous list and not listed
in Section 2.5 [gawk-Specific Regexp Operators], page 31, 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 2.8 [Using
Dynamic Regexps], page 34), for the special operators listed in Section 2.5 [gawk-
Specific Regexp Operators], page 31.
• 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$/) ...
. This matches any single character, including the newline character. For ex-
ample, ‘.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 11.2 [Command-Line Options], page 173),
‘.’ 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.
28 GAWK: Effective AWK Programming
[...] This is called a character list.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 character list is given in Section 2.4 [Using Character
Lists], page 29.
[^ ...] This is a complemented character list. The first character after the ‘[’ must
be a ‘^’. It matches any characters except those in the square brackets. For
example, ‘[^awk]’ matches any character that is not an ‘a’, ‘w’, or ‘k’.
| This is the alternation operator and it is used to specify alternatives. The
‘|’ has the lowest precedence of all the regular expression operators. For
example, ‘^P|[[:digit:]]’ matches any string that matches either ‘^P’ or
‘[[:digit:]]’. This means it matches any string that starts with ‘P’ or contains
a digit.
The alternation applies to the largest possible regexps on either side.
(...) Parentheses are used for grouping in regular expressions, as in arithmetic. They
can be used to concatenate regular expressions containing the alternation oper-
ator, ‘|’. For example, ‘@(samp|code)\{[^}]+\}’ matches both ‘@code{foo}’
and ‘@samp{bar}’. (These are Texinfo formatting control sequences. The ‘+’ is
explained further on in this list.)
* 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 ‘h’s. This also matches just ‘p’ if no ‘h’s 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.
+ This symbol is similar to ‘*’, except that the preceding expression must be
matched at least once. This means that ‘wh+y’ would match ‘why’ and ‘whhy’,
but not ‘wy’, whereas ‘wh*y’ would match all three of these strings. The follow-
ing is a simpler way of writing the last ‘*’ example:
awk ’/\(c[ad]+r x\)/ { print }’ sample
? This symbol is similar to ‘*’, except that the preceding expression can be
matched either once or not at all. For example, ‘fe?d’ matches ‘fed’ and
‘fd’, but nothing else.
{n }
{n,}
{n,m } 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
1
In other literature, you may see a character list referred to as either a character set, a character class,
or a bracket expression.
Chapter 2: Regular Expressions 29
specification for Extended Regular Expressions (EREs). POSIX EREs are based on the
regular expressions accepted by the traditional egrep utility.
Character classes are a new 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 character list. Char-
acter classes consist of ‘[:’, a keyword denoting the class, and ‘:]’. Table 2.1 lists the
character classes defined by the POSIX standard.
Class Meaning
[:alnum:] Alphanumeric characters.
[:alpha:] Alphabetic characters.
[:blank:] Space and TAB characters.
[:cntrl:] Control characters.
[:digit:] Numeric characters.
[:graph:] Characters that are both printable and visible. (A space is printable but
not visible, whereas an ‘a’ is both.)
[:lower:] Lowercase alphabetic characters.
[:print:] Printable characters (characters that are not control characters).
[:punct:] Punctuation characters (characters that are not letters, digits, control char-
acters, or space characters).
[:space:] Space characters (such as space, TAB, and formfeed, to name a few).
[:upper:] Uppercase alphabetic characters.
[:xdigit:] Characters that are hexadecimal digits.
Table 2.1: POSIX Character Classes
For example, before the POSIX standard, you had to write /[A-Za-z0-9]/ to match
alphanumeric characters. If your character set had other alphabetic characters in it, this
would not match them, and if your character set collated differently from ASCII, this might
not even match the ASCII alphanumeric characters. With the POSIX character classes, you
can write /[[:alnum:]]/ to match the alphabetic and numeric characters in your character
set.
Two additional special sequences can appear in character lists. These apply to non-
ASCII character sets, which can have single symbols (called collating elements) that are
represented with more than one character. They can also have several characters that are
equivalent for collating, or sorting, purposes. (For example, in French, a plain “e” and a
grave-accented “è” are equivalent.) These sequences are:
Collating symbols
Multicharacter collating elements enclosed between ‘[.’ and ‘.]’. For example,
if ‘ch’ is a collating element, then [[.ch.]] is a regexp that matches this
collating element, whereas [ch] is a regexp that matches either ‘c’ or ‘h’.
Chapter 2: Regular Expressions 31
Equivalence classes
Locale-specific names for a list of characters that are equal. The name is en-
closed between ‘[=’ and ‘=]’. For example, the name ‘e’ might be used to rep-
resent all of “e,” “è,” and “é.” In this case, [[=e=]] is a regexp that matches
any of ‘e’, ‘é’, or ‘è’.
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 equiva-
lence classes.
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 11.2 [Command-Line Options], page 173)
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. However, interval expressions are
not supported.
--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 spe-
cial, interval expressions are not available, nor are the POSIX character classes
([[:alnum:]], etc.). Characters described by octal and hexadecimal escape
sequences are treated literally, even if they represent regexp metacharacters.
--re-interval
Allow interval expressions in regexps, even if ‘--traditional’ has been
provided. (‘--posix’ automatically enables interval expressions, so
‘--re-interval’ is redundant when ‘--posix’ is is used.)
IGNORECASE = 1
Chapter 2: Regular Expressions 33
3
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 don’t recommend it.
34 GAWK: Effective AWK Programming
a 300 B
a alpo-net 555-3412 2400
a 1200
a 300 A
a barfly 555-7685 1200
a 300 A
a bites 555-1675 2400
a 1200
a 300 A
a camelot 555-0542 300 C
a core 555-2912 1200
a 300 C
a fooey 555-1234 2400
a 1200
a 300 B
a foot 555-6699 1200
a 300 B
a macfoo 555-6480 1200
a 300 A
a sdace 555-3430 2400
a 1200
a 300 A
a sabafoo 555-2127 1200
a 300 C
a
Note that the entry for the ‘camelot’ BBS is not split. In the original data file (see Sec-
tion 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 variable-
assignment feature (see Section 11.3 [Other Command-Line Arguments], page 178):
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.
38 GAWK: Effective AWK Programming
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 3.7 [Multiple-Line Records], page 49, 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 2 [Regular Expressions],
page 24). 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.
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 243, 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, there’s no guarantee that this will never happen.
The use of RS as a regular expression and the RT variable are gawk extensions; they are
not available in compatibility mode (see Section 11.2 [Command-Line Options], page 173).
In compatibility mode, only the first character of the value of RS is used to determine the
end of the record.
You might think that for text files, the nul character, which consists of a character with
all bits equal to zero, is a good value to use for RS in this case:
BEGIN { RS = "\0" } # whole file becomes one 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.
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 4.3 [Output Separators], page 59).
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 "can’t happen"
else
print "everything is normal"
should print ‘everything is normal’, because NF+1 is certain to be out of range. (See
Section 6.4.1 [The if-else Statement], page 99, for more information about awk’s if-else
statements. See Section 5.10 [Variable Typing and Comparison Expressions], page 85, 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 don’t 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 # force record to be reconstituted
print $0 # or whatever else with $0
This forces awk rebuild the record. It does help to add a comment, as we’ve 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
Chapter 3: Reading Input Files 43
applies to any built-in function that updates $0, such as sub and gsub (see Section 8.1.3
[String-Manipulation Functions], page 129).
a Field 1 is a
a Field 2 is
a Field 3 is b
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 11.2 [Command-Line Options], page 173), if FS is the null string, then gawk
also behaves this way.
a foot 555
a macfoo 555
a sdace 555
a sabafoo 555
Note the second line of output. The second line in the original file looked like this:
alpo-net 555-3412 2400/1200/300 A
The ‘-’ as part of the system’s 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 user’s logon name and the second is the user’s
(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
after a record is read, the value of the fields (i.e., how they were split) should reflect the old
value of FS, not the new one.
However, many implementations of awk do not work this way. Instead, they defer split-
ting the fields until a field is actually referenced. The fields are split using the current
value of FS! This behavior can be difficult to diagnose. The following example illustrates
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:/:
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 6.5.2 [Built-in Variables
That Convey Information], page 110). 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
fixed-width field splitting ...
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 201, for an example of such a function).
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 don’t
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 8.1.3 [String-Manipulation Functions], page 129). 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 seperator 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
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
{
print "Name is:", $1
print "Address is:", $2
print "City and State are:", $3
print ""
}
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
...
Chapter 3: Reading Input Files 51
See Section 13.3.4 [Printing Mailing Labels], page 235, 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. 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.)
In all cases, gawk sets RT to the input text that matched the value specified by RS.
tmp = substr($0, 1, t - 1)
u = index(substr($0, t + 2), "*/")
while (u == 0) {
if (getline <= 0) {
m = "unexpected EOF or error"
m = (m ": " ERRNO)
print m > "/dev/stderr"
exit
}
t = -1
u = index($0, "*/")
}
# substr expression will be "" if */
# occurred at end of line
$0 = tmp substr($0, u + 2)
}
print $0
}
This awk program deletes all C-style comments (‘/* ... */’) from the input. By replac-
ing the ‘print $0’ with other statements, you could perform more complicated processing
on the decommented input, such as searching for matches of a regular expression. (This
program has a subtle problem—it does not work if one comment ends and another begins
on the same line.)
This form of the getline command sets NF, NR, FNR, and the value of $0.
NOTE: The new value of $0 is used to test the patterns of any subsequent
rules. The original value of $0 that triggered the rule that executed getline
is lost. By contrast, the next statement reads a new record but immediately
begins processing it normally, starting with the first rule in the program. See
Section 6.4.8 [The next Statement], page 105.
tew
free
phore
and produces these results:
tew
wan
phore
free
The getline command used in this way sets only the variables NR and FNR (and of
course, var). The record is not split into fields, so the values of the fields (including $0)
and the value of NF do not change.
} else
print
}
Note here how the name of the extra input file is not built into the program; it is taken
directly from the data, specifically from the second field on the ‘@include’ line.
The close function is called to ensure that if two identical ‘@include’ lines appear in
the input, the entire specified file is included twice. See Section 4.8 [Closing Input and
Output Redirections], page 70.
One deficiency of this program is that it does not process nested ‘@include’ statements
(i.e., ‘@include’ statements in included files) the way a true macro preprocessor would. See
Section 13.3.9 [An Easy Way to Use Library Functions], page 244, for a program that does
handle nested ‘@include’ statements.
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 recom-
putes the value of $0. The values of NR and FNR are not changed.
According to POSIX, ‘expression | getline’ is ambiguous if expression contains un-
parenthesized operators other than ‘$’—for example, ‘"echo " "date" | getline’ is am-
biguous because the concatenation operator is not parenthesized. You should write it as
‘("echo " "date") | getline’ if you want your program to be portable to other awk im-
plementations.
Variant Effect
getline Sets $0, NF, FNR, and NR
getline var Sets var, FNR, and NR
getline < file Sets $0 and NF
getline var < file Sets var
command | getline Sets $0 and NF
command | getline var Sets var
command |& getline Sets $0 and NF. This is a gawk extension
command |& getline var Sets var. This is a gawk extension
Table 3.1: getline Variants and What They Set
Chapter 4: Printing Output 57
4 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 them—how many columns,
whether to use exponential notation or not, and so on. (For the exceptions, see Section 4.3
[Output Separators], page 59, and Section 4.4 [Controlling Numeric Output with print],
page 59.) For printing with specifications, you need the printf statement (see Section 4.5
[Using printf Statements for Fancier Printing], page 60).
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.
a line three
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 example’s output
makes much sense. A heading line at the beginning would make it clearer. Let’s add some
headings to our table of months ($1) and green crates shipped ($2). We do this using the
BEGIN pattern (see Section 6.1.4 [The BEGIN and END Special Patterns], page 96) so that
the headings are only printed once:
awk ’BEGIN { print "Month Crates"
print "----- ------" }
{ print $1, $2 }’ inventory-shipped
When run, the program prints the following:
Month Crates
----- ------
Jan 13
Feb 15
Mar 15
...
The only problem, however, is that the headings and the table data don’t line up! We can
fix this by printing some spaces between the two fields:
awk ’BEGIN { print "Month Crates"
print "----- ------" }
{ print $1, " ", $2 }’ inventory-shipped
Lining up columns this way can get pretty complicated when there are many columns
to fix. Counting spaces for two or three columns is simple, but any more than this can take
up a lot of time. This is why the printf statement was created (see Section 4.5 [Using
printf Statements for Fancier Printing], page 60); one of its specialties is lining up columns
of data.
NOTE: You can continue either a print or printf statement simply by putting
a newline after any comma (see Section 1.6 [awk Statements Versus Lines],
page 20).
Chapter 4: Printing Output 59
According to the POSIX standard, awk’s behavior is undefined if OFMT contains anything
but a floating-point conversion specification.
%d, %i These are equivalent; they both print a decimal integer. (The ‘%i’ specification
is for compatibility with ISO C.)
%e, %E These print a number in scientific (exponential) notation; for example:
printf "%4.3e\n", 1950
prints ‘1.950e+03’, with a total of four significant figures, three of which follow
the decimal point. (The ‘4.3’ represents two modifiers, discussed in the next
subsection.) ‘%E’ uses ‘E’ instead of ‘e’ in the output.
%f This prints a number in floating-point notation. For example:
printf "%4.3f", 1950
prints ‘1950.000’, with a total of four significant figures, three of which follow
the decimal point. (The ‘4.3’ represents two modifiers, discussed in the next
subsection.)
On systems supporting IEEE 754 floating point format, values representing
negative infinity are formatted as ‘-inf’ or ‘-infinity’, and positive infinity
as ‘inf’ and ‘-infinity’. The special “not a number” value formats as ‘-nan’
or ‘nan’.
%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. On
those that don’t, gawk uses %f instead.
%g, %G These 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 This prints an unsigned octal integer.
%s This prints a string.
%u This prints an unsigned decimal integer. (This format is of marginal use, be-
cause all numbers in awk are floating-point; it is provided primarily for com-
patibility with C.)
%x, %X These print an unsigned hexadecimal integer; ‘%X’ uses the letters ‘A’ through
‘F’ instead of ‘a’ through ‘f’.
%% This isn’t a format-control letter, but it does have meaning—the sequence ‘%%’
outputs one ‘%’; it does not consume an argument and it ignores any modifiers.
NOTE: When using the integer format-control letters for values that are out-
side the range of the widest C integer type, gawk switches to the the ‘%g’
format specifier. If ‘--lint’ is provided on the command line (see Section 11.2
[Command-Line Options], page 173), gawk warns about this. Other versions of
awk may print invalid values or do something else entirely.
the format-control letter. We will use the bullet symbol “•” in the following examples to
represent spaces in the output. Here are the possible modifiers, in the order in which they
may appear:
N$ An integer constant followed by a ‘$’ is a positional specifier. Normally, format
specifications are applied to arguments in the order given in the format string.
With a positional specifier, the format specification is applied to a specific
argument, instead of what would be the next argument in the list. Positional
specifiers begin counting with one. Thus:
printf "%s %s\n", "don’t", "panic"
printf "%2$s %1$s\n", "panic", "don’t"
prints the famous friendly message twice.
At first glance, this feature doesn’t seem to be of much use. It is in fact a gawk
extension, intended for use in translating messages at runtime. See Section 9.4.2
[Rearranging printf Arguments], page 160, which describes how and why to
use positional specifiers. For now, we will not use them.
- The minus sign, used before the width modifier (see later on in this table), 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 table), 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’, and ‘%f’, the result always contains a decimal point. For ‘%g’ and
‘%G’, trailing zeros are not removed from the result.
0 A leading ‘0’ (zero) acts as a flag that indicates that output should be padded
with zeros instead of spaces. This applies even to non-numeric output formats.
This flag only has an effect when the field width is wider than the value to
print.
’ A single quote or apostrohe character is a POSIX extension to ISO C. It in-
dicates that the integer part of a floating point value, or the entire part of an
integer decimal value, should have a thousands-separator character in it. This
only works in locales that support such characters. For example:
$ cat thousands.awk Show source pro-
gram
a BEGIN { printf "%’d\n", 1234567 }
$ LC_ALL=C gawk -f thousands.awk Run it in "C" lo-
cale
Chapter 4: Printing Output 63
a 1234567
$ LC_ALL=en_US.UTF-8 gawk -f thousands.awk Run in US En-
glish UTF locale
a 1,234,567
For more information about locales and internationalization issues, FIXME: see
xxxx.
NOTE: The ‘’’ flag is a nice feature, but its use complicates things:
it now becomes difficult to use it in command-line programs. For
information on appropriate quoting tricks, FIXME: see XXXX.
width This is a number specifying the desired minimum width of a field. Inserting
any number between the ‘%’ sign and the format-control character forces the
field to expand to this width. The default way to do this is to pad with spaces
on the left. For example:
printf "%4s", "foo"
prints ‘•foo’.
The value of width is a minimum width, not a maximum. If the item value
requires more than width characters, it can be as wide as necessary. Thus, the
following:
printf "%4s", "foobar"
prints ‘foobar’.
Preceding the width with a minus sign causes the output to be padded with
spaces on the right, instead of on the left.
.prec A period followed by an integer constant specifies the precision to use when
printing. The meaning of the precision varies by control letter:
%e, %E, %f Number of digits to the right of the decimal point.
%g, %G Maximum number of significant digits.
%d, %i, %o, %u, %x, %X
Minimum number of digits to print.
%s Maximum number of characters from the string that should print.
Thus, the following:
printf "%.4s", "foobar"
prints ‘foob’.
The C library printf’s dynamic width and prec capability (for example, "%*.*s") is
supported. Instead of supplying explicit width and/or prec values in the format string, they
are passed in the argument list. For example:
w = 5
p = 3
s = "abcdefg"
printf "%*.*s\n", w, p, s
is exactly equivalent to:
64 GAWK: Effective AWK Programming
s = "abcdefg"
printf "%5.3s\n", s
Both programs output ‘••abc’. Earlier versions of awk did not support this capability. If
you must use such a version, you may simulate this feature by using concatenation to build
up the format string, like so:
w = 5
p = 3
s = "abcdefg"
printf "%" w "." p "s\n", s
This is not particularly easy to read but it does work.
C programmers may be used to supplying additional ‘l’, ‘L’, and ‘h’ modifiers in printf
format strings. These are not valid in awk. Most awk implementations silently ignore these
modifiers. If ‘--lint’ is provided on the command line (see Section 11.2 [Command-Line
Options], page 173), gawk warns about their use. If ‘--posix’ is supplied, their use is a
fatal error.
a 555-3412
...
$ cat name-list
a aardvark
a alpo-net
...
Each output file contains one name or number per line.
print items >> output-file
This type of redirection prints the items into the pre-existing output file named
output-file. The difference between this and the single-‘>’ redirection is that
the old contents (if any) of output-file are not erased. Instead, the awk output
is appended to the file. If output-file does not exist, then it is created.
print items | command
It is also possible to send output to another program through a pipe instead
of into a file. This type of redirection opens a pipe to command, and writes
the values of items through this pipe to another process created to execute
command.
The redirection argument command is actually an awk expression. Its value is
converted to a string whose contents give the shell command to be run. For
example, the following produces two files, one unsorted list of BBS names, and
one list sorted in reverse alphabetical order:
awk ’{ print $1 > "names.unsorted"
command = "sort -r > names.sorted"
print $1 | command }’ BBS-list
The unsorted list is written with an ordinary redirection, while the sorted list
is written by piping through the sort utility.
The next example uses redirection to mail a message to the mailing list
‘bug-system’. This might be useful when trouble is encountered in an awk
script run periodically for system maintenance:
report = "mail bug-system"
print "Awk script failed:", $0 | report
m = ("at record number " FNR " of " FILENAME)
print m | report
close(report)
The message is built using string concatenation and saved in the variable m.
It’s then sent down the pipeline to the mail program. (The parentheses group
the items to concatenate—see Section 5.6 [String Concatenation], page 80.)
The close function is called here because it’s a good idea to close the pipe as
soon as all the intended output has been sent to it. See Section 4.8 [Closing
Input and Output Redirections], page 70, for more information.
This example also illustrates the use of a variable to represent a file or
command—it is not necessary to always use a string constant. Using a variable
is generally a good idea, because awk requires that the string value be spelled
identically every time.
Chapter 4: Printing Output 67
END { close("sh") }
The tolower function returns its argument string with all uppercase characters converted
to lowercase (see Section 8.1.3 [String-Manipulation Functions], page 129). 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.
The protocol is one of ‘tcp’, ‘udp’, or ‘raw’, and the other fields represent the other
essential pieces of information for making a networking connection. These file names are
used with the ‘|&’ operator for communicating with a coprocess (see Section 10.2 [Two-
Way Communications with Another Process], page 166). This is an advanced feature,
mentioned here only for completeness. Full discussion is delayed until Section 10.3 [Using
gawk for Network Programming], page 168.
close("sort -r names")
Once this function call is executed, the next getline from that file or command, or the
next print or printf to that file or command, reopens the file or reruns the command.
Because the expression that you use to close a file or pipeline must exactly match the
expression used to open the file or run the command, it is good practice to use a variable
to store the file name or command. The previous example becomes the following:
sortcom = "sort -r names"
sortcom | getline foo
...
close(sortcom)
This helps avoid hard-to-find typographical errors in your awk programs. Here are some of
the reasons for closing an output file:
• To write a file and read it back later on in the same awk program. Close the file after
writing it, then begin reading it with getline.
• To write numerous files, successively, in the same awk program. If the files aren’t closed,
eventually awk may exceed a system limit on the number of open files in one process.
It is best to close each one when the program has finished writing it.
• To make a command finish. When output is redirected through a pipe, the command
reading the pipe normally continues to try to read input as long as the pipe is open.
Often this means the command cannot really do its work until the pipe is closed. For
example, if output is redirected to the mail program, the message is not actually sent
until the pipe is closed.
• 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. gawk’s 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.
72 GAWK: Effective AWK Programming
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 10.2 [Two-Way
Communications with Another Process], page 166, which discusses it in more detail and
gives an example.
2
The technical terminology is rather morbid. The finished child is called a “zombie,” and cleaning up
after it is referred to as “reaping.”
3
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 5: Expressions 73
5 Expressions
Expressions are the basic building blocks of awk patterns and actions. An expression eval-
uates 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 same meaning as if it appeared in a pattern, i.e., ‘($0 ~ /foo/)’ See Section 6.1.2
[Expressions as Patterns], page 93. This means that the following two code segments:
if ($0 ~ /barfly/ || $0 ~ /camelot/)
print "found"
and:
if (/barfly/ || /camelot/)
print "found"
are exactly equivalent. One rather bizarre consequence of this rule is that the following
Boolean expression is valid, but does not do what the user probably intended:
# note that /foo/ is on the left of the ~
if (/foo/ ~ $1) print "found foo"
This code is “obviously” testing $1 for a match against the regexp /foo/. But in fact, the
expression ‘/foo/ ~ $1’ actually means ‘($0 ~ /foo/) ~ $1’. In other words, first match
the input record against the regexp /foo/. The result is either zero or one, depending upon
the success or failure of the match. That result is then matched against the first field in
the record. Because it is unlikely that you would ever really want to make this kind of test,
gawk issues a warning when it sees this construct in a program. Another consequence of
this rule is that the assignment statement:
matches = /foo/
assigns either zero or one to the variable matches, depending upon the contents of the
current input record. This feature of the language has never been well documented until
the POSIX specification.
Constant regular expressions are also used as the first argument for the gensub, sub, and
gsub functions, and as the second argument of the match function (see Section 8.1.3 [String-
Manipulation Functions], page 129). Modern implementations of awk, including gawk, allow
the third argument of split to be a regexp constant, but some older implementations do
not. This can lead to confusion when attempting to use regexp constants as arguments to
user-defined functions (see Section 8.2 [User-Defined Functions], page 149). For example:
function mysub(pat, repl, str, global)
{
if (global)
gsub(pat, repl, str)
else
sub(pat, repl, str)
return str
}
{
...
text = "hi! hi yourself!"
mysub(/hi/, "howdy", text, 1)
...
}
In this example, the programmer wants to pass a regexp constant to the user-defined
function mysub, which in turn passes it on to either sub or gsub. However, what really
76 GAWK: Effective AWK Programming
happens is that the pat parameter is either one or zero, depending upon whether or not $0
matches /hi/. gawk issues a warning when it sees a regexp constant used as a parameter
to a user-defined function, since passing a truth value in this way is probably not what was
intended.
5.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.
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 the file ‘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 pro-
gram in the ARGV array (see Section 6.5.3 [Using ARGC and ARGV], page 113). awk processes
the values of command-line assignments for escape sequences (see Section 2.2 [Escape Se-
quences], page 25).
format, awk converts all numbers to the same constant string. As a special case, if a number
is an integer, then the result of converting it to a string is always an integer, no matter
what the value of CONVFMT may be. Given the following code fragment:
CONVFMT = "%2.2f"
a = 12
b = a ""
b has the value "12", not "12.00".
Prior to the POSIX standard, awk used the value of OFMT for converting numbers to
strings. OFMT specifies the output format to use when printing numbers with print. CONVFMT
was introduced in order to separate the semantics of conversion from the semantics of
printing. Both CONVFMT and OFMT have the same default value: "%.6g". In the vast majority
of cases, old awk programs do not change their behavior. However, these semantics for
OFMT are something to keep in mind if you must port your new style program to older
implementations of awk. We recommend that instead of changing your programs, just port
gawk itself. See Section 4.1 [The print Statement], page 57, for more information on the
print statement.
Finally, once again, where you are can matter when it comes to converting between
numbers and strings. In Section 2.9 [Where You Are Makes A Difference], page 35, we
mentioned that the local character set and language (the locale) can affect how gawk matches
characters. The locale also affects numeric formats. In particular, for awk programs, it
affects the decimal point character. The "C" locale, and most English-language locales, use
the period character (‘.’) as the decimal point. However, many (if not most) European and
non-English locales use the comma (‘,’) as the decimal point character.
The POSIX standard says that awk always uses the period as the decimal point when
reading the awk program source code, and for command-line variable assignments (see Sec-
tion 11.3 [Other Command-Line Arguments], page 178). However, when interpreting input
data, for print and printf output, and for number to string conversion, the local decimal
point character is used. As of version 3.1.3, gawk fully complies with this aspect of the
standard. Here are some examples indicating the difference in behavior, on a GNU/Linux
system:
$ gawk ’BEGIN { printf "%g\n", 3.1415927 }’
a 3.14159
$ LC_ALL=en_DK gawk ’BEGIN { printf "%g\n", 3.1415927 }’
a 3,14159
$ echo 4,321 | gawk ’{ print $1 + 1 }’
a 5
$ echo 4,321 | LC_ALL=en_DK gawk ’{ print $1 + 1 }’
a 5,321
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,
it’s treated as the full number, ‘4.321’.
Chapter 5: Expressions 79
-17 % 8 = -1
In other awk implementations, the signedness of the remainder may be machine-
dependent.
NOTE: The POSIX standard only specifies the use of ‘^’ for exponentiation.
For maximum portability, do not use the ‘**’ operator.
print foo
foo = "bar"
print 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 value—the 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:
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]
}
Chapter 5: Expressions 83
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 haven’t been covered yet. See
Chapter 7 [Arrays in awk], page 116, and see Section 8.1.2 [Numeric Functions], page 127, 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 5.1 lists the arithmetic assignment operators. In each case, the righthand operand
is an expression whose value is converted to a number.
Operator Effect
lvalue += increment Adds increment to the value of lvalue.
lvalue -= decrement Subtracts decrement from the value of lvalue.
lvalue *= coefficient Multiplies the value of lvalue by coefficient.
lvalue /= divisor Divides the value of lvalue by divisor.
lvalue %= modulus Sets lvalue to its remainder by modulus.
lvalue ^= power
lvalue **= power Raises lvalue to the power power.
Table 5.1: Arithmetic Assignment Operators
NOTE: Only the ‘^=’ operator is specified by POSIX. For maximum portability,
do not use the ‘**=’ operator.
Advanced Notes: Syntactic Ambiguities Between ‘/=’ and Regular
Expressions
There is a syntactic ambiguity between the ‘/=’ assignment operator and regexp constants
whose first character is an ‘=’. This is most notable in commercial awk versions. For
example:
$ awk /==/ /dev/null
error awk: syntax error at source line 1
error context is
error >>> /= <<<
error awk: bailing out at source line 1
A workaround is:
awk ’/[=]=/’ /dev/null
gawk does not have this problem, nor do the other freely available versions described in
Section B.6 [Other Freely Available awk Implementations], page 277.
The operator used for adding one is written ‘++’. It can be used to increment a variable
either before or after taking its value. To pre-increment a variable v, write ‘++v’. This adds
one to the value of v—that new value is also the value of the expression. (The assignment
expression ‘v += 1’ is completely equivalent.) Writing the ‘++’ after the variable specifies
post-increment. This increments the variable value just the same; the difference is that the
value of the increment expression itself is the variable’s old value. Thus, if foo has the value
four, then the expression ‘foo++’ has the value four, but it changes the value of foo to five.
In other words, the operator returns the old value of the variable, but with the side effect
of incrementing it.
The post-increment ‘foo++’ is nearly the same as writing ‘(foo += 1) - 1’. It is not
perfectly equivalent because all numbers in awk are floating-point—in floating-point, ‘foo
+ 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 This expression increments lvalue, and the new value becomes the value of the
expression.
lvalue ++ This expression increments lvalue, but the value of the expression is the old
value of lvalue.
--lvalue This expression is like ‘++lvalue ’, but instead of adding, it subtracts. It decre-
ments lvalue and delivers the value that is the result.
lvalue-- This expression is like ‘lvalue ++’, but instead of adding, it subtracts. It decre-
ments lvalue. The value of the expression is the old value of lvalue.
In short, doing things like this is not recommended and definitely not anything that you
can rely upon for portability. You should avoid such things in your own programs.
}
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:
Expression Result
x <y True if x is less than y.
x <= y True if x is less than or equal to y.
x >y True if x is greater than y.
x >= y True if x is greater than or equal to y.
x == y True if x is equal to y.
x != y True if x is not equal to y.
x ~y True if the string x matches the regexp denoted by y.
x !~ y True if the string x does not match the regexp denoted by y.
subscript in array True if the array array has an element with the subscript subscript.
Table 5.2: Relational Operators
Comparison expressions have the value one if true and zero if false. When comparing
operands of mixed types, numeric operands are converted to strings using the value of
CONVFMT (see Section 5.4 [Conversion of Strings and Numbers], page 77).
Strings are compared by comparing the first character of each, then the second character
of each, and so on. Thus, "10" is less than "9". If there are two strings where one is a
prefix of the other, the shorter string is less than the longer one. Thus, "abc" is less than
"abcd".
It is very easy to accidentally mistype the ‘==’ operator and leave off one of the ‘=’
characters. The result is still valid awk code, but the program does not do what is intended:
if (a = b) # oops! should be a == b
...
3
The POSIX standard is under revision. The revised standard’s rules for typing and comparison are the
same as just described for gawk.
Chapter 5: Expressions 87
else
...
Unless b happens to be zero or the null string, the if part of the test always succeeds.
Because the operators are so similar, this kind of error is very difficult to spot when scanning
the source code.
The following table of expressions illustrates the kind of comparison gawk performs, as
well as what the result of the comparison is:
1.5 <= 2.0
numeric comparison (true)
"abc" >= "xyz"
string comparison (false)
1.5 != " +2"
string comparison (true)
"1e2" < "3"
string comparison (true)
a = 2; b = "2"
a == b string comparison (true)
a = 2; b = " +2"
a == b string comparison (false)
In the next 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 2.1 [How to Use Regular Expressions], page 24;
also see Section 2.8 [Using Dynamic Regexps], page 34).
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 5.2 [Using Regular Expression Constants],
page 74, where this is discussed in more detail.
88 GAWK: Effective AWK Programming
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.
NOTE: The next statement is discussed in Section 6.4.8 [The next Statement],
page 105. 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 it’s there is to avoid
printing the bracketing ‘START’ and ‘END’ lines.
A fixed set of functions are built-in, which means they are available in every awk program.
The sqrt function is one of these. See Section 8.1 [Built-in Functions], page 127, for a list
of built-in functions and their descriptions. In addition, you can define functions for use in
your program. See Section 8.2 [User-Defined Functions], page 149, 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 function’s 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 variable—a 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 8.1 [Built-in
Functions], page 127, 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 8.2 [User-Defined Functions], page 149).
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. A function can also have side effects, such as assigning values
to certain variables or doing I/O. 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
The normal precedence of the operators can be overruled by using parentheses. Think of
the precedence rules as saying where the parentheses are assumed to be. In fact, it is wise
to always use parentheses whenever there is an unusual combination of operators, because
other people who read the program may not remember what the precedence is in this case.
Even experienced programmers occasionally forget the exact rules, which leads to mistakes.
Explicit parentheses help prevent any such mistakes.
When operators of equal precedence are used together, the leftmost operator groups
first, except for the assignment, conditional, and exponentiation operators, which group in
the opposite order. Thus, ‘a - b + c’ groups as ‘(a - b) + c’ and ‘a = b = c’ groups as ‘a =
(b = c)’.
The precedence of prefix unary operators does not matter as long as only unary operators
are involved, because there is only one way to interpret them: innermost first. Thus, ‘$++i’
means ‘$(++i)’ and ‘++$x’ means ‘++($x)’. However, when another operator follows the
operand, then the precedence of the unary operators can matter. ‘$x^2’ means ‘($x)^2’,
but ‘-x^2’ means ‘-(x^2)’, because ‘-’ has lower precedence than ‘^’, whereas ‘$’ has higher
precedence. This table presents awk’s operators, in order of highest to lowest precedence:
(...) Grouping.
$ Field.
++ -- Increment, decrement.
^ ** Exponentiation. These operators group right-to-left.
+-! Unary plus, minus, logical “not.”
*/% Multiplication, division, modulus.
+- Addition, subtraction.
String Concatenation
No special symbol is used to indicate concatenation. The operands are simply
written side by side (see Section 5.6 [String Concatenation], page 80).
< <= == !=
> >= >> | |&
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”.
92 GAWK: Effective AWK Programming
|| Logical “or”.
?: Conditional. This operator groups right-to-left.
= += -= *=
/= %= ^= **=
Assignment. These operators group right to left.
NOTE: The ‘|&’, ‘**’, and ‘**=’ operators are not specified by POSIX. For
maximum portability, do not use them.
Chapter 6: Patterns, Actions, and Variables 93
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 2.8 [Using Dynamic Regexps], page 34). 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
a fooey 555-1234 2400/1200/300 B
The following command prints all records in ‘BBS-list’ that contain either ‘2400’ or
‘foo’ (or both, of course):
$ awk ’/2400/ || /foo/’ BBS-list
a alpo-net 555-3412 2400/1200/300 A
a bites 555-1675 2400/1200/300 A
a fooey 555-1234 2400/1200/300 B
a foot 555-6699 1200/300 B
a macfoo 555-6480 1200/300 A
a sdace 555-3430 2400/1200/300 A
a sabafoo 555-2127 1200/300 C
The following command prints all records in ‘BBS-list’ that do not contain the string
‘foo’:
$ awk ’! /foo/’ BBS-list
a aardvark 555-5553 1200/300 B
a alpo-net 555-3412 2400/1200/300 A
a barfly 555-7685 1200/300 A
a bites 555-1675 2400/1200/300 A
a camelot 555-0542 300 C
a core 555-2912 1200/300 C
a sdace 555-3430 2400/1200/300 A
The subexpressions of a Boolean operator in a pattern can be constant regular expres-
sions, comparisons, or any other awk expressions. Range patterns are not expressions, so
Chapter 6: Patterns, Actions, and Variables 95
they cannot appear inside Boolean patterns. Likewise, the special patterns BEGIN and END,
which never match any input record, are not expressions and cannot appear inside Boolean
patterns.
$ awk ’
> BEGIN { print "Analysis of \"foo\"" }
> /foo/ { ++n }
> END { print "\"foo\" appears", n, "times." }’ BBS-list
a Analysis of "foo"
a "foo" appears 4 times.
This program finds the number of records in the input file ‘BBS-list’ that contain
the string ‘foo’. The BEGIN rule prints a title for the report. There is no need to use
the BEGIN rule to initialize the counter n to zero, since awk does this automatically (see
Section 5.3 [Variables], page 76). The second rule increments the variable n every time a
record containing the pattern ‘foo’ is read. The END rule prints the value of n at the end of
the run.
The special patterns BEGIN and END cannot be used in ranges or with Boolean operators
(indeed, they cannot be used with any operators). An awk program may have multiple
BEGIN and/or END rules. They are executed in the order in which they appear: all the
BEGIN rules at startup and all the END rules at termination. BEGIN and END rules may
be intermixed with other rules. This feature was added in the 1987 version of awk and is
included in the POSIX standard. The original (1978) version of awk required the BEGIN
rule to be placed at the beginning of the program, the END rule to be placed at the end,
and only allowed one of each. This is no longer required, but it is a good idea to follow this
template in terms of program organization and readability.
Multiple BEGIN and END rules are useful for writing library functions, because each library
file can have its own BEGIN and/or END rule to do its own initialization and/or cleanup. The
order in which library functions are named on the command line controls the order in which
their BEGIN and END rules are executed. Therefore, you have to be careful when writing
such rules in library files so that the order in which they are executed doesn’t matter. See
Section 11.2 [Command-Line Options], page 173, for more information on using library
functions. See Chapter 12 [A Library of awk Functions], page 181, for a number of useful
library functions.
Chapter 6: Patterns, Actions, and Variables 97
If an awk program has only a BEGIN rule 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 most common method is to use shell quoting to substitute the variable’s value into
the program inside the script. For example, in the following program:
echo -n "Enter search pattern: "
read pattern
awk "/$pattern/ "’{ nmatches++ }
END { print nmatches, "found" }’ /path/to/data
the awk program consists of two pieces of quoted text that are concatenated together to
form the program. The first part is double-quoted, which allows substitution of the pattern
variable inside the quotes. The second part is single-quoted.
Variable substitution via quoting works, but can be potentially messy. It requires a good
understanding of the shell’s quoting rules (see Section 1.1.6 [Shell-Quoting Issues], page 14),
and it’s often difficult to correctly match up the quotes when reading the program.
A better method is to use awk’s variable assignment feature (see Section 5.3.2 [Assigning
Variables on the Command Line], page 76) to assign the shell variable’s value to an awk
variable’s value. Then use dynamic regexps to match the pattern (see Section 2.8 [Using
Dynamic Regexps], page 34). The following shows how to redo the previous example using
this technique:
echo -n "Enter search pattern: "
read pattern
awk -v pat="$pattern" ’$0 ~ pat { nmatches++ }
END { print nmatches, "found" }’ /path/to/data
Now, the awk program is just one single-quoted string. The assignment ‘-v
pat="$pattern"’ still requires double quotes, in case there is whitespace in the value
of $pattern. The awk variable pat could be named pattern too, but that would be
more confusing. Using a variable also provides more flexibility, since the variable can be
used anywhere inside the program—for printing, as an array subscript, or for any other
use—without requiring the quoting tricks at every point in the program.
6.3 Actions
An awk program or script consists of a series of rules and function definitions interspersed.
(Functions are described later. See Section 8.2 [User-Defined Functions], page 149.) 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 }’:
Chapter 6: Patterns, Actions, and Variables 99
if (x % 2 == 0)
print "x is even"
else
print "x is odd"
In this example, if the expression ‘x % 2 == 0’ is true (that is, if the value of x is evenly
divisible by two), then the first print statement is executed; otherwise, the second print
statement is executed. If the else keyword appears on the same line as then-body and
then-body is not a compound statement (i.e., not surrounded by curly braces), then a
semicolon must separate then-body from the else. To illustrate this, the previous example
can be rewritten as:
if (x % 2 == 0) print "x is even"; else
print "x is odd"
If the ‘;’ is left out, awk can’t interpret the statement and it produces a syntax error. Don’t
actually write programs this way, because a human reader might fail to see the else if it is
not the first thing on its line.
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 C’s 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 6.4.7 [The continue
Statement], page 104) 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.
}
Control flow in the switch statement works as it does in C. Once a match to a given
case is made, case statement bodies are executed 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.
Th 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 has no meaning when used outside the body of a loop. 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 6.4.8 [The next
Statement], page 105). Recent versions of Unix awk no longer allow this usage. gawk
supports this use of break only if ‘--traditional’ has been specified on the command line
(see Section 11.2 [Command-Line Options], page 173). Otherwise, it is treated as an error,
since the POSIX standard specifies that break should only be used inside the body of a
loop.
next statement inside a function body reads the next record and starts processing it with
the first rule in the program. If the next statement causes the end of the input to be
reached, then the code in any END rules is executed. See Section 6.1.4 [The BEGIN and END
Special Patterns], page 96.
When an exit statement is executed from a BEGIN rule, the program stops processing
everything immediately. No input records are read. However, if an END rule is present, as
part of executing the exit statement, the END rule is executed (see Section 6.1.4 [The BEGIN
and END Special Patterns], page 96). If exit is used as part of an END rule, it causes the
program to stop immediately.
An exit statement that is not part of a BEGIN or END rule stops the execution of any
further automatic rules for the current record, skips reading any remaining input records,
and executes the END rule if there is one.
In such a case, if you don’t want the END rule to do its job, set a variable to nonzero before
the exit statement and check that variable in the END rule. See Section 12.2.3 [Assertions],
page 185, for an example that does this.
If an argument is supplied to exit, its value is used as the exit status code for the awk
process. If no argument is supplied, exit returns status zero (success). In the case where
an argument is supplied to a first exit statement, and then exit is called a second time
from an END rule with no argument, awk uses the previously supplied exit value.
For example, suppose an error condition occurs that is difficult or impossible to handle.
Conventionally, programs report this by exiting with a nonzero status. An awk program
can do this using an exit statement with a nonzero argument, as shown in the following
example:
BEGIN {
if (("date" | getline date_now) <= 0) {
print "Can’t get system date" > "/dev/stderr"
exit 1
}
print "current date is", date_now
close("date")
}
or "w" specify that input files and output files, respectively, should use binary
I/O. A string value of "rw" or "wr" indicates that all files should use binary
I/O. Any other string value is equivalent to "rw", but gawk generates a warning
message. BINMODE is described in more detail in Section B.3.3.4 [Using gawk on
PC Operating Systems], page 270.
This variable is a gawk extension. In other awk implementations (except mawk,
see Section B.6 [Other Freely Available awk Implementations], page 277), or
if gawk is in compatibility mode (see Section 11.2 [Command-Line Options],
page 173), it is not special.
CONVFMT This string controls conversion of numbers to strings (see Section 5.4 [Con-
version of Strings and Numbers], page 77). It works by being passed, in ef-
fect, as the first argument to the sprintf function (see Section 8.1.3 [String-
Manipulation Functions], page 129). 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 for field splitting. See Section 3.6 [Reading Fixed-Width Data], page 47,
for more information.
If gawk is in compatibility mode (see Section 11.2 [Command-Line Options],
page 173), then FIELDWIDTHS has no special meaning, and field-splitting oper-
ations occur based exclusively on the value of FS.
FS This is the input field separator (see Section 3.5 [Specifying How Fields Are Sep-
arated], page 43). The value is a single-character string or a multi-character reg-
ular 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.)
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 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, split, and sub functions,
record termination with RS, and field splitting with FS, all ignore case when
2
In POSIX awk, newline does not count as whitespace.
Chapter 6: Patterns, Actions, and Variables 109
the expression foo["A", "B"] really accesses foo["A\034B"] (see Section 7.9
[Multidimensional Arrays], page 122).
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 9 [Internationalization with gawk], page 156). 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 11.2 [Command-Line Options], page 173),
it is not special.
ARGC, ARGV
The command-line arguments available to awk programs are stored in an array
called ARGV. ARGC is the number of command-line arguments present. See
Section 11.3 [Other Command-Line Arguments], page 178. Unlike most awk
arrays, ARGV is indexed from 0 to ARGC − 1. In the following example:
$ awk ’BEGIN {
> for (i = 0; i < ARGC; i++)
> print ARGV[i]
> }’ inventory-shipped BBS-list
a awk
a inventory-shipped
a BBS-list
ARGV[0] contains "awk", ARGV[1] contains "inventory-shipped", and
ARGV[2] contains "BBS-list". The value of ARGC is three, one more than the
index of the last element in ARGV, because the elements are numbered from
zero.
The names ARGC and ARGV, as well as the convention of indexing the array
from 0 to ARGC − 1, are derived from the C language’s 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 awk’s command-
line options. See Section 6.5.3 [Using ARGC and ARGV], page 113, 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.
Chapter 6: Patterns, Actions, and Variables 111
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 11.2 [Command-Line Options], page 173),
it is not special.
ENVIRON An associative array that contains 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 11.4
[The AWKPATH Environment Variable], page 178).
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.
ERRNO works similarly to the C variable errno. In particular 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 11.2 [Command-Line Options], page 173),
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
is set to "-". FILENAME is changed each time a new file is read (see Chapter 3
[Reading Input Files], page 36). 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 3.8 [Explicit Input with getline], page 51) 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 3.8 [Explicit Input with getline], page 51). 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 3.2
[Examining Fields], page 39).
Unlike most of the variables described in this section, assigning a value to NF has
the potential to affect awk’s internal workings. In particular, assignments to NF
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.
112 GAWK: Effective AWK Programming
can be used to create or remove fields from the current record: See Section 3.4
[Changing the Contents of a Field], page 41.
NR The number of input records awk has processed since the beginning of the
program’s execution (see Section 3.1 [How Input Is Split into Records], page 36).
NR is incremented each time a new record is read.
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, or it is
"FIELDWIDTHS" if field splitting with FIELDWIDTHS 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.
PROCINFO["uid"]
The value of the getuid system call.
PROCINFO["version"]
The version of gawk. This is available from version 3.1.4 and later.
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 7.2
[Referring to an Array Element], page 117).
This array is a gawk extension. In other awk implementations, or if gawk is in
compatibility mode (see Section 11.2 [Command-Line Options], page 173), it is
not special.
RLENGTH The length of the substring matched by the match function (see Section 8.1.3
[String-Manipulation Functions], page 129). 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 The start-index in characters of the substring that is matched by the match
function (see Section 8.1.3 [String-Manipulation Functions], page 129). RSTART
Chapter 6: Patterns, Actions, and Variables 113
is set by invoking the match function. Its value is the position of the string
where the matched substring starts, or zero if no match was found.
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 11.2 [Command-Line Options], page 173),
it is not special.
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 -d -v file1 file2 ...
Because ‘-d’ is not a valid gawk option, it and the following ‘-v’ are passed on to the awk
program.
116 GAWK: Effective AWK Programming
7 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 finishes with a discussion of gawk’s facility for sorting an array
based on its indices.
awk maintains a single set of names that may be used for naming variables, arrays, and
functions (see Section 8.2 [User-Defined Functions], page 149). Thus, you cannot have a
variable and an array with the same name in the same awk program.
To determine whether an element exists in an array at a certain index, use the following
expression:
index in array
This expression tests whether the particular index exists, without the side effect of creating
that element if it is not present. The expression has the value one (true) if array [index ]
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."
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 line’s 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:
Chapter 7: Arrays in awk 119
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 8.1.3 [String-Manipulation Functions], page 129) 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 array’s name as a scalar (i.e., a regular variable). For example, the following
does not work:
a[1] = 3; delete a; a = 3
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 which sometimes
can have a subtle effect on your programs.
is used as a single index into an ordinary, one-dimensional array. The separator used is the
value of the built-in variable SUBSEP.
For example, suppose we evaluate the expression ‘foo[5,12] = "value"’ when the value
of SUBSEP is "@". The numbers 5 and 12 are converted to strings and concatenated with an
‘@’ between them, yielding "5@12"; thus, the array element foo["5@12"] is set to "value".
Once the element’s value is stored, awk has no record of whether it was stored with a sin-
gle index or a sequence of indices. The two expressions ‘foo[5,12]’ and ‘foo[5 SUBSEP 12]’
are always equivalent.
The default value of SUBSEP is the string "\034", which contains a nonprinting character
that is unlikely to appear in an awk program or in most input data. The usefulness of
choosing an unlikely character comes from the fact that index values that contain a string
matching SUBSEP can lead to combined strings that are ambiguous. Suppose that SUBSEP
is "@"; then ‘foo["a@b", "c"]’ and ‘foo["a", "b@c"]’ are indistinguishable because both
are actually stored as ‘foo["a@b@c"]’.
To test whether a particular index sequence exists in a multidimensional array, use the
same operator (‘in’) that is used for single dimensional arrays. Write the whole sequence
of indices in parentheses, separated by commas, as the left operand:
(subscript1, subscript2, ...) in array
The following example treats its input as a two-dimensional array of fields; it rotates
this array 90 degrees clockwise and prints the result. It assumes that all lines have the same
number of elements:
{
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
124 GAWK: Effective AWK Programming
6 5 4 3
1 6 5 4
2 1 6 5
3 2 1 6
END {
n = asorti(source, dest)
for (i = 1; i <= n; i++) {
do something with dest[i] Work with sorted indices di-
rectly
...
do something with source[dest[i]] Access original array via sorted in-
dices
}
}
If your version of gawk is 3.1.0 or 3.1.1, you don’t have asorti. Instead, use a helper
array to hold the sorted index values, and then access the original array’s elements. It works
in the following way:
populate the array data
# copy indices
j = 1
for (i in data) {
ind[j] = i # index value becomes element value
j++
}
n = asort(ind) # index values are now sorted
for (i = 1; i <= n; i++) {
do something with ind[i] Work with sorted indices directly
...
do something with data[ind[i]] Access original array via sorted in-
dices
}
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.
Copying array indices and elements isn’t 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
126 GAWK: Effective AWK Programming
arrays use the values. Similarly, when copying the indices from data to ind, there is only
one copy of the actual index strings.
We said previously that comparisons are done using gawk’s “usual comparison rules.”
Because IGNORECASE affects string comparisons, the value of IGNORECASE also affects sorting
for both asort and asorti. Caveat Emptor.
Chapter 8: Functions 127
8 Functions
This chapter describes awk’s 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, 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.
int(x ) This returns 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.
sqrt(x ) This returns the positive square root of x. gawk reports an error if x is negative.
Thus, sqrt(4) is 2.
exp(x ) This returns the exponential of x (e ^ x ) or reports an error if x is out of
range. The range of values x can have depends on your machine’s floating-
point representation.
log(x ) This returns the natural logarithm of x, if x is positive; otherwise, it reports an
error.
sin(x ) This returns the sine of x, with x in radians.
cos(x ) This returns the cosine of x, with x in radians.
atan2(y, x )
This returns the arctangent of y / x in radians.
rand() This returns a random number. The values of rand are uniformly distributed
between zero and one. The value could be zero but is never one.1
Often random integers are needed instead. Following is a user-defined function
that can be used to obtain a random non-negative integer less than n:
function randint(n) {
return int(n * rand())
}
The multiplication produces a random number greater than zero and less than
n. Using int, this result is made into an integer between zero and n − 1,
inclusive.
The following example uses a similar function to produce random integers be-
tween one and n. This program prints a new random number for each input
record:
# Function to roll a simulated die.
function roll(n) { return 1 + int(rand() * n) }
a program generates the same results each time you run it. The numbers are
random within one awk run but predictable from run to run. This is convenient
for debugging, but if you want a program to do different things each time it is
used, you must change the seed to a value that is different in each run. To do
this, use srand.
srand([x ])
The function srand sets the starting point, or seed, for generating random
numbers to the value x.
Each seed value leads to a particular sequence of random numbers.2 Thus, if
the seed is set to the same value a second time, the same sequence of random
numbers is produced again.
Different awk implementations use different random-number generators inter-
nally. Don’t 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.
a[2] = "de"
a[3] = "sac"
The asort function is described in more detail in Section 7.11 [Sorting Array
Values and Indices with gawk], page 124. asort is a gawk extension; it is not
available in compatibility mode (see Section 11.2 [Command-Line Options],
page 173).
asorti(source [, dest ]) #
asorti is a gawk-specific extension, returning the number of elements in the
array source. It works similarly to asort, however, the indices are sorted,
instead of the values. As array indices are always strings, the comparison
performed is always a string comparison. (Here too, IGNORECASE affects the
sorting.)
The asorti function is described in more detail in Section 7.11 [Sorting Array
Values and Indices with gawk], page 124. It was added in gawk 3.1.2. asorti
is a gawk extension; it is not available in compatibility mode (see Section 11.2
[Command-Line Options], page 173).
index(in, find )
This searches the string in for the first occurrence of the string find, and re-
turns 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 ])
This returns 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 5. By contrast, length(15 * 35) works out to 3. 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 marked as “deprecated” in
the POSIX standard. This means that while a program can do
this, it is a feature that can eventually be removed from a future
version of the standard. Therefore, for programs to be maximally
portable, always supply the parentheses.
match(string, regexp [, array ])
The match function searches string for the longest, leftmost substring matched
by the regular expression, regexp. It returns the character position, or index,
at which that substring begins (one, if it starts at the beginning of string). If
no match is found, it returns zero.
The regexp argument may be either a regexp constant (‘/.../’) or a string
constant (". . . "). In the latter case, the string is treated as a regexp to be
Chapter 8: Functions 131
matched. Section 2.8 [Using Dynamic Regexps], page 34, for a discussion of the
difference between the two forms, and the implications for writing your program
correctly.
The order of the first two arguments is backwards from most other string func-
tions that work with regular expressions, such as sub and gsub. It might help to
remember that for match, the order is the same as for the ‘~’ operator: ‘string
~ regexp ’.
The match function sets the built-in variable RSTART to the index. It also
sets the built-in variable RLENGTH to the length in characters of the matched
substring. If no match is found, RSTART is set to zero, and RLENGTH to −1.
For example:
{
if ($1 == "FIND")
regex = $2
else {
where = match($0, regex)
if (where != 0)
print "Match of", regex, "found at",
where, "in", $0
}
}
This program looks for lines that match the regular expression stored in the
variable regex. This regular expression can be changed. If the first word on a
line is ‘FIND’, regex is changed to be the second word on that line. Therefore,
if given:
FIND ru+n
My program runs
but not very quickly
FIND Melvin
JF+KM
This line is property of Reality Engineering Co.
Melvin was here.
awk prints:
Match of ru+n found at 12 in My program runs
Match of Melvin found at 1 in Melvin was here.
If array is present, it is cleared, and then the 0th element of array is set to
the entire portion of string matched by regexp. If regexp contains parentheses,
the integer-indexed elements of array are set to contain the portion of string
matching the corresponding parenthesized subexpression. For example:
$ echo foooobazbarrrrr |
> gawk ’{ match($0, /(fo+).+(bar*)/, arr)
> print arr[1], arr[2] }’
a foooo barrrrr
In addition, beginning with gawk 3.1.2, multidimensional subscripts are avail-
able providing the start index and length of each matched subexpression:
132 GAWK: Effective AWK Programming
$ echo foooobazbarrrrr |
> gawk ’{ match($0, /(fo+).+(bar*)/, arr)
> print arr[1], arr[2]
> print arr[1, "start"], arr[1, "length"]
> print arr[2, "start"], arr[2, "length"]
> }’
a foooo barrrrr
a 1 5
a 9 7
There may not be subscripts for the start and index for every parenthesized
subexpressions, since they may not all have matched text; thus they should be
tested for with the in operator (see Section 7.2 [Referring to an Array Element],
page 117).
The array argument to match is a gawk extension. In compatibility mode (see
Section 11.2 [Command-Line Options], page 173), using a third argument is a
fatal error.
split(string, array [, fieldsep ])
This function divides string into pieces separated by fieldsep and stores the
pieces in array. The first piece is stored in array [1], the second piece in
array [2], and so forth. The string value of the third argument, fieldsep, is a
regexp describing where to split string (much as FS can be a regexp describing
where to split input records). If fieldsep is omitted, the value of FS is used.
split returns the number of elements created.
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, "-")
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"
The value returned by this call to split is three.
As with input field-splitting, when the value of fieldsep is " ", leading and trail-
ing whitespace is ignored, 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. (This is a gawk-specific
extension.)
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. Section 2.8 [Using Dynamic Regexps], page 34, for a discussion
of the difference between using a string constant or a regexp constant, and the
implications for writing your program correctly.
Chapter 8: Functions 133
Before splitting the string, split deletes any previously existing elements in
the array array.
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 7.6 [The delete Statement],
page 120.)
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, ...)
This returns (without printing) the string that printf would have printed out
with the same arguments (see Section 4.5 [Using printf Statements for Fancier
Printing], page 60). For example:
pival = sprintf("pi = %.2f (approx.)", 22/7)
assigns the string "pi = 3.14 (approx.)" to the variable pival.
strtonum(str ) #
Examines str and returns its numeric value. If str begins with a leading ‘0’,
strtonum assumes that str is an octal number. If str begins with a leading ‘0x’
or ‘0X’, strtonum assumes that str is a hexadecimal number. For example:
$ echo 0x11 |
> gawk ’{ printf "%d\n", strtonum($1) }’
a 17
Using the strtonum function is not the same as adding zero to a string value;
the automatic coercion of strings to numbers works only for decimal data, not
for octal or hexadecimal.3
strtonum is a gawk extension; it is not available in compatibility mode (see
Section 11.2 [Command-Line Options], page 173).
sub(regexp, replacement [, target ])
The sub function alters the value of target. It searches this value, which is
treated as a string, for the leftmost, longest substring matched by the regular
expression regexp. Then the entire string is changed by replacing the matched
text with replacement. The modified string becomes the new value of target.
The regexp argument may be either a regexp constant (‘/.../’) or a string
constant (". . . "). In the latter case, the string is treated as a regexp to be
matched. Section 2.8 [Using Dynamic Regexps], page 34, for a discussion of the
difference between the two forms, and the implications for writing your program
correctly.
This function is peculiar because target is not simply used to compute a value,
and not just any expression will do—it must be a variable, field, or array element
so that sub can store a modified value there. If this argument is omitted, then
the default is to use and alter $0.4 For example:
3
Unless you use the ‘--non-decimal-data’ option, which isn’t recommended. See Section 10.1 [Allowing
Nondecimal Input Data], page 165, for more information.
4
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 substituion, even if the operation is a “no-op”
such as ‘sub(/^/, "")’.
134 GAWK: Effective AWK Programming
replaces all occurrences of the string ‘Britain’ with ‘United Kingdom’ for all
input records.
The gsub function returns the number of substitutions made. If the variable to
search and alter (target) is omitted, then the entire input record ($0) is used.
As in sub, the characters ‘&’ and ‘\’ are special, and the third argument must
be assignable.
8.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.
5
This is different from C and C++, in which the first character is number zero.
Chapter 8: Functions 137
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 2.2 [Escape Sequences],
page 25. Thus, for every ‘\’ that awk processes at the runtime level, type two backslashes
at the lexical level. When a character that is not valid for an escape sequence follows the
‘\’, Unix 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 8.1.
Table 8.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 1992 POSIX standard attempted to fix this problem. That standard says that sub
and gsub look for either a ‘\’ or an ‘&’ after the ‘\’. If either one follows a ‘\’, that character
is output literally. The interpretation of ‘\’ and ‘&’ then becomes as shown in Table 8.2.
138 GAWK: Effective AWK Programming
Table 8.2: 1992 POSIX Rules for sub and gsub Escape Sequence Processing
This appears to solve the problem. Unfortunately, the phrasing of the standard is unusual.
It says, in effect, that ‘\’ turns off the special meaning of any following character, but for
anything other than ‘\’ and ‘&’, such special meaning is undefined. This wording leads to
two problems:
• Backslashes must now be doubled in the replacement string, breaking historical awk
programs.
• To make sure that an awk program is portable, every character in the replacement
string must be preceded with a backslash.6
Because of the problems just listed, in 1996, the gawk maintainer submitted proposed
text for a revised standard that reverts to rules that correspond more closely to the original
existing practice. The proposed rules have special cases that make it possible to produce a
‘\’ preceding the matched text. This is shown in Table 8.3.
close(filename [, how ])
Close the file filename for input or output. Alternatively, the argument may be
a shell command that was used for creating a coprocess, or for redirecting to
or from a pipe; then the coprocess or pipe is closed. See Section 4.8 [Closing
Input and Output Redirections], page 70, for more information.
When closing a coprocess, it is occasionally useful to first close one end of the
two-way pipe and then to close the other. This is done by providing a second
argument to close. This second argument should be one of the two string
values "to" or "from", indicating which end of the pipe to close. Case in
the string does not matter. See Section 10.2 [Two-Way Communications with
Another Process], page 166, which discusses this feature in more detail and
gives an example.
fflush([filename ])
Flush any buffered output associated with filename, which is either a file opened
for writing or a shell command for redirecting output to a pipe or coprocess.
Many utility programs buffer their output; i.e., they save information to write
to a disk file or terminal in memory until there is enough for it to be worthwhile
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
function—gawk also buffers its output and the fflush function forces gawk to
flush its buffers.
fflush was added to the Bell Laboratories research 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 11.2 [Command-Line Options],
page 173).
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.
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.
Chapter 8: Functions 141
system(command )
Executes operating-system commands and then returns to the awk program.
The system function executes the command given by the string command. It
returns the status returned by the command that was executed as its value.
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 cranking up
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.
8
See [Glossary], page 299, especially the entries “Epoch” and “UTC.”
Chapter 8: Functions 143
they are not specified in the POSIX standard, nor are they in any other known version of
awk.9 Optional parameters are enclosed in square brackets ([ ]):
systime()
This function returns the current time as the number of seconds since the
system epoch. On POSIX systems, this is the number of seconds since 1970-
01-01 00:00:00 UTC, not counting leap seconds. It may be a different number
on other systems.
mktime(datespec )
This function turns datespec into a timestamp in the same form as is returned
by systime. It is similar to the function of the same name in ISO C. The
argument, datespec, is a string of the form "YYYY MM DD HH MM SS [DST ]".
The string consists of six or seven numbers representing, respectively, the full
year including century, the month from 1 to 12, the day of the month from 1
to 31, the hour of the day from 0 to 23, the minute from 0 to 59, the second
from 0 to 60,10 and an optional daylight-savings flag.
The values of these numbers need not be within the ranges specified; for exam-
ple, an hour of −1 means 1 hour before midnight. The origin-zero Gregorian
calendar is assumed, with year 0 preceding year 1 and year −1 preceding year
0. The time is assumed to be in the local timezone. If the daylight-savings flag
is positive, the time is assumed to be daylight savings time; if zero, the time is
assumed to be standard time; and if negative (the default), mktime attempts
to determine whether daylight savings time is in effect for the specified time.
If datespec does not contain enough elements or if the resulting time is out of
range, mktime returns −1.
strftime([format [, timestamp ]])
This function returns a string. It is similar to the function of the same name
in ISO C. The time specified by timestamp is used to produce a string, based
on the contents of the format string. The timestamp is in the same format
as the value returned by the systime function. If no timestamp argument is
supplied, gawk uses the current time of day as the timestamp. If no format
argument is supplied, strftime uses "%a %b %d %H:%M:%S %Z %Y". This format
string produces output that is (almost) equivalent to that of the date utility.
(Versions of gawk prior to 3.0 require the format argument.)
The systime function allows you to compare a timestamp from a log file with the
current time of day. In particular, it is easy to determine how long ago a particular record
was logged. It also allows you to produce log records using the “seconds since the epoch”
format.
The mktime function allows you to convert a textual representation of a date and time
into a timestamp. This makes it easy to do before/after comparisons of dates and times,
particularly when dealing with date and time data coming from an external source, such as
a log file.
9
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.
10
Occasionally there are minutes in a year with a leap second, which is why the seconds can go up to 60.
144 GAWK: Effective AWK Programming
The strftime function allows you to easily turn a timestamp into human-readable
information. It is similar in nature to the sprintf function (see Section 8.1.3 [String-
Manipulation Functions], page 129), in that it copies nonformat specification characters
verbatim to the returned string, while substituting date and time values for format specifi-
cations in the format string.
strftime is guaranteed by the 1999 ISO C standard11 to support the following date
format specifications:
%a The locale’s abbreviated weekday name.
%A The locale’s full weekday name.
%b The locale’s abbreviated month name.
%B The locale’s full month name.
%c The locale’s “appropriate” date and time representation. (This is ‘%A %B %d %T
%Y’ in the "C" locale.)
%C The century. This is the year divided by 100 and truncated to the next lower
integer.
%d The day of the month as a decimal number (01–31).
%D Equivalent to specifying ‘%m/%d/%y’.
%e The day of the month, padded with a space if it is only one digit.
%F Equivalent to specifying ‘%Y-%m-%d’. This is the ISO 8601 date format.
%g The year modulo 100 of the ISO 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
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 The full year of the ISO week number, as a decimal number.
%h Equivalent to ‘%b’.
%H The hour (24-hour clock) as a decimal number (00–23).
%I The hour (12-hour clock) as a decimal number (01–12).
%j The day of the year as a decimal number (001–366).
%m The month as a decimal number (01–12).
%M The minute as a decimal number (00–59).
%n A newline character (ASCII LF).
%p The locale’s equivalent of the AM/PM designations associated with a 12-hour
clock.
%r The locale’s 12-hour clock time. (This is ‘%I:%M:%S %p’ in the "C" locale.)
11
As this is a recent standard, not every system’s strftime necessarily supports all of the conversions
listed here.
Chapter 8: Functions 145
case $1 in
-u) TZ=UTC0 # use UTC
export TZ
shift ;;
esac
gawk ’BEGIN {
format = "%a %b %d %H:%M:%S %Z %Y"
exitval = 0
if (ARGC > 2)
exitval = 1
Chapter 8: Functions 147
else if (ARGC == 2) {
format = ARGV[1]
if (format ~ /^\+/)
format = substr(format, 2) # remove leading +
}
print strftime(format)
exit exitval
}’ "$@"
Bit operator
AND OR XOR
Operands 0 1 0 1 0 1
0 0 0 0 1 0 1
1 0 1 1 1 1 0
Table 8.6: Bitwise Operations
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:
14
This example shows that 0’s come in on the left side. For gawk, this is always true, but in some languages,
it’s possible to have the left side fill with 1’s. Caveat emptor.
148 GAWK: Effective AWK Programming
lshift(val, count ) Returns the value of val, shifted left by count bits.
rshift(val, count ) Returns the value of val, shifted right by count bits.
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 don’t understand this paragraph, don’t worry about it.)
Here is a user-defined function (see Section 8.2 [User-Defined Functions], page 149) that
illustrates the use of these functions:
# bits2str --- turn a byte into readable 1’s and 0’s
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"
Chapter 8: Functions 149
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.
The main code in the BEGIN rule shows the difference between the decimal and octal
values for the same numbers (see Section 5.1.2 [Octal and Hexadecimal Numbers], page 73),
and then demonstrates the results of the compl, lshift, and rshift functions.
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.)
To ensure that your awk programs are portable, always use the keyword function when
defining a function.
{
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 called
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 11.2 [Command-Line Options], page 173), gawk
reports calls to undefined functions.
154 GAWK: Effective AWK Programming
Some awk implementations generate a runtime error if you use the next statement (see
Section 6.4.8 [The next Statement], page 105) inside a user-defined function. gawk does not
have this limitation.
{
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 99385 is the largest number in the array.
BEGIN {
b = 1
foo(b) # invalid: fatal type mismatch
4. For each language with a translator, ‘guide.po’ is copied and translations are created
and shipped with the application.
5. Each language’s ‘.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 application’s 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(gettext("Don’t 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)
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 day in a date, local month abbreviations, and so on.
LC_ALL All of the above. (Not too useful in the context of gettext.)
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 6.1.4 [The BEGIN and END Special Patterns], page 96), or it
can also be done via the ‘-v’ command-line option (see Section 11.2 [Command-Line
Options], page 173):
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 9.5 [A Simple Internationalization Example], page 162, for an example pro-
gram showing the steps to create and use translations from awk.
gawk’s ‘--gen-po’ command-line option extracts the messages and is discussed next.
After that, printf’s ability to rearrange the order for printf arguments at runtime is
covered.
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")
> }’
a hello
a hello
NOTE: When using ‘*’ with a positional specifier, the ‘*’ comes first, then the
integer position, and then the ‘$’. This is somewhat counterintutive.
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. It’s still a bad idea to try
mixing them, even if gawk doesn’t detect it.
Although positional specifiers can be used directly in awk programs, their primary pur-
pose is to help in producing correct translations of format strings into languages different
from the one in which the program is first written.
#: guide.awk:5
msgid "The Answer Is"
msgstr ""
This original portable object file is saved and reused for each language into which the
application is translated. The msgid is the original string and the msgstr is the translation.
Chapter 9: Internationalization with gawk 163
NOTE: Strings not marked with a leading underscore do not appear in the
‘guide.po’ file.
Next, the messages must be translated. Here is a translation to a hypothetical dialect
of English, called “Mellow”:6
$ cp guide.po guide-mellow.po
Add translations to guide-mellow.po ...
Following are the translations:
#: guide.awk:4
msgid "Don’t Panic"
msgstr "Hey man, relax!"
#: guide.awk:5
msgid "The Answer Is"
msgstr "Like, the scoop is"
The next step is to make the directory to hold the binary message object file and then to
create the ‘guide.mo’ file. The directory layout shown here is standard for GNU gettext
on GNU/Linux systems. Other versions of gettext may use a different layout:
$ mkdir en_US en_US/LC_MESSAGES
The msgfmt utility does the conversion from human-readable ‘.po’ file to machine-
readable ‘.mo’ file. By default, msgfmt creates a file named ‘messages’. This file must
be renamed and placed in the proper directory so that gawk can find it:
$ msgfmt guide-mellow.po
$ mv messages en_US/LC_MESSAGES/guide.mo
Finally, we run the program to test it:
$ gawk -f guide.awk
a Hey man, relax!
a Like, the scoop is 42
a Pardon me, Zaphod who?
If the three replacement functions for dcgettext, dcngettext and bindtextdomain (see
Section 9.4.3 [awk Portability Issues], page 161) are in a file named ‘libintl.awk’, then we
can run ‘guide.awk’ unchanged as follows:
$ gawk --posix -f guide.awk -f libintl.awk
a Don’t Panic
a The Answer Is 42
a Pardon me, Zaphod who?
If a translation of gawk’s messages exists, then gawk produces usage messages, warnings,
and fatal errors in the local language.
On systems that do not use version 2 (or later) of the GNU C library, you should configure
gawk with the ‘--with-included-gettext’ option before compiling and installing it. See
Section B.2.2 [Additional Configuration Options], page 264, for more information.
Chapter 10: Advanced Features of gawk 165
This program reads the current date and time from the local system’s 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.
/foo/ {
print "matched /foo/, gosh"
for (i = 1; i <= 3; i++)
sing()
}
{
if (/foo/)
print "if is true"
else
print "else is true"
170 GAWK: Effective AWK Programming
# BEGIN block(s)
BEGIN {
1 print "First BEGIN rule"
1 print "Second BEGIN rule"
}
# Rule(s)
5 /foo/ { # 2
2 print "matched /foo/, gosh"
6 for (i = 1; i <= 3; i++) {
6 sing()
}
}
5 {
5 if (/foo/) { # 2
2 print "if is true"
3 } else {
3 print "else is true"
}
}
# END block(s)
Chapter 10: Advanced Features of gawk 171
END {
1 print "First END rule"
1 print "Second END rule"
}
6 function sing(dummy)
{
6 print "I gotta be me!"
}
This example illustrates many of the basic rules for profiling output. The rules are as
follows:
• The program is printed in the order BEGIN rule, pattern/action rules, END rule and
functions, listed alphabetically. Multiple BEGIN and END rules are merged together.
• Pattern-action rules have two counts. The first count, to the left of the rule, shows
how many times the rule’s pattern was tested. The second count, to the right of the
rule’s opening left brace in a comment, shows how many times the rule’s action was
executed. The difference between the two indicates how many times the rule’s 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 if’s 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 can’t 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)’.
• All string concatenations are parenthesized too. (This could be made a bit smarter.)
• 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
isn’t 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
172 GAWK: Effective AWK Programming
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 and END 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 --
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-DOS or MS-Windows, 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 don’t 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-hCi
or Ctrl-hBREAKi key, while the QUIT signal is generated by the Ctrl-h“i key.
Chapter 11: Running awk and gawk 173
This chapter covers how to run awk, both POSIX-standard and gawk-specific command-line
options, and what awk and gawk do with non-option arguments. It then proceeds to cover
how gawk searches for source files, obsolete options and/or features, and known bugs in
gawk. This chapter rounds out the discussion of awk as a program and as a language.
While a number of the options and features described here were discussed in passing
earlier in the book, this chapter provides the full details.
-F fs
--field-separator fs
Sets the FS variable to fs (see Section 3.5 [Specifying How Fields Are Separated],
page 43).
-f source-file
--file source-file
Indicates that the awk program is to be found in source-file instead of in the
first non-option argument.
174 GAWK: Effective AWK Programming
-v var =val
--assign var =val
Sets the variable var to the value val before execution of the program begins.
Such variable values are available inside the BEGIN rule (see Section 11.3 [Other
Command-Line Arguments], page 178).
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.
-mf N
-mr N Sets various memory limits to the value N. The ‘f’ flag sets the maximum
number of fields and the ‘r’ flag sets the maximum record size. These two flags
and the ‘-m’ option are from the Bell Laboratories research version of Unix awk.
They are provided for compatibility but otherwise ignored by gawk, since gawk
has no predefined limits. (The Bell Laboratories awk no longer needs these
options; it continues to accept them to avoid breaking old programs.)
-W gawk-opt
Following the POSIX standard, implementation-specific options are supplied as
arguments to the ‘-W’ option. 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.
-- Signals 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 ‘-’.
The previous list described options mandated by the POSIX standard, as well as options
available in the Bell Laboratories version of awk. The following list describes gawk-specific
options:
-W compat
-W traditional
--compat
--traditional
Specifies compatibility mode, in which the GNU extensions to the awk language
are disabled, so that gawk behaves just like the Bell Laboratories research ver-
sion of Unix awk. ‘--traditional’ is the preferred form of this option. See
Section A.5 [Extensions in gawk Not in POSIX awk], page 255, which sum-
marizes the extensions. Also see Section C.1 [Downward Compatibility and
Debugging], page 279.
-W copyright
--copyright
Print the short version of the General Public License and then exit.
Chapter 11: Running awk and gawk 175
-W copyleft
--copyleft
Just like ‘--copyright’. This option may disappear in a future version of gawk.
-W dump-variables[=file ]
--dump-variables[=file ]
Prints a sorted list of global variables, their types, and final values to file. If
no file is provided, gawk prints this list to the file named ‘awkvars.out’ in the
current directory.
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
don’t 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.)
-W gen-po
--gen-po Analyzes the source program and generates a GNU gettext Portable Object file
on standard output for all string constants that have been marked for transla-
tion. See Chapter 9 [Internationalization with gawk], page 156, for information
about this option.
-W help
-W usage
--help
--usage Prints a “usage” message summarizing the short and long style options that
gawk accepts and then exit.
-W lint[=fatal]
--lint[=fatal]
Warns about constructs that are dubious or nonportable to other awk imple-
mentations. 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.)
-W lint-old
--lint-old
Warns 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 252).
-W non-decimal-data
--non-decimal-data
Enable automatic interpretation of octal and hexadecimal values in input data
(see Section 10.1 [Allowing Nondecimal Input Data], page 165).
Caution: This option can severely break old programs. Use with care.
176 GAWK: Effective AWK Programming
-W posix
--posix Operates in strict POSIX mode. This disables all gawk extensions (just like
‘--traditional’) and adds the following additional restrictions:
• \x escape sequences are not recognized (see Section 2.2 [Escape Sequences],
page 25).
• Newlines do not act as whitespace to separate fields when FS is equal to a
single space (see Section 3.2 [Examining Fields], page 39).
• Newlines are not allowed after ‘?’ or ‘:’ (see Section 5.12 [Conditional
Expressions], page 89).
• The synonym func for the keyword function is not recognized (see Sec-
tion 8.2.1 [Function Definition Syntax], page 149).
• The ‘**’ and ‘**=’ operators cannot be used in place of ‘^’ and ‘^=’ (see
Section 5.5 [Arithmetic Operators], page 78, and also see Section 5.7 [As-
signment Expressions], page 81).
• Specifying ‘-Ft’ on the command-line does not set the value of FS to be
a single TAB character (see Section 3.5 [Specifying How Fields Are Sepa-
rated], page 43).
• The fflush built-in function is not supported (see Section 8.1.4
[Input/Output Functions], page 140).
If you supply both ‘--traditional’ and ‘--posix’ on the command line,
‘--posix’ takes precedence. gawk also issues a warning if both options are
supplied.
-W profile[=file ]
--profile[=file ]
Enable profiling of awk programs (see Section 10.5 [Profiling Your awk
Programs], page 169). 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.
When run with gawk, the profile is just a “pretty printed” version of the pro-
gram. 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.
-W re-interval
--re-interval
Allows interval expressions (see Section 2.3 [Regular Expression Operators],
page 27) in regexps. Because interval expressions were traditionally not avail-
able in awk, gawk does not provide them by default. This prevents old awk
programs from breaking.
-W source program-text
--source program-text
Allows you to mix source code in files with source code that you enter on the
command line. Program source code is taken from the program-text. This
is particularly useful when you have library functions that you want to use
Chapter 11: Running awk and gawk 177
from your command-line programs (see Section 11.4 [The AWKPATH Environment
Variable], page 178).
-W version
--version
Prints 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.5 [Reporting Problems and Bugs], page 276).
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 3.5 [Specifying How Fields Are Separated], page 43).
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 8.2.1 [Function Definition Syntax],
page 149, function names must be unique.)
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 charac-
ter) 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 command-
line awk programs, gawk provides the ‘--source’ option. This does not require you to pre-
empt the standard input for your source code; it allows you to easily mix command-line
and library source code (see Section 11.4 [The AWKPATH Environment Variable], page 178).
If no ‘-f’ or ‘--source’ option is specified, then gawk uses the first non-option command-
line 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 shell’s 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 csh-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.
1
Not recommended.
178 GAWK: Effective AWK Programming
exist, gawk uses a default path, ‘.:/usr/local/share/awk’.2 (Programs written for use
by system administrators should use an AWKPATH variable that does not include the current
directory, ‘.’.)
The search path feature is particularly useful for building libraries of useful awk functions.
The library files can be placed in a standard directory in the default path and then specified
on the command line with a short file name. Otherwise, the full file name would have to
be typed for each file.
By using both the ‘--source’ and ‘-f’ options, your command-line awk programs can use
facilities in awk library files (see Chapter 12 [A Library of awk Functions], page 181). Path
searching is not done if gawk is in compatibility mode. This is true for both ‘--traditional’
and ‘--posix’. See Section 11.2 [Command-Line Options], page 173.
NOTE: If you want files in the current directory to be found, you must include
the current directory in the path, either by including ‘.’ explicitly in the path
or by writing a null entry in the path. (A null entry is indicated by starting
or ending the path with a colon or by placing two colons next to each other
(‘::’).) If the current directory is not included in the path, then files cannot be
found in the current directory. This path search mechanism is identical to the
shell’s.
Starting with version 3.0, if AWKPATH is not defined in the environment, gawk places its
default search path into ENVIRON["AWKPATH"]. This makes it easy to determine the actual
search path that gawk will use from within an awk program.
While you can change ENVIRON["AWKPATH"] within your awk program, this has no effect
on the running program’s behavior. This makes sense: the AWKPATH environment variable
is used to find the program source files. Once your program is running, all the files have
been found, and gawk no longer needs to use AWKPATH.
2
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
don’t need to worry about this, though.
180 GAWK: Effective AWK Programming
Section 12.4 [Processing Command-Line Options], page 196). 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 vari-
ables that will not conflict with any variables used by either another library function or a
user’s 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 don’t use leading underscores in their variable
names, so this convention immediately decreases the chances that the variable name will be
accidentally shared with the user’s program.
In addition, several of the library functions use a prefix that helps indicate what function
or set of functions use the variables—for example, _pw_byname in the user database routines
(see Section 12.5 [Reading the User Database], page 201). 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
as well.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 variable’s name with a capital
letter—for example, getopt’s Opterr and Optind variables (see Section 12.4 [Processing
Command-Line Options], page 196). 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 awk’s 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 user’s 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 201, 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 way—we merely recommend that you do so.
2
While all the library routines could have been rewritten to use this convention, this was not done, in order
to show how my own awk programming style has evolved and to provide some basis for this discussion.
3
gawk’s ‘--dump-variables’ command-line option is useful for verifying this.
Chapter 12: A Library of awk Functions 183
_abandon_ == FILENAME {
if (FNR == 1)
_abandon_ = ""
else
next
}
184 GAWK: Effective AWK Programming
The nextfile function has not changed. It makes _abandon_ equal to the current file
name and then executes a next statement. The next statement reads the next record and
increments FNR so that FNR is guaranteed to have a value of at least two. However, if
nextfile is called for the last record in the file, then awk closes the current data file and
moves on to the next one. Upon doing so, FILENAME is set to the name of the new file
and FNR is reset to one. If this next file is the same as the previous one, _abandon_ is still
equal to FILENAME. However, FNR is equal to one, telling us that this is a new occurrence
of the file and not the one we were reading when the nextfile function was executed. In
that case, _abandon_ is reset to the empty string, so that further executions of this rule fail
(until the next time that nextfile is called).
If FNR is not one, then we are still in the original data file and the program executes a
next statement to skip through it.
An important question to ask at this point is: given that the functionality of nextfile
can be provided with a library file, why is it built into gawk? Adding features for little reason
leads to larger, slower programs that are harder to maintain. The answer is that building
nextfile into gawk provides significant gains in efficiency. If the nextfile function is
executed at the beginning of a large data file, awk still has to scan the entire file, splitting
it up into records, just to skip over it. The built-in nextfile can simply close the file
immediately and proceed to the next one, which saves a lot of time. This is particularly
important in awk, because awk programs are generally I/O-bound (i.e., they spend most of
their time doing input and output, instead of performing computations).
ret = ret * 8 + k
}
} else if (str ~ /^0[xX][0-9a-fA-f]+/) {
# hexadecimal
str = substr(str, 3) # lop off leading 0x
n = length(str)
ret = 0
Chapter 12: A Library of awk Functions 185
ret = ret * 16 + k
}
} else if (str ~ /^[-+]?([0-9]+([.][0-9]*([Ee][0-9]+)?)?|([.][0-9]+([Ee][-+]?[0-9]+
# decimal number, possibly floating point
ret = str + 0
} else
ret = "NOT-A-NUMBER"
return ret
}
12.2.3 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>
END {
if (_assert_exit)
exit 1
}
The assert function tests the condition parameter. If it is false, it prints a message
to standard error, using the string parameter to describe the failed condition. It then sets
the variable _assert_exit to one and executes the exit statement. The exit statement
jumps to the END rule. If the END rules finds _assert_exit to be true, it exits immediately.
The purpose of the test in the END rule is to keep any other END rules from running.
When an assertion fails, the program should exit immediately. If no assertions fail, then
_assert_exit is still false when the END rule is run normally, and the rest of the program’s
END rules execute. For all of this to work correctly, ‘assert.awk’ must be the first source
file read by awk. The function can be used in a program in the following way:
Chapter 12: A Library of awk Functions 187
function myfunc(a, b)
{
assert(a <= 5 && b >= 17.1, "a <= 5 && b >= 17.1")
...
}
If the assertion fails, you see a message similar to the following:
mydata:1357: assertion failed: a <= 5 && b >= 17.1
There is a small problem with this version of assert. An END rule is automatically
added to the program calling assert. Normally, if a program consists of just a BEGIN rule,
the input files and/or standard input are not read. However, now that the program has an
END rule, awk attempts to read the input data files or standard input (see Section 6.1.4.1
[Startup and Cleanup Actions], page 96), most likely causing the program to hang as it
waits for input.
There is a simple workaround to this: make sure the BEGIN rule always ends with an
exit statement.
if (x < 0) {
aval = -x # absolute value
ival = int(aval)
fraction = aval - ival
if (fraction >= .5)
return int(x) - 1 # -2.5 --> -3
else
return int(x) # -2.3 --> -2
} else {
fraction = x - ival
if (fraction >= .5)
188 GAWK: Effective AWK Programming
return ival + 1
else
return ival
}
}
# test harness
{ print $0, round($0) }
function cliff_rand()
{
_cliff_seed = (100 * log(_cliff_seed)) % 1
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 8.1.2 [Numeric Func-
tions], page 127) isn’t random enough, you might try using this function instead.
# Global identifiers:
# _ord_: numerical values indexed by characters
# _ord_init: function to initialize _ord_
BEGIN { _ord_init() }
{
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
}
function chr(c)
{
# force c to be numeric by adding 0
return sprintf("%c", c + 0)
}
# 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 func-
tion 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.
time of day in human readable form. While strftime is extensive, the control formats are
not necessarily easy to remember or intuitively obvious when reading a program.
The following function, gettimeofday, populates a user-supplied array with preformat-
ted time information. It returns a string with the current time formatted in the same way
as the date utility:
# gettimeofday.awk --- get the time of day in a usable format
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 231, 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.
FILENAME != _oldfilename \
{
if (_oldfilename != "")
endfile(_oldfilename)
_oldfilename = FILENAME
beginfile(FILENAME)
}
END { endfile(FILENAME) }
This file must be loaded before the user’s “main” program, so that the rule it supplies
is executed first.
This rule relies on awk’s 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.
This version has same problem as the first version of nextfile (see Section 12.2.1 [Im-
plementing nextfile as a Function], page 183). 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 228, shows how this library function can be used
and how it simplifies writing the main program.
194 GAWK: Effective AWK Programming
function rewind( i)
{
# shift remaining arguments up
for (i = ARGC; i > ARGIND; i--)
ARGV[i] = ARGV[i-1]
# do it
nextfile
}
This code relies on the ARGIND variable (see Section 6.5.2 [Built-in Variables That Convey
Information], page 110), 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 6.4.9 [Using gawk’s
nextfile Statement], page 106). See Section 12.2.1 [Implementing nextfile as a Function],
page 183, for a function version of nextfile.
BEGIN {
for (i = 1; i < ARGC; i++) {
if (ARGV[i] ~ /^[A-Za-z_][A-Za-z0-9_]*=.*/ \
|| ARGV[i] == "-")
continue # assignment or standard input
else if ((getline junk < ARGV[i]) < 0) # unreadable
delete ARGV[i]
Chapter 12: A Library of awk Functions 195
else
close(ARGV[i])
}
}
In gawk, the getline won’t be fatal (unless ‘--posix’ is in force). Removing the element
from ARGV with delete skips the file (since it’s no longer in the list).
BEGIN { Argind = 0 }
END {
if (ARGIND > Argind)
for (Argind++; Argind <= ARGIND; Argind++)
zerofile(ARGV[Argind], Argind)
}
The user-level variable Argind allows the awk program to track its progress through
ARGV. Whenever the program detects that ARGIND is greater than ‘Argind + 1’, it means
that one or more empty files were skipped. The action then calls zerofile for each such
file, incrementing Argind along the way.
The ‘Argind != ARGIND’ rule simply keeps Argind up to date in the normal case.
Finally, the END rule catches the case of any empty files at the end of the command-line
arguments. Note that the test in the condition of the for loop uses the ‘<=’ operator, not
<.
As an exercise, you might consider whether this same problem can be solved without
relying on gawk’s ARGIND variable.
196 GAWK: Effective AWK Programming
As a second exercise, revise this code to handle the case where an intervening value in
ARGV is a variable assignment.
BEGIN {
if (No_command_assign)
disable_assigns(ARGC, ARGV)
}
You then run your program this way:
awk -v No_command_assign=1 -f noassign.awk -f yourprog.awk *
The function works by looping through the arguments. It prepends ‘./’ to any argument
that matches the form of a variable assignment, turning that argument into a file name.
The use of No_command_assign allows you to disable command-line assignments at in-
vocation time, by giving the variable a true value. When not set, it is initially zero (i.e.,
false), so the command-line arguments are left alone.
the command-line arguments for option letters. Each time around the loop, it returns a
single character representing the next option letter that it finds, or ‘?’ if it finds an invalid
option. When it returns −1, there are no options left on the command line.
When using getopt, options that do not take arguments can be grouped together. Fur-
thermore, options that take arguments require that the argument is 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 option’s 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 The string value of the argument to an option.
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 letter representing the command-line option.
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 */
198 GAWK: Effective AWK Programming
...
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 11.2 [Command-Line Options], page 173).
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 8.1.3 [String-
Manipulation Functions], page 129).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 at end of options
# ? for unrecognized option
# <c> a character representing the current option
# Private Data:
# _opti -- index in multi-flag option, e.g., -abc
The function starts out with 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.
Chapter 12: A Library of awk Functions 199
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 command-
line 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 there’s no reason to look at the program name, which is
in ARGV[0]:
BEGIN {
Opterr = 1 # default is to diagnose
Optind = 1 # 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++)
Chapter 12: A Library of awk Functions 201
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:
a ARGV[3] = <bax>
a ARGV[4] = <-x>
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(argc, argv)
int argc;
char **argv;
{
struct passwd *p;
endpwent();
return 0;
}
If you don’t understand C, don’t 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 user’s login name.
Encrypted password The user’s encrypted password. This may not be avail-
able on some systems.
User-ID The user’s numeric user ID number.
Group-ID The user’s numeric group ID number.
Full name The user’s full name, and perhaps other information
associated with the user.
Home directory The user’s login (or “home”) directory (familiar to
shell programmers as $HOME).
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 pwcat’s output are as follows:
Chapter 12: A Library of awk Functions 203
$ 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/"
}
oldfs = FS
oldrs = RS
olddol0 = $0
using_fw = (PROCINFO["FS"] == "FIELDWIDTHS")
FS = ":"
RS = "\n"
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;
_pw_init needs only to be called 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 user’s 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 on some other
awk implementation.
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
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 returns the null string:
function getpwnam(name)
{
_pw_init()
if (name in _pw_byname)
return _pw_byname[name]
return ""
}
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()
if (uid in _pw_byuid)
return _pw_byuid[uid]
return ""
}
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)
Chapter 12: A Library of awk Functions 205
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 was made 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 user’s main program actually
calls one of these functions. If this library file is loaded along with a user’s 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 it clutters up the code.
The id program in Section 13.2.3 [Printing out User Information], page 219, uses these
functions.
#include <stdio.h>
#include <grp.h>
int
main(argc, argv)
int argc;
206 GAWK: Effective AWK Programming
char **argv;
{
struct group *g;
int i;
BEGIN \
{
# Change to suit your system
_gr_awklib = "/usr/local/libexec/awk/"
}
oldfs = FS
oldrs = RS
olddol0 = $0
using_fw = (PROCINFO["FS"] == "FIELDWIDTHS")
FS = ":"
RS = "\n"
_gr_bycount[++_gr_count] = $0
}
close(grcat)
_gr_count = 0
_gr_inited++
FS = oldfs
if (using_fw)
FIELDWIDTHS = FIELDWIDTHS
208 GAWK: Effective AWK Programming
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 Sec-
tion 12.5 [Reading the User Database], page 201). The _gr_inited variable is used to
ensure that the database is scanned no more than once. The _gr_init function first saves
FS, FIELDWIDTHS, RS, and $0, and then sets FS and RS to the correct values for scanning
the group information.
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 username
(_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 usernames 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 doesn’t
check that there is a $4.)
Finally, _gr_init closes the pipeline to grcat, restores FS (and FIELDWIDTHS if neces-
sary), 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, getgrnam returns the null string:
function getgrnam(group)
{
_gr_init()
if (group in _gr_byname)
return _gr_byname[group]
return ""
}
The getgrgid function is similar, it takes a numeric group ID and looks up the infor-
mation associated with that group ID:
function getgrgid(gid)
{
_gr_init()
if (gid in _gr_bygid)
Chapter 12: A Library of awk Functions 209
return _gr_bygid[gid]
return ""
}
The getgruser function does not have a C counterpart. It takes a username and returns
the list of groups that have the user as a member:
function getgruser(user)
{
_gr_init()
if (user in _gr_groupsbyuser)
return _gr_groupsbyuser[user]
return ""
}
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 awk’s associative
arrays to do work.
The id program in Section 13.2.3 [Printing out User Information], page 219, uses these
functions.
210 GAWK: Effective AWK Programming
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 Use list as the list of fields to cut out.
-d delim Use delim as the field-separator character instead of the tab character.
-s Suppress printing of lines that do not contain the field delimiter.
The awk implementation of cut uses the getopt library function (see Section 12.4 [Pro-
cessing Command-Line Options], page 196) and the join library function (see Section 12.2.7
[Merging an Array into a String], page 190).
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
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()
}
if (fieldlist == "") {
Chapter 13: Practical awk Programs 213
if (by_fields)
set_fieldlist()
else
set_charlist()
}
set_fieldlist is used to split the field list apart at the commas and into an array.
Then, for each element of the array, it looks to see if it is actually a range, and if so, splits
it apart. The range is verified to make sure the first number is smaller than the second.
Each number in the list is added to the flist array, which simply lists the fields that will
be printed. Normal field splitting is used. The program lets awk handle the job of doing
the field splitting:
function set_fieldlist( n, m, i, j, k, f, g)
{
n = split(fieldlist, f, ",")
j = 1 # index in flist
for (i = 1; i <= n; i++) {
if (index(f[i], "-") != 0) { # a range
m = split(f[i], g, "-")
if (m != 2 || g[1] >= g[2]) {
printf("bad field list: %s\n",
f[i]) > "/dev/stderr"
exit 1
}
for (k = g[1]; k <= g[2]; k++)
flist[j++] = k
} else
flist[j++] = f[i]
}
nfields = j - 1
}
The set_charlist function is more complicated than set_fieldlist. The idea here is
to use gawk’s FIELDWIDTHS variable (see Section 3.6 [Reading Fixed-Width Data], page 47),
which describes constant-width input. When using a character list, that is exactly what we
have.
Setting up FIELDWIDTHS is more complicated than simply listing the fields that need to
be printed. We have to keep track of the fields to print and also the intervening characters
that have to be skipped. For example, suppose you wanted characters 1 through 8, 15, and
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,
214 GAWK: Effective AWK Programming
{
if (by_fields && suppress && index($0, FS) != 0)
next
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 6.5 [Built-in Variables],
page 107):
# 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 argu-
ments up to ARGV[Optind] are cleared, so that awk won’t 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 == "")
pattern = ARGV[Optind++]
# 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 we’re
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
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
1
It also introduces a subtle bug; if a match happens, we output the translated line, not the original.
218 GAWK: Effective AWK Programming
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)
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 ...]"
Chapter 13: Practical awk Programs 219
# output is:
# uid=12(foo) euid=34(bar) gid=3(baz) \
# egid=5(blat) groups=9(nine),2(two),1(one)
BEGIN \
{
uid = PROCINFO["uid"]
euid = PROCINFO["euid"]
gid = PROCINFO["gid"]
egid = PROCINFO["egid"]
printf("uid=%d", uid)
pw = getpwuid(uid)
if (pw != "") {
220 GAWK: Effective AWK Programming
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])
}
}
if (egid != gid) {
printf(" egid=%d", egid)
pw = getgrgid(egid)
if (pw != "") {
split(pw, a, ":")
printf("(%s)", a[1])
}
}
print ""
}
Chapter 13: Practical awk Programs 221
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 don’t 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 it’s tested, and the loop body never executes.
BEGIN {
outfile = "x" # default
count = 1000
if (ARGC > 4)
usage()
i = 1
if (ARGV[i] ~ /^-[0-9]+$/) {
count = -ARGV[i]
ARGV[i] = ""
i++
}
# test argv in case reading from stdin instead of file
222 GAWK: Effective AWK Programming
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)
{
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 isn’t true for EBCDIC systems.
Chapter 13: Practical awk Programs 223
BEGIN \
{
for (i = 1; i < ARGC; i++)
copy[i] = ARGV[i]
if (ARGV[1] == "-a") {
append = 1
delete ARGV[1]
delete copy[1]
ARGC--
}
if (ARGC < 2) {
print "usage: tee [-a] file ..." > "/dev/stderr"
exit 1
}
ARGV[1] = "-"
ARGC = 2
}
The 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
224 GAWK: Effective AWK Programming
}
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])
}
The program begins with a usage function and then a brief outline of the options and
their meanings in a comment. 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 nonre-
peated 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
}
BEGIN \
{
count = 1
outputfile = "/dev/stdout"
opts = "udc0:1:2:3:4:5:6:7:8:9:"
while ((c = getopt(ARGC, ARGV, opts)) != -1) {
if (c == "u")
non_repeated_only++
else if (c == "d")
repeated_only++
else if (c == "c")
do_count++
else if (index("0123456789", c) != 0) {
# getopt requires args to options
# this messes us up for things like -5
if (Optarg ~ /^[0-9]+$/)
fcount = (c Optarg) + 0
else {
226 GAWK: Effective AWK Programming
fcount = c + 0
Optind--
}
} else
usage()
}
if (ARGV[Optind] ~ /^\+[0-9]+$/) {
charcount = substr(ARGV[Optind], 2) + 0
Optind++
}
if (ARGC - Optind == 2) {
outputfile = ARGV[ARGC - 1]
ARGV[ARGC - 1] = ""
}
}
The following function, are_equal, compares the current line, $0, to the previous line,
last. It handles skipping fields and characters. If no field count and no character count
are specified, are_equal simply returns one or zero depending upon the result of a simple
string comparison of last and $0. Otherwise, things get more complicated. If fields have
to be skipped, each line is broken into an array using split (see Section 8.1.3 [String-
Manipulation Functions], page 129); the desired fields are then joined back into a line using
join. The joined lines are stored in clast and cline. If no fields are skipped, clast and
cline are set to last and $0, respectively. Finally, if characters are skipped, substr is
used to strip off the leading charcount characters in clast and cline. The two strings are
then compared and are_equal returns the result:
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
Chapter 13: Practical awk Programs 227
}
if (charcount) {
clast = substr(clast, charcount + 1)
cline = substr(cline, charcount + 1)
}
{
equal = are_equal()
if (equal)
count++
else {
if ((repeated_only && count > 1) ||
(non_repeated_only && count == 1))
print last > outputfile
last = $0
228 GAWK: Effective AWK Programming
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
}
# Options:
# -l only count lines
# -w only count words
# -c only count characters
#
# Default is to count lines, words, characters
Chapter 13: Practical awk Programs 229
#
# 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
tion is simply deleted). The record is then resplit into fields, yielding just the actual words
on the line, and ensuring that there are no empty fields.
If there are no fields left after removing all the punctuation, the current record is skipped.
Otherwise, the program loops through each word, comparing it to the previous one:
# dupword.awk --- find duplicate words in text
{
$0 = tolower($0)
gsub(/[^[:alnum:][:blank:]]/, " ");
$0 = $0 # re-split
if (NF == 0)
next
if ($1 == prev)
printf("%s:%d: duplicate %s\n",
FILENAME, FNR, $1)
for (i = 2; i <= NF; i++)
if ($i == $(i-1))
printf("%s:%d: duplicate %s\n",
FILENAME, FNR, $i)
prev = $NF
}
BEGIN \
{
232 GAWK: Effective AWK Programming
if (ARGC < 2) {
print usage1 > "/dev/stderr"
print usage2 > "/dev/stderr"
exit 1
} else if (ARGC == 5) {
delay = ARGV[4] + 0
count = ARGV[3] + 0
message = ARGV[2]
} else if (ARGC == 4) {
count = ARGV[3] + 0
message = ARGV[2]
} else if (ARGC == 3) {
message = ARGV[2]
} else if (ARGV[1] !~ /[0-9]?[0-9]:[0-9][0-9]/) {
print usage1 > "/dev/stderr"
print usage2 > "/dev/stderr"
exit 1
}
Finally, the program uses the system function (see Section 8.1.4 [Input/Output Func-
tions], page 140) 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:
# 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
}
tr requires two lists of characters.3 When processing the input, the first character in
the first list is replaced with the first character in the second list, the second character in
the first list is replaced with the second character in the second list, and so on. If there are
more characters in the “from” list than in the “to” list, the last character of the “to” list is
used for the remaining characters in the “from” list.
Some time ago, a user proposed that a transliteration function should be added to gawk.
The following program was written to prove that character transliteration could be done
with a user-level function. This program is not as complete as the system tr utility but it
does most of the job.
The translate program demonstrates one of the few weaknesses of standard awk: deal-
ing with individual characters is very painful, requiring repeated use of the substr, index,
and gsub built-in functions (see Section 8.1.3 [String-Manipulation Functions], page 129).4
There are two functions. The first, stranslate, takes three arguments:
from A list of characters from which to translate.
to A list of characters to which to translate.
target The string on which to do the translation.
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, gsub is used to
change it to the corresponding to character.
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:
# translate.awk --- do tr-like stuff
# main program
BEGIN {
if (ARGC < 3) {
print "usage: translate from to" > "/dev/stderr"
exit
}
FROM = ARGV[1]
TO = ARGV[2]
ARGC = 2
ARGV[1] = "-"
}
{
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 func-
tion. However, shortly after writing this program, we learned that the System V Release 4
awk had added the toupper and tolower functions (see Section 8.1.3 [String-Manipulation
Functions], page 129). These functions handle the vast majority of the cases where charac-
ter 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.
The basic idea is to read 20 labels worth of data. Each line of each label is stored in the
line array. The single rule takes care of filling the line array and printing the page when
20 labels have been read.
The BEGIN rule simply sets RS to the empty string, so that awk splits records at blank
lines (see Section 3.1 [How Input Is Split into Records], page 36). It sets MAXLINES to 100,
since 100 is the maximum number of lines on the page (20 * 5 = 100).
Most of the work is done in the printpage function. The label lines are stored sequen-
tially in the line array. But they have to print horizontally; line[1] next to line[6],
line[2] next to line[7], and so on. Two loops are used to accomplish this. The outer
loop, controlled by i, steps through every 10 lines of data; this is each row of labels. The
inner loop, controlled by j, goes through the lines within the row. As j goes from 0 to 4,
‘i+j’ is the j-th line in the row, and ‘i+j+5’ is the entry next to it. The output ends up
looking something like this:
line 1 line 6
line 2 line 7
line 3 line 8
line 4 line 9
line 5 line 10
...
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
program was written. You will also note that there are 2 blank lines at the top and 2 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
function printpage( i, j)
{
if (Nlines <= 0)
return
if (i + j > MAXLINES)
break
printf " %-41s %s\n", line[i+j], line[i+j+5]
}
print ""
}
for (i in line)
line[i] = ""
}
# 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++)
line[++Nlines] = ""
Count++
}
END \
{
printpage()
}
END {
238 GAWK: Effective AWK Programming
{
$0 = tolower($0) # remove case distinctions
# remove punctuation
gsub(/[^[:alnum:]_[:blank:]]/, "", $0)
for (i = 1; i <= NF; i++)
freq[$i]++
}
END {
for (word in freq)
printf "%s\t%d\n", word, freq[word]
}
Assuming we have saved this program in a file named ‘wordfreq.awk’, and that the data
is in ‘file1’, the following pipeline:
awk -f wordfreq.awk file1 | sort -k 2nr
Chapter 13: Practical awk Programs 239
produces a table of the words appearing in ‘file1’ in order of decreasing frequency. The
awk program suitably massages the data and produces a word frequency table, which is not
ordered.
The awk script’s output is then sorted by the sort utility and printed on the terminal.
The options given to sort specify a sort that uses the second field of each input line (skipping
one field), that the sort keys should be treated as numeric quantities (otherwise ‘15’ would
come before ‘5’), and that the sorting should be done in descending (reverse) order.
The sort could even be done from within the program, by changing the END action to:
END {
sort = "sort -k 2nr"
for (word in freq)
printf "%s\t%d\n", word, freq[word] | sort
close(sort)
}
This way of sorting must be used on systems that do not have true pipes at the command-
line (or batch-file) level. See the general operating system documentation for more infor-
mation on how to use the sort program.
{
if (data[$0]++ == 0)
lines[++count] = $0
}
END {
for (i = 1; i <= count; i++)
print lines[i]
}
240 GAWK: Effective AWK Programming
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.
@example
@c file examples/messages.awk
BEGIN @{ print "Don’t panic!" @}
@c end file
Chapter 13: Practical awk Programs 241
@end example
@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 won’t 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
}
$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 function 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 3.8 [Explicit
Input with getline], page 51). 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.
242 GAWK: Effective AWK Programming
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 8.1.3 [String-Manipulation Functions], page 129). 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.
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)
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 @,
# don’t 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
Chapter 13: Practical awk Programs 243
}
}
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 4.6 [Redirecting Output of print and printf], page 65). 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)
}
function usage()
{
print "usage: awksed pat repl [files...]" > "/dev/stderr"
exit 1
}
BEGIN {
# validate arguments
if (ARGC < 3)
244 GAWK: Effective AWK Programming
usage()
RS = ARGV[1]
ORS = ARGV[2]
@include getopt.awk
@include join.awk
...
# main program
BEGIN {
while ((c = getopt(ARGC, ARGV, "a:b:cde")) != -1)
...
...
}
The following program, ‘igawk.sh’, provides this service. It simulates gawk’s searching
of the AWKPATH variable and also allows nested includes; i.e., a file that is included with
‘@include’ can contain further ‘@include’ statements. igawk makes an effort to only include
files once, so that nested includes don’t accidentally include a library function twice.
igawk should behave just like gawk externally. This means it should accept all of gawk’s
command-line arguments, including the ability to have multiple source files specified via
‘-f’, and the ability to mix command-line and library source files.
The program is written using the POSIX Shell (sh) command language.6 It works as
follows:
1. Loop through the arguments, saving anything that doesn’t 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 variable’s 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 variable’s 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 user’s program, for the user’s 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:
6
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.
246 GAWK: Effective AWK Programming
-- This ends the arguments to igawk. Anything else should be passed on to the
user’s 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. Don’t worry about
it if you are not familiar with sh.)
-v, -F These are saved and passed on to gawk.
-f, --file, --file=, -Wfile=
The file name is appended to the shell variable program with an ‘@include’
statement. The expr utility is used to remove the leading option part of the
argument (e.g., ‘--file=’). (Typical sh usage would be to use the echo and sed
utilities to do this work. Unfortunately, some versions of echo evaluate escape
sequences in their arguments, possibly mangling the program text. Using expr
avoids this problem.)
--source, --source=, -Wsource=
The source text is appended to program.
--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 command-
line 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
case $1 in
--) shift; break;;
-W) shift
# The ${x?’message here’} construct prints a
# diagnostic if $x is the null string
set -- -W"${@?’missing operand’}"
continue;;
-[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 2.0 1>&2
gawk --version
exit 0 ;;
*) break;;
esac
shift
done
248 GAWK: Effective AWK Programming
if [ -z "$program" ]
then
program=${1?’missing program’}
shift
fi
7
On some very old versions of awk, the test ‘getline junk < t’ can loop forever if the file exists but is
empty. Caveat emptor.
Chapter 13: Practical awk Programs 249
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 we print an error message and continue.
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
EOF
‘
The shell construct ‘command << marker ’ is called a here document. Everything in the
shell script up to the marker is fed to command as input. The shell processes the contents
of the here document for variable and command substitution (and possibly other things as
well, depending upon the shell).
The shell construct ‘‘...‘’ is called command substitution. The output of the command
between the two backquotes (grave accents) is substituted into the command line. It is saved
as a single string, even if the results contain whitespace.
The expanded program is saved in the variable processed_program. It’s 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 user’s 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 shell’s parsing process. This
keeps things properly quoted.
This version of igawk represents my fourth attempt at 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 file’s 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 aren’t
familiar with sh.
Also, this program illustrates that it is often worthwhile to combine sh and awk pro-
gramming 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. With igawk, there is no real reason to build ‘@include’
processing into gawk itself.
As an additional example of this, consider the idea of having two files in a directory in
the search path:
Chapter 13: Practical awk Programs 251
‘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.
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.
252 GAWK: Effective AWK Programming
• Redirection of input for the getline function (see Section 3.8 [Explicit Input with
getline], page 51).
• Multiple BEGIN and END rules (see Section 6.1.4 [The BEGIN and END Special Patterns],
page 96).
• Multidimensional arrays (see Section 7.9 [Multidimensional Arrays], page 122).
• \x escape sequences are not recognized (see Section 2.2 [Escape Sequences], page 25).
• Newlines do not act as whitespace to separate fields when FS is equal to a single space
(see Section 3.2 [Examining Fields], page 39).
• Newlines are not allowed after ‘?’ or ‘:’ (see Section 5.12 [Conditional Expressions],
page 89).
• The synonym func for the keyword function is not recognized (see Section 8.2.1
[Function Definition Syntax], page 149).
• The operators ‘**’ and ‘**=’ cannot be used in place of ‘^’ and ‘^=’ (see Section 5.5
[Arithmetic Operators], page 78, and Section 5.7 [Assignment Expressions], page 81).
• Specifying ‘-Ft’ on the command line does not set the value of FS to be a single TAB
character (see Section 3.5 [Specifying How Fields Are Separated], page 43).
• The fflush built-in function is not supported (see Section 8.1.4 [Input/Output Func-
tions], page 140).
The Bell Laboratories awk also incorporates the following extensions, originally developed
for gawk:
• The ‘\x’ escape sequence (see Section 2.2 [Escape Sequences], page 25).
• The ‘/dev/stdin’, ‘/dev/stdout’, and ‘/dev/stderr’ special files (see Section 4.7
[Special File Names in gawk], page 67).
• The ability for FS and for the third argument to split to be null strings (see Sec-
tion 3.5.2 [Making Each Character a Separate Field], page 44).
• The nextfile statement (see Section 6.4.9 [Using gawk’s nextfile Statement],
page 106).
• The ability to delete all of an array at once with ‘delete array ’ (see Section 7.6 [The
delete Statement], page 120).
Appendix A: The Evolution of the awk Language 255
• The RT variable that contains the input text that matched RS (see Section 3.1 [How
Input Is Split into Records], page 36).
• Full support for both POSIX and GNU regexps (see Chapter 2 [Regular Expressions],
page 24).
• The gensub function for more powerful text manipulation (see Section 8.1.3 [String-
Manipulation Functions], page 129).
• The strftime function acquired a default time format, allowing it to be called with
no arguments (see Section 8.1.5 [Using gawk’s Timestamp Functions], page 142).
• The ability for FS and for the third argument to split to be null strings (see Sec-
tion 3.5.2 [Making Each Character a Separate Field], page 44).
• The ability for RS to be a regexp (see Section 3.1 [How Input Is Split into Records],
page 36).
• The next file statement became nextfile (see Section 6.4.9 [Using gawk’s nextfile
Statement], page 106).
• The ‘--lint-old’ option to warn about constructs that are not available in the orig-
inal Version 7 Unix version of awk (see Section A.1 [Major Changes Between V7 and
SVR3.1], page 252).
• The ‘-m’ option and the fflush function from the Bell Laboratories research version
of awk (see Section 11.2 [Command-Line Options], page 173; also see Section 8.1.4
[Input/Output Functions], page 140).
• The ‘--re-interval’ option to provide interval expressions in regexps (see Section 2.3
[Regular Expression Operators], page 27).
• The ‘--traditional’ option was added as a better name for ‘--compat’ (see Sec-
tion 11.2 [Command-Line Options], page 173).
• The use of GNU Autoconf to control the configuration process (see Section B.2.1 [Com-
piling gawk for Unix], page 264).
• Amiga support (see Section B.3.1 [Installing gawk on an Amiga], page 266).
Version 3.1 of gawk introduced the following features:
• The BINMODE special variable for non-POSIX systems, which allows binary I/O for
input and/or output files (see Section B.3.3.4 [Using gawk on PC Operating Systems],
page 270).
• The LINT special variable, which dynamically controls lint warnings (see Section 6.5
[Built-in Variables], page 107).
• The PROCINFO array for providing process-related information (see Section 6.5 [Built-in
Variables], page 107).
• The TEXTDOMAIN special variable for setting an application’s internationalization text
domain (see Section 6.5 [Built-in Variables], page 107, and Chapter 9 [International-
ization with gawk], page 156).
• The ability to use octal and hexadecimal constants in awk program source code (see
Section 5.1.2 [Octal and Hexadecimal Numbers], page 73).
• The ‘|&’ operator for two-way I/O to a coprocess (see Section 10.2 [Two-Way Commu-
nications with Another Process], page 166).
Appendix A: The Evolution of the awk Language 257
• The ‘/inet’ special files for TCP/IP networking using ‘|&’ (see Section 10.3 [Using
gawk for Network Programming], page 168).
• The optional second argument to close that allows closing one end of a two-way pipe
to a coprocess (see Section 10.2 [Two-Way Communications with Another Process],
page 166).
• The optional third argument to the match function for capturing text-matching subex-
pressions within a regexp (see Section 8.1.3 [String-Manipulation Functions], page 129).
• Positional specifiers in printf formats for making translations easier (see Section 9.4.2
[Rearranging printf Arguments], page 160).
• The asort and asorti functions for sorting arrays (see Section 7.11 [Sorting Array
Values and Indices with gawk], page 124).
• The bindtextdomain, dcgettext and dcngettext functions for internationalization
(see Section 9.3 [Internationalizing awk Programs], page 158).
• The extension built-in function and the ability to add new built-in functions dynam-
ically (see Section C.3 [Adding New Built-in Functions to gawk], page 282).
• The mktime built-in function for creating timestamps (see Section 8.1.5 [Using gawk’s
Timestamp Functions], page 142).
• The and, or, xor, compl, lshift, rshift, and strtonum built-in functions (see Sec-
tion 8.1.6 [Bit-Manipulation Functions of gawk], page 147).
• The support for ‘next file’ as two words was removed completely (see Section 6.4.9
[Using gawk’s nextfile Statement], page 106).
• The ‘--dump-variables’ option to print a list of all global variables (see Section 11.2
[Command-Line Options], page 173).
• The ‘--gen-po’ command-line option and the use of a leading underscore to mark
strings that should be translated (see Section 9.4.1 [Extracting Marked Strings],
page 160).
• The ‘--non-decimal-data’ option to allow non-decimal input data (see Section 10.1
[Allowing Nondecimal Input Data], page 165).
• The ‘--profile’ option and pgawk, the profiling version of gawk, for producing execu-
tion profiles of awk programs (see Section 10.5 [Profiling Your awk Programs], page 169).
• The ‘--enable-portals’ configuration option to enable special treatment of pathnames
that begin with ‘/p’ as BSD portals (see Section 10.4 [Using gawk with BSD Portals],
page 169).
• The use of GNU Automake to help in standardizing the configuration process (see
Section B.2.1 [Compiling gawk for Unix], page 264).
• The use of GNU gettext for gawk’s own message output (see Section 9.6 [gawk Can
Speak Your Language], page 163).
• BeOS support (see Section B.3.2 [Installing gawk on BeOS], page 266).
• Tandem support (see Section B.4.2 [Installing gawk on a Tandem], page 275).
• The Atari port became officially unsupported (see Section B.4.1 [Installing gawk on the
Atari ST], page 274).
• The source code now uses new-style function definitions, with ansi2knr to convert the
code on systems with old compilers.
258 GAWK: Effective AWK Programming
• Arno Peters did the initial work to convert gawk to use GNU Automake and gettext.
• Alan J. Broder provided the initial version of the asort function as well as the code
for the new 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 environ-
ments.
• Arnold Robbins has been working on gawk since 1988, at first helping David Trueman,
and as the primary maintainer since around 1994.
260 GAWK: Effective AWK Programming
level is 4, but when retrieving distributions, you should get the version with the highest
version, release, and patch level. (Note, however, that patch levels greater than or equal to
80 denote “beta” or nonproduction software; you might not want to retrieve such a version
unless you don’t mind experimenting.) If you are not on a Unix system, you need to make
other arrangements for getting and extracting the gawk distribution. You should consult a
local expert.
‘README’
‘README_d/README.*’
Descriptive files: ‘README’ for gawk under Unix and the rest for the various
hardware and software combinations.
‘ChangeLog’
A detailed list of source code changes as bugs are fixed or improvements made.
‘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 gawk’s performance. Most of these depend on
the hardware or operating system software and are not limits in gawk itself.
‘POSIX.STD’
A description of one area in which the POSIX standard for awk is incorrect as
well as how gawk handles the problem.
‘doc/awkforai.txt’
A short article describing why gawk is a good language for AI (Artificial Intel-
ligence) programming.
262 GAWK: Effective AWK Programming
‘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 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 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 244.
‘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.
Appendix B: Installing gawk 263
‘Makefile.in’
‘acconfig.h’
‘acinclude.m4’
‘aclocal.m4’
‘configh.in’
‘configure.in’
‘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], page 264.
‘intl/*’
‘po/*’ The ‘intl’ directory provides the GNU gettext library, which implements
gawk’s internationalization features, while the ‘po’ library contains message
translations.
‘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 240), 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 181, and the
igawk program from Section 13.3.9 [An Easy Way to Use Library Functions],
page 244, 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’.
‘unsupported/atari/*’
Files needed for building gawk on an Atari ST (see Section B.4.1 [Installing
gawk on the Atari ST], page 274, for details).
‘unsupported/tandem/*’
Files needed for building gawk on a Tandem (see Section B.4.2 [Installing gawk
on a Tandem], page 275, for details).
‘posix/*’ Files needed for building gawk on POSIX-compliant systems.
‘pc/*’ Files needed for building gawk under MS-DOS, MS Windows and OS/2 (see
Section B.3.3 [Installation on PC Operating Systems], page 267, for details).
‘vms/*’ Files needed for building gawk under VMS (see Section B.3.4 [How to Compile
and Install gawk on VMS], page 271, for details).
‘test/*’ A test suite for gawk. You can use ‘make check’ from the top-level gawk di-
rectory 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.
264 GAWK: Effective AWK Programming
--disable-lint
This option disables all lint checking within gawk. The ‘--lint’ and
‘--lint-old’ options (see Section 11.2 [Command-Line Options], page 173)
are accepted, but silently do nothing. Similarly, setting the LINT variable (see
Section 6.5.1 [Built-in Variables That Control awk], page 107) has no effect on
the running awk program.
When used with GCC’s automatic dead-code-elimination, this option cuts al-
most 200K bytes off the size of the gawk executable on GNU/Linux x86 systems.
Results on other systems and with other compilers are likely to vary. Using this
option may bring you some slight performance improvement.
Using this option will cause some of the tests in the test suite to fail. This
option may be removed at a later date.
--disable-nls
Disable all message-translation facilities. This is usually not desirable, but it
may bring you some slight performance improvement. You should also use this
option if ‘--with-included-gettext’ doesn’t work on your system.
The ‘Makefile’ contains a number of targets for building various MS-DOS, Windows32,
and OS/2 versions. A list of targets is printed if the make command is given without a
target. As an example, to build gawk using the DJGPP tools, enter ‘make djgpp’. (The
DJGPP tools may be found at ftp://ftp.delorie.com/pub/djgpp/current/v2gnu/.)
Using make to run the standard tests and to install gawk requires additional Unix-like
tools, including sh, sed, and cp. In order to run the tests, the ‘test/*.ok’ files may need to
be converted so that they have the usual DOS-style end-of-line markers. Most of the tests
work properly with Stewartson’s shell along with the companion utilities or appropriate
GNU utilities. However, some editing of ‘test/Makefile’ is required. It is recommended
that you copy the file ‘pc/Makefile.tst’ over the file ‘test/Makefile’ as a replacement.
Details can be found in ‘README_d/README.pc’ and in the file ‘pc/Makefile.tst’.
The 32 bit EMX version of gawk works “out of the box” under OS/2. In principle, it is
possible to compile gawk the following way:
$ ./configure
$ make
This is not recommended, though. To get an OMF executable you should use the
following commands at your sh prompt:
$ CPPFLAGS="-D__ST_MT_ERRNO__"
$ export CPPFLAGS
$ CFLAGS="-O2 -Zomf -Zmt"
$ export CFLAGS
$ LDFLAGS="-s -Zcrtdll -Zlinker /exepack:2 -Zlinker /pm:vio -Zstack 0x8000"
$ export LDFLAGS
$ RANLIB="echo"
$ export RANLIB
$ ./configure --prefix=c:/usr --without-included-gettext
$ make AR=emxomfar
These are just suggestions. You may use any other set of (self-consistent) environment
variables and compiler flags.
To get an FHS-compliant file hierarchy it is recommended to use the additional
configure options ‘--infodir=c:/usr/share/info’, ‘--mandir=c:/usr/share/man’ and
‘--libexecdir=c:/usr/lib’.
The internal gettext library tends to be problematic. It is therefore recommended to
use either an external one (‘--without-included-gettext’) or to disable NLS entirely
(‘--disable-nls’).
If you use GCC 2.95 or newer it is recommended to use also:
$ LIBS="-lgcc"
$ export LIBS
You can also get an a.out executable if you prefer:
$ CPPFLAGS="-D__ST_MT_ERRNO__"
$ export CPPFLAGS
$ CFLAGS="-O2 -Zmt"
$ export CFLAGS
$ LDFLAGS="-s -Zstack 0x8000"
Appendix B: Installing gawk 269
$ LIBS="-lgcc"
$ unset RANLIB
$ ./configure --prefix=c:/usr --without-included-gettext
$ make
NOTE: Even if the compiled gawk.exe (a.out) executable contains a DOS
header, it does not work under DOS. To compile an executable that runs un-
der DOS, "-DPIPES_SIMULATED" must be added to CPPFLAGS. But then some
nonstandard extensions of gawk (e.g., ‘|&’) do not work!
After compilation the internal tests can be performed. Enter ‘make check CMP="diff
-a"’ at your command prompt. All tests but the pid test are expected to work properly.
The pid test fails because child processes are not started by fork().
‘make install’ works as expected.
NOTE: Most 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 http://www.unixos2.org/sw/pub/binary/make/ or on
ftp://hobbes.nmsu.edu/pub/os2/.
mawk adds a ‘-W BINMODE=N ’ option and an environment variable that can set BINMODE,
RS, and ORS. The files ‘binmode[1-3].awk’ (under ‘gnu/lib/awk’ in some of the prepared
distributions) have been chosen to match mawk’s ‘-W BINMODE=N ’ option. These can be
changed or discarded; in particular, the setting of RS giving the fewest “surprises” is open
to debate. mawk uses ‘RS = "\r\n"’ if binary mode is set on read, which is appropriate for
files with the DOS-style end-of-line.
To illustrate, the following examples set binary mode on writes for standard output and
other files, and set ORS as the “usual” 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
Depending upon which C compiler you are using, follow one of the sets of instructions
in this table:
VAX C V3.x
Use either ‘vmsbuild.com’ or ‘descrip.mms’ as is. These use
CC/OPTIMIZE=NOLINE, which is essential for Version 3.0.
VAX C V2.x
You must have Version 2.3 or 2.4; older ones won’t work. Edit either
‘vmsbuild.com’ or ‘descrip.mms’ according to the comments in them. For
‘vmsbuild.com’, this just entails removing two ‘!’ delimiters. Also edit
‘config.h’ (which is a copy of file ‘[.config]vms-conf.h’) and comment out
or delete the two lines ‘#define __STDC__ 0’ and ‘#define VAXC_BUILTINS’
near the end.
GNU C Edit ‘vmsbuild.com’ or ‘descrip.mms’; the changes are different from those
for VAX C V2.x but equally straightforward. No changes to ‘config.h’ are
needed.
DEC C Edit ‘vmsbuild.com’ or ‘descrip.mms’ according to their comments. No
changes to ‘config.h’ are needed.
gawk has been tested under VAX/VMS 5.5-1 using VAX C V3.2, and GNU C 1.40 and
2.3. It should work without modifications for VMS V4.6 and up.
is not found, gawk appends the suffix ‘.awk’ to the filename and retries the file search. If
‘AWK_LIBRARY’ is not defined, that portion of the file search fails benignly.
idea to put it on a RAM drive. If neither TEMP nor TMPDIR are found, then gawk uses the
current directory for its temporary files.
The ST version of gawk searches for its program files, as described in Section 11.4 [The
AWKPATH Environment Variable], page 178. The default value for the AWKPATH variable is
taken from DEFPATH defined in ‘Makefile’. The sample gcc/TOS ‘Makefile’ for the ST in
the distribution sets DEFPATH to ".,c:\lib\awk,c:\gnu\lib\awk". The search path can
be modified by explicitly setting AWKPATH to whatever you want. Note that colons cannot
be used on the ST to separate elements in the AWKPATH variable, since they have another
reserved meaning. Instead, you must use a comma to separate elements in the path. When
recompiling, the separating character can be modified by initializing the envsep variable in
‘unsupported/atari/gawkmisc.atr’ to another value.
Although awk allows great flexibility in doing I/O redirections from within a program,
this facility should be used with care on the ST running under TOS. In some circumstances,
the OS routines for file-handle pool processing lose track of certain events, causing the
computer to crash and requiring a reboot. Often a warm reboot is sufficient. Fortunately,
this happens infrequently and in rather esoteric situations. In particular, avoid having one
part of an awk program using print statements explicitly redirected to ‘/dev/stdout’, while
other print statements use the default standard output, and a calling shell has redirected
standard output to a file.
When gawk is compiled with the ST version of gcc and its usual libraries, it accepts
both ‘/’ and ‘\’ as path separators. While this is convenient, it should be remembered that
this removes one technically valid character (‘/’) from your file name. It may also create
problems for external programs called via the system function, which may not support this
convention. Whenever it is possible that a file created by gawk will be used by some other
program, use only backslashes. Also remember that in awk, backslashes in strings have to
be doubled in order to get literal backslashes (see Section 2.2 [Escape Sequences], page 25).
syntax for ‘/in filename,out filename/’ must be used instead of the usual Unix ‘<’ and
‘>’ for file redirection. (Redirection options on getline, print etc., are supported.)
The ‘-mr val ’ option (see Section 11.2 [Command-Line Options], page 173) has been
“stolen” to enable Tandem users to process fixed-length records with no “end-of-line” char-
acter. That is, ‘-mr 74’ tells gawk to read the input file as fixed 74-byte records.
• The ‘**’ and ‘**=’ operators (see Section 5.5 [Arithmetic Operators],
page 78 and also see Section 5.7 [Assignment Expressions], page 81).
• The use of func as an abbreviation for function (see Section 8.2.1 [Func-
tion Definition Syntax], page 149).
• The ‘\x’ escape sequence (see Section 2.2 [Escape Sequences], page 25).
• The ‘/dev/stdout’, and ‘/dev/stderr’ special files (see Section 4.7 [Spe-
cial File Names in gawk], page 67). Use "-" instead of "/dev/stdin" with
mawk.
• The ability for FS and for the third argument to split to be null strings
(see Section 3.5.2 [Making Each Character a Separate Field], page 44).
• The ability to delete all of an array at once with ‘delete array ’ (see
Section 7.6 [The delete Statement], page 120).
• The ability for RS to be a regexp (see Section 3.1 [How Input Is Split into
Records], page 36).
• The BINMODE special variable for non-Unix operating systems (see Sec-
tion B.3.3.4 [Using gawk on PC Operating Systems], page 270).
The next version of mawk will support nextfile.
awka Written by Andrew Sumner, awka translates awk programs into C, compiles
them, and links them with a library of functions that provides the core awk
functionality. It also has a number of extensions.
The awk translator is released under the GPL, and the library is under the
LGPL.
To get awka, go to http://awka.sourceforge.net. You can reach Andrew
Sumner at andrew@zbcom.net.
pawk Nelson H.F. Beebe at the University of Utah has modified the Bell Labs
awk to provide timing and profiling information. It is different from pgawk
(see Section 10.5 [Profiling Your awk Programs], page 169), 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-20020210.tar.gz or
http://www.math.utah.edu/pub/pawk/pawk-20020210.tar.gz.
Appendix C: Implementation Notes 279
4. Use the gawk coding style. The C code for gawk follows the instructions in the GNU
Coding Standards, with minor exceptions. The code is formatted using the traditional
“K&R” style, particularly as regards to the placement of braces and the use of tabs.
In brief, the coding rules for gawk are as follows:
• Use ANSI/ISO style (prototype) function headers when defining functions.
• Put the name of the function at the beginning of its own line.
• Put the return type of the function, even if it is int, on the line above the line
with the name and arguments of the function.
• Put spaces around parentheses used in control structures (if, while, for, do,
switch, and return).
• Do not put spaces in front of parentheses used in function calls.
• Put spaces around all C operators and after commas in function calls.
• Do not use the comma operator to produce multiple side effects, except in for
loop initialization and increment parts, and in macro bodies.
• Use real tabs for indenting, not spaces.
• Use the “K&R” brace layout style.
• Use comparisons against NULL and ’\0’ in the conditions of if, while, and for
statements, as well as in the cases of switch statements, instead of just the plain
pointer or character value.
• Use the TRUE, FALSE and NULL symbolic constants and the character constant ’\0’
where appropriate, instead of 1 and 0.
• Use the ISALPHA, ISDIGIT, etc. macros, instead of the traditional lowercase ver-
sions; these macros are better behaved for non-ASCII character sets.
• Provide one-line descriptive comments for each function.
• Do not use ‘#elif’. Many older Unix C compilers cannot handle it.
• 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.
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.
5. Be prepared to sign the appropriate paperwork. In order for the FSF to distribute
your changes, you must either place those changes in the public domain and submit
a signed statement to that effect, or assign the copyright in your changes to the FSF.
Both of these actions are easy to do and many people have done so already. If you
have questions, please contact me (see Section B.5 [Reporting Problems and Bugs],
page 276), or gnu@gnu.org.
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 documenta-
tion 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.
Appendix C: Implementation Notes 281
7. Submit changes as context diffs or unified diffs. Use ‘diff -c -r -N’ or ‘diff -u -r
-N’ to compare the original gawk source tree with your version. (I find context diffs to
be more readable but unified diffs are more compact.) 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.5 [Reporting Problems and Bugs], page 276, 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 isn’t possible for me to do that with a
minimum of extra work, then I probably will not.
from a port’s 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.)
6. 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.
7. 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.
8. Be prepared to sign the appropriate paperwork. In order for the FSF to distribute
your code, you must either place your code in the public domain and submit a signed
statement to that effect, or assign the copyright in your code to the FSF.
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.
NODE *
do_xxx(NODE *tree)
{
...
}
NODE *get_argument(NODE *tree, int i)
This function is called from within a C extension function to get the i-th
argument from the function call. The first argument is argument zero.
NODE *get_actual_argument(NODE *tree, unsigned int i,
int optional, int wantarray);
This function retrieves a particular argument i. wantarray is TRUE if the argu-
ment should be an array, FALSE otherwise. If optional is TRUE, the argument
need not have been supplied. If it wasn’t, the return value is NULL. It is a fatal
error if optional is TRUE but the argument was not provided.
Caution: This function is new as of gawk 3.1.4.
get_scalar_argument(t, i, opt)
This is a convenience macro that calls get_actual_argument.
Caution: This macro is new as of gawk 3.1.4.
Appendix C: Implementation Notes 285
get_array_argument(t, i, opt)
This is a convenience macro that calls get_actual_argument.
Caution: This macro is new as of gawk 3.1.4.
void set_value(NODE *tree)
This function is called from within a C extension function to set the return
value from the extension function. This value is what the awk program sees as
the return value from the new awk function.
void update_ERRNO(void)
This function is called from within a C extension function to set the value of
gawk’s ERRNO variable, based on the current value of the C errno variable. It
is provided as a convenience.
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.
In versions of gawk up to and including 3.1.2, the following boilerplate code shows how
to do this:
NODE *the_arg;
/* check type */
if (the_arg->type != Node_var && the_arg->type != Node_var_array)
fatal("newfunc: third argument is not an array");
/* force it to be an array: */
the_arg = get_array(the_arg);
"blocks" The number of disk blocks the file actually occupies. This may not be a function
of the file’s size if the file has holes.
"atime"
"mtime"
"ctime" The file’s last access, modification, and inode update times, respectively. These
are numeric timestamps, suitable for formatting with strftime (see Section 8.1
[Built-in Functions], page 127).
"pmode" The file’s “printable mode.” This is a string representation of the file’s type and
permissions, such as what is produced by ‘ls -l’—for example, "drwxr-xr-x".
"type" A printable string representation of the file’s 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" The file is a named-pipe (also known as a FIFO).
"file" The file is just a regular file.
"socket" The file is an AF_UNIX (“Unix domain”) socket in the filesystem.
"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 7.2 [Referring to an Array Element], page 117):
"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.
#include "awk.h"
#include <sys/sysmacros.h>
static NODE *
do_chdir(tree)
NODE *tree;
{
NODE *newdir;
int ret = -1;
static char *
format_mode(fmode)
unsigned long fmode;
{
...
}
Next comes the actual do_stat function itself. First come the variable declarations and
argument checking:
/* do_stat --- provide a stat() function for gawk */
static NODE *
do_stat(tree)
NODE *tree;
{
NODE *file, *array;
struct stat sbuf;
int ret;
NODE **aptr;
char *pmode; /* printable mode */
char *type = "unknown";
set_value(tmp_number((AWKNUM) ret));
free_temp(file);
return tmp_number((AWKNUM) 0);
}
290 GAWK: Effective AWK Programming
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_string("name", 4), FALSE);
*aptr = dupnode(file);
NODE *
dlload(tree, dl)
NODE *tree;
void *dl;
{
make_builtin("chdir", do_chdir, 1);
make_builtin("stat", do_stat, 2);
return tmp_number((AWKNUM) 0);
}
And that’s it! As an exercise, consider adding functions to implement system calls such
as chown, chmod, and umask.
Once the library exists, it is loaded by calling the extension built-in function. This
function takes two arguments: the name of the library to load and the name of a function
to call when the library is first loaded. This function adds the new functions to gawk. It
returns the value returned by the initialization function within the shared library:
# file testff.awk
BEGIN {
extension("./filefuncs.so", "dlload")
chdir(".") # no-op
This section briefly lists extensions and possible improvements that indicate the direc-
tions we are currently considering for gawk. The file ‘FUTURES’ in the gawk distribution lists
these extensions as well.
Following is a list of probable future changes visible at the awk language level:
Loadable module interface
It is not clear that the awk-level interface to the modules facility is as good as it
should be. The interface needs to be redesigned, particularly taking namespace
issues into account, as well as possibly including issues such as library search
path order and versioning.
RECLEN variable for fixed-length records
Along with FIELDWIDTHS, this would speed up the processing of fixed-length
records. PROCINFO["RS"] would be "RS" or "RECLEN", depending upon which
kind of record processing is in effect.
Additional printf specifiers
The 1999 ISO C standard added a number of additional printf format speci-
fiers. These should be evaluated for possible inclusion in gawk.
Databases It may be possible to map a GDBM/NDBM/SDBM file into an awk array.
Large character sets
It would be nice if gawk could handle UTF-8 and other character sets that are
larger than eight bits. (gawk currently has partial multi-byte support, but it
needs an expert to really think out the multi-byte issues and consult with the
maintainer on the appropriate changes.)
More lint warnings
There are more things that could be checked for portability.
Following is a list of probable improvements that will make gawk’s source code easier to
work with:
Loadable module mechanics
The current extension mechanism works (see Section C.3 [Adding New Built-
in Functions to gawk], page 282), but is rather primitive. It requires a fair
amount of manual work to create and integrate a loadable module. Nor is the
current mechanism as portable as might be desired. The GNU libtool package
provides a number of features that would make using loadable modules much
easier. gawk should be changed to use libtool.
Loadable module internals
The API to its internals that gawk “exports” should be revised. Too many
things are needlessly exposed. A new API should be designed and implemented
to make module writing easier.
Better array subscript management
gawk’s management of array subscript storage could use revamping, so that
using the same value to index multiple arrays only stores one copy of the index
value.
Appendix C: Implementation Notes 293
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:
No
Initialization More Data? 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 awk’s BEGIN rule (see Section 6.1.4 [The BEGIN and
END Special Patterns], page 96).
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.
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. awk’s
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.
1
Compiled programs are typically written in lower-level languages such as C, C++, Fortran, or Ada, and
then translated, or compiled, into a form that the computer can execute directly.
Appendix D: Basic Programming Concepts 295
Clean Up Once you’ve processed all the data, you may have things you need to do before
exiting. This step corresponds to awk’s END rule (see Section 6.1.4 [The BEGIN
and END Special Patterns], page 96).
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.
An algorithm is a detailed set of instructions necessary to accomplish a task, or process
data. It is much the same as a recipe for baking a cake. Programs implement algorithms.
Often, it is up to you to design the algorithm and implement it, simultaneously.
The “logical chunks” we talked about previously are called records, similar to the records
a company keeps on employees, a school keeps for students, or a doctor keeps for patients.
Each record has many component parts, such as first and last names, date of birth, address,
and so on. The component parts are referred to as the fields of the record.
The act of reading data is termed input, and that of generating results, not too surpris-
ingly, is termed output. They are often referred to together as “input/output,” and even
more often, as “I/O” for short. (You will also see “input” and “output” used as verbs.)
awk manages the reading of data for you, as well as the breaking it up into records and
fields. Your program’s job is to tell awk what to with the data. You do this by describing
patterns in the data to look for, and actions to execute when those patterns are seen. This
data-driven nature of awk programs usually makes them both easier to write and easier to
read.
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 296.
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 5.1.2 [Octal and Hexadecimal Numbers],
page 73.
Programs are written in programming languages. Hundreds, if not thousands, of pro-
gramming 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. Where it makes sense, POSIX awk is compatible with 1990 ISO
C.
In 1999, a revised ISO C standard was approved and released. Future versions of gawk
will be as compatible as possible with this standard.
Section 5.10 [Variable Typing and Comparison Expressions], page 85), which plays a role
in how variables are used in comparisons.
It is important to note that the string value for a number may not reflect the full value (all
the digits) that the numeric value actually contains. The following program (‘values.awk’)
illustrates this:
{
$1 = $2 + $3
# see it for what it is
printf("$1 = %.12g\n", $1)
# use CONVFMT
a = "<" $1 ">"
print "a =", a
# use OFMT
print "$1 =", $1
}
This program shows the full value of the sum of $2 and $3 using printf, and then prints
the string values obtained from both automatic conversion (via CONVFMT) and from printing
(via OFMT).
Here is what happens when the program is run:
$ echo 2 3.654321 1.2345678 | awk -f values.awk
a $1 = 4.8888888
a a = <4.88889>
a $1 = 4.88889
This makes it clear that the full numeric value is different from what the default string
representations show.
CONVFMT’s 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 number’s
value exactly.3
Unlike numbers in the abstract sense (such as what you studied in high school or college
math), numbers stored in computers are limited in certain ways. They cannot represent
an infinite number of digits, nor can they always represent things exactly. In particular,
floating-point numbers cannot always represent values exactly. Here is an example:
$ awk ’{ printf("%010d\n", $1 * 100) }’
515.79
a 0000051579
515.80
a 0000051579
515.81
a 0000051580
515.82
a 0000051582
Ctrl-d
3
Pathological cases can require up to 752 digits (!), but we doubt that you need to worry about this.
298 GAWK: Effective AWK Programming
This shows that some values can be represented exactly, whereas others are only approx-
imated. This is not a “bug” in awk, but simply an artifact of how computers represent
numbers.
Another peculiarity of floating-point numbers on modern systems is that they often have
more than one representation for the number zero! In particular, it is possible to represent
“minus zero” as well as regular, or “positive” zero.
This example shows that negative and positive zero are distinct values when stored
internally, but that they are in fact equal to each other, as well as to “regular” zero:
$ gawk ’BEGIN { mz = -0 ; pz = 0
> printf "-0 = %g, +0 = %g, (-0 == +0) -> %d\n", mz, pz, mz == pz
> printf "mz == 0 -> %d, pz == 0 -> %d\n", mz == 0, pz == 0
> }’
a -0 = -0, +0 = 0, (-0 == +0) -> 1
a mz == 0 -> 1, pz == 0 -> 1
It helps to keep this in mind should you process numeric data that contains negative
zero values; the fact that the zero is negative is noted and can affect comparisons.
Appendix D: Glossary 299
Glossary
Action A series of awk statements attached to a rule. If the rule’s pattern matches
an input record, awk executes the rule’s action. Actions are always enclosed in
curly braces. (See Section 6.3 [Actions], page 98.)
Amazing awk Assembler
Henry Spencer at the University of Toronto wrote a retargetable assembler
completely as sed and awk scripts. It is thousands of lines long, including
machine descriptions for several eight-bit microcomputers. It is a good example
of a program that would have been better written in another language. You
can get it from ftp://ftp.freefriends.org/arnold/Awkstuff/aaa.tgz.
Amazingly Workable Formatter (awf)
Henry Spencer at the University of Toronto wrote a formatter that
accepts a large subset of the ‘nroff -ms’ and ‘nroff -man’ formatting
commands, using awk and sh. It is available over the Internet from
ftp://ftp.freefriends.org/arnold/Awkstuff/awf.tgz.
Anchor The regexp metacharacters ‘^’ and ‘$’, which force the match to the beginning
or end of the string, respectively.
ANSI The American National Standards Institute. This organization produces many
standards, among them the standards for the C and C++ programming lan-
guages. These standards often become international standards as well. See also
“ISO.”
Array A grouping of multiple values under the same name. Most languages just pro-
vide sequential arrays. awk provides associative arrays.
Assertion A statement in a program that a condition is true at this point in the program.
Useful for reasoning about how a program is supposed to behave.
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 5.7 [Assignment Expressions], page 81.
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 program’s rules are
all processed in turn. awk programs may also contain function definitions.
awk Script Another name for an awk program.
Bash The GNU version of the standard shell (the Bourne-Again SHell). See also
“Bourne Shell.”
300 GAWK: Effective AWK Programming
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).
Compound Statement
A series of awk statements, enclosed in curly braces. Compound statements
may be nested. (See Section 6.4 [Control Statements in Actions], page 99.)
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 5.6 [String Concatenation],
page 80.)
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 5.12
[Conditional Expressions], page 89.)
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 5.10 [Variable Typing and Comparison
Expressions], page 85.)
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.”
302 GAWK: Effective AWK Programming
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 5.4 [Conversion of Strings and Numbers],
page 77.)
Deadlock The situation in which two communicating processes are each waiting for the
other to perform an action.
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 2.8 [Using Dynamic Regexps],
page 34.)
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 in-
formation 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
Unix 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 2.2 [Escape Sequences], page 25.)
FDL See “Free Documentation License.”
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. (See
Section 3.5 [Specifying How Fields Are Separated], page 43, and Section 3.6
[Reading Fixed-Width Data], page 47.)
Appendix D: Glossary 303
Flag A variable whose truth value indicates the existence or nonexistence of some
condition.
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 string
contained in the built-in variable CONVFMT. (See Section 4.5.2 [Format-Control
Letters], page 60.)
Free Documentation License
This document describes the terms under which this book is published and may
be copied. (See [GNU Free Documentation License], page 315.)
Function A specialized group of statements used to encapsulate general or program-
specific tasks. awk has a number of built-in functions, and also allows you
to define your own. (See Chapter 8 [Functions], page 127.)
FSF See “Free Software Foundation.”
Free Software Foundation
A nonprofit organization dedicated to the production and distribution of freely
distributable software. It was founded by Richard M. Stallman, the author
of the original Emacs editor. GNU Emacs is the most widely used version of
Emacs today.
gawk The GNU implementation of awk.
General Public License
This document describes the terms under which gawk and its source code may
be distributed. (See [GNU General Public License], page 309.)
GMT “Greenwich Mean Time.” This is the old term for UTC. It is the time of day
used as the epoch for Unix and POSIX systems. See also “Epoch” and “UTC.”
GNU “GNU’s not Unix”. An on-going project of the Free Software Foundation to
create a complete, freely distributable, POSIX-compliant computing environ-
ment.
GNU/Linux
A variant of the GNU system using the Linux kernel, instead of the Free Soft-
ware Foundation’s Hurd kernel. Linux is a stable, efficient, full-featured 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 See “General Public License.”
304 GAWK: Effective AWK Programming
Hexadecimal
Base 16 notation, where the digits are 0–9 and A–F, 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).
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 3.1 [How Input Is Split into Records],
page 36.)
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 in-
structions 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 traditionally available
in awk programs.
ISO The International Standards Organization. This organization produces inter-
national 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.
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.
gawk’s keywords are: BEGIN, END, if, else, while, do...while, for, for...in,
break, continue, delete, next, nextfile, function, func, and exit.
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 See “Lesser General Public License.”
Localization
The process of providing the data necessary for an internationalized program
to work in a particular language.
Appendix D: Glossary 305
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 An expression that can appear on the left side of an assignment operator. In
most languages, lvalues can be variables or array elements. In awk, a field
designator can also be used as an 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 al-
ternation.
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. Very old awk implementations
use single-precision floating-point.
Octal Base-eight notation, where the digits are 0–7. Octal numbers are written in C
using a leading ‘0’, to indicate their base. Thus, 013 is 11 (one times 8 plus 3).
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
typical pattern might compare the input record against a regular expression.
(See Section 6.1 [Pattern Elements], page 93.)
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.2-1992, Portable Operating System Interface (POSIX) Part 2:
Shell and Utilities. Informally, this standard is often referred to as simply
“P1003.2.”
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 func-
tions and not for the main awk program. Special care must be taken when
naming such variables and functions. (See Section 12.1 [Naming Library Func-
tion Global Variables], page 181.)
306 GAWK: Effective AWK Programming
Short-Circuit
The nature of the awk logical operators ‘&&’ and ‘||’. If the value of the en-
tire expression is determinable from evaluating just the lefthand side of these
operators, the righthand side is not evaluated. (See Section 5.11 [Boolean Ex-
pressions], page 88.)
Side Effect
A side effect occurs when an expression has an effect aside from merely pro-
ducing a value. Assignment expressions, increment and decrement expressions,
and function calls have side effects. (See Section 5.7 [Assignment Expressions],
page 81.)
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 The character generated by hitting the space bar on the keyboard.
Special File
A file name interpreted internally by gawk, instead of being handed directly to
the underlying operating system—for example, ‘/dev/stderr’. (See Section 4.7
[Special File Names in gawk], page 67.)
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.
String A datum consisting of a sequence of characters, such as ‘I am a string’. Con-
stant strings are written with double quotes in the awk language and may
contain escape sequences. (See Section 2.2 [Escape Sequences], page 25.)
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 A computer operating system originally developed in the early 1970’s at AT&T
Bell Laboratories. It initially became popular in universities around the world
and later moved into commercial environments as a software development sys-
tem and network server system. There are many commercial versions of Unix,
308 GAWK: Effective AWK Programming
as well as several work-alike systems whose source code is freely available (such
as GNU/Linux, NetBSD, FreeBSD, and OpenBSD).
UTC The accepted abbreviation for “Universal Coordinated Time.” This is standard
time in Greenwich, England, which is used as a reference time for day and date
calculations. See also “Epoch” and “GMT.”
Whitespace
A sequence of space, TAB, or newline characters occurring inside an input
record or a string.
Appendix D: GNU General Public License 309
Preamble
The licenses for most software are designed to take away your freedom to share and change
it. By contrast, the GNU General Public License is intended to guarantee your freedom
to share and change free software—to make sure the software is free for all its users. This
General Public License applies to most of the Free Software Foundation’s software and to
any other program whose authors commit to using it. (Some other Free Software Foundation
software is covered by the GNU Library General Public License instead.) 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 this service 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 make restrictions that forbid anyone to deny you
these rights or to ask you to surrender the rights. These restrictions translate to certain
responsibilities for you if you distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether gratis or for a fee, you
must give the recipients all the rights that you have. 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.
We protect your rights with two steps: (1) copyright the software, and (2) offer you this
license which gives you legal permission to copy, distribute and/or modify the software.
Also, for each author’s protection and ours, we want to make certain that everyone
understands that there is no warranty for this free software. If the software is modified by
someone else and passed on, we want its recipients to know that what they have is not the
original, so that any problems introduced by others will not reflect on the original authors’
reputations.
Finally, any free program is threatened constantly by software patents. We wish to avoid
the danger that redistributors of a free program will individually obtain patent licenses, in
effect making the program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone’s free use or not licensed at all.
The precise terms and conditions for copying, distribution and modification follow.
310 GAWK: Effective AWK Programming
Thus, it is not the intent of this section to claim rights or contest your rights to
work written entirely by you; rather, the intent is to exercise the right to control the
distribution of derivative or collective works based on the Program.
In addition, mere aggregation of another work not based on the Program with the
Program (or with a work based on the Program) on a volume of a storage or distribution
medium does not bring the other work under the scope of this License.
3. You may copy and distribute the Program (or a work based on it, under Section 2)
in object code or executable form under the terms of Sections 1 and 2 above provided
that you also do one of the following:
a. Accompany it with the complete corresponding machine-readable source code,
which must be distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
b. Accompany it with a written offer, valid for at least three years, to give any third
party, for a charge no more than your cost of physically performing source distri-
bution, a complete machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium customarily
used for software interchange; or,
c. Accompany it with the information you received as to the offer to distribute cor-
responding source code. (This alternative is allowed only for noncommercial dis-
tribution and only if you received the program in object code or executable form
with such an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for making modifi-
cations to it. For an executable work, complete source code means all the source code
for all modules it contains, plus any associated interface definition files, plus the scripts
used to control compilation and installation of the executable. However, as a spe-
cial exception, the source code distributed need not include anything that is normally
distributed (in either source or binary form) with the major components (compiler,
kernel, and so on) of the operating system on which the executable runs, unless that
component itself accompanies the executable.
If distribution of executable or object code is made by offering access to copy from
a designated place, then offering equivalent access to copy the source code from the
same place counts as distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program except as expressly
provided under this License. Any attempt otherwise to copy, modify, sublicense or
distribute the Program is void, and will automatically terminate your rights under this
License. However, parties who have received copies, or rights, from you under this
License will not have their licenses terminated so long as such parties remain in full
compliance.
5. You are not required to accept this License, since you have not signed it. However,
nothing else grants you permission to modify or distribute the Program or its derivative
works. These actions are prohibited by law if you do not accept this License. Therefore,
by modifying or distributing the Program (or any work based on the Program), you
indicate your acceptance of this License to do so, and all its terms and conditions for
copying, distributing or modifying the Program or works based on it.
312 GAWK: Effective AWK Programming
6. Each time you redistribute the Program (or any work based on the Program), the
recipient automatically receives a license from the original licensor to copy, distribute
or modify the Program subject to these terms and conditions. You may not impose
any further restrictions on the recipients’ exercise of the rights granted herein. You are
not responsible for enforcing compliance by third parties to this License.
7. If, as a consequence of a court judgment or allegation of patent infringement or for any
other reason (not limited to patent issues), 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 distribute so as
to satisfy simultaneously your obligations under this License and any other pertinent
obligations, then as a consequence you may not distribute the Program at all. For
example, if a patent license would not permit royalty-free redistribution of the Program
by all those who receive copies directly or indirectly through you, then the only way
you could satisfy both it and this License would be to refrain entirely from distribution
of the Program.
If any portion of this section is held invalid or unenforceable under any particular
circumstance, the balance of the section is intended to apply and the section as a
whole is intended to apply in other circumstances.
It is not the purpose of this section to induce you to infringe any patents or other
property right claims or to contest validity of any such claims; this section has the
sole purpose of protecting the integrity of the free software distribution system, which
is implemented by public license practices. Many people have made generous contri-
butions to the wide range of software distributed through that system in reliance on
consistent application of that system; it is up to the author/donor to decide if he or
she is willing to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to be a consequence
of the rest of this License.
8. If the distribution and/or use of the Program is restricted in certain countries either
by patents or by copyrighted interfaces, the original copyright holder who places the
Program under this License may add an explicit geographical distribution limitation
excluding those countries, so that distribution is permitted only in or among countries
not thus excluded. In such case, this License incorporates the limitation as if written
in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions of the 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 a
version number of this License which applies to it and “any later version”, you have
the option of following the terms and conditions either of that version or of any later
version published by the Free Software Foundation. If the Program does not specify a
version number of this License, you may choose any version ever published by the Free
Software Foundation.
10. If you wish to incorporate parts of the Program into other free programs whose distri-
bution conditions are different, write to the author to ask for permission. For software
Appendix D: GNU General Public License 313
which is copyrighted by the Free Software Foundation, write to the Free Software Foun-
dation; we sometimes make exceptions for this. Our decision will be guided by the two
goals of preserving the free status of all derivatives of our free software and of promoting
the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO
WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY AP-
PLICABLE 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 IM-
PLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE EN-
TIRE 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.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO
MAY MODIFY AND/OR REDISTRIBUTE 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.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this when it starts in an
interactive mode:
Gnomovision version 69, Copyright (C) year name of author
Gnomovision 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, the commands you use may be called something
other than ‘show w’ and ‘show c’; they could even be mouse-clicks or menu items—whatever
suits your program.
You should also get your employer (if you work as a programmer) or your school, if any,
to sign a “copyright disclaimer” for the program, if necessary. Here is a sample; alter the
names:
Yoyodyne, Inc., hereby disclaims all copyright
interest in the program ‘Gnomovision’
(which makes passes at compilers) written
by James Hacker.
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 com-
posed 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 work’s title, preceding the
beginning of the body of the text.
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
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
Appendix D: GNU Free Documentation License 317
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 Document’s 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,
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.
318 GAWK: Effective AWK Programming
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 Document’s 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 Docu-
ment, 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
titles to the list of Invariant Sections in the Modified Version’s license notice. These
titles must be distinct from any other section titles.
Appendix D: GNU Free Documentation License 319
You may add a section Entitled “Endorsements”, provided it contains nothing but
endorsements of your Modified Version by various parties—for 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 vari-
ous 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 individu-
ally 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.
7. AGGREGATION WITH INDEPENDENT WORKS
A compilation of the Document or its derivatives with other separate and independent
documents or works, in or on a volume of a storage or distribution medium, is called
320 GAWK: Effective AWK Programming
an “aggregate” if the copyright resulting from the compilation is not used to limit the
legal rights of the compilation’s users beyond what the individual works permit. When
the Document is included an aggregate, this License does not apply to the other works
in the aggregate which are not themselves derivative works of the Document.
If the Cover Text requirement of section 3 is applicable to these copies of the Document,
then if the Document is less than one half of the entire aggregate, the Document’s Cover
Texts may be placed on covers that bracket the Document within the aggregate, or the
electronic equivalent of covers if the Document is in electronic form. Otherwise they
must appear on printed covers that bracket the whole aggregate.
8. TRANSLATION
Translation is considered a kind of modification, so you may distribute translations
of the Document under the terms of section 4. Replacing Invariant Sections with
translations requires special permission from their copyright holders, but you may
include translations of some or all Invariant Sections in addition to the original versions
of these Invariant Sections. You may include a translation of this License, and all the
license notices in the Document, and any Warrany Disclaimers, provided that you
also include the original English version of this License and the original versions of
those notices and disclaimers. In case of a disagreement between the translation and
the original version of this License or a notice or disclaimer, the original version will
prevail.
If a section in the Document is Entitled “Acknowledgements”, “Dedications”, or “His-
tory”, the requirement (section 4) to Preserve its Title (section 1) will typically require
changing the actual title.
9. TERMINATION
You may not copy, modify, sublicense, or distribute the Document except as expressly
provided for under this License. Any other attempt to copy, modify, sublicense or
distribute the Document is void, and will automatically terminate your rights under
this License. However, parties who have received copies, or rights, from you under this
License will not have their licenses terminated so long as such parties remain in full
compliance.
10. FUTURE REVISIONS OF THIS LICENSE
The Free Software Foundation may publish new, revised versions of the GNU Free
Documentation 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.
See http://www.gnu.org/copyleft/.
Each version of the License is given a distinguishing version number. If the Document
specifies that a particular numbered version of this License “or any later version”
applies to it, you have the option of following the terms and conditions either of that
specified version or of any later version that has been published (not as a draft) by
the Free Software Foundation. If the Document does not specify a version number of
this License, you may choose any version ever published (not as a draft) by the Free
Software Foundation.
Appendix D: GNU Free Documentation License 321
Index
! *
! (exclamation point), ! operator . . . . . 88, 91, 218 * (asterisk), * operator, as multiplication operator
! (exclamation point), != operator . . . . . . . . . 86, 91 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91
! (exclamation point), !~ operator . . 24, 32, 34, 74, * (asterisk), * operator, as regexp operator . . . . 28
86, 87, 91, 94 * (asterisk), * operator, null strings, matching
! operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95, 218 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
* (asterisk), ** operator . . . . . . . . . . . . . . 80, 91, 176
* (asterisk), **= operator . . . . . . . . . . . . . 83, 92, 176
* (asterisk), *= operator . . . . . . . . . . . . . . . . . . 83, 92
"
" (double quote) . . . . . . . . . . . . . . . . . . . . . . . . . 12, 15
" (double quote), regexp constants . . . . . . . . . . . . 34
+
+ (plus sign) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
+ (plus sign), + operator . . . . . . . . . . . . . . . . . . . . . . 91
+ (plus sign), ++ operator . . . . . . . . . . . . . . . . . 84, 91
# + (plus sign), += operator . . . . . . . . . . . . . . . . . 82, 92
# (number sign), #! (executable scripts) . . . . . . . 13 + (plus sign), decrement/increment operators . . 83
# (number sign), #! (executable scripts),
portability issues with . . . . . . . . . . . . . . . . . . . 13
# (number sign), commenting . . . . . . . . . . . . . . . . . 14
,
, (comma), in range patterns . . . . . . . . . . . . . . . . . 95
$ -
$ (dollar sign) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 - (hyphen), - operator . . . . . . . . . . . . . . . . . . . . . . . 91
$ (dollar sign), $ field operator . . . . . . . . . . . . 39, 91 - (hyphen), -- (decrement/increment) operator
$ (dollar sign), incrementing fields and arrays . . 84 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91
$ field operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 - (hyphen), -- operator . . . . . . . . . . . . . . . . . . . . . . 84
- (hyphen), -= operator . . . . . . . . . . . . . . . . . . . 83, 92
- (hyphen), filenames beginning with . . . . . . . . . 174
- (hyphen), in character lists . . . . . . . . . . . . . . . . . 29
% --assign option . . . . . . . . . . . . . . . . . . . . . . . . . . . . 174
% (percent sign), % operator . . . . . . . . . . . . . . . . . . . 91 --compat option . . . . . . . . . . . . . . . . . . . . . . . . . . . . 174
% (percent sign), %= operator . . . . . . . . . . . . . . 83, 92 --copyleft option . . . . . . . . . . . . . . . . . . . . . . . . . . 175
--copyright option . . . . . . . . . . . . . . . . . . . . . . . . . 174
--disable-lint configuration option . . . . . . . . . 264
--disable-nls configuration option . . . . . . . . . . 265
& --dump-variables option . . . . . . . . . . . . . . . 175, 182
& (ampersand), && operator . . . . . . . . . . . . . . . 88, 91 --enable-portals configuration option . . 169, 264
& (ampersand), gsub/gensub/sub functions and --enable-switch configuration option. . . . . . . . 264
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 136 --field-separator option . . . . . . . . . . . . . . . . . . 173
--file option . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173
--gen-po option . . . . . . . . . . . . . . . . . . . . . . . 160, 175
’ --help option . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 175
--lint option . . . . . . . . . . . . . . . . . . . . . . . . . . 173, 175
’ (single quote) . . . . . . . . . . . . . . . . . . . . . . . 11, 13, 15 --lint-old option . . . . . . . . . . . . . . . . . . . . . . . . . . 175
’ (single quote), vs. apostrophe . . . . . . . . . . . . . . . 14 --non-decimal-data option . . . . . . . . . . . . . 165, 175
’ (single quote), with double quotes . . . . . . . . . . . 15 --non-decimal-data option, strtonum function
and . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165
--posix option . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 176
( --posix option, --traditional option and . . . 176
--profile option . . . . . . . . . . . . . . . . . . . . . . 169, 176
() (parentheses) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 --re-interval option. . . . . . . . . . . . . . . . . . . . . . . 176
() (parentheses), pgawk program . . . . . . . . . . . . . 171 --source option . . . . . . . . . . . . . . . . . . . . . . . 176, 177
Appendix D: Index 323
input redirection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 L
input, data, nondecimal . . . . . . . . . . . . . . . . . . . . . 165 labels.awk program . . . . . . . . . . . . . . . . . . . . . . . . 236
input, explicit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 languages, data-driven . . . . . . . . . . . . . . . . . . . . . . 295
input, files, See input files . . . . . . . . . . . . . . . . . . . . 49 LC_ALL locale category . . . . . . . . . . . . . . . . . . . . . . 158
input, multiline records . . . . . . . . . . . . . . . . . . . . . . 49 LC_COLLATE locale category . . . . . . . . . . . . . . . . . . 157
input, splitting into records . . . . . . . . . . . . . . . . . . . 36 LC_CTYPE locale category . . . . . . . . . . . . . . . . . . . . 157
input, standard . . . . . . . . . . . . . . . . . . . . . . . . . . 12, 68 LC_MESSAGES locale category . . . . . . . . . . . . . . . . . 157
input/output, binary . . . . . . . . . . . . . . . . . . . . . . . . 107 LC_MESSAGES locale category, bindtextdomain
input/output, from BEGIN and END . . . . . . . . . . . . 97 function (gawk) . . . . . . . . . . . . . . . . . . . . . . . . . 159
input/output, two-way . . . . . . . . . . . . . . . . . . . . . . 166 LC_MONETARY locale category . . . . . . . . . . . . . . . . . 157
insomnia, cure for . . . . . . . . . . . . . . . . . . . . . . . . . . 231 LC_NUMERIC locale category . . . . . . . . . . . . . . . . . . 157
installation, amiga . . . . . . . . . . . . . . . . . . . . . . . . . . 266 LC_RESPONSE locale category . . . . . . . . . . . . . . . . . 158
installation, atari . . . . . . . . . . . . . . . . . . . . . . . . . . . 274 LC_TIME locale category . . . . . . . . . . . . . . . . . . . . . 158
installation, beos . . . . . . . . . . . . . . . . . . . . . . . . . . . 266 left angle bracket (<), < operator . . . . . . . . . . 86, 91
installation, tandem. . . . . . . . . . . . . . . . . . . . . . . . . 275 left angle bracket (<), < operator (I/O) . . . . . . . . 53
installation, vms . . . . . . . . . . . . . . . . . . . . . . . . . . . . 271 left angle bracket (<), <= operator . . . . . . . . . 86, 91
installing gawk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260 left shift, bitwise . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147
int function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128 leftmost longest match . . . . . . . . . . . . . . . . . . . . . . . 49
INT signal (MS-DOS) . . . . . . . . . . . . . . . . . . . . . . . 172 length function . . . . . . . . . . . . . . . . . . . . . . . . . . . . 130
integers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295 Lesser General Public License (LGPL) . . . . . . . 304
integers, unsigned . . . . . . . . . . . . . . . . . . . . . . . . . . . 295 LGPL (Lesser General Public License) . . . . . . . 304
interacting with other programs. . . . . . . . . . . . . . 141 libraries of awk functions . . . . . . . . . . . . . . . . . . . . 181
libraries of awk functions, assertions . . . . . . . . . . 186
internationalization . . . . . . . . . . . . . . . . . . . . . 149, 156
libraries of awk functions, associative arrays and
internationalization, localization . . . . . . . . . 110, 156
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 182
internationalization, localization, character classes
libraries of awk functions, character values as
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
numbers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188
internationalization, localization, gawk and. . . . 156
libraries of awk functions, command-line options
internationalization, localization, locale categories . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157 libraries of awk functions, example program for
internationalization, localization, marked strings using . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 244
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158 libraries of awk functions, group database, reading
internationalization, localization, portability and . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 205
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 161 libraries of awk functions, managing, data files
internationalizing a program . . . . . . . . . . . . . . . . . 156 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192
interpreted programs . . . . . . . . . . . . . . . . . . . 294, 304 libraries of awk functions, managing, time . . . . . 190
interval expressions . . . . . . . . . . . . . . . . . . . . . . . . . . 28 libraries of awk functions, merging arrays into
inventory-shipped file . . . . . . . . . . . . . . . . . . . . . . 16 strings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 190
ISO. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 304 libraries of awk functions, nextfile statement
ISO 8859-1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 300 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 183
ISO Latin-1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 300 libraries of awk functions, rounding numbers . . 187
libraries of awk functions, user database, reading
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
J line breaks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
Jacobs, Andrew . . . . . . . . . . . . . . . . . . . . . . . . . . . . 202 line continuations . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
Jaegermann, Michal . . . . . . . . . . . . . . . . . . . . . . 9, 258 line continuations, gawk . . . . . . . . . . . . . . . . . . . . . . 89
Jedi knights . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180 line continuations, in print statement . . . . . . . . . 58
join user-defined function . . . . . . . . . . . . . . . . . . . 190 line continuations, with C shell . . . . . . . . . . . . . . . 20
lines, blank, printing . . . . . . . . . . . . . . . . . . . . . . . . . 57
lines, counting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
K lines, duplicate, removing . . . . . . . . . . . . . . . . . . . 239
lines, matching ranges of . . . . . . . . . . . . . . . . . . . . . 95
Kahrs, Jürgen . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9, 258 lines, skipping between markers . . . . . . . . . . . . . . . 95
Kenobi, Obi-Wan . . . . . . . . . . . . . . . . . . . . . . . . . . . 180 lint checking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109
Kernighan, Brian . . . 4, 7, 9, 80, 254, 258, 277, 296 lint checking, array elements . . . . . . . . . . . . . . . . . 120
kill command, dynamic profiling . . . . . . . . . . . . 172 lint checking, array subscripts . . . . . . . . . . . . . . . 122
Knights, jedi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180 lint checking, empty programs . . . . . . . . . . . . . . . 173
Kwok, Conrad . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 258 lint checking, issuing warnings . . . . . . . . . . . . . . . 175
Appendix D: Index 333
numbers, floating-point, AWKNUM internal type output field separator, See OFS variable . . . . . . . . 41
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283 output record separator, See ORS variable . . . . . . 59
numbers, hexadecimal . . . . . . . . . . . . . . . . . . . . . . . . 73 output redirection . . . . . . . . . . . . . . . . . . . . . . . . . . . 65
numbers, NODE internal type . . . . . . . . . . . . . . . . . 283 output, buffering . . . . . . . . . . . . . . . . . . . . . . . 140, 142
numbers, octal. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 output, duplicating into files . . . . . . . . . . . . . . . . . 223
numbers, random . . . . . . . . . . . . . . . . . . . . . . . . . . . 128 output, files, closing . . . . . . . . . . . . . . . . . . . . . . . . . . 70
numbers, rounding . . . . . . . . . . . . . . . . . . . . . . . . . . 187 output, format specifier, OFMT . . . . . . . . . . . . . . . . . 59
numeric, constants . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 output, formatted. . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
numeric, output format . . . . . . . . . . . . . . . . . . . . . . 59 output, pipes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
numeric, strings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 output, printing, See printing . . . . . . . . . . . . . . . . . 57
numeric, values . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283 output, records . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
output, standard. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68
O
oawk utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 P
obsolete features . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179 P1003.2 POSIX standard . . . . . . . . . . . . . . . . . . . . 305
octal numbers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 param_cnt internal variable . . . . . . . . . . . . . . . . . . 283
octal values, enabling interpretation of . . . . . . . 175 parameters, number of . . . . . . . . . . . . . . . . . . . . . . 283
OFMT variable . . . . . . . . . . . . . . . . . . . . . . . . 59, 78, 109 parentheses () . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
OFMT variable, POSIX awk and . . . . . . . . . . . . . . . . 60 parentheses (), pgawk program . . . . . . . . . . . . . . 171
OFS variable . . . . . . . . . . . . . . . . . . . . . . . . . 41, 59, 109 password file . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
OpenBSD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307 patterns. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
operating systems, BSD-based . . . . . . . . . . . . . 7, 169 patterns, comparison expressions as . . . . . . . . . . . 93
operating systems, PC, gawk on . . . . . . . . . . . . . . 270 patterns, counts . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171
operating systems, PC, gawk on, installing . . . . 267 patterns, default . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
operating systems, porting gawk to . . . . . . . . . . . 281 patterns, empty . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
operating systems, See Also GNU/Linux, PC patterns, expressions as . . . . . . . . . . . . . . . . . . . . . . 93
operating systems, Unix. . . . . . . . . . . . . . . . . 260 patterns, ranges in . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
operations, bitwise . . . . . . . . . . . . . . . . . . . . . . . . . . 147 patterns, regexp constants as . . . . . . . . . . . . . . . . . 94
operators, arithmetic . . . . . . . . . . . . . . . . . . . . . . . . . 79 patterns, types of . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
operators, assignment . . . . . . . . . . . . . . . . . . . . . . . . 81 pawk profiling Bell Labs awk . . . . . . . . . . . . . . . . . 278
operators, assignment, evaluation order . . . . . . . . 82 PC operating systems, gawk on . . . . . . . . . . . . . . 270
operators, Boolean, See Boolean expressions . . . 88 PC operating systems, gawk on, installing. . . . . 267
operators, decrement/increment . . . . . . . . . . . . . . . 83 percent sign (%), % operator . . . . . . . . . . . . . . . . . . . 91
operators, GNU-specific . . . . . . . . . . . . . . . . . . . . . . 31 percent sign (%), %= operator . . . . . . . . . . . . . . 83, 92
operators, input/output . . . . . 53, 54, 55, 65, 66, 91 period (.) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
operators, logical, See Boolean expressions . . . . . 88 PERL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
operators, precedence . . . . . . . . . . . . . . . . . . . . . 84, 90 Peters, Arno . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 259
operators, relational, See operators, comparison Peterson, Hal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 258
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 pgawk program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 169
operators, short-circuit . . . . . . . . . . . . . . . . . . . . . . . 88 pgawk program, awkprof.out file . . . . . . . . . . . . . 169
operators, string . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80 pgawk program, dynamic profiling . . . . . . . . . . . . 172
operators, string-matching . . . . . . . . . . . . . . . . . . . . 24 pipes, closing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
operators, string-matching, for buffers . . . . . . . . . 31 pipes, input . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
operators, word-boundary (gawk). . . . . . . . . . . . . . 31 pipes, output . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
options, command-line . . . . . . . . . . . . . . . 12, 45, 173 plus sign (+) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
options, command-line, end of . . . . . . . . . . . . . . . 174 plus sign (+), + operator . . . . . . . . . . . . . . . . . . . . . . 91
options, command-line, invoking awk . . . . . . . . . 173 plus sign (+), ++ operator . . . . . . . . . . . . . . . . . 84, 91
options, command-line, processing . . . . . . . . . . . 196 plus sign (+), += operator . . . . . . . . . . . . . . . . . 82, 92
options, deprecated . . . . . . . . . . . . . . . . . . . . . . . . . 179 plus sign (+), decrement/increment operators . . 83
options, long . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173 portability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
options, printing list of . . . . . . . . . . . . . . . . . . . . . . 175 portability, #! (executable scripts) . . . . . . . . . . . . 13
OR bitwise operation . . . . . . . . . . . . . . . . . . . . . . . 147 portability, ** operator and . . . . . . . . . . . . . . . . . . 80
or Boolean-logic operator . . . . . . . . . . . . . . . . . . . . . 88 portability, **= operator and . . . . . . . . . . . . . . . . . 83
or function (gawk) . . . . . . . . . . . . . . . . . . . . . . . . . . 147 portability, ARGV variable . . . . . . . . . . . . . . . . . . . . . 14
ord user-defined function . . . . . . . . . . . . . . . . . . . . 188 portability, backslash continuation and . . . . . . . . 21
order of evaluation, concatenation . . . . . . . . . . . . . 80 portability, backslash in escape sequences . . . . . . 26
ORS variable. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59, 109 portability, close function and . . . . . . . . . . . . . . . 71
Appendix D: Index 335
V W
values, numeric . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295 w utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47
values, string . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295 Wall, Larry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
variable typing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 warnings, issuing . . . . . . . . . . . . . . . . . . . . . . . . . . . 175
variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22, 295 wc utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
variables, assigning on command line . . . . . . . . . . 76 wc.awk program . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
variables, built-in. . . . . . . . . . . . . . . . . . . . . . . . 76, 107 Weinberger, Peter . . . . . . . . . . . . . . . . . . . . . . . . 4, 258
variables, built-in, -v option, setting with . . . . . 174 while statement . . . . . . . . . . . . . . . . . . . . . . . . 24, 100
whitespace, as field separators . . . . . . . . . . . . . . . . 43
variables, built-in, conveying information . . . . . 110
whitespace, functions, calling . . . . . . . . . . . . . . . . 127
variables, flag. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
whitespace, newlines as . . . . . . . . . . . . . . . . . . . . . 176
variables, getline command into, using . . . 52, 53,
Williams, Kent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 258
55
Woods, John . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 258
variables, global, for library functions . . . . . . . . 181 word boundaries, matching . . . . . . . . . . . . . . . . . . . 31
variables, global, printing list of . . . . . . . . . . . . . . 175 word, regexp definition of . . . . . . . . . . . . . . . . . . . . 31
variables, initializing . . . . . . . . . . . . . . . . . . . . . . . . . 76 word-boundary operator (gawk) . . . . . . . . . . . . . . . 31
variables, names of . . . . . . . . . . . . . . . . . . . . . . . . . . 116 wordfreq.awk program . . . . . . . . . . . . . . . . . . . . . . 238
variables, private . . . . . . . . . . . . . . . . . . . . . . . . . . . 181 words, counting. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
variables, setting. . . . . . . . . . . . . . . . . . . . . . . . . . . . 174 words, duplicate, searching for . . . . . . . . . . . . . . . 230
variables, shadowing . . . . . . . . . . . . . . . . . . . . . . . . 150 words, usage counts, generating . . . . . . . . . . . . . . 237
variables, types of. . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
variables, types of, comparison expressions and
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 X
variables, uninitialized, as array subscripts . . . . 122 xgettext utility . . . . . . . . . . . . . . . . . . . . . . . . . . . . 160
variables, user-defined . . . . . . . . . . . . . . . . . . . . . . . . 76 XOR bitwise operation . . . . . . . . . . . . . . . . . . . . . . 147
vertical bar (|) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 xor function (gawk) . . . . . . . . . . . . . . . . . . . . . . . . . 147
vertical bar (|), | operator (I/O) . . . . . . . . . . 54, 91
vertical bar (|), |& I/O operator (I/O) . . . . . . . 166
vertical bar (|), |& operator (I/O) . . . . . . . . . 55, 91 Z
vertical bar (|), |& operator (I/O), two-way Zaretskii, Eli . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
communications . . . . . . . . . . . . . . . . . . . . . . . . 169 zero, negative vs. positive . . . . . . . . . . . . . . . . . . . 298
vertical bar (|), || operator . . . . . . . . . . . . . . . 88, 91 zerofile.awk program . . . . . . . . . . . . . . . . . . . . . . 195
vname internal variable . . . . . . . . . . . . . . . . . . . . . . 283 Zoulas, Christos . . . . . . . . . . . . . . . . . . . . . . . . . . . . 258