# PaCkAgE DaTaStReAm gperf 1 1176 # end of header 0707010004df39000081a40000000000000000000000014f7d41b9000001140000010000010007ffffffffffffffff0000000e00000000gperf/pkginfoPKG=gperf NAME=gperf 3.0.4 SPARC 64bit Solaris 10 VERSION=3.0.4 PSTAMP=5th April 2012 VENDOR=Douglas C. Schmidt, Bruno Haible EMAIL=http://ftp.gnu.org/gnu/gperf/ DESC=Perfect hash generator ARCH=i386 CATEGORY=utility CLASSES=none BASEDIR=/ ISTATES=S s 1 2 3 RSTATES=S s 1 2 3 0707010004df38000081a40000000000000000000000014f7d41b9000002bc0000010000010007ffffffffffffffff0000000d00000000gperf/pkgmap: 1 1176 1 d none /usr ? ? ? 1 d none /usr/local ? ? ? 1 d none /usr/local/bin 0755 root root 1 f none /usr/local/bin/gperf 0755 root root 371888 53956 1333608888 1 d none /usr/local/share 0755 root root 1 d none /usr/local/share/doc 0755 root root 1 f none /usr/local/share/doc/gperf.html 0644 root root 101637 21196 1333608888 1 d none /usr/local/share/info 0755 root root 1 f none /usr/local/share/info/gperf.info 0644 root root 96860 33519 1333608888 1 d none /usr/local/share/man 0755 root root 1 d none /usr/local/share/man/man1 0755 root root 1 f none /usr/local/share/man/man1/gperf.1 0644 root root 7283 48907 1333608888 1 i checkinstall 785 2565 1333608889 1 i pkginfo 276 21112 1333608889 07070100000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000b00000000TRAILER!!!0707010004df39000081a40000000000000000000000014f7d41b9000001140000010000010007ffffffffffffffff0000000800000000pkginfoPKG=gperf NAME=gperf 3.0.4 SPARC 64bit Solaris 10 VERSION=3.0.4 PSTAMP=5th April 2012 VENDOR=Douglas C. Schmidt, Bruno Haible EMAIL=http://ftp.gnu.org/gnu/gperf/ DESC=Perfect hash generator ARCH=i386 CATEGORY=utility CLASSES=none BASEDIR=/ ISTATES=S s 1 2 3 RSTATES=S s 1 2 3 0707010004df38000081a40000000000000000000000014f7d41b9000002bc0000010000010007ffffffffffffffff0000000700000000pkgmap: 1 1176 1 d none /usr ? ? ? 1 d none /usr/local ? ? ? 1 d none /usr/local/bin 0755 root root 1 f none /usr/local/bin/gperf 0755 root root 371888 53956 1333608888 1 d none /usr/local/share 0755 root root 1 d none /usr/local/share/doc 0755 root root 1 f none /usr/local/share/doc/gperf.html 0644 root root 101637 21196 1333608888 1 d none /usr/local/share/info 0755 root root 1 f none /usr/local/share/info/gperf.info 0644 root root 96860 33519 1333608888 1 d none /usr/local/share/man 0755 root root 1 d none /usr/local/share/man/man1 0755 root root 1 f none /usr/local/share/man/man1/gperf.1 0644 root root 7283 48907 1333608888 1 i checkinstall 785 2565 1333608889 1 i pkginfo 276 21112 1333608889 0707010004df47000041ed0000000000000000000000024f7d41b9000000000000010000010007ffffffffffffffff0000000800000000install0707010004df48000081ed0000000000000000000000014f7d41b9000003110000010000010007ffffffffffffffff0000001500000000install/checkinstall#!/bin/sh # expected_bits="64" expected_release="5.10" expected_platform="sparc" # release=`uname -r` platform=`uname -p` bits=`isainfo -b` # if [ ${platform} != ${expected_platform} ]; then echo "\n\n\n\tThis package must be installed on a ${expected_platform} architecture\n" echo "\tAborting installation.\n\n\n" exit 1 fi if [ ${release} != ${expected_release} ]; then echo "\n\n\n\tThis package must be installed on a ${expected_release} machine\n" echo "\tAborting installation.\n\n\n" exit 1 fi if [ ${bits} != ${expected_bits} ]; then echo "\n\n\n\tThis package must be installed on a ${expected_bits} bit machine\n" echo "\tYour machine is running a ${bits} bit O.S. currently\n" echo "\tAborting installation.\n\n\n" exit 1 fi exit 0 0707010004df3a000041ed0000000000000000000000034f7d41b9000000000000010000010007ffffffffffffffff0000000500000000root0707010004df3b000041ed0000000000000000000000034f7d41b9000000000000010000010007ffffffffffffffff0000000900000000root/usr0707010004df3c000041ed0000000000000000000000044f7d41b9000000000000010000010007ffffffffffffffff0000000f00000000root/usr/local0707010004df3f000041ed0000000000000000000000054f7d41b9000000000000010000010007ffffffffffffffff0000001500000000root/usr/local/share0707010004df44000041ed0000000000000000000000034f7d41b9000000000000010000010007ffffffffffffffff0000001900000000root/usr/local/share/man0707010004df45000041ed0000000000000000000000024f7d41b9000000000000010000010007ffffffffffffffff0000001e00000000root/usr/local/share/man/man10707010004df46000081a40000000000000000000000014f7d41b800001c730000010000010007ffffffffffffffff0000002600000000root/usr/local/share/man/man1/gperf.1.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.23. .TH GPERF "1" "February 2009" "GNU gperf 3.0.4" FSF .SH NAME gperf \- generate a perfect hash function from a key set .SH SYNOPSIS .B gperf [\fIOPTION\fR]... [\fIINPUT-FILE\fR] .SH DESCRIPTION GNU 'gperf' generates perfect hash functions. .PP If a long option shows an argument as mandatory, then it is mandatory for the equivalent short option also. .SS "Output file location:" .HP \fB\-\-output\-file\fR=\fIFILE\fR Write output to specified file. .PP The results are written to standard output if no output file is specified or if it is -. .SS "Input file interpretation:" .TP \fB\-e\fR, \fB\-\-delimiters\fR=\fIDELIMITER\-LIST\fR Allow user to provide a string containing delimiters used to separate keywords from their attributes. Default is ",". .TP \fB\-t\fR, \fB\-\-struct\-type\fR Allows the user to include a structured type declaration for generated code. Any text before %% is considered part of the type declaration. Key words and additional fields may follow this, one group of fields per line. .TP \fB\-\-ignore\-case\fR Consider upper and lower case ASCII characters as equivalent. Note that locale dependent case mappings are ignored. .SS "Language for the output code:" .TP \fB\-L\fR, \fB\-\-language\fR=\fILANGUAGE\-NAME\fR Generates code in the specified language. Languages handled are currently C++, ANSI-C, C, and KR-C. The default is C. .SS "Details in the output code:" .TP \fB\-K\fR, \fB\-\-slot\-name\fR=\fINAME\fR Select name of the keyword component in the keyword structure. .TP \fB\-F\fR, \fB\-\-initializer\-suffix\fR=\fIINITIALIZERS\fR Initializers for additional components in the keyword structure. .TP \fB\-H\fR, \fB\-\-hash\-function\-name\fR=\fINAME\fR Specify name of generated hash function. Default is \&'hash'. .TP \fB\-N\fR, \fB\-\-lookup\-function\-name\fR=\fINAME\fR Specify name of generated lookup function. Default name is 'in_word_set'. .TP \fB\-Z\fR, \fB\-\-class\-name\fR=\fINAME\fR Specify name of generated C++ class. Default name is \&'Perfect_Hash'. .TP \fB\-7\fR, \fB\-\-seven\-bit\fR Assume 7-bit characters. .TP \fB\-l\fR, \fB\-\-compare\-lengths\fR Compare key lengths before trying a string comparison. This is necessary if the keywords contain NUL bytes. It also helps cut down on the number of string comparisons made during the lookup. .TP \fB\-c\fR, \fB\-\-compare\-strncmp\fR Generate comparison code using strncmp rather than strcmp. .TP \fB\-C\fR, \fB\-\-readonly\-tables\fR Make the contents of generated lookup tables constant, i.e., readonly. .TP \fB\-E\fR, \fB\-\-enum\fR Define constant values using an enum local to the lookup function rather than with defines. .TP \fB\-I\fR, \fB\-\-includes\fR Include the necessary system include file at the beginning of the code. .TP \fB\-G\fR, \fB\-\-global\-table\fR Generate the static table of keywords as a static global variable, rather than hiding it inside of the lookup function (which is the default behavior). .TP \fB\-P\fR, \fB\-\-pic\fR Optimize the generated table for inclusion in shared libraries. This reduces the startup time of programs using a shared library containing the generated code. .TP \fB\-Q\fR, \fB\-\-string\-pool\-name\fR=\fINAME\fR Specify name of string pool generated by option \fB\-\-pic\fR. Default name is 'stringpool'. .TP \fB\-\-null\-strings\fR Use NULL strings instead of empty strings for empty keyword table entries. .TP \fB\-W\fR, \fB\-\-word\-array\-name\fR=\fINAME\fR Specify name of word list array. Default name is \&'wordlist'. .TP \fB\-\-length\-table\-name\fR=\fINAME\fR Specify name of length table array. Default name is \&'lengthtable'. .TP \fB\-S\fR, \fB\-\-switch\fR=\fICOUNT\fR Causes the generated C code to use a switch statement scheme, rather than an array lookup table. This can lead to a reduction in both time and space requirements for some keyfiles. The COUNT argument determines how many switch statements are generated. A value of 1 generates 1 switch containing all the elements, a value of 2 generates 2 tables with 1/2 the elements in each table, etc. If COUNT is very large, say 1000000, the generated C code does a binary search. .TP \fB\-T\fR, \fB\-\-omit\-struct\-type\fR Prevents the transfer of the type declaration to the output file. Use this option if the type is already defined elsewhere. .SS "Algorithm employed by gperf:" .TP \fB\-k\fR, \fB\-\-key\-positions\fR=\fIKEYS\fR Select the key positions used in the hash function. The allowable choices range between 1-255, inclusive. The positions are separated by commas, ranges may be used, and key positions may occur in any order. Also, the meta-character '*' causes the generated hash function to consider ALL key positions, and $ indicates the "final character" of a key, e.g., $,1,2,4,6-10. .TP \fB\-D\fR, \fB\-\-duplicates\fR Handle keywords that hash to duplicate values. This is useful for certain highly redundant keyword sets. .TP \fB\-m\fR, \fB\-\-multiple\-iterations\fR=\fIITERATIONS\fR Perform multiple choices of the \fB\-i\fR and \fB\-j\fR values, and choose the best results. This increases the running time by a factor of ITERATIONS but does a good job minimizing the generated table size. .TP \fB\-i\fR, \fB\-\-initial\-asso\fR=\fIN\fR Provide an initial value for the associate values array. Default is 0. Setting this value larger helps inflate the size of the final table. .TP \fB\-j\fR, \fB\-\-jump\fR=\fIJUMP\-VALUE\fR Affects the "jump value", i.e., how far to advance the associated character value upon collisions. Must be an odd number, default is 5. .TP \fB\-n\fR, \fB\-\-no\-strlen\fR Do not include the length of the keyword when computing the hash function. .TP \fB\-r\fR, \fB\-\-random\fR Utilizes randomness to initialize the associated values table. .TP \fB\-s\fR, \fB\-\-size\-multiple\fR=\fIN\fR Affects the size of the generated hash table. The numeric argument N indicates "how many times larger or smaller" the associated value range should be, in relationship to the number of keys, e.g. a value of 3 means "allow the maximum associated value to be about 3 times larger than the number of input keys". Conversely, a value of 1/3 means "make the maximum associated value about 3 times smaller than the number of input keys". A larger table should decrease the time required for an unsuccessful search, at the expense of extra table space. Default value is 1. .SS "Informative output:" .TP \fB\-h\fR, \fB\-\-help\fR Print this message. .TP \fB\-v\fR, \fB\-\-version\fR Print the gperf version number. .TP \fB\-d\fR, \fB\-\-debug\fR Enables the debugging option (produces verbose output to the standard error). .SH AUTHOR Written by Douglas C. Schmidt and Bruno Haible. .SH "REPORTING BUGS" Report bugs to . .SH COPYRIGHT Copyright \(co 1989-1998, 2000-2004, 2006-2007, 2009 Free Software Foundation, Inc. .br This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. .SH "SEE ALSO" The full documentation for .B gperf is maintained as a Texinfo manual. If the .B info and .B gperf programs are properly installed at your site, the command .IP .B info gperf .PP should give you access to the complete manual. 0707010004df40000041ed0000000000000000000000024f7d41b9000000000000010000010007ffffffffffffffff0000001900000000root/usr/local/share/doc0707010004df41000081a40000000000000000000000014f7d41b800018d050000010000010007ffffffffffffffff0000002400000000root/usr/local/share/doc/gperf.html Perfect Hash Function Generator

User's Guide to gperf 3.0.4

The GNU Perfect Hash Function Generator

Edition 3.0.4, 1 February 2009

Douglas C. Schmidt
Bruno Haible


Table of Contents


Copyright (C) 1989-2009 Free Software Foundation, Inc.

Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies.

Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided also that the section entitled “GNU General Public License” is included exactly as in the original, and provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one.

Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that the section entitled “GNU General Public License” may be included in a translation approved by the author instead of in the original English.

GNU GENERAL PUBLIC LICENSE

Version 3, 29 June 2007

Copyright (C) 2007 Free Software Foundation, Inc. http://fsf.org/

Everyone is permitted to copy and distribute verbatim copies of this
license document, but changing it is not allowed.

1.0 Preamble

The GNU General Public License is a free, copyleft license for software and other kinds of works.

The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too.

When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things.

To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others.

For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights.

Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it.

For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions.

Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users.

Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free.

The precise terms and conditions for copying, distribution and modification follow.

1.1 TERMS AND CONDITIONS

  1. Definitions. “This License” refers to version 3 of the GNU General Public License. “Copyright” also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. “The Program” refers to any copyrightable work licensed under this License. Each licensee is addressed as “you”. “Licensees” and “recipients” may be individuals or organizations. To “modify” a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a “modified version” of the earlier work or a work “based on” the earlier work. A “covered work” means either the unmodified Program or a work based on the Program. To “propagate” a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To “convey” a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays “Appropriate Legal Notices” to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion.
  2. Source Code. The “source code” for a work means the preferred form of the work for making modifications to it. “Object code” means any non-source form of a work. A “Standard Interface” means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The “System Libraries” of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A “Major Component”, in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The “Corresponding Source” for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work.
  3. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary.
  4. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures.
  5. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee.
  6. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions:
    1. The work must carry prominent notices stating that you modified it, and giving a relevant date.
    2. The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to “keep intact all notices”.
    3. You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it.
    4. If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so.
    A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an “aggregate” if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate.
  7. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways:
    1. Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange.
    2. Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge.
    3. Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b.
    4. Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements.
    5. Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d.
    A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A “User Product” is either (1) a “consumer product”, which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, “normally used” refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. “Installation Information” for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying.
  8. Additional Terms. “Additional permissions” are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms:
    1. Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or
    2. Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or
    3. Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or
    4. Limiting the use for publicity purposes of names of licensors or authors of the material; or
    5. Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or
    6. Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors.
    All other non-permissive additional terms are considered “further restrictions” within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way.
  9. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10.
  10. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so.
  11. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An “entity transaction” is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it.
  12. Patents. A “contributor” is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's “contributor version”. A contributor's “essential patent claims” are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, “control” includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a “patent license” is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To “grant” such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. “Knowingly relying” means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is “discriminatory” if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law.
  13. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program.
  14. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such.
  15. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License “or any later version” applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version.
  16. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM “AS IS” WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
  17. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
  18. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee.

1.2 END OF TERMS AND CONDITIONS

1.3 How to Apply These Terms to Your New Programs

If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms.

To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the “copyright” line and a pointer to where the full notice is found.

one line to give the program's name and a brief idea of what it does.
Copyright (C) year name of author

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or (at
your option) any later version.

This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program.  If not, see http://www.gnu.org/licenses/.

Also add information on how to contact you by electronic and paper mail.

If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode:

program Copyright (C) year name of author
This program comes with ABSOLUTELY NO WARRANTY; for details type ‘show w’.
This is free software, and you are welcome to redistribute it
under certain conditions; type ‘show c’ for details.

The hypothetical commands ‘show w’ and ‘show c’ should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an “about box”.

You should also get your employer (if you work as a programmer) or school, if any, to sign a “copyright disclaimer” for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see http://www.gnu.org/licenses/.

The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read http://www.gnu.org/philosophy/why-not-lgpl.html.

Contributors to GNU gperf Utility

2 Introduction

gperf is a perfect hash function generator written in C++. It transforms an n element user-specified keyword set W into a perfect hash function F. F uniquely maps keywords in W onto the range 0..k, where k >= n-1. If k = n-1 then F is a minimal perfect hash function. gperf generates a 0..k element static lookup table and a pair of C functions. These functions determine whether a given character string s occurs in W, using at most one probe into the lookup table.

gperf currently generates the reserved keyword recognizer for lexical analyzers in several production and research compilers and language processing tools, including GNU C, GNU C++, GNU Java, GNU Pascal, GNU Modula 3, and GNU indent. Complete C++ source code for gperf is available from http://ftp.gnu.org/pub/gnu/gperf/. A paper describing gperf's design and implementation in greater detail is available in the Second USENIX C++ Conference proceedings or from http://www.cs.wustl.edu/~schmidt/resume.html.

3 Static search structures and GNU gperf

A static search structure is an Abstract Data Type with certain fundamental operations, e.g., initialize, insert, and retrieve. Conceptually, all insertions occur before any retrievals. In practice, gperf generates a static array containing search set keywords and any associated attributes specified by the user. Thus, there is essentially no execution-time cost for the insertions. It is a useful data structure for representing static search sets. Static search sets occur frequently in software system applications. Typical static search sets include compiler reserved words, assembler instruction opcodes, and built-in shell interpreter commands. Search set members, called keywords, are inserted into the structure only once, usually during program initialization, and are not generally modified at run-time.

Numerous static search structure implementations exist, e.g., arrays, linked lists, binary search trees, digital search tries, and hash tables. Different approaches offer trade-offs between space utilization and search time efficiency. For example, an n element sorted array is space efficient, though the average-case time complexity for retrieval operations using binary search is proportional to log n. Conversely, hash table implementations often locate a table entry in constant time, but typically impose additional memory overhead and exhibit poor worst case performance.

Minimal perfect hash functions provide an optimal solution for a particular class of static search sets. A minimal perfect hash function is defined by two properties:

For most applications it is far easier to generate perfect hash functions than minimal perfect hash functions. Moreover, non-minimal perfect hash functions frequently execute faster than minimal ones in practice. This phenomena occurs since searching a sparse keyword table increases the probability of locating a “null” entry, thereby reducing string comparisons. gperf's default behavior generates near-minimal perfect hash functions for keyword sets. However, gperf provides many options that permit user control over the degree of minimality and perfection.

Static search sets often exhibit relative stability over time. For example, Ada's 63 reserved words have remained constant for nearly a decade. It is therefore frequently worthwhile to expend concerted effort building an optimal search structure once, if it subsequently receives heavy use multiple times. gperf removes the drudgery associated with constructing time- and space-efficient search structures by hand. It has proven a useful and practical tool for serious programming projects. Output from gperf is currently used in several production and research compilers, including GNU C, GNU C++, GNU Java, GNU Pascal, and GNU Modula 3. The latter two compilers are not yet part of the official GNU distribution. Each compiler utilizes gperf to automatically generate static search structures that efficiently identify their respective reserved keywords.

4 High-Level Description of GNU gperf

The perfect hash function generator gperf reads a set of “keywords” from an input file (or from the standard input by default). It attempts to derive a perfect hashing function that recognizes a member of the static keyword set with at most a single probe into the lookup table. If gperf succeeds in generating such a function it produces a pair of C source code routines that perform hashing and table lookup recognition. All generated C code is directed to the standard output. Command-line options described below allow you to modify the input and output format to gperf.

By default, gperf attempts to produce time-efficient code, with less emphasis on efficient space utilization. However, several options exist that permit trading-off execution time for storage space and vice versa. In particular, expanding the generated table size produces a sparse search structure, generally yielding faster searches. Conversely, you can direct gperf to utilize a C switch statement scheme that minimizes data space storage size. Furthermore, using a C switch may actually speed up the keyword retrieval time somewhat. Actual results depend on your C compiler, of course.

In general, gperf assigns values to the bytes it is using for hashing until some set of values gives each keyword a unique value. A helpful heuristic is that the larger the hash value range, the easier it is for gperf to find and generate a perfect hash function. Experimentation is the key to getting the most from gperf.

4.1 Input Format to gperf

You can control the input file format by varying certain command-line arguments, in particular the ‘-t’ option. The input's appearance is similar to GNU utilities flex and bison (or UNIX utilities lex and yacc). Here's an outline of the general format:

declarations
%%
keywords
%%
functions

Unlike flex or bison, the declarations section and the functions section are optional. The following sections describe the input format for each section.

It is possible to omit the declaration section entirely, if the ‘-t’ option is not given. In this case the input file begins directly with the first keyword line, e.g.:

january
february
march
april
...

4.1.1 Declarations

The keyword input file optionally contains a section for including arbitrary C declarations and definitions, gperf declarations that act like command-line options, as well as for providing a user-supplied struct.

4.1.1.1 User-supplied struct

If the ‘-t’ option (or, equivalently, the ‘%struct-type’ declaration) is enabled, you must provide a C struct as the last component in the declaration section from the input file. The first field in this struct must be of type char * or const char * if the ‘-P’ option is not given, or of type int if the option ‘-P’ (or, equivalently, the ‘%pic’ declaration) is enabled. This first field must be called ‘name’, although it is possible to modify its name with the ‘-K’ option (or, equivalently, the ‘%define slot-name’ declaration) described below.

Here is a simple example, using months of the year and their attributes as input:

struct month { char *name; int number; int days; int leap_days; };
%%
january,   1, 31, 31
february,  2, 28, 29
march,     3, 31, 31
april,     4, 30, 30
may,       5, 31, 31
june,      6, 30, 30
july,      7, 31, 31
august,    8, 31, 31
september, 9, 30, 30
october,  10, 31, 31
november, 11, 30, 30
december, 12, 31, 31

Separating the struct declaration from the list of keywords and other fields are a pair of consecutive percent signs, ‘%%’, appearing left justified in the first column, as in the UNIX utility lex.

If the struct has already been declared in an include file, it can be mentioned in an abbreviated form, like this:

struct month;
%%
january,   1, 31, 31
...

4.1.1.2 Gperf Declarations

The declaration section can contain gperf declarations. They influence the way gperf works, like command line options do. In fact, every such declaration is equivalent to a command line option. There are three forms of declarations:

  1. Declarations without argument, like ‘%compare-lengths’.
  2. Declarations with an argument, like ‘%switch=count.
  3. Declarations of names of entities in the output file, like ‘%define lookup-function-name name.

When a declaration is given both in the input file and as a command line option, the command-line option's value prevails.

The following gperf declarations are available.

‘%delimiters=delimiter-list
Allows you to provide a string containing delimiters used to separate keywords from their attributes. The default is ",". This option is essential if you want to use keywords that have embedded commas or newlines.
‘%struct-type’
Allows you to include a struct type declaration for generated code; see above for an example.
‘%ignore-case’
Consider upper and lower case ASCII characters as equivalent. The string comparison will use a case insignificant character comparison. Note that locale dependent case mappings are ignored.
‘%language=language-name
Instructs gperf to generate code in the language specified by the option's argument. Languages handled are currently:
‘KR-C’
Old-style K&R C. This language is understood by old-style C compilers and ANSI C compilers, but ANSI C compilers may flag warnings (or even errors) because of lacking ‘const’.
‘C’
Common C. This language is understood by ANSI C compilers, and also by old-style C compilers, provided that you #define const to empty for compilers which don't know about this keyword.
‘ANSI-C’
ANSI C. This language is understood by ANSI C (C89, ISO C90) compilers, ISO C99 compilers, and C++ compilers.
‘C++’
C++. This language is understood by C++ compilers.
The default is C.
‘%define slot-name name
This declaration is only useful when option ‘-t’ (or, equivalently, the ‘%struct-type’ declaration) has been given. By default, the program assumes the structure component identifier for the keyword is ‘name’. This option allows an arbitrary choice of identifier for this component, although it still must occur as the first field in your supplied struct.
‘%define initializer-suffix initializers
This declaration is only useful when option ‘-t’ (or, equivalently, the ‘%struct-type’ declaration) has been given. It permits to specify initializers for the structure members following slot-name in empty hash table entries. The list of initializers should start with a comma. By default, the emitted code will zero-initialize structure members following slot-name.
‘%define hash-function-name name
Allows you to specify the name for the generated hash function. Default name is ‘hash’. This option permits the use of two hash tables in the same file.
‘%define lookup-function-name name
Allows you to specify the name for the generated lookup function. Default name is ‘in_word_set’. This option permits multiple generated hash functions to be used in the same application.
‘%define class-name name
This option is only useful when option ‘-L C++’ (or, equivalently, the ‘%language=C++’ declaration) has been given. It allows you to specify the name of generated C++ class. Default name is Perfect_Hash.
‘%7bit’
This option specifies that all strings that will be passed as arguments to the generated hash function and the generated lookup function will solely consist of 7-bit ASCII characters (bytes in the range 0..127). (Note that the ANSI C functions isalnum and isgraph do not guarantee that a byte is in this range. Only an explicit test like ‘c >= 'A' && c <= 'Z'’ guarantees this.)
‘%compare-lengths’
Compare keyword lengths before trying a string comparison. This option is mandatory for binary comparisons (see section 4.3 Use of NUL bytes). It also might cut down on the number of string comparisons made during the lookup, since keywords with different lengths are never compared via strcmp. However, using ‘%compare-lengths’ might greatly increase the size of the generated C code if the lookup table range is large (which implies that the switch option ‘-S’ or ‘%switch’ is not enabled), since the length table contains as many elements as there are entries in the lookup table.
‘%compare-strncmp’
Generates C code that uses the strncmp function to perform string comparisons. The default action is to use strcmp.
‘%readonly-tables’
Makes the contents of all generated lookup tables constant, i.e., “readonly”. Many compilers can generate more efficient code for this by putting the tables in readonly memory.
‘%enum’
Define constant values using an enum local to the lookup function rather than with #defines. This also means that different lookup functions can reside in the same file. Thanks to James Clark <jjc@ai.mit.edu>.
‘%includes’
Include the necessary system include file, <string.h>, at the beginning of the code. By default, this is not done; the user must include this header file himself to allow compilation of the code.
‘%global-table’
Generate the static table of keywords as a static global variable, rather than hiding it inside of the lookup function (which is the default behavior).
‘%pic’
Optimize the generated table for inclusion in shared libraries. This reduces the startup time of programs using a shared library containing the generated code. If the ‘%struct-type’ declaration (or, equivalently, the option ‘-t’) is also given, the first field of the user-defined struct must be of type ‘int’, not ‘char *’, because it will contain offsets into the string pool instead of actual strings. To convert such an offset to a string, you can use the expression ‘stringpool + o, where o is the offset. The string pool name can be changed through the ‘%define string-pool-name’ declaration.
‘%define string-pool-name name
Allows you to specify the name of the generated string pool created by the declaration ‘%pic’ (or, equivalently, the option ‘-P’). The default name is ‘stringpool’. This declaration permits the use of two hash tables in the same file, with ‘%pic’ and even when the ‘%global-table’ declaration (or, equivalently, the option ‘-G’) is given.
‘%null-strings’
Use NULL strings instead of empty strings for empty keyword table entries. This reduces the startup time of programs using a shared library containing the generated code (but not as much as the declaration ‘%pic’), at the expense of one more test-and-branch instruction at run time.
‘%define word-array-name name
Allows you to specify the name for the generated array containing the hash table. Default name is ‘wordlist’. This option permits the use of two hash tables in the same file, even when the option ‘-G’ (or, equivalently, the ‘%global-table’ declaration) is given.
‘%define length-table-name name
Allows you to specify the name for the generated array containing the length table. Default name is ‘lengthtable’. This option permits the use of two length tables in the same file, even when the option ‘-G’ (or, equivalently, the ‘%global-table’ declaration) is given.
‘%switch=count
Causes the generated C code to use a switch statement scheme, rather than an array lookup table. This can lead to a reduction in both time and space requirements for some input files. The argument to this option determines how many switch statements are generated. A value of 1 generates 1 switch containing all the elements, a value of 2 generates 2 tables with 1/2 the elements in each switch, etc. This is useful since many C compilers cannot correctly generate code for large switch statements. This option was inspired in part by Keith Bostic's original C program.
‘%omit-struct-type’
Prevents the transfer of the type declaration to the output file. Use this option if the type is already defined elsewhere.

4.1.1.3 C Code Inclusion

Using a syntax similar to GNU utilities flex and bison, it is possible to directly include C source text and comments verbatim into the generated output file. This is accomplished by enclosing the region inside left-justified surrounding ‘%{’, ‘%}’ pairs. Here is an input fragment based on the previous example that illustrates this feature:

%{
#include <assert.h>
/* This section of code is inserted directly into the output. */
int return_month_days (struct month *months, int is_leap_year);
%}
struct month { char *name; int number; int days; int leap_days; };
%%
january,   1, 31, 31
february,  2, 28, 29
march,     3, 31, 31
...

4.1.2 Format for Keyword Entries

The second input file format section contains lines of keywords and any associated attributes you might supply. A line beginning with ‘#’ in the first column is considered a comment. Everything following the ‘#’ is ignored, up to and including the following newline. A line beginning with ‘%’ in the first column is an option declaration and must not occur within the keywords section.

The first field of each non-comment line is always the keyword itself. It can be given in two ways: as a simple name, i.e., without surrounding string quotation marks, or as a string enclosed in double-quotes, in C syntax, possibly with backslash escapes like \" or \234 or \xa8. In either case, it must start right at the beginning of the line, without leading whitespace. In this context, a “field” is considered to extend up to, but not include, the first blank, comma, or newline. Here is a simple example taken from a partial list of C reserved words:

# These are a few C reserved words, see the c.gperf file 
# for a complete list of ANSI C reserved words.
unsigned
sizeof
switch
signed
if
default
for
while
return

Note that unlike flex or bison the first ‘%%’ marker may be elided if the declaration section is empty.

Additional fields may optionally follow the leading keyword. Fields should be separated by commas, and terminate at the end of line. What these fields mean is entirely up to you; they are used to initialize the elements of the user-defined struct provided by you in the declaration section. If the ‘-t’ option (or, equivalently, the ‘%struct-type’ declaration) is not enabled these fields are simply ignored. All previous examples except the last one contain keyword attributes.

4.1.3 Including Additional C Functions

The optional third section also corresponds closely with conventions found in flex and bison. All text in this section, starting at the final ‘%%’ and extending to the end of the input file, is included verbatim into the generated output file. Naturally, it is your responsibility to ensure that the code contained in this section is valid C.

4.1.4 Where to place directives for GNU indent.

If you want to invoke GNU indent on a gperf input file, you will see that GNU indent doesn't understand the ‘%%’, ‘%{’ and ‘%}’ directives that control gperf's interpretation of the input file. Therefore you have to insert some directives for GNU indent. More precisely, assuming the most general input file structure

declarations part 1
%{
verbatim code
%}
declarations part 2
%%
keywords
%%
functions

you would insert ‘*INDENT-OFF*’ and ‘*INDENT-ON*’ comments as follows:

/* *INDENT-OFF* */
declarations part 1
%{
/* *INDENT-ON* */
verbatim code
/* *INDENT-OFF* */
%}
declarations part 2
%%
keywords
%%
/* *INDENT-ON* */
functions

4.2 Output Format for Generated C Code with gperf

Several options control how the generated C code appears on the standard output. Two C functions are generated. They are called hash and in_word_set, although you may modify their names with a command-line option. Both functions require two arguments, a string, char * str, and a length parameter, int len. Their default function prototypes are as follows:

Function: unsigned int hash (const char * str, unsigned int len)
By default, the generated hash function returns an integer value created by adding len to several user-specified str byte positions indexed into an associated values table stored in a local static array. The associated values table is constructed internally by gperf and later output as a static local C array called ‘hash_table’. The relevant selected positions (i.e. indices into str) are specified via the ‘-k’ option when running gperf, as detailed in the Options section below (see section 5 Invoking gperf).

Function: in_word_set (const char * str, unsigned int len)
If str is in the keyword set, returns a pointer to that keyword. More exactly, if the option ‘-t’ (or, equivalently, the ‘%struct-type’ declaration) was given, it returns a pointer to the matching keyword's structure. Otherwise it returns NULL.

If the option ‘-c’ (or, equivalently, the ‘%compare-strncmp’ declaration) is not used, str must be a NUL terminated string of exactly length len. If ‘-c’ (or, equivalently, the ‘%compare-strncmp’ declaration) is used, str must simply be an array of len bytes and does not need to be NUL terminated.

The code generated for these two functions is affected by the following options:

‘-t’
‘--struct-type’
Make use of the user-defined struct.
‘-S total-switch-statements
‘--switch=total-switch-statements
Generate 1 or more C switch statement rather than use a large, (and potentially sparse) static array. Although the exact time and space savings of this approach vary according to your C compiler's degree of optimization, this method often results in smaller and faster code.

If the ‘-t’ and ‘-S’ options (or, equivalently, the ‘%struct-type’ and ‘%switch’ declarations) are omitted, the default action is to generate a char * array containing the keywords, together with additional empty strings used for padding the array. By experimenting with the various input and output options, and timing the resulting C code, you can determine the best option choices for different keyword set characteristics.

4.3 Use of NUL bytes

By default, the code generated by gperf operates on zero terminated strings, the usual representation of strings in C. This means that the keywords in the input file must not contain NUL bytes, and the str argument passed to hash or in_word_set must be NUL terminated and have exactly length len.

If option ‘-c’ (or, equivalently, the ‘%compare-strncmp’ declaration) is used, then the str argument does not need to be NUL terminated. The code generated by gperf will only access the first len, not len+1, bytes starting at str. However, the keywords in the input file still must not contain NUL bytes.

If option ‘-l’ (or, equivalently, the ‘%compare-lengths’ declaration) is used, then the hash table performs binary comparison. The keywords in the input file may contain NUL bytes, written in string syntax as \000 or \x00, and the code generated by gperf will treat NUL like any other byte. Also, in this case the ‘-c’ option (or, equivalently, the ‘%compare-strncmp’ declaration) is ignored.

4.4 The Copyright of the Output

gperf is under GPL, but that does not cause the output produced by gperf to be under GPL. The reason is that the output contains only small pieces of text that come directly from gperf's source code -- only about 7 lines long, too small for being significant --, and therefore the output is not a “work based on gperf” (in the sense of the GPL version 3).

On the other hand, the output produced by gperf contains essentially all of the input file. Therefore the output is a “derivative work” of the input (in the sense of U.S. copyright law); and its copyright status depends on the copyright of the input. For most software licenses, the result is that the the output is under the same license, with the same copyright holder, as the input that was passed to gperf.

5 Invoking gperf

There are many options to gperf. They were added to make the program more convenient for use with real applications. “On-line” help is readily available via the ‘--help’ option. Here is the complete list of options.

5.1 Specifying the Location of the Output File

‘--output-file=file
Allows you to specify the name of the file to which the output is written to.

The results are written to standard output if no output file is specified or if it is ‘-’.

5.2 Options that affect Interpretation of the Input File

These options are also available as declarations in the input file (see section 4.1.1.2 Gperf Declarations).

‘-e keyword-delimiter-list
‘--delimiters=keyword-delimiter-list
Allows you to provide a string containing delimiters used to separate keywords from their attributes. The default is ",". This option is essential if you want to use keywords that have embedded commas or newlines. One useful trick is to use -e'TAB', where TAB is the literal tab character.
‘-t’
‘--struct-type’
Allows you to include a struct type declaration for generated code. Any text before a pair of consecutive ‘%%’ is considered part of the type declaration. Keywords and additional fields may follow this, one group of fields per line. A set of examples for generating perfect hash tables and functions for Ada, C, C++, Pascal, Modula 2, Modula 3 and JavaScript reserved words are distributed with this release.
‘--ignore-case’
Consider upper and lower case ASCII characters as equivalent. The string comparison will use a case insignificant character comparison. Note that locale dependent case mappings are ignored. This option is therefore not suitable if a properly internationalized or locale aware case mapping should be used. (For example, in a Turkish locale, the upper case equivalent of the lowercase ASCII letter ‘i’ is the non-ASCII character ‘capital i with dot above’.) For this case, it is better to apply an uppercase or lowercase conversion on the string before passing it to the gperf generated function.

5.3 Options to specify the Language for the Output Code

These options are also available as declarations in the input file (see section 4.1.1.2 Gperf Declarations).

‘-L generated-language-name
‘--language=generated-language-name
Instructs gperf to generate code in the language specified by the option's argument. Languages handled are currently:
‘KR-C’
Old-style K&R C. This language is understood by old-style C compilers and ANSI C compilers, but ANSI C compilers may flag warnings (or even errors) because of lacking ‘const’.
‘C’
Common C. This language is understood by ANSI C compilers, and also by old-style C compilers, provided that you #define const to empty for compilers which don't know about this keyword.
‘ANSI-C’
ANSI C. This language is understood by ANSI C compilers and C++ compilers.
‘C++’
C++. This language is understood by C++ compilers.
The default is C.
‘-a’
This option is supported for compatibility with previous releases of gperf. It does not do anything.
‘-g’
This option is supported for compatibility with previous releases of gperf. It does not do anything.

5.4 Options for fine tuning Details in the Output Code

Most of these options are also available as declarations in the input file (see section 4.1.1.2 Gperf Declarations).

‘-K slot-name
‘--slot-name=slot-name
This option is only useful when option ‘-t’ (or, equivalently, the ‘%struct-type’ declaration) has been given. By default, the program assumes the structure component identifier for the keyword is ‘name’. This option allows an arbitrary choice of identifier for this component, although it still must occur as the first field in your supplied struct.
‘-F initializers
‘--initializer-suffix=initializers
This option is only useful when option ‘-t’ (or, equivalently, the ‘%struct-type’ declaration) has been given. It permits to specify initializers for the structure members following slot-name in empty hash table entries. The list of initializers should start with a comma. By default, the emitted code will zero-initialize structure members following slot-name.
‘-H hash-function-name
‘--hash-function-name=hash-function-name
Allows you to specify the name for the generated hash function. Default name is ‘hash’. This option permits the use of two hash tables in the same file.
‘-N lookup-function-name
‘--lookup-function-name=lookup-function-name
Allows you to specify the name for the generated lookup function. Default name is ‘in_word_set’. This option permits multiple generated hash functions to be used in the same application.
‘-Z class-name
‘--class-name=class-name
This option is only useful when option ‘-L C++’ (or, equivalently, the ‘%language=C++’ declaration) has been given. It allows you to specify the name of generated C++ class. Default name is Perfect_Hash.
‘-7’
‘--seven-bit’
This option specifies that all strings that will be passed as arguments to the generated hash function and the generated lookup function will solely consist of 7-bit ASCII characters (bytes in the range 0..127). (Note that the ANSI C functions isalnum and isgraph do not guarantee that a byte is in this range. Only an explicit test like ‘c >= 'A' && c <= 'Z'’ guarantees this.) This was the default in versions of gperf earlier than 2.7; now the default is to support 8-bit and multibyte characters.
‘-l’
‘--compare-lengths’
Compare keyword lengths before trying a string comparison. This option is mandatory for binary comparisons (see section 4.3 Use of NUL bytes). It also might cut down on the number of string comparisons made during the lookup, since keywords with different lengths are never compared via strcmp. However, using ‘-l’ might greatly increase the size of the generated C code if the lookup table range is large (which implies that the switch option ‘-S’ or ‘%switch’ is not enabled), since the length table contains as many elements as there are entries in the lookup table.
‘-c’
‘--compare-strncmp’
Generates C code that uses the strncmp function to perform string comparisons. The default action is to use strcmp.
‘-C’
‘--readonly-tables’
Makes the contents of all generated lookup tables constant, i.e., “readonly”. Many compilers can generate more efficient code for this by putting the tables in readonly memory.
‘-E’
‘--enum’
Define constant values using an enum local to the lookup function rather than with #defines. This also means that different lookup functions can reside in the same file. Thanks to James Clark <jjc@ai.mit.edu>.
‘-I’
‘--includes’
Include the necessary system include file, <string.h>, at the beginning of the code. By default, this is not done; the user must include this header file himself to allow compilation of the code.
‘-G’
‘--global-table’
Generate the static table of keywords as a static global variable, rather than hiding it inside of the lookup function (which is the default behavior).
‘-P’
‘--pic’
Optimize the generated table for inclusion in shared libraries. This reduces the startup time of programs using a shared library containing the generated code. If the option ‘-t’ (or, equivalently, the ‘%struct-type’ declaration) is also given, the first field of the user-defined struct must be of type ‘int’, not ‘char *’, because it will contain offsets into the string pool instead of actual strings. To convert such an offset to a string, you can use the expression ‘stringpool + o, where o is the offset. The string pool name can be changed through the option ‘--string-pool-name’.
‘-Q string-pool-name
‘--string-pool-name=string-pool-name
Allows you to specify the name of the generated string pool created by option ‘-P’. The default name is ‘stringpool’. This option permits the use of two hash tables in the same file, with ‘-P’ and even when the option ‘-G’ (or, equivalently, the ‘%global-table’ declaration) is given.
‘--null-strings’
Use NULL strings instead of empty strings for empty keyword table entries. This reduces the startup time of programs using a shared library containing the generated code (but not as much as option ‘-P’), at the expense of one more test-and-branch instruction at run time.
‘-W hash-table-array-name
‘--word-array-name=hash-table-array-name
Allows you to specify the name for the generated array containing the hash table. Default name is ‘wordlist’. This option permits the use of two hash tables in the same file, even when the option ‘-G’ (or, equivalently, the ‘%global-table’ declaration) is given.
‘--length-table-name=length-table-array-name
Allows you to specify the name for the generated array containing the length table. Default name is ‘lengthtable’. This option permits the use of two length tables in the same file, even when the option ‘-G’ (or, equivalently, the ‘%global-table’ declaration) is given.
‘-S total-switch-statements
‘--switch=total-switch-statements
Causes the generated C code to use a switch statement scheme, rather than an array lookup table. This can lead to a reduction in both time and space requirements for some input files. The argument to this option determines how many switch statements are generated. A value of 1 generates 1 switch containing all the elements, a value of 2 generates 2 tables with 1/2 the elements in each switch, etc. This is useful since many C compilers cannot correctly generate code for large switch statements. This option was inspired in part by Keith Bostic's original C program.
‘-T’
‘--omit-struct-type’
Prevents the transfer of the type declaration to the output file. Use this option if the type is already defined elsewhere.
‘-p’
This option is supported for compatibility with previous releases of gperf. It does not do anything.

5.5 Options for changing the Algorithms employed by gperf

‘-k selected-byte-positions
‘--key-positions=selected-byte-positions
Allows selection of the byte positions used in the keywords' hash function. The allowable choices range between 1-255, inclusive. The positions are separated by commas, e.g., ‘-k 9,4,13,14’; ranges may be used, e.g., ‘-k 2-7’; and positions may occur in any order. Furthermore, the wildcard '*' causes the generated hash function to consider all byte positions in each keyword, whereas '$' instructs the hash function to use the “final byte” of a keyword (this is the only way to use a byte position greater than 255, incidentally). For instance, the option ‘-k 1,2,4,6-10,'$'’ generates a hash function that considers positions 1,2,4,6,7,8,9,10, plus the last byte in each keyword (which may be at a different position for each keyword, obviously). Keywords with length less than the indicated byte positions work properly, since selected byte positions exceeding the keyword length are simply not referenced in the hash function. This option is not normally needed since version 2.8 of gperf; the default byte positions are computed depending on the keyword set, through a search that minimizes the number of byte positions.
‘-D’
‘--duplicates’
Handle keywords whose selected byte sets hash to duplicate values. Duplicate hash values can occur if a set of keywords has the same names, but possesses different attributes, or if the selected byte positions are not well chosen. With the -D option gperf treats all these keywords as part of an equivalence class and generates a perfect hash function with multiple comparisons for duplicate keywords. It is up to you to completely disambiguate the keywords by modifying the generated C code. However, gperf helps you out by organizing the output. Using this option usually means that the generated hash function is no longer perfect. On the other hand, it permits gperf to work on keyword sets that it otherwise could not handle.
‘-m iterations
‘--multiple-iterations=iterations
Perform multiple choices of the ‘-i’ and ‘-j’ values, and choose the best results. This increases the running time by a factor of iterations but does a good job minimizing the generated table size.
‘-i initial-value
‘--initial-asso=initial-value
Provides an initial value for the associate values array. Default is 0. Increasing the initial value helps inflate the final table size, possibly leading to more time efficient keyword lookups. Note that this option is not particularly useful when ‘-S’ (or, equivalently, ‘%switch’) is used. Also, ‘-i’ is overridden when the ‘-r’ option is used.
‘-j jump-value
‘--jump=jump-value
Affects the “jump value”, i.e., how far to advance the associated byte value upon collisions. Jump-value is rounded up to an odd number, the default is 5. If the jump-value is 0 gperf jumps by random amounts.
‘-n’
‘--no-strlen’
Instructs the generator not to include the length of a keyword when computing its hash value. This may save a few assembly instructions in the generated lookup table.
‘-r’
‘--random’
Utilizes randomness to initialize the associated values table. This frequently generates solutions faster than using deterministic initialization (which starts all associated values at 0). Furthermore, using the randomization option generally increases the size of the table.
‘-s size-multiple
‘--size-multiple=size-multiple
Affects the size of the generated hash table. The numeric argument for this option indicates “how many times larger or smaller” the maximum associated value range should be, in relationship to the number of keywords. It can be written as an integer, a floating-point number or a fraction. For example, a value of 3 means “allow the maximum associated value to be about 3 times larger than the number of input keywords”. Conversely, a value of 1/3 means “allow the maximum associated value to be about 3 times smaller than the number of input keywords”. Values smaller than 1 are useful for limiting the overall size of the generated hash table, though the option ‘-m’ is better at this purpose. If `generate switch' option ‘-S’ (or, equivalently, ‘%switch’) is not enabled, the maximum associated value influences the static array table size, and a larger table should decrease the time required for an unsuccessful search, at the expense of extra table space. The default value is 1, thus the default maximum associated value about the same size as the number of keywords (for efficiency, the maximum associated value is always rounded up to a power of 2). The actual table size may vary somewhat, since this technique is essentially a heuristic.

5.6 Informative Output

‘-h’
‘--help’
Prints a short summary on the meaning of each program option. Aborts further program execution.
‘-v’
‘--version’
Prints out the current version number.
‘-d’
‘--debug’
Enables the debugging option. This produces verbose diagnostics to “standard error” when gperf is executing. It is useful both for maintaining the program and for determining whether a given set of options is actually speeding up the search for a solution. Some useful information is dumped at the end of the program when the ‘-d’ option is enabled.

6 Known Bugs and Limitations with gperf

The following are some limitations with the current release of gperf:

7 Things Still Left to Do

It should be “relatively” easy to replace the current perfect hash function algorithm with a more exhaustive approach; the perfect hash module is essential independent from other program modules. Additional worthwhile improvements include:

8 Bibliography

[1] Chang, C.C.: A Scheme for Constructing Ordered Minimal Perfect Hashing Functions Information Sciences 39(1986), 187-195.

[2] Cichelli, Richard J. Author's Response to “On Cichelli's Minimal Perfect Hash Functions Method” Communications of the ACM, 23, 12(December 1980), 729.

[3] Cichelli, Richard J. Minimal Perfect Hash Functions Made Simple Communications of the ACM, 23, 1(January 1980), 17-19.

[4] Cook, C. R. and Oldehoeft, R.R. A Letter Oriented Minimal Perfect Hashing Function SIGPLAN Notices, 17, 9(September 1982), 18-27.

[5] Cormack, G. V. and Horspool, R. N. S. and Kaiserwerth, M. Practical Perfect Hashing Computer Journal, 28, 1(January 1985), 54-58.

[6] Jaeschke, G. Reciprocal Hashing: A Method for Generating Minimal Perfect Hashing Functions Communications of the ACM, 24, 12(December 1981), 829-833.

[7] Jaeschke, G. and Osterburg, G. On Cichelli's Minimal Perfect Hash Functions Method Communications of the ACM, 23, 12(December 1980), 728-729.

[8] Sager, Thomas J. A Polynomial Time Generator for Minimal Perfect Hash Functions Communications of the ACM, 28, 5(December 1985), 523-532

[9] Schmidt, Douglas C. GPERF: A Perfect Hash Function Generator Second USENIX C++ Conference Proceedings, April 1990.

[10] Schmidt, Douglas C. GPERF: A Perfect Hash Function Generator C++ Report, SIGS 10 10 (November/December 1998).

[11] Sebesta, R.W. and Taylor, M.A. Minimal Perfect Hash Functions for Reserved Word Lists SIGPLAN Notices, 20, 12(September 1985), 47-53.

[12] Sprugnoli, R. Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets Communications of the ACM, 20 11(November 1977), 841-850.

[13] Stallman, Richard M. Using and Porting GNU CC Free Software Foundation, 1988.

[14] Stroustrup, Bjarne The C++ Programming Language. Addison-Wesley, 1986.

[15] Tiemann, Michael D. User's Guide to GNU C++ Free Software Foundation, 1989.

Concept Index

Jump to: & - a - b - c - d - f - h - i - j - k - m - n - s

&

  • ‘%%’
  • ‘%7bit’
  • ‘%compare-lengths’
  • ‘%compare-strncmp’
  • ‘%define class-name’
  • ‘%define hash-function-name’
  • ‘%define initializer-suffix’
  • ‘%define length-table-name’
  • ‘%define lookup-function-name’
  • ‘%define slot-name’
  • ‘%define string-pool-name’
  • ‘%define word-array-name’
  • ‘%delimiters’
  • ‘%enum’
  • ‘%global-table’
  • ‘%ignore-case’
  • ‘%includes’
  • ‘%language’
  • ‘%null-strings’
  • ‘%omit-struct-type’
  • ‘%pic’
  • ‘%readonly-tables’
  • ‘%struct-type’
  • ‘%switch’
  • ‘%{’
  • ‘%}’
  • a

  • Array name, Array name
  • b

  • Bugs
  • c

  • Class name
  • Copyright
  • d

  • Declaration section
  • Delimiters
  • Duplicates
  • f

  • Format
  • Functions section
  • h

  • hash
  • hash table
  • i

  • in_word_set
  • Initializers
  • j

  • Jump value
  • k

  • Keywords section
  • m

  • Minimal perfect hash functions
  • n

  • NUL
  • s

  • Slot name
  • Static search structure
  • switch, switch

  • This document was generated on 1 February 2009 using the texi2html translator version 1.52b.

    0707010004df42000041ed0000000000000000000000024f7d41b9000000000000010000010007ffffffffffffffff0000001a00000000root/usr/local/share/info0707010004df43000081a40000000000000000000000014f7d41b800017a5c0000010000010007ffffffffffffffff0000002500000000root/usr/local/share/info/gperf.infoThis is gperf.info, produced by makeinfo version 4.13 from gperf.texi. INFO-DIR-SECTION Programming Tools START-INFO-DIR-ENTRY * Gperf: (gperf). Perfect Hash Function Generator. END-INFO-DIR-ENTRY This file documents the features of the GNU Perfect Hash Function Generator 3.0.4. Copyright (C) 1989-2009 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided also that the section entitled "GNU General Public License" is included exactly as in the original, and provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that the section entitled "GNU General Public License" and this permission notice may be included in translations approved by the Free Software Foundation instead of in the original English.  File: gperf.info, Node: Top, Next: Copying, Prev: (dir), Up: (dir) Introduction ************ This manual documents the GNU `gperf' perfect hash function generator utility, focusing on its features and how to use them, and how to report bugs. * Menu: * Copying:: GNU General Public License says how you can copy and share `gperf'. * Contributors:: People who have contributed to `gperf'. * Motivation:: The purpose of `gperf'. * Search Structures:: Static search structures and GNU `gperf' * Description:: High-level discussion of how GPERF functions. * Options:: A description of options to the program. * Bugs:: Known bugs and limitations with GPERF. * Projects:: Things still left to do. * Bibliography:: Material Referenced in this Report. * Concept Index:: High-Level Description of GNU `gperf' * Input Format:: Input Format to `gperf' * Output Format:: Output Format for Generated C Code with `gperf' * Binary Strings:: Use of NUL bytes * Output Copyright:: The Copyright of the Output. Input Format to `gperf' * Declarations:: Declarations. * Keywords:: Format for Keyword Entries. * Functions:: Including Additional C Functions. * Controls for GNU indent:: Where to place directives for GNU `indent'. Declarations * User-supplied Struct:: Specifying keywords with attributes. * Gperf Declarations:: Embedding command line options in the input. * C Code Inclusion:: Including C declarations and definitions. Invoking `gperf' * Input Details:: Options that affect Interpretation of the Input File * Output Language:: Specifying the Language for the Output Code * Output Details:: Fine tuning Details in the Output Code * Algorithmic Details:: Changing the Algorithms employed by `gperf' * Verbosity:: Informative Output  File: gperf.info, Node: Copying, Next: Contributors, Prev: Top, Up: Top GNU GENERAL PUBLIC LICENSE ************************** Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. `http://fsf.org/' Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble ======== The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS ==================== 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a. The work must carry prominent notices stating that you modified it, and giving a relevant date. b. The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c. You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d. If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a. Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b. Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c. Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d. Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e. Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a. Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b. Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c. Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d. Limiting the use for publicity purposes of names of licensors or authors of the material; or e. Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f. Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS =========================== How to Apply These Terms to Your New Programs ============================================= If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES. Copyright (C) YEAR NAME OF AUTHOR This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see `http://www.gnu.org/licenses/'. Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: PROGRAM Copyright (C) YEAR NAME OF AUTHOR This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see `http://www.gnu.org/licenses/'. The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read `http://www.gnu.org/philosophy/why-not-lgpl.html'.  File: gperf.info, Node: Contributors, Next: Motivation, Prev: Copying, Up: Top Contributors to GNU `gperf' Utility *********************************** * The GNU `gperf' perfect hash function generator utility was written in GNU C++ by Douglas C. Schmidt. The general idea for the perfect hash function generator was inspired by Keith Bostic's algorithm written in C, and distributed to net.sources around 1984. The current program is a heavily modified, enhanced, and extended implementation of Keith's basic idea, created at the University of California, Irvine. Bugs, patches, and suggestions should be reported to `'. * Special thanks is extended to Michael Tiemann and Doug Lea, for providing a useful compiler, and for giving me a forum to exhibit my creation. In addition, Adam de Boor and Nels Olson provided many tips and insights that greatly helped improve the quality and functionality of `gperf'. * Bruno Haible enhanced and optimized the search algorithm. He also rewrote the input routines and the output routines for better reliability, and added a testsuite.  File: gperf.info, Node: Motivation, Next: Search Structures, Prev: Contributors, Up: Top 1 Introduction ************** `gperf' is a perfect hash function generator written in C++. It transforms an N element user-specified keyword set W into a perfect hash function F. F uniquely maps keywords in W onto the range 0..K, where K >= N-1. If K = N-1 then F is a _minimal_ perfect hash function. `gperf' generates a 0..K element static lookup table and a pair of C functions. These functions determine whether a given character string S occurs in W, using at most one probe into the lookup table. `gperf' currently generates the reserved keyword recognizer for lexical analyzers in several production and research compilers and language processing tools, including GNU C, GNU C++, GNU Java, GNU Pascal, GNU Modula 3, and GNU indent. Complete C++ source code for `gperf' is available from `http://ftp.gnu.org/pub/gnu/gperf/'. A paper describing `gperf''s design and implementation in greater detail is available in the Second USENIX C++ Conference proceedings or from `http://www.cs.wustl.edu/~schmidt/resume.html'.  File: gperf.info, Node: Search Structures, Next: Description, Prev: Motivation, Up: Top 2 Static search structures and GNU `gperf' ****************************************** A "static search structure" is an Abstract Data Type with certain fundamental operations, e.g., _initialize_, _insert_, and _retrieve_. Conceptually, all insertions occur before any retrievals. In practice, `gperf' generates a _static_ array containing search set keywords and any associated attributes specified by the user. Thus, there is essentially no execution-time cost for the insertions. It is a useful data structure for representing _static search sets_. Static search sets occur frequently in software system applications. Typical static search sets include compiler reserved words, assembler instruction opcodes, and built-in shell interpreter commands. Search set members, called "keywords", are inserted into the structure only once, usually during program initialization, and are not generally modified at run-time. Numerous static search structure implementations exist, e.g., arrays, linked lists, binary search trees, digital search tries, and hash tables. Different approaches offer trade-offs between space utilization and search time efficiency. For example, an N element sorted array is space efficient, though the average-case time complexity for retrieval operations using binary search is proportional to log N. Conversely, hash table implementations often locate a table entry in constant time, but typically impose additional memory overhead and exhibit poor worst case performance. _Minimal perfect hash functions_ provide an optimal solution for a particular class of static search sets. A minimal perfect hash function is defined by two properties: * It allows keyword recognition in a static search set using at most _one_ probe into the hash table. This represents the "perfect" property. * The actual memory allocated to store the keywords is precisely large enough for the keyword set, and _no larger_. This is the "minimal" property. For most applications it is far easier to generate _perfect_ hash functions than _minimal perfect_ hash functions. Moreover, non-minimal perfect hash functions frequently execute faster than minimal ones in practice. This phenomena occurs since searching a sparse keyword table increases the probability of locating a "null" entry, thereby reducing string comparisons. `gperf''s default behavior generates _near-minimal_ perfect hash functions for keyword sets. However, `gperf' provides many options that permit user control over the degree of minimality and perfection. Static search sets often exhibit relative stability over time. For example, Ada's 63 reserved words have remained constant for nearly a decade. It is therefore frequently worthwhile to expend concerted effort building an optimal search structure _once_, if it subsequently receives heavy use multiple times. `gperf' removes the drudgery associated with constructing time- and space-efficient search structures by hand. It has proven a useful and practical tool for serious programming projects. Output from `gperf' is currently used in several production and research compilers, including GNU C, GNU C++, GNU Java, GNU Pascal, and GNU Modula 3. The latter two compilers are not yet part of the official GNU distribution. Each compiler utilizes `gperf' to automatically generate static search structures that efficiently identify their respective reserved keywords.  File: gperf.info, Node: Description, Next: Options, Prev: Search Structures, Up: Top 3 High-Level Description of GNU `gperf' *************************************** * Menu: * Input Format:: Input Format to `gperf' * Output Format:: Output Format for Generated C Code with `gperf' * Binary Strings:: Use of NUL bytes * Output Copyright:: The Copyright of the Output. The perfect hash function generator `gperf' reads a set of "keywords" from an input file (or from the standard input by default). It attempts to derive a perfect hashing function that recognizes a member of the "static keyword set" with at most a single probe into the lookup table. If `gperf' succeeds in generating such a function it produces a pair of C source code routines that perform hashing and table lookup recognition. All generated C code is directed to the standard output. Command-line options described below allow you to modify the input and output format to `gperf'. By default, `gperf' attempts to produce time-efficient code, with less emphasis on efficient space utilization. However, several options exist that permit trading-off execution time for storage space and vice versa. In particular, expanding the generated table size produces a sparse search structure, generally yielding faster searches. Conversely, you can direct `gperf' to utilize a C `switch' statement scheme that minimizes data space storage size. Furthermore, using a C `switch' may actually speed up the keyword retrieval time somewhat. Actual results depend on your C compiler, of course. In general, `gperf' assigns values to the bytes it is using for hashing until some set of values gives each keyword a unique value. A helpful heuristic is that the larger the hash value range, the easier it is for `gperf' to find and generate a perfect hash function. Experimentation is the key to getting the most from `gperf'.  File: gperf.info, Node: Input Format, Next: Output Format, Prev: Description, Up: Description 3.1 Input Format to `gperf' =========================== You can control the input file format by varying certain command-line arguments, in particular the `-t' option. The input's appearance is similar to GNU utilities `flex' and `bison' (or UNIX utilities `lex' and `yacc'). Here's an outline of the general format: declarations %% keywords %% functions _Unlike_ `flex' or `bison', the declarations section and the functions section are optional. The following sections describe the input format for each section. * Menu: * Declarations:: Declarations. * Keywords:: Format for Keyword Entries. * Functions:: Including Additional C Functions. * Controls for GNU indent:: Where to place directives for GNU `indent'. It is possible to omit the declaration section entirely, if the `-t' option is not given. In this case the input file begins directly with the first keyword line, e.g.: january february march april ...  File: gperf.info, Node: Declarations, Next: Keywords, Prev: Input Format, Up: Input Format 3.1.1 Declarations ------------------ The keyword input file optionally contains a section for including arbitrary C declarations and definitions, `gperf' declarations that act like command-line options, as well as for providing a user-supplied `struct'. * Menu: * User-supplied Struct:: Specifying keywords with attributes. * Gperf Declarations:: Embedding command line options in the input. * C Code Inclusion:: Including C declarations and definitions.  File: gperf.info, Node: User-supplied Struct, Next: Gperf Declarations, Prev: Declarations, Up: Declarations 3.1.1.1 User-supplied `struct' .............................. If the `-t' option (or, equivalently, the `%struct-type' declaration) _is_ enabled, you _must_ provide a C `struct' as the last component in the declaration section from the input file. The first field in this struct must be of type `char *' or `const char *' if the `-P' option is not given, or of type `int' if the option `-P' (or, equivalently, the `%pic' declaration) is enabled. This first field must be called `name', although it is possible to modify its name with the `-K' option (or, equivalently, the `%define slot-name' declaration) described below. Here is a simple example, using months of the year and their attributes as input: struct month { char *name; int number; int days; int leap_days; }; %% january, 1, 31, 31 february, 2, 28, 29 march, 3, 31, 31 april, 4, 30, 30 may, 5, 31, 31 june, 6, 30, 30 july, 7, 31, 31 august, 8, 31, 31 september, 9, 30, 30 october, 10, 31, 31 november, 11, 30, 30 december, 12, 31, 31 Separating the `struct' declaration from the list of keywords and other fields are a pair of consecutive percent signs, `%%', appearing left justified in the first column, as in the UNIX utility `lex'. If the `struct' has already been declared in an include file, it can be mentioned in an abbreviated form, like this: struct month; %% january, 1, 31, 31 ...  File: gperf.info, Node: Gperf Declarations, Next: C Code Inclusion, Prev: User-supplied Struct, Up: Declarations 3.1.1.2 Gperf Declarations .......................... The declaration section can contain `gperf' declarations. They influence the way `gperf' works, like command line options do. In fact, every such declaration is equivalent to a command line option. There are three forms of declarations: 1. Declarations without argument, like `%compare-lengths'. 2. Declarations with an argument, like `%switch=COUNT'. 3. Declarations of names of entities in the output file, like `%define lookup-function-name NAME'. When a declaration is given both in the input file and as a command line option, the command-line option's value prevails. The following `gperf' declarations are available. `%delimiters=DELIMITER-LIST' Allows you to provide a string containing delimiters used to separate keywords from their attributes. The default is ",". This option is essential if you want to use keywords that have embedded commas or newlines. `%struct-type' Allows you to include a `struct' type declaration for generated code; see above for an example. `%ignore-case' Consider upper and lower case ASCII characters as equivalent. The string comparison will use a case insignificant character comparison. Note that locale dependent case mappings are ignored. `%language=LANGUAGE-NAME' Instructs `gperf' to generate code in the language specified by the option's argument. Languages handled are currently: `KR-C' Old-style K&R C. This language is understood by old-style C compilers and ANSI C compilers, but ANSI C compilers may flag warnings (or even errors) because of lacking `const'. `C' Common C. This language is understood by ANSI C compilers, and also by old-style C compilers, provided that you `#define const' to empty for compilers which don't know about this keyword. `ANSI-C' ANSI C. This language is understood by ANSI C (C89, ISO C90) compilers, ISO C99 compilers, and C++ compilers. `C++' C++. This language is understood by C++ compilers. The default is C. `%define slot-name NAME' This declaration is only useful when option `-t' (or, equivalently, the `%struct-type' declaration) has been given. By default, the program assumes the structure component identifier for the keyword is `name'. This option allows an arbitrary choice of identifier for this component, although it still must occur as the first field in your supplied `struct'. `%define initializer-suffix INITIALIZERS' This declaration is only useful when option `-t' (or, equivalently, the `%struct-type' declaration) has been given. It permits to specify initializers for the structure members following SLOT-NAME in empty hash table entries. The list of initializers should start with a comma. By default, the emitted code will zero-initialize structure members following SLOT-NAME. `%define hash-function-name NAME' Allows you to specify the name for the generated hash function. Default name is `hash'. This option permits the use of two hash tables in the same file. `%define lookup-function-name NAME' Allows you to specify the name for the generated lookup function. Default name is `in_word_set'. This option permits multiple generated hash functions to be used in the same application. `%define class-name NAME' This option is only useful when option `-L C++' (or, equivalently, the `%language=C++' declaration) has been given. It allows you to specify the name of generated C++ class. Default name is `Perfect_Hash'. `%7bit' This option specifies that all strings that will be passed as arguments to the generated hash function and the generated lookup function will solely consist of 7-bit ASCII characters (bytes in the range 0..127). (Note that the ANSI C functions `isalnum' and `isgraph' do _not_ guarantee that a byte is in this range. Only an explicit test like `c >= 'A' && c <= 'Z'' guarantees this.) `%compare-lengths' Compare keyword lengths before trying a string comparison. This option is mandatory for binary comparisons (*note Binary Strings::). It also might cut down on the number of string comparisons made during the lookup, since keywords with different lengths are never compared via `strcmp'. However, using `%compare-lengths' might greatly increase the size of the generated C code if the lookup table range is large (which implies that the switch option `-S' or `%switch' is not enabled), since the length table contains as many elements as there are entries in the lookup table. `%compare-strncmp' Generates C code that uses the `strncmp' function to perform string comparisons. The default action is to use `strcmp'. `%readonly-tables' Makes the contents of all generated lookup tables constant, i.e., "readonly". Many compilers can generate more efficient code for this by putting the tables in readonly memory. `%enum' Define constant values using an enum local to the lookup function rather than with #defines. This also means that different lookup functions can reside in the same file. Thanks to James Clark `'. `%includes' Include the necessary system include file, `', at the beginning of the code. By default, this is not done; the user must include this header file himself to allow compilation of the code. `%global-table' Generate the static table of keywords as a static global variable, rather than hiding it inside of the lookup function (which is the default behavior). `%pic' Optimize the generated table for inclusion in shared libraries. This reduces the startup time of programs using a shared library containing the generated code. If the `%struct-type' declaration (or, equivalently, the option `-t') is also given, the first field of the user-defined struct must be of type `int', not `char *', because it will contain offsets into the string pool instead of actual strings. To convert such an offset to a string, you can use the expression `stringpool + O', where O is the offset. The string pool name can be changed through the `%define string-pool-name' declaration. `%define string-pool-name NAME' Allows you to specify the name of the generated string pool created by the declaration `%pic' (or, equivalently, the option `-P'). The default name is `stringpool'. This declaration permits the use of two hash tables in the same file, with `%pic' and even when the `%global-table' declaration (or, equivalently, the option `-G') is given. `%null-strings' Use NULL strings instead of empty strings for empty keyword table entries. This reduces the startup time of programs using a shared library containing the generated code (but not as much as the declaration `%pic'), at the expense of one more test-and-branch instruction at run time. `%define word-array-name NAME' Allows you to specify the name for the generated array containing the hash table. Default name is `wordlist'. This option permits the use of two hash tables in the same file, even when the option `-G' (or, equivalently, the `%global-table' declaration) is given. `%define length-table-name NAME' Allows you to specify the name for the generated array containing the length table. Default name is `lengthtable'. This option permits the use of two length tables in the same file, even when the option `-G' (or, equivalently, the `%global-table' declaration) is given. `%switch=COUNT' Causes the generated C code to use a `switch' statement scheme, rather than an array lookup table. This can lead to a reduction in both time and space requirements for some input files. The argument to this option determines how many `switch' statements are generated. A value of 1 generates 1 `switch' containing all the elements, a value of 2 generates 2 tables with 1/2 the elements in each `switch', etc. This is useful since many C compilers cannot correctly generate code for large `switch' statements. This option was inspired in part by Keith Bostic's original C program. `%omit-struct-type' Prevents the transfer of the type declaration to the output file. Use this option if the type is already defined elsewhere.  File: gperf.info, Node: C Code Inclusion, Prev: Gperf Declarations, Up: Declarations 3.1.1.3 C Code Inclusion ........................ Using a syntax similar to GNU utilities `flex' and `bison', it is possible to directly include C source text and comments verbatim into the generated output file. This is accomplished by enclosing the region inside left-justified surrounding `%{', `%}' pairs. Here is an input fragment based on the previous example that illustrates this feature: %{ #include /* This section of code is inserted directly into the output. */ int return_month_days (struct month *months, int is_leap_year); %} struct month { char *name; int number; int days; int leap_days; }; %% january, 1, 31, 31 february, 2, 28, 29 march, 3, 31, 31 ...  File: gperf.info, Node: Keywords, Next: Functions, Prev: Declarations, Up: Input Format 3.1.2 Format for Keyword Entries -------------------------------- The second input file format section contains lines of keywords and any associated attributes you might supply. A line beginning with `#' in the first column is considered a comment. Everything following the `#' is ignored, up to and including the following newline. A line beginning with `%' in the first column is an option declaration and must not occur within the keywords section. The first field of each non-comment line is always the keyword itself. It can be given in two ways: as a simple name, i.e., without surrounding string quotation marks, or as a string enclosed in double-quotes, in C syntax, possibly with backslash escapes like `\"' or `\234' or `\xa8'. In either case, it must start right at the beginning of the line, without leading whitespace. In this context, a "field" is considered to extend up to, but not include, the first blank, comma, or newline. Here is a simple example taken from a partial list of C reserved words: # These are a few C reserved words, see the c.gperf file # for a complete list of ANSI C reserved words. unsigned sizeof switch signed if default for while return Note that unlike `flex' or `bison' the first `%%' marker may be elided if the declaration section is empty. Additional fields may optionally follow the leading keyword. Fields should be separated by commas, and terminate at the end of line. What these fields mean is entirely up to you; they are used to initialize the elements of the user-defined `struct' provided by you in the declaration section. If the `-t' option (or, equivalently, the `%struct-type' declaration) is _not_ enabled these fields are simply ignored. All previous examples except the last one contain keyword attributes.  File: gperf.info, Node: Functions, Next: Controls for GNU indent, Prev: Keywords, Up: Input Format 3.1.3 Including Additional C Functions -------------------------------------- The optional third section also corresponds closely with conventions found in `flex' and `bison'. All text in this section, starting at the final `%%' and extending to the end of the input file, is included verbatim into the generated output file. Naturally, it is your responsibility to ensure that the code contained in this section is valid C.  File: gperf.info, Node: Controls for GNU indent, Prev: Functions, Up: Input Format 3.1.4 Where to place directives for GNU `indent'. ------------------------------------------------- If you want to invoke GNU `indent' on a `gperf' input file, you will see that GNU `indent' doesn't understand the `%%', `%{' and `%}' directives that control `gperf''s interpretation of the input file. Therefore you have to insert some directives for GNU `indent'. More precisely, assuming the most general input file structure declarations part 1 %{ verbatim code %} declarations part 2 %% keywords %% functions you would insert `*INDENT-OFF*' and `*INDENT-ON*' comments as follows: /* *INDENT-OFF* */ declarations part 1 %{ /* *INDENT-ON* */ verbatim code /* *INDENT-OFF* */ %} declarations part 2 %% keywords %% /* *INDENT-ON* */ functions  File: gperf.info, Node: Output Format, Next: Binary Strings, Prev: Input Format, Up: Description 3.2 Output Format for Generated C Code with `gperf' =================================================== Several options control how the generated C code appears on the standard output. Two C functions are generated. They are called `hash' and `in_word_set', although you may modify their names with a command-line option. Both functions require two arguments, a string, `char *' STR, and a length parameter, `int' LEN. Their default function prototypes are as follows: -- Function: unsigned int hash (const char * STR, unsigned int LEN) By default, the generated `hash' function returns an integer value created by adding LEN to several user-specified STR byte positions indexed into an "associated values" table stored in a local static array. The associated values table is constructed internally by `gperf' and later output as a static local C array called `hash_table'. The relevant selected positions (i.e. indices into STR) are specified via the `-k' option when running `gperf', as detailed in the _Options_ section below (*note Options::). -- Function: in_word_set (const char * STR, unsigned int LEN) If STR is in the keyword set, returns a pointer to that keyword. More exactly, if the option `-t' (or, equivalently, the `%struct-type' declaration) was given, it returns a pointer to the matching keyword's structure. Otherwise it returns `NULL'. If the option `-c' (or, equivalently, the `%compare-strncmp' declaration) is not used, STR must be a NUL terminated string of exactly length LEN. If `-c' (or, equivalently, the `%compare-strncmp' declaration) is used, STR must simply be an array of LEN bytes and does not need to be NUL terminated. The code generated for these two functions is affected by the following options: `-t' `--struct-type' Make use of the user-defined `struct'. `-S TOTAL-SWITCH-STATEMENTS' `--switch=TOTAL-SWITCH-STATEMENTS' Generate 1 or more C `switch' statement rather than use a large, (and potentially sparse) static array. Although the exact time and space savings of this approach vary according to your C compiler's degree of optimization, this method often results in smaller and faster code. If the `-t' and `-S' options (or, equivalently, the `%struct-type' and `%switch' declarations) are omitted, the default action is to generate a `char *' array containing the keywords, together with additional empty strings used for padding the array. By experimenting with the various input and output options, and timing the resulting C code, you can determine the best option choices for different keyword set characteristics.  File: gperf.info, Node: Binary Strings, Next: Output Copyright, Prev: Output Format, Up: Description 3.3 Use of NUL bytes ==================== By default, the code generated by `gperf' operates on zero terminated strings, the usual representation of strings in C. This means that the keywords in the input file must not contain NUL bytes, and the STR argument passed to `hash' or `in_word_set' must be NUL terminated and have exactly length LEN. If option `-c' (or, equivalently, the `%compare-strncmp' declaration) is used, then the STR argument does not need to be NUL terminated. The code generated by `gperf' will only access the first LEN, not LEN+1, bytes starting at STR. However, the keywords in the input file still must not contain NUL bytes. If option `-l' (or, equivalently, the `%compare-lengths' declaration) is used, then the hash table performs binary comparison. The keywords in the input file may contain NUL bytes, written in string syntax as `\000' or `\x00', and the code generated by `gperf' will treat NUL like any other byte. Also, in this case the `-c' option (or, equivalently, the `%compare-strncmp' declaration) is ignored.  File: gperf.info, Node: Output Copyright, Prev: Binary Strings, Up: Description 3.4 The Copyright of the Output =============================== `gperf' is under GPL, but that does not cause the output produced by `gperf' to be under GPL. The reason is that the output contains only small pieces of text that come directly from `gperf''s source code - only about 7 lines long, too small for being significant -, and therefore the output is not a "work based on `gperf'" (in the sense of the GPL version 3). On the other hand, the output produced by `gperf' contains essentially all of the input file. Therefore the output is a "derivative work" of the input (in the sense of U.S. copyright law); and its copyright status depends on the copyright of the input. For most software licenses, the result is that the the output is under the same license, with the same copyright holder, as the input that was passed to `gperf'.  File: gperf.info, Node: Options, Next: Bugs, Prev: Description, Up: Top 4 Invoking `gperf' ****************** There are _many_ options to `gperf'. They were added to make the program more convenient for use with real applications. "On-line" help is readily available via the `--help' option. Here is the complete list of options. * Menu: * Output File:: Specifying the Location of the Output File * Input Details:: Options that affect Interpretation of the Input File * Output Language:: Specifying the Language for the Output Code * Output Details:: Fine tuning Details in the Output Code * Algorithmic Details:: Changing the Algorithms employed by `gperf' * Verbosity:: Informative Output  File: gperf.info, Node: Output File, Next: Input Details, Prev: Options, Up: Options 4.1 Specifying the Location of the Output File ============================================== `--output-file=FILE' Allows you to specify the name of the file to which the output is written to. The results are written to standard output if no output file is specified or if it is `-'.  File: gperf.info, Node: Input Details, Next: Output Language, Prev: Output File, Up: Options 4.2 Options that affect Interpretation of the Input File ======================================================== These options are also available as declarations in the input file (*note Gperf Declarations::). `-e KEYWORD-DELIMITER-LIST' `--delimiters=KEYWORD-DELIMITER-LIST' Allows you to provide a string containing delimiters used to separate keywords from their attributes. The default is ",". This option is essential if you want to use keywords that have embedded commas or newlines. One useful trick is to use -e'TAB', where TAB is the literal tab character. `-t' `--struct-type' Allows you to include a `struct' type declaration for generated code. Any text before a pair of consecutive `%%' is considered part of the type declaration. Keywords and additional fields may follow this, one group of fields per line. A set of examples for generating perfect hash tables and functions for Ada, C, C++, Pascal, Modula 2, Modula 3 and JavaScript reserved words are distributed with this release. `--ignore-case' Consider upper and lower case ASCII characters as equivalent. The string comparison will use a case insignificant character comparison. Note that locale dependent case mappings are ignored. This option is therefore not suitable if a properly internationalized or locale aware case mapping should be used. (For example, in a Turkish locale, the upper case equivalent of the lowercase ASCII letter `i' is the non-ASCII character `capital i with dot above'.) For this case, it is better to apply an uppercase or lowercase conversion on the string before passing it to the `gperf' generated function.  File: gperf.info, Node: Output Language, Next: Output Details, Prev: Input Details, Up: Options 4.3 Options to specify the Language for the Output Code ======================================================= These options are also available as declarations in the input file (*note Gperf Declarations::). `-L GENERATED-LANGUAGE-NAME' `--language=GENERATED-LANGUAGE-NAME' Instructs `gperf' to generate code in the language specified by the option's argument. Languages handled are currently: `KR-C' Old-style K&R C. This language is understood by old-style C compilers and ANSI C compilers, but ANSI C compilers may flag warnings (or even errors) because of lacking `const'. `C' Common C. This language is understood by ANSI C compilers, and also by old-style C compilers, provided that you `#define const' to empty for compilers which don't know about this keyword. `ANSI-C' ANSI C. This language is understood by ANSI C compilers and C++ compilers. `C++' C++. This language is understood by C++ compilers. The default is C. `-a' This option is supported for compatibility with previous releases of `gperf'. It does not do anything. `-g' This option is supported for compatibility with previous releases of `gperf'. It does not do anything.  File: gperf.info, Node: Output Details, Next: Algorithmic Details, Prev: Output Language, Up: Options 4.4 Options for fine tuning Details in the Output Code ====================================================== Most of these options are also available as declarations in the input file (*note Gperf Declarations::). `-K SLOT-NAME' `--slot-name=SLOT-NAME' This option is only useful when option `-t' (or, equivalently, the `%struct-type' declaration) has been given. By default, the program assumes the structure component identifier for the keyword is `name'. This option allows an arbitrary choice of identifier for this component, although it still must occur as the first field in your supplied `struct'. `-F INITIALIZERS' `--initializer-suffix=INITIALIZERS' This option is only useful when option `-t' (or, equivalently, the `%struct-type' declaration) has been given. It permits to specify initializers for the structure members following SLOT-NAME in empty hash table entries. The list of initializers should start with a comma. By default, the emitted code will zero-initialize structure members following SLOT-NAME. `-H HASH-FUNCTION-NAME' `--hash-function-name=HASH-FUNCTION-NAME' Allows you to specify the name for the generated hash function. Default name is `hash'. This option permits the use of two hash tables in the same file. `-N LOOKUP-FUNCTION-NAME' `--lookup-function-name=LOOKUP-FUNCTION-NAME' Allows you to specify the name for the generated lookup function. Default name is `in_word_set'. This option permits multiple generated hash functions to be used in the same application. `-Z CLASS-NAME' `--class-name=CLASS-NAME' This option is only useful when option `-L C++' (or, equivalently, the `%language=C++' declaration) has been given. It allows you to specify the name of generated C++ class. Default name is `Perfect_Hash'. `-7' `--seven-bit' This option specifies that all strings that will be passed as arguments to the generated hash function and the generated lookup function will solely consist of 7-bit ASCII characters (bytes in the range 0..127). (Note that the ANSI C functions `isalnum' and `isgraph' do _not_ guarantee that a byte is in this range. Only an explicit test like `c >= 'A' && c <= 'Z'' guarantees this.) This was the default in versions of `gperf' earlier than 2.7; now the default is to support 8-bit and multibyte characters. `-l' `--compare-lengths' Compare keyword lengths before trying a string comparison. This option is mandatory for binary comparisons (*note Binary Strings::). It also might cut down on the number of string comparisons made during the lookup, since keywords with different lengths are never compared via `strcmp'. However, using `-l' might greatly increase the size of the generated C code if the lookup table range is large (which implies that the switch option `-S' or `%switch' is not enabled), since the length table contains as many elements as there are entries in the lookup table. `-c' `--compare-strncmp' Generates C code that uses the `strncmp' function to perform string comparisons. The default action is to use `strcmp'. `-C' `--readonly-tables' Makes the contents of all generated lookup tables constant, i.e., "readonly". Many compilers can generate more efficient code for this by putting the tables in readonly memory. `-E' `--enum' Define constant values using an enum local to the lookup function rather than with #defines. This also means that different lookup functions can reside in the same file. Thanks to James Clark `'. `-I' `--includes' Include the necessary system include file, `', at the beginning of the code. By default, this is not done; the user must include this header file himself to allow compilation of the code. `-G' `--global-table' Generate the static table of keywords as a static global variable, rather than hiding it inside of the lookup function (which is the default behavior). `-P' `--pic' Optimize the generated table for inclusion in shared libraries. This reduces the startup time of programs using a shared library containing the generated code. If the option `-t' (or, equivalently, the `%struct-type' declaration) is also given, the first field of the user-defined struct must be of type `int', not `char *', because it will contain offsets into the string pool instead of actual strings. To convert such an offset to a string, you can use the expression `stringpool + O', where O is the offset. The string pool name can be changed through the option `--string-pool-name'. `-Q STRING-POOL-NAME' `--string-pool-name=STRING-POOL-NAME' Allows you to specify the name of the generated string pool created by option `-P'. The default name is `stringpool'. This option permits the use of two hash tables in the same file, with `-P' and even when the option `-G' (or, equivalently, the `%global-table' declaration) is given. `--null-strings' Use NULL strings instead of empty strings for empty keyword table entries. This reduces the startup time of programs using a shared library containing the generated code (but not as much as option `-P'), at the expense of one more test-and-branch instruction at run time. `-W HASH-TABLE-ARRAY-NAME' `--word-array-name=HASH-TABLE-ARRAY-NAME' Allows you to specify the name for the generated array containing the hash table. Default name is `wordlist'. This option permits the use of two hash tables in the same file, even when the option `-G' (or, equivalently, the `%global-table' declaration) is given. `--length-table-name=LENGTH-TABLE-ARRAY-NAME' Allows you to specify the name for the generated array containing the length table. Default name is `lengthtable'. This option permits the use of two length tables in the same file, even when the option `-G' (or, equivalently, the `%global-table' declaration) is given. `-S TOTAL-SWITCH-STATEMENTS' `--switch=TOTAL-SWITCH-STATEMENTS' Causes the generated C code to use a `switch' statement scheme, rather than an array lookup table. This can lead to a reduction in both time and space requirements for some input files. The argument to this option determines how many `switch' statements are generated. A value of 1 generates 1 `switch' containing all the elements, a value of 2 generates 2 tables with 1/2 the elements in each `switch', etc. This is useful since many C compilers cannot correctly generate code for large `switch' statements. This option was inspired in part by Keith Bostic's original C program. `-T' `--omit-struct-type' Prevents the transfer of the type declaration to the output file. Use this option if the type is already defined elsewhere. `-p' This option is supported for compatibility with previous releases of `gperf'. It does not do anything.  File: gperf.info, Node: Algorithmic Details, Next: Verbosity, Prev: Output Details, Up: Options 4.5 Options for changing the Algorithms employed by `gperf' =========================================================== `-k SELECTED-BYTE-POSITIONS' `--key-positions=SELECTED-BYTE-POSITIONS' Allows selection of the byte positions used in the keywords' hash function. The allowable choices range between 1-255, inclusive. The positions are separated by commas, e.g., `-k 9,4,13,14'; ranges may be used, e.g., `-k 2-7'; and positions may occur in any order. Furthermore, the wildcard '*' causes the generated hash function to consider *all* byte positions in each keyword, whereas '$' instructs the hash function to use the "final byte" of a keyword (this is the only way to use a byte position greater than 255, incidentally). For instance, the option `-k 1,2,4,6-10,'$'' generates a hash function that considers positions 1,2,4,6,7,8,9,10, plus the last byte in each keyword (which may be at a different position for each keyword, obviously). Keywords with length less than the indicated byte positions work properly, since selected byte positions exceeding the keyword length are simply not referenced in the hash function. This option is not normally needed since version 2.8 of `gperf'; the default byte positions are computed depending on the keyword set, through a search that minimizes the number of byte positions. `-D' `--duplicates' Handle keywords whose selected byte sets hash to duplicate values. Duplicate hash values can occur if a set of keywords has the same names, but possesses different attributes, or if the selected byte positions are not well chosen. With the -D option `gperf' treats all these keywords as part of an equivalence class and generates a perfect hash function with multiple comparisons for duplicate keywords. It is up to you to completely disambiguate the keywords by modifying the generated C code. However, `gperf' helps you out by organizing the output. Using this option usually means that the generated hash function is no longer perfect. On the other hand, it permits `gperf' to work on keyword sets that it otherwise could not handle. `-m ITERATIONS' `--multiple-iterations=ITERATIONS' Perform multiple choices of the `-i' and `-j' values, and choose the best results. This increases the running time by a factor of ITERATIONS but does a good job minimizing the generated table size. `-i INITIAL-VALUE' `--initial-asso=INITIAL-VALUE' Provides an initial VALUE for the associate values array. Default is 0. Increasing the initial value helps inflate the final table size, possibly leading to more time efficient keyword lookups. Note that this option is not particularly useful when `-S' (or, equivalently, `%switch') is used. Also, `-i' is overridden when the `-r' option is used. `-j JUMP-VALUE' `--jump=JUMP-VALUE' Affects the "jump value", i.e., how far to advance the associated byte value upon collisions. JUMP-VALUE is rounded up to an odd number, the default is 5. If the JUMP-VALUE is 0 `gperf' jumps by random amounts. `-n' `--no-strlen' Instructs the generator not to include the length of a keyword when computing its hash value. This may save a few assembly instructions in the generated lookup table. `-r' `--random' Utilizes randomness to initialize the associated values table. This frequently generates solutions faster than using deterministic initialization (which starts all associated values at 0). Furthermore, using the randomization option generally increases the size of the table. `-s SIZE-MULTIPLE' `--size-multiple=SIZE-MULTIPLE' Affects the size of the generated hash table. The numeric argument for this option indicates "how many times larger or smaller" the maximum associated value range should be, in relationship to the number of keywords. It can be written as an integer, a floating-point number or a fraction. For example, a value of 3 means "allow the maximum associated value to be about 3 times larger than the number of input keywords". Conversely, a value of 1/3 means "allow the maximum associated value to be about 3 times smaller than the number of input keywords". Values smaller than 1 are useful for limiting the overall size of the generated hash table, though the option `-m' is better at this purpose. If `generate switch' option `-S' (or, equivalently, `%switch') is _not_ enabled, the maximum associated value influences the static array table size, and a larger table should decrease the time required for an unsuccessful search, at the expense of extra table space. The default value is 1, thus the default maximum associated value about the same size as the number of keywords (for efficiency, the maximum associated value is always rounded up to a power of 2). The actual table size may vary somewhat, since this technique is essentially a heuristic.  File: gperf.info, Node: Verbosity, Prev: Algorithmic Details, Up: Options 4.6 Informative Output ====================== `-h' `--help' Prints a short summary on the meaning of each program option. Aborts further program execution. `-v' `--version' Prints out the current version number. `-d' `--debug' Enables the debugging option. This produces verbose diagnostics to "standard error" when `gperf' is executing. It is useful both for maintaining the program and for determining whether a given set of options is actually speeding up the search for a solution. Some useful information is dumped at the end of the program when the `-d' option is enabled.  File: gperf.info, Node: Bugs, Next: Projects, Prev: Options, Up: Top 5 Known Bugs and Limitations with `gperf' ***************************************** The following are some limitations with the current release of `gperf': * The `gperf' utility is tuned to execute quickly, and works quickly for small to medium size data sets (around 1000 keywords). It is extremely useful for maintaining perfect hash functions for compiler keyword sets. Several recent enhancements now enable `gperf' to work efficiently on much larger keyword sets (over 15,000 keywords). When processing large keyword sets it helps greatly to have over 8 megs of RAM. * The size of the generate static keyword array can get _extremely_ large if the input keyword file is large or if the keywords are quite similar. This tends to slow down the compilation of the generated C code, and _greatly_ inflates the object code size. If this situation occurs, consider using the `-S' option to reduce data size, potentially increasing keyword recognition time a negligible amount. Since many C compilers cannot correctly generate code for large switch statements it is important to qualify the -S option with an appropriate numerical argument that controls the number of switch statements generated. * The maximum number of selected byte positions has an arbitrary limit of 255. This restriction should be removed, and if anyone considers this a problem write me and let me know so I can remove the constraint.  File: gperf.info, Node: Projects, Next: Bibliography, Prev: Bugs, Up: Top 6 Things Still Left to Do ************************* It should be "relatively" easy to replace the current perfect hash function algorithm with a more exhaustive approach; the perfect hash module is essential independent from other program modules. Additional worthwhile improvements include: * Another useful extension involves modifying the program to generate "minimal" perfect hash functions (under certain circumstances, the current version can be rather extravagant in the generated table size). This is mostly of theoretical interest, since a sparse table often produces faster lookups, and use of the `-S' `switch' option can minimize the data size, at the expense of slightly longer lookups (note that the gcc compiler generally produces good code for `switch' statements, reducing the need for more complex schemes). * In addition to improving the algorithm, it would also be useful to generate an Ada package as the code output, in addition to the current C and C++ routines.  File: gperf.info, Node: Bibliography, Next: Concept Index, Prev: Projects, Up: Top 7 Bibliography ************** [1] Chang, C.C.: A Scheme for Constructing Ordered Minimal Perfect Hashing Functions Information Sciences 39(1986), 187-195. [2] Cichelli, Richard J. Author's Response to "On Cichelli's Minimal Perfect Hash Functions Method" Communications of the ACM, 23, 12(December 1980), 729. [3] Cichelli, Richard J. Minimal Perfect Hash Functions Made Simple Communications of the ACM, 23, 1(January 1980), 17-19. [4] Cook, C. R. and Oldehoeft, R.R. A Letter Oriented Minimal Perfect Hashing Function SIGPLAN Notices, 17, 9(September 1982), 18-27. [5] Cormack, G. V. and Horspool, R. N. S. and Kaiserwerth, M. Practical Perfect Hashing Computer Journal, 28, 1(January 1985), 54-58. [6] Jaeschke, G. Reciprocal Hashing: A Method for Generating Minimal Perfect Hashing Functions Communications of the ACM, 24, 12(December 1981), 829-833. [7] Jaeschke, G. and Osterburg, G. On Cichelli's Minimal Perfect Hash Functions Method Communications of the ACM, 23, 12(December 1980), 728-729. [8] Sager, Thomas J. A Polynomial Time Generator for Minimal Perfect Hash Functions Communications of the ACM, 28, 5(December 1985), 523-532 [9] Schmidt, Douglas C. GPERF: A Perfect Hash Function Generator Second USENIX C++ Conference Proceedings, April 1990. [10] Schmidt, Douglas C. GPERF: A Perfect Hash Function Generator C++ Report, SIGS 10 10 (November/December 1998). [11] Sebesta, R.W. and Taylor, M.A. Minimal Perfect Hash Functions for Reserved Word Lists SIGPLAN Notices, 20, 12(September 1985), 47-53. [12] Sprugnoli, R. Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets Communications of the ACM, 20 11(November 1977), 841-850. [13] Stallman, Richard M. Using and Porting GNU CC Free Software Foundation, 1988. [14] Stroustrup, Bjarne The C++ Programming Language. Addison-Wesley, 1986. [15] Tiemann, Michael D. User's Guide to GNU C++ Free Software Foundation, 1989.  File: gperf.info, Node: Concept Index, Prev: Bibliography, Up: Top Concept Index ************* [index] * Menu: * %%: User-supplied Struct. (line 33) * %7bit: Gperf Declarations. (line 95) * %compare-lengths: Gperf Declarations. (line 103) * %compare-strncmp: Gperf Declarations. (line 115) * %define class-name: Gperf Declarations. (line 89) * %define hash-function-name: Gperf Declarations. (line 79) * %define initializer-suffix: Gperf Declarations. (line 71) * %define length-table-name: Gperf Declarations. (line 173) * %define lookup-function-name: Gperf Declarations. (line 84) * %define slot-name: Gperf Declarations. (line 63) * %define string-pool-name: Gperf Declarations. (line 152) * %define word-array-name: Gperf Declarations. (line 167) * %delimiters: Gperf Declarations. (line 24) * %enum: Gperf Declarations. (line 124) * %global-table: Gperf Declarations. (line 135) * %ignore-case: Gperf Declarations. (line 34) * %includes: Gperf Declarations. (line 130) * %language: Gperf Declarations. (line 39) * %null-strings: Gperf Declarations. (line 160) * %omit-struct-type: Gperf Declarations. (line 192) * %pic: Gperf Declarations. (line 140) * %readonly-tables: Gperf Declarations. (line 119) * %struct-type: Gperf Declarations. (line 30) * %switch: Gperf Declarations. (line 180) * %{: C Code Inclusion. (line 6) * %}: C Code Inclusion. (line 6) * Array name: Output Details. (line 129) * Bugs: Contributors. (line 6) * Class name: Output Details. (line 41) * Copyright: Output Copyright. (line 6) * Declaration section: Input Format. (line 6) * Delimiters: Input Details. (line 11) * Duplicates: Algorithmic Details. (line 32) * Format: Input Format. (line 6) * Functions section: Input Format. (line 6) * hash: Output Format. (line 14) * hash table: Output Format. (line 6) * in_word_set: Output Format. (line 24) * Initializers: Output Details. (line 20) * Jump value: Algorithmic Details. (line 63) * Keywords section: Input Format. (line 6) * Minimal perfect hash functions: Search Structures. (line 30) * NUL: Binary Strings. (line 6) * Slot name: Output Details. (line 11) * Static search structure: Search Structures. (line 6) * switch <1>: Output Details. (line 143) * switch: Output Format. (line 44)  Tag Table: Node: Top1237 Node: Copying3374 Node: Contributors40915 Node: Motivation42108 Node: Search Structures43240 Node: Description46799 Node: Input Format48757 Node: Declarations49902 Node: User-supplied Struct50490 Node: Gperf Declarations52105 Node: C Code Inclusion60897 Node: Keywords61740 Node: Functions63688 Node: Controls for GNU indent64226 Node: Output Format65177 Node: Binary Strings67972 Node: Output Copyright69148 Node: Options70087 Node: Output File70876 Node: Input Details71268 Node: Output Language73107 Node: Output Details74526 Node: Algorithmic Details81793 Node: Verbosity87050 Node: Bugs87761 Node: Projects89357 Node: Bibliography90489 Node: Concept Index92504  End Tag Table 0707010004df3d000041ed0000000000000000000000024f7d41b9000000000000010000010007ffffffffffffffff0000001300000000root/usr/local/bin0707010004df3e000081ed0000000000000000000000014f7d41b80005acb00000010000010007ffffffffffffffff0000001900000000root/usr/local/bin/gperfELF+]@0@8@"!@@X{F{F{H{H-t-((/usr/lib/sparcv9/ld.so.1aa  !"$'(-/034689=>ABCDEHMNPQRUVXZ\]^`adhijklorstuvwxyz|}   "#$%'*,-./04679:;<=?ACDGJKMNORTUY\]_` #%&)*+,.1257:;<?@FGIJKLOSTWY[_bcefgmnpq{~   !&()+12358>@BEFHILPQSVWXZ[^(0 XD_"`e$SDe\ (W_D@LLp`D=XTdi ^p$! t0p@  h`48([0$40(p|+ o0FNlX$n08|<b n0.HR!0 n$vhPT00n/T7PKqXTsԀp n0k8hX/hTH hN  pR`8c5`=`FXm ph0k(  =0 n R s0 w |p$ 8D p S@T ( ( o0 @H je@8   nx0   c `p jD 2` 9@p [ w " ^D a p0  vX0 @HX d r " {h  ! 0$ k :p N r y CL 0P TXl qp 0#p`DJ8e l`pXh  L 5FِLcx s0$b X$f(D@IHf8*(eL֘$F$n(pL@'PT+(w|IxPo@ppGX  0$AL_0 s0Ԁpl'e@8@ Z p0|m4 RPOpmLD8X@ 8D8]x` `?T@L_`7$c8~{h(,(ذL"eLS qh0wL@pѨD@ՠ5<D8Xg r0m4Xp$)XO t@q8ЈD!P01k(^f Cp"{H4Bg(`Pp0TX0p(XKb$(( p0kXD8 pEMm$]! tP0#0! {F(QlJDn" D v0ِLh S )(| ` _`]@@7_a]@@0_a]@@)_a]@@"_a]@@_a ]@@_a(]@@ _a0]@@_a8]@@_a@]@@_aH]@@_aP]@@_aX]@@_a`]@@ܒ_ah]@@Ւ_ap]@@Β_ax]@@ǒ_a]@@_a]@@_a]@@_a]@@_a]@@_a]@@ _a]@@_a]@@_a]@@_a]@@ _a]@@x_a]@@q_a]@@j_a]@@c_a]@@\_a]@@U_b]@@N A@ctwwb]@B 'G_D H_\ G,0\@w_L -HW_L @ ѐ_ߠ w_L AH_L ZH _L aH_L zH _L @ _ߠ wH3_L -H._L @ _ߠ w_L AH_L ZO_L aH_L zO_L -O_L =H _L @ _ߠ w_b]@@hL_ߐ@ 'h+@ m "_L H _L "H_L \H _L $H_L `H@ R \_L @ N_ߠ Ow@ H "H@ D '_L H_L \H@ 8 \_L @ 4_ߠ Ow@ . 'H b]_ߐ@@b ]@zG O8'b(]@q ww''''G'__t`G_$`G_$` G_$`G_$`G_$` _,`0A@cDww_  H_ $D` $`_D`$D` H _,`_D $H'H_\ L HH_\` t`H_\` t`_D H' '_\ L ,08408< @  H_\ L G,`,`?'_\` Ot`_\ L -H9_\` t` _,`_$ _\ L ,08408< @ e H_\`L ` E ,`,`?% _\` Ot`_D G뀤H_D` D` H_D H@'G_$`$G_D HG_D H_D H-'GH*'_D H&'H_\ L 0H  $O ,OvO$ 0 O, < #c`_ߠؠDO[_D 'G< 0A@~cĮww _$`_t _t _t ( _$`0_$ 4_$ 8 _$`<b0] _$ @c]\ _t`Hc]\ _t`Pc]\ _t`Xc]\ _t``c]\ _t`hc]\ _t`pc]\ _t`xc]\ _t`c]\ _t`_ 㺠A@~b<ww_D !@H_D  Hb@]HwbH]w_D  HbP]HwbX]w_D  Hb`]Hwbh]w_D  Hbp]Hwbx]w_D  Hb]Hwb]w_D  Hb]Hwb]w_D  @Hb]Hwb]w_D  Hb]Hwwb]ww_D !Hb]Hwgb]wg_D "Hb]HwWb]wW_D $Hb]HwGb]wG_D (Hb]Hw7b]w7_D !@Hc]Hw'c]w'_D !@Hc]Hwc]w_D !@Hc ]Hwc(]w_D ! @Hc0]Hwc8]w_D !@@Hc@]HwcH]w_D !@HcP]HwcX]w_D !@Hc`]Hwch]w_D !@Hcp]Hwcx]w_D !@Hc]Hwc]w`]!b8]________w_gw_Ww_Gw_7w_'w_ww_wg_wW_wG_w7_w'_w_w_\`Hw\`hw\`pw\`xw\`w\`Pw\`XwD`8'D`0'w`@(D`4'g\`wWD`<'G@@ssss_s_s_s_s_s_ws_gs_Ws_Gs_7s_'s_s'_s/_s7_s?_sG_sO_sW_s__sgGsoGwsw;Ggs_WsGG@:s_ *08408 H`]!c]@@'H?`]!c]_ Đ@@_ @m'G〤?H!G〤?H`]!c]@@H`]!c]G @@O`]!c]@@ޒ0A@|awww_\ (h___t`(_ D` ?$`_c]@@ H _ D` $`HF_c]@@ْ H _ D` $`H5_c]@@Ȓ H _ D` $`H$_c]@@ H _ D` $`H`]!c]_@@q_ D` $`0w'_D ! @ H _ D! @$G_$`<0A@{c|www_\ Hc]\ h__t`H0A@{c www_\ Pc]\ h__t`P0A@{bwww_\ Xc]\ h__t`X0A@{b,www_\ `c]\ h__t``0A@{awww_\ hc]\ h__t`h0A@{aLwww_\ pc]\ h__t`p0A@{`ܮwww_\ xc]\ h__t`x0A@{`lwww_\ c]\ h__t`0A@zcwww_\ c]\ h__t`㾠A@zcwWw'w_\ c8]t`G_$`__t`_D`\`c]c]@@[Ę'Gۀ?HHH_ D`!$`H_ D`"$`H_ D!@$`]!c]c8]\ c]\ @@H_ D!@$HcX]\ _t`H_ D`$$`HHcX]\ _t`XHH_ D!@$H`] @ cX]\ _t`hHcX]\ @'G_$`4G׀ H`]!c]_D 4@@`]@*08408 H `]!c]@@HO_ D`($`HHcX]\ @'G_$`0GӀ H`]!`]_D 0@@e`]!}@M H%_D 0 H _D 0<` @ ?$@ H_D 0'_ 0D` $``]!`]Gϐ@@8H_ D!@$?'?'cX]\ @  ???scX]\ L *H _ ˒ H_ Ē _ w_wȐ'G?HCG?H`]!`]@@ `]!@Ԑ __$@<0?`8p!h`]!`]@@В`]!@ G?HG?'G_$`_ Ow__$@<0?`8p'{{ H`]!` ]@@`]!@ _ {@_ *08408 H`]!`(]@@`]!@k HAcX]\ _t`PH9_ D` $`H2_t (_cX]\ @H&cX]\ @'G_$`8Gˀ H`]!`0]@@F_$ 8H _ D!@$HcX]\ _t`HHHHH_ D!@$HcX]\ _t`H_ D!@$_D 4 H `]!`8]@@Hb0] 's /rcX]\ g@@6'w_gcX]\ h /rH&_gL H!_gL /H_g w___g@@'s_g__h_gL H /rH /rr H`]!`@]@@~`]!ΐ@~ wsI_$ @_ @`] JH b0] _ @ I$ _ @`] J(Hb0] _$ @_ @`] JH`]!`H]_ @(c8]\ @;[@~jH_ @`] JH`]!`P]_ @(c8]\ @;[@~KH_ D! @$cX]\ @~u_$ <_D < H`]!`X]cX]\ @@~'`]!?@~ H_ D` $`H_ D!@@$H`] ``]c]\ @@}`] `h]`p]@@}`] `x]`]`]@@}ߖ@}͐ cX]\ _t`pHcX]\ _t``H_ D` @$`HcX]\ _t` H_ D` $`H_ D!@$HwcX]\ _t`xHo`]!@} HeGۀ`cHR`NH#`KH`CH`7OO%`C O, < #a\_WDO`LOO`SH%`N O, < #al_WD`WH `SO`TOFO`ZH`WOwOO{`aO,O%`c O, < #a_W|DO`]D G뀤H`]D '`]D  `]$`_Gǡ,0\@_t``]D G뀤H`]!`]c8]\ @@}`]!@| X$Dl|xD,Th$dt   4Pp0w'_D G @  2H /4 0w'_ DG@$@w_\ w_@w_\ w_@w_D 0'G< @w_D 4'G< @w_D 8'G< @w_D <'G< @w_ @'(@w_\ Hw_@w_\ Pw_@w_\ Xw_@w_\ `w_@w_\ hw_@w_\ pw_@w_\ xw_@w_\ w_@w_\ w_@w_ w_@A@u`w`]Po0A@u`w'c] G @ 'G< 0A@tcw'G`] @@{'G< wwwwע__D @T',0@{sw_w_w'G?H>G?H _\`D`?< L,08408'HG_D H_\ GL@,08408'_׀h _G,0@'H@{C_߀h_,0@'_$`_ wO__t` __$@<0?`8p_$`(_w_0www___ߐ@ wwww____א@jw__D (@@@w_\ @z0A@t`dwwc]_t`c]_t`0A@scwwc]_t`@w ww'w__t`G_$`__t` ww'w__G_א@ޖ?_$`<0w' 'GG뀤H,G'_G,0@'G〤 H_G?< ,0@H_G< ,0@,$@G?O'_G,0$@G O'0w'_G렌 H_@z90ww_t __t`0ww__@ww_h! @z w_@w__ǐ@_w__t`_@w_@Z wO_t _Hw_@y@y_@w_w_0w_h_@Z w_@y_wO wwwߠw_h__t`H7_瀤h__t`H.__@_@@*08408 H__t`_@w_w_\ wH __t`_@w_\ wO_w_ww_h _@xZ h_HCwHA_w_@jZ w_@eZ w_ǀhH_@ZZ w_@UZ w_ǀhHO_@HZ w_@Cr __@__@_@aw_0ww__@w_@w_\ w_@w_w_@w_\ w_@w_w_0www__t`__t`@A@qc,w`]h `]HwH`]w_A@qbwww'w_ w_w_L H%__瀤 h Hu/_L _L H_L -H_L _H Ha/_ w_ Ow__瀤h#_L AH_L ZH_L aH_L zH _L -H_L _H H4/__瀤h_L H_L H_ wO__瀤h_L H`]!`]X@@w@wq  /4 㾰A@q`,w_ww'ww_ w_wg_gL H%__瀤 h H/_L _gL H_gL -H_L _H H/_ w_g Owg__瀤h#_L AH_L ZH_L aH_L zH _L -H_L _H H/__瀤h_L =H`]!`]_א@@@v@v _ w__$@ @w?w_w_w__瀤h!_L H_L H_L H_ww_ w_wo_ w_wL _o,`O _,`__瀤h_L H_L H_ wO__瀤h_L H`]!`]j@@v@v __t` /4 㾐A@p`dw?ww'ww_ w`]wO_OL H__瀤 h H%/_L _OL H H/_ w_O OwO__瀤h _L H _L H H/__瀤h_L H_L H_ wO_wG_GL H%__瀤 h H/_L _GL H_GL -H_L _H H/_ w_G OwG__瀤h#_L AH_L ZH_L aH_L zH _L -H_L _H H/__瀤h _L H_L H`]!`]_א@@@u@u _ w__瀤h _L O_L O__$@ @uw_w_w__瀤h!_L H_L H_L H_wg_ w_w__ w_gL __,`O _,`__瀤h_L H_L H_ wO__瀤h_L H`]!`]@@uG@u5 __t` /4 A@nc,wwwwߢ_\ @?@P'Gۀ H)_\ @u H`]!`]@@uH`]!`]@@t@t _G۠@w`]O\t`\t`a]GD$`D$` 'C '3_w'_'_πh7_'L %H_'L  %H_'OGC,0t@3GGC,0$@GC 'CGC HH3 '3_'_Ϡ$@ @u8w'_'h_' w'H_w'OGC H:`]Ғ *08408 H /BH) /B_w__Oh _L %H /BH__O$@ @tw_h_ wH_OwOHGC  4H /BB HF_w_Ow /_ w__πh_L H_ wH_L H _L H /_ wO H`]!a]G@@t_wG 'Hww_w 'B@ 'GCGHOGC?< ,0\@wOGC?< ,0\@ _t`8__t`@GGC?< ,0@_$`HH _w_t 8_t @_$ H_t _t (_$ 0_t P_$ X_t `_t h 'ww '_w__h__$@ @tJw_׀h_נ wH_w_L %H:_L  {H)_\ h`]!a]l_ 0g@@@s@s~ _ߠ _t` _$`0H _L  }Hm_\ h`]!a]@@@sk@sY _\ (h`]!a ])@@sT@sB __t`( /_ߠ w__׀h_L H_Ǡ wH_L H _L H /_Ǡ Owր H`]!a(]@@sH_\ h_\ (h`]!a0]@@rH__a8]@z*08408 H `]_@zHe__a@]@ǖ*08408 H `] HM__aH]@*08408 H `] H5__aP]@/*08408 H `]_@H__aX]@*08408 H `]_@PH__a`]@*08408 H `]_@QH__ah]@И*08408 H `]_@nH__ap]@*08408 H `]_@H__ax]@*08408 H `]_@H__a]@*08408 H `]H @H{__a]@ݖ*08408 H `]0 Hc__a]@Ŗ*08408 H `]!HK__a]@*08408 H `]"H3__a]@*08408 H `]$H__a]@}*08408 H `]В(H__a]@e*08408 H `]H__a]@L*08408 H `]H__a]@*08408 H `]_@﯒H__a]@*08408 H `]jH__a]@*08408 H `]_@CH__a]@n*08408 H `]_@DHg__a]@a*08408 H*`]_@q@b`]s H`]!a]_@@@p@p H-__a]@*08408 H `]@H`]!a]R@@p}@pk Hp_\ h_\ (hf_h_@pHww_w__ߠ$@w__@ w_@pw_w_ h ___@@pY__@__@@pP ___@,_h_@p_w 4,0@p{wo_oww뀤 H _w_,0@@p,_w,0$@_h_@pp_ww ' '_wO8_\ h_\ (h`]!b]_ 0@@o@oא `] *08408 Hv_h_w/_w'_/L H_/L H_/ w/He_/L H _' w'_/ w/HX_/L /HQ_/L  *H(_/ w/_/L H_/L *H _/L  /H_/ w/H_/L H_' w'_/ w/OH(_/L  /H!_/ w/_/L H _/L H_/ w/O_/L H_' w'_/ w/HHO_/_h_/@ow_ @ow_w__/_ @@oX_@o_w_' _$`X_@o̐w__h_L? H _L? H_L? H _?w _,`HHO_h_L H`]!b]@@o@n _@ow__?L@ ;H_ @oBw_w___@@n ;__,@ __ ,@_@o<_w__t`P_w___L H__L {H__L ;H __L H__ Ow____h__L? H __L? H__L? H__?w_HHO___$@wW_W @nwG_GwO_O__W@@n _O_W,@_O_t`h_W @nӐw7_7w?_?__W@@n _?_W,@ *_?_W ,@ _?_W ,@_?_t``_h_@n_ pw`]w' /_w__h__$@ @nΔw_h_ wH_w_L #HH_L %H`]!b]@@n@n  H_L "H*__$@@n`w___wg_gw_ wW_W_h`]!b]@@m@m _WL /ROR \H~_W wW_WL /RH# 'K 'GGG H_WL 0H_WL 7H_WL GK, @?'K_W wWGG 'GOGK H`]!b ]@@mGK_g,`H: '; '7_W wW_WL 0H_WL 9H_WL AH_WL FH _WL aH8_WL fH3_WL AH _WL FH_WL ?H'_WL aH _WL fH_WL ?H'_WL ?'G'G;, G@';_W wWG7 '7OG7 H`]!b(]@@m>G; H`]!b0]@@m*G;_g,`HOR_g,`_W wW /H _g,`_W wW /H _g,`_W wW /H _g,`_W wW /H _g,`_W wW /H _g,`_W wW /H{ _g,`_W wW /Hq _g,`_W wW /Hg`]!b8]@@lŖ@l HSOR`\H`0H `"O`'OO%`0 O, < # `L_D`nH`fH`aH`\OtOO`bOOOO`tH `nOk`rO|O`vH`tOjOO`xOOHOR "HHH OR_g,`_W wW /_g wgOS_W wW_W_h%_WL H __WL @@lnh`]!b@]@@l3@l! _W wW_g_$@w`]^ *08408 H.__W$@ @liw_w__W_$@@l__Wh _L? H H's 's ___W$@Gs$@,_wHc]wHt_w__h_L H_w__$@wc]wHV__L @@khH_w__$@w_ߠ w`] *08408 H.__ߠ$@ @lw_w___$@@k__߀h _L? H H'g 'g ___ߢ$@Gg$@,_wHc]wH_ߠ wO_ h /_\ \`\ __< _@@ww_w$` @k֐wo_o_w@_o_t`_\ w '_wO_t _\ ph`]!bH]@@k;@k) _,`x__t`__Ht`_o@k@kDDDDDDDD@w_\ `@kt_\ h@kp_\ P@kl_\ @kh0A@db\ww`],*08408 H`]!bP]_``@jޖ_\ @k: A@daww'_$` _$`,0@kw__t`_\ ,0@ @kL`]*08408 H`]!bX]_ ,p< @@j0w'_\,0@H H /H _`\`,0$@ /4 0A@d` ww_ ` $`_  H) _$`_\``,0 @j`]*08408 H`]!b`]@@j:`]!@jԐ w'/_,`_$ ,`,`' '4  H4 ' '4  H4 ' '4  H4 ' '4  H4 ' '4  H4 ' '_$`  < ,@4 _$`_ ,0@j&w__t`_\``,0 @jb@w_\ @j A@ca,ww '_ ?'G瀤 H_\ G,0\@hG_\ G,0\@D (H _\ G,0\@D ('G?O'`]!bh]_,`Gbp]@@@ios_ ?'G〤 Ho_\ G,0\@hc`]!bx]G@@iSG_\ G,0\@D (H`]!b]G_\ G,0\@D ($b]@@@i2 'G_\ G,0\@D (H_\ G,0\@\ Gߡ,0@< `]!@@i]Gߠ O'`]!b]_\ G,0\@D`\`@@hG?O'`]!b]@@h ww_\` D`(,0< @D͒'_ ? @'_  H H'_D '_ < 4@Gϡ4 @,  '_\ ߡ,0\@h'_\ߡ,0\@_@@.*08408 H _\ ߡ,0\@Hw_ ` $`ۢ@_ ? @'O__\ ߧ,0t@w_www_D (_D (H_\ _\` D`(,0@i H_  H _D _D H H/ʠ //4 0ww__t`_ JA@acDww_$ HH_\ w_πh _ D` $`_̐Z Ow!<_$` !#_$`HH)_\ w_ǀh"_w_D _D H_D _$` _D _D H_D _$`_Z Ow_D  H`]!b]@@gْ@gǐ `]  @*08408 HEHHA_\ w_h:_\w_\ wHH)_D 'G H"_L ,08408< H`]!b]_D`\`@@g@g _ wG?O'_:Z Ow`]*08408 H _D`D` H H/ /_,` A@`cww`]ꓒ @*08408@? ` 'G'4 A@`clww`]q *08408 H8_ː',0@gzw_wHH '뀤H _ߥ,p$Ӡ O'HH A'π ZH Ϩ _ߥ,0$Ϡ O'_HwHw_ wwwHH_\ w_׀h_|__ߒ@_Z Owׁ0wHH_\ w_瀤h _X*_cZ Owwww___ߐ@ '_  H H/Ҡ /Ң_D 4 Ґ@`HH'_\ w_h _w_w_@w_h۠ '_w_\ Ow_H'@f4 ~A@_ct ~ww`]p*08408 H_ `]ꎐ@ڊH}_ߐw%`]P*08408 HHH_\ w_h_Z h_횐wHH_Z w_h_퉐w_D _D H_D 'HH@ 'GG?H8_\ GL@/_\ GL@/`] *08408 H AH  ZH / AH  ZH /HHG O'GG?HXHH@G 'wGwGH8_\ GwL@/v_\ GwL@/u`]趒 *08408 Hv AH v ZHv /vu AH u ZHu /uvuHHGw O'wGwGHG@*08408 HG@_Z OLw_Z O.w_D ? H_D ?H'à 'G'ۢˠߐ@h__@s'HHVc?'_HH=G'[G[?H7G[@v*08408 H)Sː@>SG[@ם_S_@D'OO_ H O_H G[ H cS@<O'_G[?O'[_ǀ HH ˠc@*_'OHHp?Ð?';HHWG'7G7?HQG7@*08408 HCG7@*08408 H9 +ː@ڒ +G7@ו_ +_@ܔ '' '; H  ';HG7?H ? +@̒ '';G7?O'7;ǀHH ˠ?@ظ;'OHH  O? 'HHG ' G?H G@֢*08408 H G@֖*08408 HHHG ' G?H G@|*08408 H G@p*08408 H G GHHHG ~' ~G Hw ~G@M*08408 Hc ~ː@ ~ G@̒ ~ G@Ò ~ ~G@\_ ~_@ ~' ~  H ~ H# G?H G?H ~G H  ~@ݒ ~ ' ~G? ~O' G? OP' G? O"' ǀHH @ׯ 'O_ ː@ף`]r*08408 H`]!b]@@c) ~Ϣ_ @ث ~/  ~/HHA ~Ϡٺ ~' ~G?H3 ~ H `]!b]@@b ~G?H  ~/H`]!b] ~G @@bܔ ~/O ~ H ~ H `]!b]@@b`]!b]@@b`]!b]@@b_@c 0w_Yw_`_@'_@b'4 A@\`dwww 'HH 'G_D H_Gˡ,0@H_Gˡ,0@'Gˠ O'`]叒 @*08408@? ` 'Gף4 @'4 A@[cLwwwww`]g *08408 H__ߐ@'ۡ,0@bnw_wHH 'ۀH _ϥ,p$à O'HH_\ w_h_阐w__D @cHHm'G?HeG?H _\`D`?< L,08408'HG_D H _\ GL@,08408'H@b A H  ZH ' a H4 zH0G?H _G,0@'_,0@'?'HH'G H_G,0@H _G,0$@G?O'O_-Z O}w_HwHw_ wwwwHH_\ w_πh____ג@榖_Z Owρww_`_@w_`__@Ɩ '_  H H/Ҡ /Ң_D 4 Ґ@HH'_\ w_h _w_w_@w_h۠ '_w_\ Ow/_$_@aIH'#@aY4 㾐A@Zaw?w_.'_D ,0@aw_wHH 'G_D H _Gǡ,0$@GǠ O'__ߐ@h'뀤H0 'æ_`D`  HH֗'{G{?HH G{?Hà 'Oá,0@`ϐw_w 'wg_`D` HHgo'cGc?HHGc?H w'w 'wGc4 _ϥ,0$@OwÀH@`_D ,0@`w_w_D ,0@`w_wHHU '_?'[HH7 'WWÀH0___D ,0@@`0__W,0@,0_@$__@Β'SS[H ___D ,0@@`S'[W O'W[ӀH___D ,0@@_['H_ O'_뀤O_@`=_@`:`] *08408 HW`]!b]@@_Ē /RHH='KK'K?'Kˀ H2__K,0@,0 H&R H `]!b]@@_`]!b]_K,0@`_ߡ,p@@_ /RO`]!b]@@_y_@_֐__td _\d @_$$(_`\d @+_t$0A@XcĮww_`\d0\d @_`D` Դk_$$8_D`$dP_$$<_  H H/ /__D$P4 @wWHH_\ w_瀤h_w7_7wO__O@&w/_/wGw?_Gh_$ w'א "G뀤 H6_w_ w_L /@ Hހ "Hހ \Hһ \ҸHҴ \ޡ<   0Үޡ<   0Ҩޠ  0ңG?O'ҝ "0A@Gaw'`]>w_瀤ha]@@M֒_@N[@: @a]@Mʐ0A@GaDwww_@N?@?L@ *H a]__@@MH a]__@@M0A@G`wwa]_\ @@M A@G`4wwww`]С *08408 H"a]@Me_\`\ @a]@MZ_\`\ @a]@MO H/Ha]@ME_\`\ @a]@M:_\`\ @ /4  A@FbԮwwww___ߐ@/b]@M`]< *08408 Hb]@Mb]@Lހ H_\`\ @b]@L_\`\ @b ]@LH_\`\ @b(]@LԐ_\`\ @b0]@Lɐ A@Fa<wwww___ߐ@4/b8]@L`]֒ *08408 Hb@]@LbH]@Lހ H_\`\ @bP]@L_\`\ @bX]@L{H_\`\ @b`]@Ln_\`\ @bh]@Lcbp]@L^_\`\ @bx]@LS A@Ecdwwww___ߐ@/b]@L4`]` *08408 Hb]@L$b]@Lހ H_\`\ @b]@L_\`\ @b]@LH_\`\ @b]@K_\`\ @b]@Kb]@K0A@Eaww'b]@KӐb]@KΐG뀤?H b]@KŐHb]G@@K_\$xG,0@ H b]_\$xG,0@@Kb]@K@A@E`ww`] *08408 H b]@KH&`]ί *08408< `]Φ *08408< @`]Μ *08408< @Hb]@K__ p H_ l H_ pܒ _D hH_ p@?@ϒ?Hc]@K9`]e *08408< `]\ *08408< @`]R *08408< @Hc]@Kc]@K`]< *08408 Hc]`]@@Jc ]`]@@J`] *08408 Hc(]H4w`]  *08408 Hc0]H"w`] *08408< `] *08408< @Hc8]Hwc@]w_w_w_@JcH]@J_ pA HdcP]`]\ _D$ @@J 'S 'O_D$'KGK<  .! 'KGK HGO 'OO 'GG_$H,G HcX]@J`Gt` L $@ Hc`]@JPch]GO_\$G,0D@@JCG O'Gcp]@J:_ pؐ H_ l Hc]Hwc]wcx]_@@JH+/_`pD`d~/ '+G+?HG+_D hHh_ l Hc]Hwc]wc]_@@I_ p H!_ ps H_ pk ?H_?c]@Iѐ_ H&G+?H_G+@/'+G+?H c]@IHHOG+?H_ɒ?c]@IH_ l Hc]Hwoc]wo_ l Hc]Hw_c]w_c]_o__@@I{G+?HG+_D dH/j'+G+?HHOG+?HYG+?HUG+'GG+Hc]@IQGG+H c]G@@IEG?O'c]@I<_G+@Y`]@I2/+'+G+?HG+?OG_D hH`]@IG_D hH `]G@@IG?O'`]@IG+?H ` ]@H_?`(]@H`0]@HСA@BaԮww '`]*08408 H`8]Hw`@]w_w`H]_`]\ _D d`]_ߐ@@@H '_\ wǠ '_ǀh_3w`] *08408 H`]˼ *08408 H _\ 0hHG_D 8HM`] ˣ*08408 HA`]˗*08408 H5G_D 8H/GӀ H`P]@HQG'GϠ 'G<``.! L $@ H `X]_ߐ@@H7``]@H1 GӠ O'GӀ H`h]@H$G'GϠ 'G<``.! L $@ H `p]_ߐ@@H `x]_D @@HGӠ '_\ 0h7_\ 0w_h0`]@GG'GϠ 'G<``.! L $@ H `]_ߐ@@GԒ`]_D @@G̒GӠ '_\ 0Ow_hZ Ow`]_ߐ@@G`]*08408 H`]@GA@A`wow`]Ò *08408 H`]ʷ*08408 H`]Hw`]w_w`]_`]˨_@@Ge_\ wϠ '_πh_w`] ʃ*08408 H`]x *08408 H _\ 0hH|`] e*08408 H`]Y*08408 H_D 8'`]_`]RGא@@G_\`D`Ւ`]@G_\ 0h>_\ 0w_h7_D _D H_\ _\`D`@G H Gנ '`]_`]Gא@@FҖ_\`D``]@Fǐ_\ 0OwGנ '_cZ O\w`]_@@F`]_`]\ `]`]ܐ_@@@F_\ wϠ '_πh_!w`] ɵ*08408 H`]ɪ *08408 H _\ 0hHnG׀ H`]@Fc`] Ɏ*08408 H`]ɂ*08408 H_D 8'`]_@@FA_\`D`_\ 0h5_\ 0ww_wh._wD _D H_w\ _\`D`@F HGנ 'a]@Fa]_@@F _w\`D`Ӓ_w\ 0OwwGנ '_ͣZ OjwG׀ Ha]@Ea]_@@Ea ]_`]c]\ `]@@@EИ`]*08408 Ha(]@E A@?aww'w`]ْ *08408 H_ a0]_ߐ@@E`]Ò *08408 Ha8]@E`]Ȳ*08408 Ha@]`]ɯ`]ɩG@@EfH_\`D`*`]Ȋ *08408 H_\ @Eא h aH]_\ @@EDaP]@E?`]j*08408 H aX]_D`8D`<@E)СA@>bw'w`]D *08408 H8`]8*08408 H H'`])*08408@??  'G'Ϥ :GϠ < `]А@Ej@l'G〤 H 'H$`]*08408 H H'`]*08408@?  ` 'G'G' 'ߠ 'GGHGG<`@.! L$@ HG Ha`]@Dah]_@@DH G Hap]@D`]Ǯ *08408 Hax]@Dr`]ǝ*08408 H a]@DaH`]NJ*08408 H a]@DNHa]@DG`]s *08408 Ha]`] @@D0Gߠ 'G Oz'СA@=bww`]D*08408 Ha]Hwa]w_wa]_@@C`]\ _\ (@2a]`]_@@C_\ wϠ '_πh_nw`] *08408 H`] *08408 H _\ 0hHGۀ Ha]@CG_D 8H*`] *08408 H`]*08408 H_D 8Gۢ$@_@la]@C_D 8'G_$`<_G_@Ĕ_\ 0h;_\ 0w_h4G۠ 'G_$`<a]@Ca_D _D H_\ _\`D`@C H_D <H'_D <'G'_G_@_\ 0OwG۠ '_ڐZ OTwGۀ Ha]@C(a]_@@C!pA@<bww`]<*08408 HR?'_D$,p,p@CDw_w_DdDd,  < ,0@C7w_w_D$ '_w__DdDd,  < ,0w__h _?w?_$`O_\ w___h__ZB 8'[__UB <_G[,0$@`]*08408 H`]!a]__:B __6Z __2B <@@@B__(Z 0hQG[_$`__B <_$` _$`__Z 0wO_Oh(_ D` $``]ş*08408 H`]!a]_OD`\`D`<@@BO_O\ 0OwO_D  Ha]b]@@C% H_ w__Z Opw___h_?w`]\*08408 H`]!b]__$@l D`D`D`@@B_D 'KGKG?H_GK,0D@?H _GK < ,0D@?HH)GK O'K_D ?'KGK H_GK,0D@?H _GK < ,0D@?HH GK?O'KG'KG '__D`,0DD`Hb]b]@@B%,H?GK_D `@$__D ,0$@_D ` _D @_GK,0$@_D  _GK < ,0$@Ob!#'!<'_G,0@w__h_?w_D ';GG;HG;'GG;HG;'O`]Ğ*08408 Hb ]Hwb(]w_wb0]_`]\ GG@_@@@AG 'sG'7G7<  .! '7G7 HGs 'sOG H$ '3G '/G/<  .! '/G/ HG3 '3OG3 '3GsG3HG3's *Gs<`@.! 'o 'k '+G+GH6G+ Hb8]@@Gk'Gk 'kGGo<`@.! L$@ H b@]_@@@ҒbH]Gs_G+,0D@@@ƔG+ O'+bP]_@@@_@A_@A 0A@:`ww`] *08408 H#`]Œ *08408 H`]ù*08408 H _D$ H_ސH_ِ0A@9cww`] Ð*08408 HB`]Å *08408 H`]y*08408 H _D$ H_V`]f *08408 H`]Z*08408 H _D$ H_H`]E *08408 H_'__A@9b,ww'w`]*08408 HbX]Gb`]_sB 8_oB _kZ @@@?͚`]*08408 Hj_TZ 0hc`] *08408 Hbh]Gbp]`]ϐ_5B <@@@?bx]Gb]`]è_B <@@@? '_w_πh Gנ '_\ 0Owb]Gb]Gb]@@?^ _$`H`]… *08408 Hb]Gb]_ڐB Gb]@@@?8G 'b]Gb]@@?*`]V *08408 Hb]`]3_ƩB <@@?H _ƟZ _ƛB @͒b]@>b]Gb]@@>`] *08408 HG?'b]Gb]@@>ؔH _$`_vZ w_СA@8aLww'''''`]*08408 Hb]Gc]GGG@@@>G뀤 HG<` @< 'GGǠ$@'G'G'G'Hc] HH'G'GG$@'_wG'G H _ Z wG?O'c]Gc]_B 8Gc]@@@>K_GGG_ڐB 8?G۠ @@wc ]Gc(]c0]c8]@@>$s_GGŵ@B 8GG۠ @@Rc@]GcH]@@> H_ŚB 8'G瀤 H[ 'GGHcP]cX]@@>Ŕ%HGG߀Hc`]ch]@@>%HGG߀H _G۠@ԔH'cp]Gcx]Gc]@@=_Gۤ @c]Gc]@@=HjG Hc]Gc]@@=Hc]Gc]G@@=c]Gc]@@=|G瀤 H2 'c]Gc]_B 8G$@@@=d_Gۤ @bwG H c]Gc]@@=LG?O'c]Gc]@@==A@6c www`]`]0@@= `] K*08408 HY_G'`]'GGÀHG'`]@<`])*08408 HH_D$ HC`] *08408 H`]c]\ _D d@@<Ҕ`]@<͐`]\ _\ (@` ]@<`(]@<`]\ _\ (@`0]@<`]ؒ *08408 H`8]@<`]\ _\ @Ӓ`@]@<H `H]_\ @@<_\`GGDdDd@ `P]@_w_w_\ 0w_\ @-_\ c]h_\ @-_\ _g h_\ _o h_\ @-_@-_w_o_w_\ Ow_OW@GH '٢W@@-tG< @w_0A@&aww_Xcx]_t`H_h@-D0w'_АG렌 H_@-0w'_J H_JG@HH wJ O A@&`wwbP]B bX]B `]B  HB@H?'& H@ H_@: *0[ &': *0Z`s r`OH' H_@: *0@Z: *0@Z`rr`O@ H@ObP]B `]B bX]B "@bP]" `]B bX]"  A@%bw'ww`]D bX]$`bP]$`bh]t b`]@,bp]t _M -H  bx]$` Hw瀤+H  bx]$` Hwbp]\ h bx]H$` bx]$`_w߰СA@%a<w'wwww'cX]t `]D H c]D H`]D H `]$`G_z_w c]$`bh]\ h bh]\ L HRbX]D `]D H `]D bX]$`bP]D `]D H `]D bP]$`bx]D H_bP]D bX]D HbX]D `]D H_HbX]D `]D H `]D bP]$`H `]D  `]$``]D GH_`]D ,0\@L -O`]D ,0\@L  O`]D bX]$``]D GHP_`]D ,0\@b]@+HA`]D  `]$`bP]D bX]D HbX]D `]D H'_HbP]D bX]D H `]D bP]$`GbX]$``]$``]D GHbP]D bX]D H bP]D `]$`H?_`]D ,0]L -H `]D ,0]L  Hbx]D HHҪ?`]D 'Gˠ`]$`_,\@cX]t`H _߀h`]D ,0]L  -H H'ˠ '_`]D ,0\@Gˠ@ bh]t`_߀h _`]D ,0\@L  -HGӀH`]D ,0\@L H_`]D ,0\@SL hw ' '?'bh]\ w_L H =H _Ǡ wL H =O_w '\`h=_\ bh]\ _bh]\ @*ɔ$@H"_bh]\ $@< _@*L\ 2 H _wG' H'_h_wGH' '_ wG' '\`oGH<GH8c@]D H`]!b]_\``]D ,0@)|\@bh]\ bh]@*\ : @bh]t``]D  `]$` cp]$`Hժ ?_hG'`]D  `]$`_LHXE HcX]HLt`c@]D H._`]D $ < ,0\L  -H`]!b]\@)!] H`]!b]\`]D $ < ,0\L @) ] bh]\ bh]@)\ : @bh]t`_D cp]$`Hm ?HYE  HU`]D GH`]D 'G`]$`_,\@cX]H:t`c@]D H`]!b]_\``]D $ < ,0@(\@bh]\ bh]@)B\ : @bh]t`_D cp]$`_L $ :@??  ?H'bh]\ bh]@)#\ : @bh]t`_׀@hG$`_\`hD`$H HD`GӀH_`]D ,0\@L  -H _bh]\ L hNc@]D H0_`]D ,0\@L  -H`]!b]\`bh]@(D\ H`]!b]\``]D ,0\@L bh]@(.\ b]bh]t``]D  `]$` cp]$`H ?bh]\ w_bh]t`L/_[Owbh]\ L H `]D  `]$`_hO΀ :H/c@]D H!bp]\ h`]!b]_\ @'OH `]!b]_\ @'OOcp]$`H8 ?L WHL ;Hw ' ' 'bh]\ L Hbh]\ cX]t``]D  `]H?$``]D GH%c@]D H `]!b]_\ @'}Ocp]$`_L :H :H/Π ?/HO`]D 'G`]$`_,\@cX]t`cX]\ w_bh]t`L H =H _ wL H =O_w '\`h=_\ bh]\ _bh]\ @(*$@H"_bh]\ $@< _@'\ 2 H _wG' H'_h_wGH' '_ wG' '\`oGH7GH3c@]D H`]!b]_\``]D ,0@&\@bh]\ bh]@'d\ : @bh]t``]D  `]$`H; ?_hG'_LH1E HcX]H%t`c@]D H `]!b]_\ @&] bh]\ bh]@'#\ : @bh]t`H ?HSE  HO`]D GH`]D 'G`]$`_,\@cX]H4t`c@]D H`]!b]_\``]D $ < ,0@&Q\@bh]\ bh]@&\ : @bh]t`_L $ :@??  ?H'bh]\ bh]@&\ : @bh]t`_׀@hG$`_\`hD`$H HD`bh]t H W_L` :HL` :H%bh]\ L Hbh]\ cX]t``]D  `]H$`cX]t bh]H]t bh]\ L Hbh]\ cX]t``]D  `]H?$``]D GH%c@]D H `]!b]_\ @%OOcp]$`_L :H :H/Π ?/H`]D 'G`]$`_,\@cX]t`bh]t Oα=`0'wwG__ '< <  'wwwwG____ 'ӱ< <  'wwwwG____ 'ӱ< < A@cwowww/w_h _瀤h_߀h?H'_\ h  @_t`_\ @%Xw__t`_\ _Ϡ$@w_\ _Ϡ@w_@%'_\ _Ǧ$@__\ $@hb]b]@@% @H_ǀ hT_\ @h_\`,0t`H_\` @t`_\ _\ @_$@w_\ @%ww_ww_\ h__\ _$@@$_\ @% __t`_\ _\ _Ǡ$@w_\ _Ǧ$@__\ $@hb]c]@@%k QHG?H_@% H__\ h?H$'HH_w_ wG_,`_Ǡ?wGOހHHOf _,`__\ _Ϡ@$'G< 0www___ߐ@ 'G<  ww'w___G@'G<  w' '뀤 H _w_ w, _ @'!< @'〤 H4'?O''4 P@P@[$Z?P@[$Z?[hZ?Z?Z?Z?Z?Z? @@@ @@@*P@[[Z?Z Z]]]耤 p|Th8tD, ( X HD 4t   8lHD4 #H1x@<`dPLLdhP T x PLltd p$ 8 x\< \ $XL$ΐXΌ4t0Positions::add internal error: overflow Positions::add internal error: duplicate Positions::remove internal error: not found *,%d-%d,$Try '%s --help' for more information. GNU 'gperf' generates perfect hash functions. Usage: %s [OPTION]... [INPUT-FILE] If a long option shows an argument as mandatory, then it is mandatory for the equivalent short option also. Output file location: --output-file=FILE Write output to specified file. The results are written to standard output if no output file is specified or if it is -. Input file interpretation: -e, --delimiters=DELIMITER-LIST Allow user to provide a string containing delimiters used to separate keywords from their attributes. Default is ",". -t, --struct-type Allows the user to include a structured type declaration for generated code. Any text before %%%% is considered part of the type declaration. Key words and additional fields may follow this, one group of fields per line. --ignore-case Consider upper and lower case ASCII characters as equivalent. Note that locale dependent case mappings are ignored. Language for the output code: -L, --language=LANGUAGE-NAME Generates code in the specified language. Languages handled are currently C++, ANSI-C, C, and KR-C. The default is C. Details in the output code: -K, --slot-name=NAME Select name of the keyword component in the keyword structure. -F, --initializer-suffix=INITIALIZERS Initializers for additional components in the keyword structure. -H, --hash-function-name=NAME Specify name of generated hash function. Default is 'hash'. -N, --lookup-function-name=NAME Specify name of generated lookup function. Default name is 'in_word_set'. -Z, --class-name=NAME Specify name of generated C++ class. Default name is 'Perfect_Hash'. -7, --seven-bit Assume 7-bit characters. -l, --compare-lengths Compare key lengths before trying a string comparison. This is necessary if the keywords contain NUL bytes. It also helps cut down on the number of string comparisons made during the lookup. -c, --compare-strncmp Generate comparison code using strncmp rather than strcmp. -C, --readonly-tables Make the contents of generated lookup tables constant, i.e., readonly. -E, --enum Define constant values using an enum local to the lookup function rather than with defines. -I, --includes Include the necessary system include file at the beginning of the code. -G, --global-table Generate the static table of keywords as a static global variable, rather than hiding it inside of the lookup function (which is the default behavior). -P, --pic Optimize the generated table for inclusion in shared libraries. This reduces the startup time of programs using a shared library containing the generated code. -Q, --string-pool-name=NAME Specify name of string pool generated by option --pic. Default name is 'stringpool'. --null-strings Use NULL strings instead of empty strings for empty keyword table entries. -W, --word-array-name=NAME Specify name of word list array. Default name is 'wordlist'. --length-table-name=NAME Specify name of length table array. Default name is 'lengthtable'. -S, --switch=COUNT Causes the generated C code to use a switch statement scheme, rather than an array lookup table. This can lead to a reduction in both time and space requirements for some keyfiles. The COUNT argument determines how many switch statements are generated. A value of 1 generates 1 switch containing all the elements, a value of 2 generates 2 tables with 1/2 the elements in each table, etc. If COUNT is very large, say 1000000, the generated C code does a binary search. -T, --omit-struct-type Prevents the transfer of the type declaration to the output file. Use this option if the type is already defined elsewhere. Algorithm employed by gperf: -k, --key-positions=KEYS Select the key positions used in the hash function. The allowable choices range between 1-%d, inclusive. The positions are separated by commas, ranges may be used, and key positions may occur in any order. Also, the meta-character '*' causes the generated hash function to consider ALL key positions, and $ indicates the "final character" of a key, e.g., $,1,2,4,6-10. -D, --duplicates Handle keywords that hash to duplicate values. This is useful for certain highly redundant keyword sets. -m, --multiple-iterations=ITERATIONS Perform multiple choices of the -i and -j values, and choose the best results. This increases the running time by a factor of ITERATIONS but does a good job minimizing the generated table size. -i, --initial-asso=N Provide an initial value for the associate values array. Default is 0. Setting this value larger helps inflate the size of the final table. -j, --jump=JUMP-VALUE Affects the "jump value", i.e., how far to advance the associated character value upon collisions. Must be an odd number, default is %d. -n, --no-strlen Do not include the length of the keyword when computing the hash function. -r, --random Utilizes randomness to initialize the associated values table. -s, --size-multiple=N Affects the size of the generated hash table. The numeric argument N indicates "how many times larger or smaller" the associated value range should be, in relationship to the number of keys, e.g. a value of 3 means "allow the maximum associated value to be about 3 times larger than the number of input keys". Conversely, a value of 1/3 means "make the maximum associated value about 3 times smaller than the number of input keys". A larger table should decrease the time required for an unsuccessful search, at the expense of extra table space. Default value is 1. Informative output: -h, --help Print this message. -v, --version Print the gperf version number. -d, --debug Enables the debugging option (produces verbose output to the standard error). Report bugs to . /* Command-line: !"#$&'()*;<>?[\]`{|}~%s */? dumping Options: TYPE is........: %s UPPERLOWER is..: %s KRC is.........: %s C is...........: %s ANSIC is.......: %s CPLUSPLUS is...: %s SEVENBIT is....: %s LENTABLE is....: %s COMP is........: %s CONST is.......: %s ENUM is........: %s INCLUDE is.....: %s GLOBAL is......: %s NULLSTRINGS is.: %s SHAREDLIB is...: %s SWITCH is......: %s NOTYPE is......: %s DUP is.........: %s NOLENGTH is....: %s RANDOM is......: %s DEBUG is.......: %s lookup function name = %s hash function name = %s word list name = %s length table name = %s string pool name = %s slot name = %s initializer suffix = %s asso_values iterations = %d jump value = %d hash table size multiplier = %g initial associated value = %d delimiters = %s number of switch statements = %d enableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledenableddisabledall characters are used in the hash function maximum keysig size = %d key positions are: $ %d finished dumping Options KR-CCANSI-CC++unsupported language option %s, defaulting to C acCdDe:Ef:F:gGhH:i:Ij:k:K:lL:m:nN:oOpPQ:rs:S:tTvW:Z:7Starting program %s, version %s, with debugging on. Initial value %d should be non-zero, ignoring and continuing. warning, -r option superceeds -i, ignoring -i option and continuing Jump value %d must be a positive number. Jump value %d should be odd, adding 1 and continuing... Invalid position value or range, use 1,2,3-%d,'$' or '*'. Duplicate key positions selected No key positions selected. Duplicate key positions selected asso_iterations value must not be negative, assuming 0 warning, -r option supersedes -i, disabling -i option and continuing Invalid value for option -s. Size multiple %g is excessive, did you really mean this?! (try '%s --help' for help) Size multiple %g is extremely small, did you really mean this?! (try '%s --help' for help) number of switches %s must be a positive number GNU gperf %s Copyright (C) %s Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. 1989-1998, 2000-2004, 2006-2009Written by %s and %s. Douglas C. SchmidtBruno HaibleExtra trailing arguments to %s. BH<# 00@8f| G^{Keyword_Factory@8f| G^{0@8f| G^{Keyword_Factory*0@8f| G^{const Keyword_Factory*(standard input)%s:%u: junk after declaration %s:%u: missing argument in %%%s=ARG declaration. %s:%u: junk after declaration define%s:%u: missing argument in %%define %s ARG declaration. %s:%u: junk after declaration %s: error while reading input file %s: The input file is empty! %s:%u: warning: junk after %%%% is ignored %s:%u: %s:%u: only one %%{...%%} section is allowed %s:%u: %%} outside of %%{...%%} section %s:%u: %%{...%%} section already closed %s:%u: warning: junk after %%} is ignored %s:%u: warning: %% directives are ignored inside the %%{...%%} section delimitersstruct-typeignore-caselanguageslot-nameinitializer-suffixhash-function-namelookup-function-nameclass-name7bitcompare-lengthscompare-strncmpreadonly-tablesenumincludesglobal-tablepicstring-pool-namenull-stringsword-array-namelength-table-nameswitch%s:%u: number of switches %s must be a positive number omit-struct-type%s:%u: unrecognized %% directive %s:%u: unterminated %%{ section %s: missing struct declaration for option --struct-type %s:%u: declarations are not allowed in the keywords section. To declare a keyword starting with %%, enclose it in double-quotes. %s:%u: unterminated string %s:%u: octal escape out of range %s:%u: hexadecimal escape without any hex digits %s:%u: hexadecimal escape out of range %s:%u: invalid escape sequence in string %s:%u: string not followed by delimiter %s: No keywords in input file! dumping boolean array information size = %d iteration number = %d end of array dump bool array size = %d, total bytes = %d (re-initialized bool_array) dumping the hash table total available table slots = %d, total bytes = %d, total collisions = %d location, %*s, keyword keysig%8d, %*s, %.*s end dumping hash table Empty input keyword is not allowed. To recognize an empty input keyword, your code should check for len == 0 before calling the gperf generated lookup function. Option --seven-bit has been specified, but keyword "%.*s" contains non-ASCII characters. Try removing option --seven-bit. Computed positions: , %d, $ Computed alpha increments: , %u:+%u Key link: "%.*s" = "%.*s", with key set "". %d input keys have identical hash values, examine output carefully... %d input keys have identical hash values, try different key positions or use option -D. use option -D. total non-linked keys = %d maximum associated value is %d maximum size of generated hash table is %d dumping the keyword list without duplicates keyword #, %*s, keyword keysig%9d, %*s, %.*s end of keyword list Step %u chooses _asso_values[,'%c'], expected number of iterations between %g and %g. Keyword equivalence classes: %.*s Step %u chose _asso_values[,'%c'] in %u iterations. Internal error, unexpected duplicate hash code try options -m or -r, or use new key positions. try options -m or -r. dumping occurrence and associated values tables asso_values[%c] = %6d, occurrences[%c] = %6d end table dumping Dumping key list information: total non-static linked keywords = %d total keywords = %d total duplicates = %d maximum key length = %d List contents are: (hash value, key length, index, %*s, keyword): selchars%11d,%11d,%6d, %*s, %.*s End dumping list. unsigned charunsigned shortunsigned intsigned charshortint #define %s %d %senum %s { , %s %s = %d %s }; TOTAL_KEYWORDSMIN_WORD_LENGTHMAX_WORD_LENGTHMIN_HASH_VALUEMAX_HASH_VALUE#ifndef GPERF_DOWNCASE #define GPERF_DOWNCASE 1 static unsigned char gperf_downcase[256] = { %3d, }; #endif #ifndef GPERF_CASE_STRCMP #define GPERF_CASE_STRCMP 1 static int gperf_case_strcmp (s1, s2) register char *s1; register char *s2; (s1, s2) register const char *s1; register const char *s2; (register const char *s1, register const char *s2) { for (;;) { unsigned char c1 = gperf_downcase[(unsigned char)*s1++]; unsigned char c2 = gperf_downcase[(unsigned char)*s2++]; if (c1 != 0 && c1 == c2) continue; return (int)c1 - (int)c2; } } #endif #ifndef GPERF_CASE_STRNCMP #define GPERF_CASE_STRNCMP 1 static int gperf_case_strncmp (s1, s2, n) register char *s1; register char *s2; register unsigned int n; (s1, s2, n) register const char *s1; register const char *s2; register unsigned int n; (register const char *s1, register const char *s2, register unsigned int n) { for (; n > 0;) { unsigned char c1 = gperf_downcase[(unsigned char)*s1++]; unsigned char c2 = gperf_downcase[(unsigned char)*s2++]; if (c1 != 0 && c1 == c2) { n--; continue; } return (int)c1 - (int)c2; } return 0; } #endif #ifndef GPERF_CASE_MEMCMP #define GPERF_CASE_MEMCMP 1 static int gperf_case_memcmp (s1, s2, n) register char *s1; register char *s2; register unsigned int n; (s1, s2, n) register const char *s1; register const char *s2; register unsigned int n; (register const char *s1, register const char *s2, register unsigned int n) { for (; n > 0;) { unsigned char c1 = gperf_downcase[(unsigned char)*s1++]; unsigned char c2 = gperf_downcase[(unsigned char)*s2++]; if (c1 == c2) { n--; continue; } return (int)c1 - (int)c2; } return 0; } #endif #line %u %s %s%s%s %s(((unsigned char)* ^ (unsigned char)*) & ~32) == 0* == * && !gperf_case_strcmp ( + 1, + 1, ) && !gperf_case_strncmp ( + 1, + 1, len - 1, , len) && [len] == '\0' && !gperf_case_memcmp ( + 1, + 1, len - 1, , len)asso_values[(unsigned char)str[len - 1]str[%d]+%u]inline #ifdef __GNUC__ __inline #else #ifdef __cplusplus inline #endif #endif /*ARGSUSED*/ static unsigned int %s::%s (str, len) register char *str; register unsigned int len; (str, len) register const char *str; register unsigned int len; (register const char *str, register unsigned int len) { static %s%s asso_values[] = {, %*d }; return %s; len0 return %slen + + + ; register int hval = %s; switch (%s) { default: len0hvallen /*FALLTHROUGH*/ case %d: hval += ; /*FALLTHROUGH*/ case %d: break; } return hval + ; } %sstatic %s%s %s[] = %s {, %s %3d, %s %3d, %s %3d %s }; %sstruct %s_t %s { %s char %s_str%d[sizeof()]; %s char %s_str%d[sizeof()]; %s }; %sstatic %sstruct %s_t %s_contents = %s { , %s , %s %s }; %s#define %s ((%schar *) &%s_contents) %s {(int)(long)&((struct %s_t *)0)->%s_str%d,%s} /* hash value = %d, index = %d */, %s , {-1(char*)0""%s} %sstatic %s[] = %s { , , , %s }; keyword = %.*s, index = %d static linked keyword = %.*s, index = %d dup_ptr->count >= 2./output.ccdup_ptr[%d]: hash_value = %d, index = %d, count = %d lookup_array[dup_ptr->hash_value] == dup_ptr->index./output.cc %sstatic %s%s lookup[] = %s {, %s %*d %s }; %*s/* hash value = %4d, keyword = "%.*s" */ %*slengthptr = &%s[%d]; %*swordptr = &%s[%d]; %*swordendptr = wordptr + %d; %*sgoto multicompare; %*sif (len == %d) %*s { %*sresword = &%s[%d]; %*sgoto compare; %*s } %*s/* know %d <= key <= %d, contains %d cases */ %*sif (key < %d) %*s { %*s } %*selse %*s { %*s } min_hash_value <= lowest_case_value./output.cclowest_case_value <= max_hash_value./output.cc%*sif (key == %d) %*s { %*s } %*sswitch (key) %*sswitch (key - %d) %*s { %*s case %d: %*s break; %*s } ? if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH) { register int key = %s (str, len); if (key <= MAX_HASH_VALUE && key >= MIN_HASH_VALUE) { register %s%s *lengthptr; register *wordptr; register *wordendptr; register *resword; register %sresword; return 0; %*smulticompare: %*s while (wordptr < wordendptr) %*s { %*s if (len == *lengthptr) %*s { %*s register %schar *s = wordptr->%s*wordptr + %s; %*s if (strs) %*s return %s; wordptrs%*s } %*s lengthptr++; %*s wordptr++; %*s } %*s return 0; compare: { register %schar *s = resword->%s + %s; if (strs) return resword; } if (strresword) return resword; } if (key <= MAX_HASH_VALUE && key >= 0) %*s{ %*s register int index = lookup[key]; %*s if (index >= 0) %*s { %*s if (len == %s[index]) %*s { %*s register %schar *s = %s[index].%s + %s; %*s if (strs) %*s return &%s[index]s; %*s } %*s } %*s else if (index < -TOTAL_KEYWORDS) %*s { %*s register int offset = - 1 - TOTAL_KEYWORDS - index; %*s register %s%s *lengthptr = &%s[TOTAL_KEYWORDS + lookup[offset]]; %*s register *wordptr = &%s[TOTAL_KEYWORDS + lookup[offset]]; %*s register *wordendptr = wordptr + -lookup[offset + 1]; %*s while (wordptr < wordendptr) %*s { %*s if (len == *lengthptr) %*s { %*s register %schar *s = wordptr->%s*wordptr + %s; %*s if (strs) %*s return %s; wordptrs%*s } %*s lengthptr++; %*s wordptr++; %*s } %*s } %*s} %*sif (len == %s[key]) %*s{ %*s register int o = %s[key].%s; %*s if (o >= 0) %*s { %*s register %schar *s = o%*s{ %*s register %schar *s = %s[key].%s + %s%*s{ %*s register %schar *s = %s[key].%s; %*s if (s && strs) %*s return &%s[key]s; %*s } %*s} } return 0; #ifdef __GNUC__ __inline #if defined __GNUC_STDC_INLINE__ || defined __GNUC_GNU_INLINE__ __attribute__ ((__gnu_inline__)) #endif #endif %s%s %s::%s (str, len) register char *str; register unsigned int len; (str, len) register const char *str; register unsigned int len; (register const char *str, register unsigned int len) { } const const const const char *char *const char *char *int/* KR-CCANSI-CC++ code produced by gperf version %s */ /* Computed positions: -k'' */ #if !((' ' == 32) && ('!' == 33) && ('"' == 34) && ('#' == 35) \ && ('%%' == 37) && ('&' == 38) && ('\'' == 39) && ('(' == 40) \ && (')' == 41) && ('*' == 42) && ('+' == 43) && (',' == 44) \ && ('-' == 45) && ('.' == 46) && ('/' == 47) && ('0' == 48) \ && ('1' == 49) && ('2' == 50) && ('3' == 51) && ('4' == 52) \ && ('5' == 53) && ('6' == 54) && ('7' == 55) && ('8' == 56) \ && ('9' == 57) && (':' == 58) && (';' == 59) && ('<' == 60) \ && ('=' == 61) && ('>' == 62) && ('?' == 63) && ('A' == 65) \ && ('B' == 66) && ('C' == 67) && ('D' == 68) && ('E' == 69) \ && ('F' == 70) && ('G' == 71) && ('H' == 72) && ('I' == 73) \ && ('J' == 74) && ('K' == 75) && ('L' == 76) && ('M' == 77) \ && ('N' == 78) && ('O' == 79) && ('P' == 80) && ('Q' == 81) \ && ('R' == 82) && ('S' == 83) && ('T' == 84) && ('U' == 85) \ && ('V' == 86) && ('W' == 87) && ('X' == 88) && ('Y' == 89) \ && ('Z' == 90) && ('[' == 91) && ('\\' == 92) && (']' == 93) \ && ('^' == 94) && ('_' == 95) && ('a' == 97) && ('b' == 98) \ && ('c' == 99) && ('d' == 100) && ('e' == 101) && ('f' == 102) \ && ('g' == 103) && ('h' == 104) && ('i' == 105) && ('j' == 106) \ && ('k' == 107) && ('l' == 108) && ('m' == 109) && ('n' == 110) \ && ('o' == 111) && ('p' == 112) && ('q' == 113) && ('r' == 114) \ && ('s' == 115) && ('t' == 116) && ('u' == 117) && ('v' == 118) \ && ('w' == 119) && ('x' == 120) && ('y' == 121) && ('z' == 122) \ && ('{' == 123) && ('|' == 124) && ('}' == 125) && ('~' == 126)) /* The character set is not based on ISO-646. */ %s "gperf generated tables don't work with this execution character set. Please report a bug to ." error#error#endif %s #include /* maximum key range = %d, duplicates = %d */ class %s { private: static inline unsigned int %s (const char *str, unsigned int len); public: static %s%s%s (const char *str, unsigned int len); }; 00=O6(;E些>Output_DefinesϮ''FӜzju“=O6(;E些>0=O6(;E些>Output_Defines*0=O6(;E些>const Output_Defines*00GBAk%C1Output_EnumϮ''FӜzju“GBAk%C10GBAk%C1Output_Enum*0GBAk%C1const Output_Enum*00#ga&)w86Output_Expr1Ɓ#ga&)w860#ga&)w86Output_Expr1*0#ga&)w86const Output_Expr1*08mu:ZF.@6Output_Compare_Strcmpc`JWmu:ZF.@60mu:ZF.@6Output_Compare_Strcmp*0xmu:ZF.@6const Output_Compare_Strcmp*08X + $,:h*AOutput_Compare_Strncmpc`JWX + $,:h*A0X + $,:h*AOutput_Compare_Strncmp*0xX + $,:h*Aconst Output_Compare_Strncmp*08 יX g%Output_Compare_Memcmpc`JW יX g%0 יX g%Output_Compare_Memcmp*0x יX g%const Output_Compare_Memcmp*Ϯ''FӜzju“Ɓc`JWOutput_ConstantsϮ''FӜzju“Output_ExprƁOutput_Comparec`JWrCannot open input file '%s' -wCannot open output file '%s' error while writing output file 08F@D쌶KeywordExt_Factory@8f| G^{F@D쌶ր0F@D쌶KeywordExt_Factory*0xF@D쌶const KeywordExt_Factory**n - nchars_avail == (size_t) (read_pos - *lineptr)./getline.cc*n - nchars_avail == (size_t) (read_pos - *lineptr)./getline.cc3.0.4in_word_setnamePerfect_Hashhashwordlistlengthtablestringpool,output-fileignore-casedelimitersstruct-typelanguageslot-nameinitializer-suffixhash-fn-namehash-function-namelookup-fn-namelookup-function-nameclass-nameseven-bitcompare-strncmpreadonly-tablesenumincludesglobal-tableword-array-namelength-table-nameswitchomit-struct-typekey-positionscompare-strlencompare-lengthsduplicatesfastinitial-assojumpmultiple-iterationsno-strlenoccurrence-sortoptimized-collision-resolutionpicstring-pool-namenull-stringsrandomsize-multiplehelpversiondebugPOSIXLY_CORRECT--%s: option `%s' is ambiguous %s: option `--%s' doesn't allow an argument %s: option `%c%s' doesn't allow an argument %s: option `%s' requires an argument %s: unrecognized option `--%s' %s: unrecognized option `%c%s' %s: illegal option -- %c %s: invalid option -- %c %s: option requires an argument -- %c %s: option `-W %s' is ambiguous %s: option `-W %s' doesn't allow an argument (t+Z\BLwS\ !Y!"d"%&&&))++,-3-11 22202B2[2^2`2d2h5T5\5e5m5v5~5555555555555556666 6(61696B6J6S6[6d6l6u6}66666666777767;7=7D7H7y778#8h8899(9D9f99::X:::;< <"<5>7>[ >y>>??,?W????????@@@ @0@@@P@U@^@k@o@@@@@@@A!ABA{ABB;BmBBBCC^CCDD%D+D/D0D8DRDEoEEEEEEEEEEEEF0F[FFGG.GGGNGTGXGYGaGxGGGGGGGGHHHC@H4HeHHHII"IIIJJ J JJ(J6JEJRJ^JdJhJjJyJJJJJJJJJJKOKTKYK[KjKKL>LrLsM^MgMNNNNOOPMPQQ\Q]RtR}RRRRRRRRRRRRRRRRSSSSS$S2S5S;SASOSUSaSjSqSSSSSSSSSSSTT T(T6T;T?TTUUU U.U0U7U;UDURUVUXUdUkUlUpUtUwUUUUUUUUVVV'VJVNVQVUVVVYVtVvV}VVVVVVVVVVVVVVVWW W5W8W?WBWIWKWSW{W}WWWWWWWWWWWWWWWWXXXXXX!X*XFXpXXXXYYY Y)Y+Y2Y6Y@YmYnYYYYYYYYYYZZZ Z ZZ Z(Z)Z[Z\ZuZvZwZZZZZZZZZZ[[[[[[0[1[G[H[P[Q[b[c[t[u[}[[[\5\Z\n\y\\\\\\]-].]/]0]^]_]`]]]]]]]]]]]]]]]]]^+^,^-^.^@^y^^^^^^^^__ _9_|_}_~_____________``` `"`.`/`9`:``````a a a=aPaQaaaaaaabbbb'b-bBbCbGbIbfbgbobqbbbbbbbbbbbbccccc8c9c:cVcWc~ccccccccccccccccccccdddddddde>eueveye|eeeeeeeeeeeeeeeeeeeffff%f'lm mmm!m%m:m;mku0u2uOuQuSuqyyyyyzz@z`zzzzz{vvvw00x`PpX`h0o0o0o0o0o 0o@0o`0o0o0o0o0o0o 0o@0ow`0oo0og0o_0oW0oO0oG 0o?@0o7`0o/0o'0o0o0o0o 0o@0o`0o0o0o0o0o0o 0o@0o`0o0o0o0o0o0o)))) X h))x- *W o&oWo8XXh ooh @`ji0v@  w(w.w:w?w@wMwRw[wgwrwtwwewtwLwKwFwHwHwNwNx Zx7x"cx2CxBExGIxPGx]WxmxSxTxkxlxlxDxfxixjxmxnyoyOy3Py7QyHyUry\syjhyovywd D J Upc4s 'y +/ Z \$  m   : BZ    [       r L  w x  3 $ n Sz! ' \- 3 9  ? !Y~E !K "dQ "W %] &c &i &Uo )u )N{ + + ,~ -3r -c 1 1  2 2) 20 2B 2[ 2^ 2` 2d 2h 5T 5\  5e 5m  5v 5~  5 5  5 5  5  5 & 5, 5 2 58 5 > 5D 5 J 5P 5 V 5\ 6 c 6j 6 q 6 x 6(  61 69  6B 6J  6S 6[  6d 6l  6u 6}  6 6  6 6  6 6  6. 6. 7 7  7 76 7;  7=' 7D. 7H15 7y6< 75C 7?J 8#EQ 8h*X 89_ 8;f 9"m 9(t 9D"{ 9f8 9F 9 :V :X\ :1 : : ;  <  <" <5   =hPD =2 =s =y =9 > >7$ >[  >y, >5 >) ?) ?,+ ?WH ?  ?  ?  ?  ?  ? ? ? @  @ @  @0  @@ @P @U  @^ ! @k' @o- @ 3 @9 @? @E @8K @Q @"W A!!] AB9c A{i Ao B"u B;2{ Bm( B* B) B .p C< CV C^) CA( C Cz  D& D%, D+2 D/8 D0> D8Op DR9 DR? D{E EoK EQ EW E] Ec Ei Eo Eu E{ E E* E EG F0+ F[/ F Ff G. G. GG GN GT GXY GY Ga_Ku'PX Gx G G G5 G G G G G  H& H, HC@D2 H418 He2> HD H2J H.P IV I"\ IDc I j Iq Jx J  J  J0 J(& J(, J62 JE M8 JR > J^D JdNH y Jh Jj Jy J J J J  J J J J J J_ KO KT KY K[#VX( KjT K: KF L>4 Lr Ls  M^ EWp MgW M[ Ng! NM' N- N"3 O hY p9 OT? PM[E PgK QMQ Q\W Q]] Rt Zp\0c R} i R]Po Ru R^ R R R R R R R R  R  RY R R R S S  S  S S$ S2 S5 S; SA& SO, SU 2 Sa 8 Sj> SqD SJ SP SV S \ Sc S j Sq Sx S S SH T T  T( T6 T; T?E TK T7 U U U $ U. U0 U7 U;  UD UR UV  UX  Ud Uk  Ul' Up. Ut  Uw? U U! U( U/ U6 U= UD UK VR VY V'#` VJg VNn VQu VU| VV VY Vt Vv V} V V V V V V V  V V V V V V V  V  W  W ,  W5  W8 $ W?5 WB< WIC WKJ WS(Q W{X W}_ Wf W)m Wt W{ W# +~0< W W W W W W  W W \ W W W  X  X  X  X  X  X!  X*  XF*  Xp  X  X6  X4  X  Y  Y  Y   Y)  Y+  Y2  Y6  Y@-  Ym  Yn " Y ) Y 0 Y 7 Y5 > Y E Y L Y S Y Z Y a Y h Z o Z v Z  } Z   Z  Z   Z(   Z)2  Z[  Z\  Zu  Zv  Zw  Z  Z  Z  Z  Z  Z$  Z ' Z$ . Z 5 Z < [ C [ J [ Q [ X [ _ [0 f [1 m [G t [H { [P  [Q  [b  [c  [t  [u  [} $ [  [h  [E  \5%  \Z  \n  \y  \  \  \  \ $ \ + \= 2 ]- 9 ]. @ ]/ G ]0. N ]^ U ]_ \ ]` c ] j ] q ] x ]  ]  ]  ]  ]  ]  ]  ]  ]  ]  ]  ]  ]  ]-  ^+  ^,  ^-  ^.  ^@9  ^y  ^  ^  ^  ^-  ^ ' ^ . ^ 5 ^ < _ C _ . J _9C Q _| X _} _ _~ f _) m _ t _ { _1  _  _  _  _  _  _  _  _  _  `  `  `   `"  `.  `/  `9  `:n  ` ` ` `K ` `# a * a 21 a=8 aP? aQ/F a4M aT a[ a6b ai ap a#w b~ b  b  b' b- bB bC bG bI bf bg bo bq b b b b/ b b b b  b b b b#& c- c4 c; cB c8I c9P c:W cV^ cW'e c~l cs cz c c' c c c c  c c c c c c c  c c c  c c d d d  d d d" dE) dK0 e>77 eu> evE eyL e|S eZ ea eh eo ev e} e e e  e e  e e e e e e e e' f f f f% f'i l{ m   m m  m! m%% m:, m;03 mk:p<L<^ <px<<6(<π<<0< u0s u0y u2 uO uQ uS uq!``(6< p0h"/;D yIRbkP~ y y  y0 y0 z( z@  z`  z z  z  z( z( {.p pp v v4 v  v4 w 0|p p&H2 h=XG\(0w {X"`e$S5DYe\rz (_D@L3BLop`DXT& ^p$!! t0<pE@` h`8(0$40(p|Y o0X$n08!|<Mbh n0H!0 $v h'PT300OnTPqXTԀp n0 k8ZhXhT h  p R`8Fc``X ph0k(1MU =0tn s0p$8Dp4S@TW(} o0He@8  nx0,%3`pVjD`@p"^D*aFp0s vX0HX  "{h  1! @0$ ck p    CL!0P!TXl!/qp!X!_0!xp`D!8! !`p!X" h "' "JL"d ""ِL"x" s0""$#'b#l X#r#yf(#@#H#8#*($0eL$J$X֘$q$$$$($p$L%@% 'P%JT%[+%}w|%xP%@p%p%GX&&1 &O &o0$&L&0& s0' Ԁp'-l'M'|e@8' ' p0'm4'( (.RP(W(sOp(L(D8(X)%@)C)^8)8)x)` )`*?T*-@*UL*s_`*$*8*{h*+(,+7(+ZذL+we++ qh0+L+@p,ѨD,B@,H,oՠ,,,8X, r0,m4-X-.-Wp$-~X- -@-q. 8.KЈD.h!P0.k(.f #.p."/({H/>/L/p4/g(/Pp/0T/X0%00Mp(0tX00$0(1 (16 p01RkXD1 p111$1]1! tP022#2G02v {F2}Ql2D2" 2D3 v03!ِL3@h3XS3~(|3 >;G=$XAoAMiK1GUfPkdx.;A=2;backend;raw;cd;DBG_GEN 5.3.0booltrue\false\charversion_string M./positions.cc/var/tmp/gperf-3.0.4/src/ /opt/solstudio12.2/prod/bin/CC -xtarget=ultra -m64 -xcode=pic32 -g -I. -I./../lib -c ./positions.cc -Qoption ccfe -prefix -Qoption ccfe \$XAoAMiK1GUfPUfx.ptf;ptx;ptk;g;R=5.11<>;G=$XAoAMiK1GUfPUfx.;A=2;backend;raw;cd;DBG_GEN 5.3.06booltrue`false`unsignedintlongPositions__1nJPositions_! _useall`#_size#_positions#Positionsee thisp DPositions%e@ep thisp pos1%l D Positions-ee thisp pos1-l pos2-h DPositions8efL thisp src8h D operator=Bfpf thisp srcBh D is_useallMfg ` thisp D operator[]Sg8g\ thisp indexSl D get_sizeYgg thisp Dset_useallaghP thisp `useallao ghPptr hX hhPiiT D pointerohph thisp Dset_sizeuhh thisp sizeul D sort}hj(` thispduplicate_free`obase `len\ i0j iT iLjjPtmpL D iteratorjXja __ptr_returnp thish D iteratorjja __ptr_returnp thish maxlend D reviteratorkk0 =__ptr_returnp thish D reviteratorkXk =__ptr_returnp thish maxlend D contains!^_\` thisp pos!lcount#hp$` D add1_` thisp pos1lcount5hp =` D removeOab thisp posOlcountSh aLbxp V` abxprev_\ abx abpcurroX D print{bd thisp cdfirst`oseen_LASTCHAR`ncounthp` D a__anon_line_39_of_positions_hn9abNLpositionsQbUh'LASTCHAR__anon_line_48_of_positions_hn9abWLpositionsQbUh0MAX_SIZE__anon_line_44_of_positions_hn9abSLpositionsQbUh,MAX_KEY_POS PositionReverseIterator__1nXPositionReverseIterator_=_set #_index#_minindex# PositionReverseIteratorp`p =thispOsrch D nextoo =thisp Dremainingpp4 Xthisp DPositionReverseIteratorn0n` =thisp positionsh D PositionReverseIteratornod =thisp positionsh maxlend oodindexL D__anon_line_144_of_positions_hn9afOLpositionsQbUhEOS~  FFPositionIterator__1nQPositionIterator_j_set #_index#PositionIteratormn  thisp srch D nextlmd thisp D remainingmm thisp DPositionIteratorkk thisp positionsh D PositionIteratorkl thisp positionsh maxlend lllindexL D__anon_line_114_of_positions_hn9aeKLpositionsQbUhrEOS~aa B__FILE__1nG__FILE_v__pad%#std__1nDstd_BFILEnEFILEJgetcccputccslabssr/include/iso/stdlib_iso.h 5quot#rem# ldiv_tnGldiv_t8ldivvnDstdGsize_t_Hsize_tnGsize_tPmemchrcusr/include/iso/string_iso.hstrchrctrpbrkstrpbrkpstrrchrstrrchrrstrstrstrstrs_iobunsigned longvoidcharB $!__iob"""""""c"""","\"'6./options.cc/var/tmp/gperf-3.0.4/src/ /opt/solstudio12.2/prod/bin/CC -xtarget=ultra -m64 -xcode=pic32 -g -I. -I./../lib -c ./options.cc -Qoption ccfe -prefix -Qoption ccfe \$XAoAMiK1GUfPUhx.ptf;ptx;ptk;g;R=5.11<>;G=$XAoAMiK1GUfPUhx.;A=2;backend;raw;cd;DBG_GEN 5.3.0booltrue\false\__SLIP.INIT_Apq8Dintcharfloatunsignedlong$  Positions__1nJPositions_! _useall\# _size# _positions# Positionsc2t6M_v  Positionsc2t6Mi_v  Positionsc2t6Mii_v  Positionsc2t6Mrk0_v operator=c2G6Mrk0_r0 is_useallcJis_useall6kM_b\ operator[]c2F6kMI_i get_sizecIget_size6kM_I  set_useallcKset_useall6Mb_v \pointercHpointer6M_pi  set_sizecIset_size6MI_v sortcEsort6M_b\ iteratorcIiterator6kM_nQPositionIterator_ iteratorcIiterator6kMi_nQPositionIterator_ reviteratorcLreviterator6kM_nXPositionReverseIterator_  reviteratorcLreviterator6kMi_nXPositionReverseIterator_  containscIcontains6kMi_b\  addcDadd6Mi_v  removecGremove6Mi_v  printcFprint6kM_v  __anon_line_48_of_positions_hn9abWLpositionsQbUh0MAX_SIZE__anon_line_39_of_positions_hn9abNLpositionsQbUh'LASTCHAR__anon_line_44_of_positions_hn9abSLpositionsQbUh,MAX_KEY_POS$$$PositionIterator__1nQPositionIterator_j z _set# _index# PositionIteratorc2t6Mrk0_v z nextcEnext6M_i zremainingcJremaining6kM_I  PositionIteratorc2t6MrknJPositions__v z PositionIteratorc2t6MrknJPositions_i_v z$__anon_line_114_of_positions_hn9aeKLpositionsQbUhrEOS~  PositionReverseIterator__1nXPositionReverseIterator_ S _set# _index# _minindex#  PositionReverseIteratorc2t6Mrk0_v S enextcEnext6M_i SremainingcJremaining6kM_I n PositionReverseIteratorc2t6MrknJPositions__v S PositionReverseIteratorc2t6MrknJPositions_i_v S$   \ \ Options__1nHOptions_u _argument_count# _argument_vector# _option_word# _input_file_name# _output_file_name#  _language#( _jump#0 _initial_asso_value#4 _asso_iterations#8 _total_switches#< _size_multiple#@ _function_name#H _slot_name#P _initializer_suffix#X _class_name#` _hash_name#h _wordlist_name#p _lengthtable_name#x _stringpool_name# _delimiters# _key_positions$#OptionsthispD~Optionspthisp<pTHiter"{Hpos#{Dparse_optionsthispargclargv`option_char\\dlBAD_VALUE3@EOS4value5sparser6key_positions=key_pos>total_keysig_sizeY~numerator~denominator~invalid\~endptr~H\pdenomptr~D$print_options w{Dgthispx{0ilx { arg`Doperator[]\gthisppoptionlD set!(Lthisppoption!lD get_input_file_name(pgthispDget_output_file_name/gthispDset_language18thisplanguage1hD get_jump6gthispDget_initial_asso_value=0DgthispDget_asso_iterationsDpgthispDget_total_switchesKgthispDset_total_switchesJXthisptotal_switchesJlD get_size_multipleRgthispDget_function_nameY0DgthispDset_function_nameUthispnameUhD get_slot_name`pgthispDset_slot_name]8thispname]hD get_initializer_suffixggthispDset_initializer_suffixethispinitializersehD get_class_namengthispDset_class_namemhthispnamemhD get_hash_nameu0DgthispDset_hash_nameuthispnameuhD get_wordlist_name|pgthispDset_wordlist_name}Hthispname}hD get_lengthtable_namegthispDset_lengthtable_namehthispnamehD get_stringpool_namegthispDset_stringpool_name(thispnamehD get_delimiters0DgthispDset_delimitersHthispdelimitershD get_key_positionspgthispDshort_usageGqXq"streamGpDlong_usageNqw"streamNpD wPositionStringParser__1nUPositionStringParser_T(U _str# _low_bound# _high_bound#  _end_word_marker# _error_value# _end_marker# _in_range\# _range_upper_bound#  _range_curr_value#$PositionStringParserq{h{Uthispstrqhlow_boundrdhigh_boundr`end_word_markers\error_valuesXend_markersTD$nextPosition|(Uthisp|(||~|~curr_valuelD w^Option_Type__1nLOption_Type_#TYPEUPPERLOWERKRCCANSICCPLUSPLUS SEVENBITLENTABLECOMPCONSTENUMINCLUDEGLOBAL NULLSTRINGSSHAREDLIBSWITCHNOTYPEPOSITIONSDUPNOLENGTH RANDOMDEBUG !"__FILE__1nG__FILE_ __pad##std__1nDstd_"$FILEnEFILEJ%isdigits0cstD&putcharZ_xZtD'getccc"'putccs"'labssr/include/iso/stdlib_iso.h(5 quot# rem#$ ldiv_tnGldiv_t8'ldivvnDstdGsize_t_!$"size_tnGsize_tP'memchrcusr/include/iso/string_iso.h""!e'strchrctrpbrk'strpbrkpstrrchr'strrchrrstrstr'strstrs_1nGoption_unsigned longvoid""__SLIP.FINAL__A"D"option__1nGoption_ M #a name# has_arg# flag# val##a"#s)getopt_long##j#| #!*__iob#+++ s+ + 8,optarg 2,optind 3-option w! unsigned char.$|$/*__ctype$%+++ +!2double++!+!++!+"++"Z+ *version_string -program_name$ 0DEFAULT_JUMP_VALUE' 0DEFAULT_FUNCTION_NAME%* X0DEFAULT_SLOT_NAME%- `0DEFAULT_INITIALIZER_SUFFIX%0 h0DEFAULT_CLASS_NAME%3 p0DEFAULT_HASH_NAME%6 x0DEFAULT_WORDLIST_NAME%9 0DEFAULT_LENGTHTABLE_NAME%< 0DEFAULT_STRINGPOOL_NAME%? 0DEFAULT_DELIMITERS%B #s@'M!)long_options'/ 1__STATIC_CONSTRUCTOR D4'./keyword.cc/var/tmp/gperf-3.0.4/src/ /opt/solstudio12.2/prod/bin/CC -xtarget=ultra -m64 -xcode=pic32 -g -I. -I./../lib -c ./keyword.cc -Qoption ccfe -prefix -Qoption ccfe \$XAoAMiK1GUfPUlx.ptf;ptx;ptk;g;R=5.11<>;G=$XAoAMiK1GUfPUlx.;A=2;backend;raw;cd;DBG_GEN 5.3.0 sbooltrue\false\charintunsignedKeyword__1nHKeyword_ _allchars#_allchars_length#_rest#_lineno#Keyword thisp allcharsh allchars_lengthd restX DKeywordExt__1nKKeywordExt_2@ #_selchars# _selchars_length#(_duplicate_link#0_hash_value#8_final_index#<KeywordExt$\ thisp allchars$h allchars_length$d rest$X Dinit_selchars_tupler thisp positionsrh alpha_unifyr` Dinit_selchars_multisetx0 thisp positionsxh alpha_unifyx` alpha_incxX selcharszP Ddelete_selchars thisp Dinit_selchars_lowK thisp positionsKh alpha_unifyK` alpha_incKX iter #OH key_setQ@ ptrRp iTx cV DlongPositions__1nJPositions_! _useall\#_size#_positions#Positionsc2t6M_v Positionsc2t6Mi_v Positionsc2t6Mii_v Positionsc2t6Mrk0_v  operator=c2G6Mrk0_r0   is_useallcJis_useall6kM_b\ operator[]c2F6kMI_i get_sizecIget_size6kM_I set_useallcKset_useall6Mb_v \pointercHpointer6M_pi  set_sizecIset_size6MI_v sortcEsort6M_b\ iteratorcIiterator6kM_nQPositionIterator_ # iteratorcIiterator6kMi_nQPositionIterator_ # reviteratorcLreviterator6kM_nXPositionReverseIterator_ reviteratorcLreviterator6kMi_nXPositionReverseIterator_ containscIcontains6kMi_b\ addcDadd6Mi_v removecGremove6Mi_v printcFprint6kM_v  #__anon_line_39_of_positions_hn9abNLpositionsQbUh'LASTCHAR__anon_line_44_of_positions_hn9abSLpositionsQbUh,MAX_KEY_POS  PositionIterator__1nQPositionIterator_j _set #_index#PositionIteratorc2t6Mrk0_v  nextcEnext6M_i remainingcJremaining6kM_I PositionIteratorc2t6MrknJPositions__v  PositionIteratorc2t6MrknJPositions_i_v  __anon_line_114_of_positions_hn9aeKLpositionsQbUhrEOS~ # #  PositionReverseIterator__1nXPositionReverseIterator__set #_index#_minindex# PositionReverseIteratorc2t6Mrk0_vnextcEnext6M_iremainingcJremaining6kM_IPositionReverseIteratorc2t6MrknJPositions__v PositionReverseIteratorc2t6MrknJPositions_i_v Keyword_Factory__1nPKeyword_Factory_YKeyword_Factory$ thisp D~Keyword_Factory thisp Dcreate_keywordcOcreate_keyword6Mpkci2_pnHKeyword_~Keyword_Factory #Nvariant 1Hx thisp D0 __SLIP.DELETER__Ap thisp!deletel"sort_char_set"Pd base!p len!lP i$h@ j&d tmp'` D #__RTTI__1nPKeyword_Factory_#__RTTI__1CpnPKeyword_Factory_#__RTTI__1CpknPKeyword_Factory_$%__FILE__1nG__FILE_;__pad#&std__1nDstd_X'FILEnEFILEJ(getcccX(putccsX(labssr/include/iso/stdlib_iso.h)5quot#rem#'ldiv_tnGldiv_t8(ldivvnG__Crun_ R&__Crun__1nG__Crun_*pure_errorcKpure_error6F_v$%+empty_string  %,__iob-i----( ./keyword-list.cc/var/tmp/gperf-3.0.4/src/ /opt/solstudio12.2/prod/bin/CC -xtarget=ultra -m64 -xcode=pic32 -g -I. -I./../lib -c ./keyword-list.cc -Qoption ccfe -prefix -Qoption ccfe \$XAoAMiK1GUfP0mx.ptf;ptx;ptk;g;R=5.11<>;G=$XAoAMiK1GUfP0mx.;A=2;backend;raw;cd;DBG_GEN 5.3.0=booltrueffalsefKeyword_List__1nMKeyword_List__cdr#_car#Keyword_Listthispcarh D firstthisp D rest  0thisp D char   int unsigned  Keyword__1nHKeyword_ _allchars#_allchars_length#_rest#_lineno#Keywordc2t6Mpkci2_v   KeywordExt_List__1nPKeywordExt_List_.#KeywordExt_List%(thisp car%h D first)Xl thisp D rest0thisp D    KPositions__1nJPositions_ 0  KeywordExt__1nKKeywordExt_2@#_selchars# _selchars_length#(_duplicate_link #0_hash_value#8_final_index#<KeywordExtc2t6Mpkci2_v init_selchars_tuplecTinit_selchars_tuple6MrknJPositions_pkI_v 9init_selchars_multisetcWinit_selchars_multiset6MrknJPositions_pkI5_v 9delete_selcharscPdelete_selchars6M_v init_selchars_lowcRinit_selchars_low6MrknJPositions_pkI5_pIB 9  copy_list.H vlist.presult0hlastpv1`hnew_cons4X D copy_list?8Plist?p Ddelete_listFx 3listFprestJh DmergeU list1Uplist2Uh lessU`resultWXresultpvXP Df   Keyword_Comparison__1nSKeyword_Comparison_Qmergesort_list{ h list{p less{hlhmiddleXright_halfPttempH D mergesort_list ]listp lessh D f   ]- b./input.cc/var/tmp/gperf-3.0.4/src/ /opt/solstudio12.2/prod/bin/CC -xtarget=ultra -m64 -xcode=pic32 -g -I. -I./../lib -c ./input.cc -Qoption ccfe -prefix -Qoption ccfe \$XAoAMiK2GUfPEpx.ptf;ptx;ptk;g;R=5.11<>;G=$XAoAMiK2GUfPEpx.;A=2;backend;raw;cd;DBG_GEN 5.3.0booltrueXfalseXlong__FILE__1nG__FILE___pad#std__1nDstd_ FILEnEFILEJ size_tnGsize_tP getccc2 ) putccs2 2 ) labssr/include/iso/stdlib_iso.h  5quot#rem# ldiv_tnGldiv_t8 ldivvchr   memchrcusr/include/iso/string_iso.hJ J 2  strchrctrpbrkd d 2 strpbrkpstrrchrd d d strrchrrstrstrd d 2 strstrs_1nHOptions_d d dunsigned long intvoid9 AcharS [ \d2unsigned Keyword__1nHKeyword_ \_allcharsv#_allchars_length#_restv#_lineno#Keywordc2t6Mpkci2_v d 2 dKeyword_Factory__1nPKeyword_Factory_YOKeyword_Factoryc2t6M_vm~Keyword_Factoryc2T6M_vmcreate_keywordcOcreate_keyword6Mpkci2_pnHKeyword_m d 2 dm S sKeyword_List__1nMKeyword_List_Y_cdra#_carj#Keyword_Listc2t6MpnHKeyword__va firstcFfirst6kM_pnHKeyword_brestcErest6M_rp0kas YaInput__1nFInput__stream)#_factoryO#_inputX#_input_endX#_verbatim_declarationsd# _verbatim_declarations_endd#(_verbatim_declarations_lineno#0_verbatim_coded#8_verbatim_code_endd#@_verbatim_code_lineno#H_struct_decld#P_struct_decl_lineno#X_return_typed#`_struct_tagd#h_heada#p_charset_dependentX#xInputthisp)streamhmkeyword_factory`D~InputthispDread_input@thispinputXhinput_size`input_length2\input_endX PdeclarationsdHdeclarations_endd@keywordsdkeywords_enddkeywords_lineno Xseparator~separator_lineno~separators2~has_declarationsX.~h`lineno~p`pd~pH¬H´Hpd6~xĀnonempty_lineXM~pdN~Ődlineno~struct_declX}struct_decl_linenos}struct_decl_linecount}Ũlined}line_endd}$Ȍnonempty_lineX}qd}ȔargX}Լ,Լold_lenK}line_lenL}new_lenM}new_struct_declXN}new_struct_decl_linenosW|xHpd|struct_tag_length|struct_tagX|return_typeX|Ո؀ՈpXt|lu||len|new_struct_declX|؀pX{ـold_len{ـnew_struct_declX{dlist_tail{delimitersd{lineno{charset_dependentX{ۘlined{۴line_endd{܀keywordd{keyword_length{restd {new_kwzܔ,kpXzlpdz|cSz@(``Hcode2$zcount2%zHTcode25zcount26zlline_restXz4lpdy<<line_restXyCD td  a pretty_input_file_name'dKD is_declaration1Xdline1pdline_end1hlineno1dddecl2Xdd8D( is_declaration_with_arg[Xdline[pdline_end[hlineno\dddecl]Xargp]PargX}pX~Pddc~D, X is_define_declarationXdlinepdline_endhlinenodddeclXargpPargXpXdd~8dd~D,float!2G"#Positions__1nJPositions_ !&_useallX#_size#_positions(#Positionsc2t6M_v&Positionsc2t6Mi_v& 2Positionsc2t6Mii_v& 2 2Positionsc2t6Mrk0_v& 8operator=c2G6Mrk0_r0A& 8is_useallcJis_useall6kM_bXJoperator[]c2F6kMI_i2J get_sizecIget_size6kM_IJset_useallcKset_useall6Mb_v& XpointercHpointer6M_piS&set_sizecIset_size6MI_v& sortcEsort6M_bX&iteratorcIiterator6kM_nQPositionIterator_\JiteratorcIiterator6kMi_nQPositionIterator_\J 2reviteratorcLreviterator6kM_nXPositionReverseIterator_JreviteratorcLreviterator6kMi_nXPositionReverseIterator_J 2containscIcontains6kMi_bXJ 2addcDadd6Mi_v& 2removecGremove6Mi_v& 2printcFprint6kM_vJ$$\%__anon_line_44_of_positions_hn9abSLpositionsQbUh ,&MAX_KEY_POS GG/G / 2PositionIterator__1nQPositionIterator_ j_set8#_index#PositionIteratorc2t6Mrk0_v nextcEnext6M_i2remainingcJremaining6kM_IPositionIteratorc2t6MrknJPositions__v 8PositionIteratorc2t6MrknJPositions_i_v 8 2$G \\ PositionReverseIterator__1nXPositionReverseIterator_ _set8#_index#_minindex# PositionReverseIteratorc2t6Mrk0_v nextcEnext6M_i2remainingcJremaining6kM_IPositionReverseIteratorc2t6MrknJPositions__v 8PositionReverseIteratorc2t6MrknJPositions_i_v 8 2$G  #Options__1nHOptions_u+G_argument_count2#_argument_vector#_option_word2#_input_file_nameX#_output_file_nameX# _languaged#(_jump2#0_initial_asso_value2#4_asso_iterations2#8_total_switches2#<_size_multiple#@_function_named#H_slot_named#P_initializer_suffixd#X_class_named#`_hash_named#h_wordlist_named#p_lengthtable_named#x_stringpool_named#_delimitersd#_key_positionsG#Optionsc2t6M_v+G~Optionsc2T6M_v+Gparse_optionscNparse_options6Mippc_v+G 2 print_optionscNprint_options6kM_v+Yoperator[]c2F6kMnLOption_Type__bX+Y +bsetcDset6MnLOption_Type__v+G +bget_input_file_namecTget_input_file_name6kM_pkcd+Yget_output_file_namecUget_output_file_name6kM_pkcd+Yset_languagecMset_language6Mpkc_v+G dget_jumpcIget_jump6kM_i2+Yget_initial_asso_valuecWget_initial_asso_value6kM_i2+Yget_asso_iterationscTget_asso_iterations6kM_i2+Yget_total_switchescSget_total_switches6kM_i2+Yset_total_switchescSset_total_switches6Mi_v+G 2get_size_multiplecRget_size_multiple6kM_f+Yget_function_namecRget_function_name6kM_pkcd+Yset_function_namecRset_function_name6Mpkc_v+G dget_slot_namecNget_slot_name6kM_pkcd+Yset_slot_namecNset_slot_name6Mpkc_v+G dget_initializer_suffixcWget_initializer_suffix6kM_pkcd+Yset_initializer_suffixcWset_initializer_suffix6Mpkc_v+G dget_class_namecOget_class_name6kM_pkcd+Yset_class_namecOset_class_name6Mpkc_v+G dget_hash_namecNget_hash_name6kM_pkcd+Yset_hash_namecNset_hash_name6Mpkc_v+G dget_wordlist_namecRget_wordlist_name6kM_pkcd+Yset_wordlist_namecRset_wordlist_name6Mpkc_v+G dget_lengthtable_namecUget_lengthtable_name6kM_pkcd+Yset_lengthtable_namecUset_lengthtable_name6Mpkc_v+G dget_stringpool_namecTget_stringpool_name6kM_pkcd+Yset_stringpool_namecTset_stringpool_name6Mpkc_v+G dget_delimiterscOget_delimiters6kM_pkcd+Yset_delimiterscOset_delimiters6Mpkc_v+G dget_key_positionscRget_key_positions6kM_rknJPositions_8+Yshort_usagecLshort_usage6FpnG__FILE__v )long_usagecKlong_usage6FpnG__FILE__v )  +P'Option_Type__1nLOption_Type_#,s&TYPE&UPPERLOWER&KRC&C&ANSIC&CPLUSPLUS &SEVENBIT&LENTABLE&COMP&CONST&ENUM&INCLUDE&GLOBAL &NULLSTRINGS&SHAREDLIB&SWITCH&NOTYPE&POSITIONS&DUP&NOLENGTH &RANDOM&DEBUG (get_delim__1cJget_delim6FppcpLipnG__FILE__i_2,  ,s 2 )! -)__iob,**!*?*S-U)empty_string-8h***f** 9**V****+option ./bool-array.cc/var/tmp/gperf-3.0.4/src/ /opt/solstudio12.2/prod/bin/CC -xtarget=ultra -m64 -xcode=pic32 -g -I. -I./../lib -c ./bool-array.cc -Qoption ccfe -prefix -Qoption ccfe \$XAoAMiK2GUfPEtx.ptf;ptx;ptk;g;R=5.11<>;G=$XAoAMiK2GUfPEtx.;A=2;backend;raw;cd;DBG_GEN 5.3.0booltruebfalsebunsignedBool_Array__1nKBool_Array_$A_size#_iteration_number#_storage_array#Bool_Array Athisp sizel D ~Bool_Array Athisp Dclear<8 Athisp D set_bit- b Athisp index-l D long JoJ__FILE__1nG__FILE___padR#std__1nDstd_LoFILEnEFILEJgetcccULputccnDstdGsize_t_UUL\size_tnGsize_tPmemchrcusr/include/iso/string_iso.h~~U"strchrctrpbrkUstrpbrkpstrrchrstrrchrrstrstrUstrstrs_1nHOptions_intunsigned longvoidmucharfloatUJPositions__1nJPositions_! _useallb#_size#_positions#Positionsc2t6M_v Positionsc2t6Mi_v UPositionsc2t6Mii_v UUPositionsc2t6Mrk0_v  operator=c2G6Mrk0_r0   is_useallcJis_useall6kM_bb operator[]c2F6kMI_iU get_sizecIget_size6kM_I set_useallcKset_useall6Mb_v bpointercHpointer6M_pi  set_sizecIset_size6MI_v sortcEsort6M_bb iteratorcIiterator6kM_nQPositionIterator_  iteratorcIiterator6kMi_nQPositionIterator_  UreviteratorcLreviterator6kM_nXPositionReverseIterator_  reviteratorcLreviterator6kMi_nXPositionReverseIterator_  UcontainscIcontains6kMi_bb UaddcDadd6Mi_v UremovecGremove6Mi_v UprintcFprint6kM_v   __anon_line_44_of_positions_hn9abSLpositionsQbUh,MAX_KEY_POS  UPositionIterator__1nQPositionIterator_j k_set #_index#PositionIteratorc2t6Mrk0_v k }nextcEnext6M_iU kremainingcJremaining6kM_I PositionIteratorc2t6MrknJPositions__v k PositionIteratorc2t6MrknJPositions_i_v k U   t tPositionReverseIterator__1nXPositionReverseIterator_D_set #_index#_minindex# PositionReverseIteratorc2t6Mrk0_vDVnextcEnext6M_iUDremainingcJremaining6kM_I_PositionReverseIteratorc2t6MrknJPositions__vD PositionReverseIteratorc2t6MrknJPositions_i_vD U  MMOptions__1nHOptions_u_argument_countU#_argument_vector#_option_wordU#_input_file_name#_output_file_name# _language#(_jumpU#0_initial_asso_valueU#4_asso_iterationsU#8_total_switchesU#<_size_multiple#@_function_name#H_slot_name#P_initializer_suffix#X_class_name#`_hash_name#h_wordlist_name#p_lengthtable_name#x_stringpool_name#_delimiters#_key_positions#Optionsc2t6M_v~Optionsc2T6M_vparse_optionscNparse_options6Mippc_vUprint_optionscNprint_options6kM_voperator[]c2F6kMnLOption_Type__bbsetcDset6MnLOption_Type__vget_input_file_namecTget_input_file_name6kM_pkcget_output_file_namecUget_output_file_name6kM_pkcset_languagecMset_language6Mpkc_vget_jumpcIget_jump6kM_iUget_initial_asso_valuecWget_initial_asso_value6kM_iUget_asso_iterationscTget_asso_iterations6kM_iUget_total_switchescSget_total_switches6kM_iUset_total_switchescSset_total_switches6Mi_vUget_size_multiplecRget_size_multiple6kM_fget_function_namecRget_function_name6kM_pkcset_function_namecRset_function_name6Mpkc_vget_slot_namecNget_slot_name6kM_pkcset_slot_namecNset_slot_name6Mpkc_vget_initializer_suffixcWget_initializer_suffix6kM_pkcset_initializer_suffixcWset_initializer_suffix6Mpkc_vget_class_namecOget_class_name6kM_pkcset_class_namecOset_class_name6Mpkc_vget_hash_namecNget_hash_name6kM_pkcset_hash_namecNset_hash_name6Mpkc_vget_wordlist_namecRget_wordlist_name6kM_pkcset_wordlist_namecRset_wordlist_name6Mpkc_vget_lengthtable_namecUget_lengthtable_name6kM_pkcset_lengthtable_namecUset_lengthtable_name6Mpkc_vget_stringpool_namecTget_stringpool_name6kM_pkcset_stringpool_namecTset_stringpool_name6Mpkc_vget_delimiterscOget_delimiters6kM_pkcset_delimiterscOset_delimiters6Mpkc_vget_key_positionscRget_key_positions6kM_rknJPositions_ short_usagecLshort_usage6FpnG__FILE__vLlong_usagecKlong_usage6FpnG__FILE__vLhhOption_Type__1nLOption_Type_#TYPEUPPERLOWERKRCCANSICCPLUSPLUS SEVENBITLENTABLECOMPCONSTENUMINCLUDEGLOBAL NULLSTRINGSSHAREDLIBSWITCHNOTYPEPOSITIONSDUPNOLENGTH RANDOMDEBUGo %J__iob   =m    !optionh ./hash-table.cc/var/tmp/gperf-3.0.4/src/ /opt/solstudio12.2/prod/bin/CC -xtarget=ultra -m64 -xcode=pic32 -g -I. -I./../lib -c ./hash-table.cc -Qoption ccfe -prefix -Qoption ccfe \$XAoAMiK2GUfP0ux.ptf;ptx;ptk;g;R=5.11<>;G=$XAoAMiK2GUfP0ux.;A=2;backend;raw;cd;DBG_GEN 5.3.0DbooltruebfalsebcharintunsignedKeyword__1nHKeyword_ _allchars#_allchars_length#_rest#_lineno#Keywordc2t6Mpkci2_v     hlong   Positions__1nJPositions_!_useallb#_size#_positions#Positionsc2t6M_v Positionsc2t6Mi_v  Positionsc2t6Mii_v   Positionsc2t6Mrk0_v  operator=c2G6Mrk0_r0  is_useallcJis_useall6kM_bb operator[]c2F6kMI_i  get_sizecIget_size6kM_I set_useallcKset_useall6Mb_v  bpointercHpointer6M_pi set_sizecIset_size6MI_v  sortcEsort6M_bb iteratorcIiterator6kM_nQPositionIterator_ iteratorcIiterator6kMi_nQPositionIterator_  reviteratorcLreviterator6kM_nXPositionReverseIterator_  reviteratorcLreviterator6kMi_nXPositionReverseIterator_   containscIcontains6kMi_bb  addcDadd6Mi_v  removecGremove6Mi_v  printcFprint6kM_v  __anon_line_44_of_positions_hn9abSLpositionsQbUh,MAX_KEY_POSPositionIterator__1nQPositionIterator_j b_set#_index#PositionIteratorc2t6Mrk0_v b tnextcEnext6M_i bremainingcJremaining6kM_I }PositionIteratorc2t6MrknJPositions__v b PositionIteratorc2t6MrknJPositions_i_v b   k kPositionReverseIterator__1nXPositionReverseIterator_ ;_set#_index#_minindex# PositionReverseIteratorc2t6Mrk0_v ; MnextcEnext6M_i ;remainingcJremaining6kM_I VPositionReverseIteratorc2t6MrknJPositions__v ; PositionReverseIteratorc2t6MrknJPositions_i_v ;     D DKeywordExt__1nKKeywordExt_2@ #_selchars# _selchars_length#(_duplicate_link#0_hash_value#8_final_index#<KeywordExtc2t6Mpkci2_v    init_selchars_tuplecTinit_selchars_tuple6MrknJPositions_pkI_v   init_selchars_multisetcWinit_selchars_multiset6MrknJPositions_pkI5_v    delete_selcharscPdelete_selchars6M_v init_selchars_lowcRinit_selchars_low6MrknJPositions_pkI5_pI _    bHash_Table__1nKHash_Table_!0_table #_size#_log_size# _ignore_length #_collisions#Hash_Table)80thispsize)lbignore_length)kshift1dD~Hash_TableT0thispDinsertH0thispitemhhash_valdprobe`increment\D dump[(Bthispfield_width]l<<iah,indLl jt`DequalbBthispitem1hitem2`D  9h__FILE__1nG__FILE___padK#std__1nDstd_M hFILEnEFILEJ!getccc M!putccnDstdGsize_t_  M Vsize_tnGsize_tP!memchrcusr/include/iso/string_iso.hx x  !strchrctrpbrk  !strpbrkpstrrchr  !strrchrrstrstr  !strstrs_1cHhashpjw6FpkCI_I_  unsigned longvoidgounsigned char"hashpjw__1cHhashpjw6FpkCI_I_   h #__iob$$$$6$g$$$$$size_factor" (Z./search.cc/var/tmp/gperf-3.0.4/src/ /opt/solstudio12.2/prod/bin/CC -xtarget=ultra -m64 -xcode=pic32 -g -I. -I./../lib -c ./search.cc -Qoption ccfe -prefix -Qoption ccfe \$XAoAMiK2GUfPUwx.ptf;ptx;ptk;g;R=5.11<>;G=$XAoAMiK2GUfPUwx.;A=2;backend;raw;cd;DBG_GEN 5.3.0booltrueZfalseZKeyword_List__1nMKeyword_List_g_cdrg#_carw#Keyword_Listc2t6MpnHKeyword__vg firstcFfirst6kM_pnHKeyword_ restcErest6M_rp0g char p x int unsigned  Keyword__1nHKeyword_ w_allchars#_allchars_length#_rest#_lineno#Keywordc2t6Mpkci2_v    g    =longPositions__1nJPositions_! _useallZ#_size#_positions#Positionsc2t6M_v Positionsc2t6Mi_v Positionsc2t6Mii_v Positionsc2t6Mrk0_v   operator=c2G6Mrk0_r0    is_useallcJis_useall6kM_bZ , operator[]c2F6kMI_i , get_sizecIget_size6kM_I ,set_useallcKset_useall6Mb_v Z pointercHpointer6M_pi 5 set_sizecIset_size6MI_v  sortcEsort6M_bZ  iteratorcIiterator6kM_nQPositionIterator_ > , iteratorcIiterator6kMi_nQPositionIterator_ > , reviteratorcLreviterator6kM_nXPositionReverseIterator_  , reviteratorcLreviterator6kMi_nXPositionReverseIterator_  , containscIcontains6kMi_bZ ,addcDadd6Mi_v removecGremove6Mi_v printcFprint6kM_v ,  >__anon_line_39_of_positions_hn9abNLpositionsQbUh'LASTCHAR__anon_line_44_of_positions_hn9abSLpositionsQbUh,MAX_KEY_POS  #   # PositionIterator__1nQPositionIterator_j _set #_index#PositionIteratorc2t6Mrk0_v  nextcEnext6M_i  remainingcJremaining6kM_I PositionIteratorc2t6MrknJPositions__v  PositionIteratorc2t6MrknJPositions_i_v  __anon_line_114_of_positions_hn9aeKLpositionsQbUhrEOS~ > >  PositionReverseIterator__1nXPositionReverseIterator_ _set #_index#_minindex# PositionReverseIteratorc2t6Mrk0_v  " nextcEnext6M_i  remainingcJremaining6kM_I +PositionReverseIteratorc2t6MrknJPositions__v  PositionReverseIteratorc2t6MrknJPositions_i_v  __anon_line_144_of_positions_hn9afOLpositionsQbUhEOS~      KeywordExt__1nKKeywordExt_2@#_selchars# _selchars_length#(_duplicate_link#0_hash_value#8_final_index#<KeywordExtc2t6Mpkci2_vinit_selchars_tuplecTinit_selchars_tuple6MrknJPositions_pkI_v init_selchars_multisetcWinit_selchars_multiset6MrknJPositions_pkI5_v delete_selcharscPdelete_selchars6M_v init_selchars_lowcRinit_selchars_low6MrknJPositions_pkI5_pI 4 KeywordExt_List__1nPKeywordExt_List_.#KeywordExt_Listc2t6MpnKKeywordExt__v firstcFfirst6kM_pnKKeywordExt_ restcErest6M_rp0    4 Bool_Array__1nKBool_Array_$_size#_iteration_number#_storage_array#Bool_Arrayc2t6MI_v~Bool_Arrayc2T6M_vclearcFclear6M_v set_bitcHset_bit6MI_bZSearch__1nGSearch_!p<_head#_total_keys#_max_key_len# _min_key_len#_hash_includes_lenZ#_key_positions#_alpha_inc 4#_alpha_size#_alpha_unify 4#_max_selchars_length#_total_duplicates#_occurrences 5#_asso_values 5#_list_len#_asso_value_max#_initial_asso_value#_jump#_max_hash_value#_collision_detector#Search|<thisplist|hD ~SearchnGXK<thispGKfield_width\HHiuXIKlptrPIKTJKjLDoptimize1DG8<thispmax_hash_valueZlDtEcurr_ptrA`DEcurrCXhashcodeDTEF$temp\HF4FcaDFG8FG8cg@Dprepare,<thisp4|tempPHtempH0keyword@tempkeywordkiDcompute_alpha_sizeP<thispDcompute_alpha_unify 4<thisp alpha_sizelalpha_unify 4`\cTcPDinit_selchars_tuple(<thisp positionshalpha_unify`HtempXDdelete_selchars <thisp temphDcount_duplicates_tuple@<thisp positionshalpha_unify`count\tprepresentatives<dtemp@keyword~~ $ Dfind_positions D<thispalpha_unify 4hmandatorywimaxPwcurrentRocurrent_duplicates_countSol1okeyword1o l2o0keyword2o\n"oi#oxp`c1>&oc2>'oj4nc1>7nc2>8nbestWfbest_duplicates_countXfiZftryal]^try_duplicates_count_^bestyVbest_duplicates_countzVhi|V,X|XtryalNtry_duplicates_countNbestFbest_duplicates_countF|i1F\t\\i2F<0<@<i3Ehtryaltry_duplicates_count 8iter нseen_lastcharZϽfirstZν iȽD,!count_duplicates_tuple h <thispalpha_unify 4hcountdD!compute_alpha_size  <thisp"alpha_inchmax_alpha_incd  |iLD !compute_alpha_unify  4<thisp" positionsh"alpha_inc` Halpha_size\alpha_unify 4P  cD temp keyworditer > 4i Tc  d.b/|a0D$init_selchars_multiset>8<thisp" positions>h"alpha_unify>`"alpha_inc>X\temp@PD!count_duplicates_multisetJd<thisp"alpha_incJhalpha_unify 4O`countR\0,representatives<T tempUkeywordW}} H D find_alpha_incf\<thispduplicates_goalklcurrent 4n`current_duplicates_countqT,ioHXnindicesvDindices 4best 4tryal 4Xiter >ykey_pos|~j~iter >~00key_pos~TTinc~Dbest_duplicates_count~(j~Dtry_duplicates_count~firstZ~j~Dprepare_asso_values#<thisptemphnon_linked_length@Dasso_value_maxA@prepresentatives<~prev~h keyword~other_keyword~garbage~0j ~$keyword7}ptr8}Pcount9}t"tfield_widtha}io} 8 8tempe} keywordg} "Ltempp} "4keywordr}!!jv}||||  D!compute_partition#'(><thisp">undeterminedhpartition>`partition_last>X#&tempH#&keyword@undetermined_chars 4undetermined_chars_lengthequclass>cons$($i&&cls>~D !count_possible_collisions')<thisp">partitionh"cdsum#`m$\split_cardinalities 4%P()cls>&@(0)(@(|i(()dtemp+()Lkeyword-count/()0i0))i8D!unchanged_partitionB*(+Z<thisp">partitionBh"cBd*H+cls>DX*`+|first_countFT*x+|tempHH*+dkeywordJ@countL*+iMDfind_asso_values\+?<thispsteps>^hstepnod+1undetermined>bdetermined>c, ,Lch,x,cl,1x,1ppartition>rchosen_cz~chosen_possible_collisions{~step>~changing_count~changing 4~,-best_c}~best_possible_collisions~~--c~- --X-possible_collisions~./Pc~//c~0,0c~14|stepno~14|step>~14l2<2i~3`4Dcls>}3|44344temp}34keyword}44c}4?step>}5?k}iterations }iter 4 }ii }5(5i}5D5c}66@i }6x=6x=has_collisionZ}68Lcls>}68<68$ptr}68 keyword}hashcode|67sum!|p"|i#|8=boundM|iN|89cQ|9:c`|:;Pcn|<=c|=$=c|=?>0>i|?(?xstep>|D#compute_hashL<thisp"keywordhsumdpPiLD find_good_asso_values?C<thispasso_iterationl@4Csaved_head`best_initial_asso_value\best_jumpXbest_asso_values 5Pbest_collisionsDbest_max_hash_value@@B@Bcollisionsmax_hash_valueAAptrAAkeywordhashcodeDsort+CC<thispD   <  ZHash_Table__1nKHash_Table_!>_table<#_size#_log_size# _ignore_length<#_collisions#Hash_Tablec2t6MIb_v>Z~Hash_Tablec2T6M_v> insertcGinsert6MpnKKeywordExt__2>dumpcEdump6kM_v> equalcFequal6kMpnKKeywordExt_2_bZ> < < >unsigned char$EquivalenceClass__1nQEquivalenceClass_ > Zdouble ?%Step__1nEStep_@?_changing_count#_changing 4#_asso_value_max#_undetermined>#_partition># _expected_lower>#(_expected_upper>#0_next>#8&delete_partition'P'@i">partitionp'h'equclass>hD'less_by_hash_value#C@CpZ@"keyword1#p"keyword2#hD (equalsKLtZAI"ptr1p"ptr2h"lendD)Af* __FILE__1nG__FILE_A__padAI#+std__1nDstd_K:,AfFILEnEFILE J-getcccK:-putccsK:-labssr/include/iso/stdlib_iso.h. 5quot#rem#,BDldiv_tnGldiv_t 8-ldivvnDstdGsize_t_Bl,KCsize_tnGsize_t P-memchrcusr/include/iso/string_iso.hKeKeB-strchrctrpbrk-strpbrkpstrrchr-strrchrrstrstr-strstrsow-pow/include/iso/math_iso.h>>>-fabsscosf>>-__acosfc__asinfKnKn-__asinfs__atanfKnKn-__atanft__atan2fKnKn-__atan2ftKnKnKn-__ceilfe__cosfKnKn-__cosfo_coshfKnKn-__coshfo__expfKnKn-__expfx_fabsfKnKn-__fabsfa__floorfKnKn-__floorflKnKn-__fmodfm__frexpfKnKnKn-__frexpfrKnKn 5-__ldexpfdKnKn-__logfo_log10fKnKn-__log10foKnKn-__modffo__powfKnKnKw-__powfo_sinfKnKnKn-__sinfi_sinhfKnKn-__sinhfi__sqrtfKnKn-__sqrtfq__tanfKnKn-__tanfa_tanhfKnKn-__tanhfa__acoslKnKn-__acoslc__asinlKK-__asinls__atanlKK-__atanlt__atan2lKK-__atan2ltKKK-__ceille__coslKK-__coslo_coshlKK-__coshlo__explKK-__explx_fabslKK-__fabsla__floorlKK-__floorllKK-__fmodlm__frexplKKK-__frexplrKK 5-__ldexpldKK-__loglo_log10lKK-__log10loKK-__modflo__powlKKK-__powlo_sinlKKK-__sinli_sinhlKK-__sinhli__sqrtlKK-__sqrtlq__tanlKK-__tanla_tanhlKK-__tanhla__1cJcopy_list6FpnPKeywordExt_List__1_KK,time_tnGtime_t @ Aunsigned longvoid KT K\float Knlong double K/copy_list__1cJcopy_list6FpnPKeywordExt_List__1_K0delete_list__1cLdelete_list6FpnMKeyword_List__v_L-g1ZLQ L-/mergesort_list__1cOmergesort_list6FpnPKeywordExt_List_pFpnKKeywordExt_3_b_1_LLQ p LOptions__1nHOptions_ uXS_argument_count#_argument_vectorL#_option_word#_input_file_nameL#_output_file_nameL# _language#(_jump#0_initial_asso_value#4_asso_iterations#8_total_switches#<_size_multipleKn#@_function_name#H_slot_name#P_initializer_suffix#X_class_name#`_hash_name#h_wordlist_name#p_lengthtable_name#x_stringpool_name#_delimiters#_key_positions#Optionsc2t6M_vXS~Optionsc2T6M_vXSparse_optionscNparse_options6Mippc_vXSLprint_optionscNprint_options6kM_vXe operator[]c2F6kMnLOption_Type__bZXeXnsetcDset6MnLOption_Type__vXSXn get_input_file_namecTget_input_file_name6kM_pkcXe get_output_file_namecUget_output_file_name6kM_pkcXeset_languagecMset_language6Mpkc_vXS get_jumpcIget_jump6kM_iXe get_initial_asso_valuecWget_initial_asso_value6kM_iXe get_asso_iterationscTget_asso_iterations6kM_iXe get_total_switchescSget_total_switches6kM_iXeset_total_switchescSset_total_switches6Mi_vXS get_size_multiplecRget_size_multiple6kM_fKnXe get_function_namecRget_function_name6kM_pkcXeset_function_namecRset_function_name6Mpkc_vXS get_slot_namecNget_slot_name6kM_pkcXeset_slot_namecNset_slot_name6Mpkc_vXS get_initializer_suffixcWget_initializer_suffix6kM_pkcXeset_initializer_suffixcWset_initializer_suffix6Mpkc_vXS get_class_namecOget_class_name6kM_pkcXeset_class_namecOset_class_name6Mpkc_vXS get_hash_namecNget_hash_name6kM_pkcXeset_hash_namecNset_hash_name6Mpkc_vXS get_wordlist_namecRget_wordlist_name6kM_pkcXeset_wordlist_namecRset_wordlist_name6Mpkc_vXS get_lengthtable_namecUget_lengthtable_name6kM_pkcXeset_lengthtable_namecUset_lengthtable_name6Mpkc_vXS get_stringpool_namecTget_stringpool_name6kM_pkcXeset_stringpool_namecTset_stringpool_name6Mpkc_vXS get_delimiterscOget_delimiters6kM_pkcXeset_delimiterscOset_delimiters6Mpkc_vXS get_key_positionscRget_key_positions6kM_rknJPositions_ Xeshort_usagecLshort_usage6FpnG__FILE__vK:long_usagecKlong_usage6FpnG__FILE__vK: L L X\2Option_Type__1nLOption_Type_ #YTYPEUPPERLOWERKRCCANSICCPLUSPLUS SEVENBITLENTABLECOMPCONSTENUMINCLUDEGLOBAL NULLSTRINGSSHAREDLIBSWITCHNOTYPEPOSITIONSDUPNOLENGTH RANDOMDEBUGAf Y*3__iobY 44A4A444B 4B444B KT444C"4CP4C4C K444D4C5optionL S;./output.cc/var/tmp/gperf-3.0.4/src/ /opt/solstudio12.2/prod/bin/CC -xtarget=ultra -m64 -xcode=pic32 -g -I. -I./../lib -c ./output.cc -Qoption ccfe -prefix -Qoption ccfe \$XAoAMiK3GUfPkyx.ptf;ptx;ptk;g;R=5.11<>;G=$XAoAMiK3GUfPkyx.;A=2;backend;raw;cd;DBG_GEN 5.3.0 TbooltrueZfalseZsmallest_integral_type-MNn-tDcharintsmallest_integral_type8NHOD\min8tmax8pD Keyword_List__1nMKeyword_List_B _cdrB# _car1# Keyword_Listc2t6MpnHKeyword__v B ifirstcFfirst6kM_pnHKeyword_i CrestcErest6M_rp0L B\unsignedrKeyword__1nHKeyword_ 1 _allcharsK# _allchars_lengthT# _restK# _lineno]# Keywordc2t6Mpkci2_v i   i\:B)]^ longyPositions__1nJPositions_! _useallZ# _size]# _positions# Positionsc2t6M_v  Positionsc2t6Mi_v   Positionsc2t6Mii_v    Positionsc2t6Mrk0_v  operator=c2G6Mrk0_r0   is_useallcJis_useall6kM_bZ operator[]c2F6kMI_i  ]get_sizecIget_size6kM_I]  set_useallcKset_useall6Mb_v  ZpointercHpointer6M_pi   set_sizecIset_size6MI_v  ]sortcEsort6M_bZ iteratorcIiterator6kM_nQPositionIterator_  iteratorcIiterator6kMi_nQPositionIterator_   reviteratorcLreviterator6kM_nXPositionReverseIterator_  reviteratorcLreviterator6kMi_nXPositionReverseIterator_   containscIcontains6kMi_bZ   addcDadd6Mi_v   removecGremove6Mi_v   printcFprint6kM_v   __anon_line_39_of_positions_hn9abNLpositionsQbUh'LASTCHAR__anon_line_44_of_positions_hn9abSLpositionsQbUh,MAX_KEY_POS  PositionIterator__1nQPositionIterator_j _set # _index]# PositionIteratorc2t6Mrk0_v  nextcEnext6M_i remainingcJremaining6kM_I]  PositionIteratorc2t6MrknJPositions__v  PositionIteratorc2t6MrknJPositions_i_v  __anon_line_114_of_positions_hn9aeKLpositionsQbUhrEOS~    PositionReverseIterator__1nXPositionReverseIterator_ _set # _index]# _minindex]#  PositionReverseIteratorc2t6Mrk0_v  nextcEnext6M_i remainingcJremaining6kM_I]  PositionReverseIteratorc2t6MrknJPositions__v  PositionReverseIteratorc2t6MrknJPositions_i_v      ]KeywordExt__1nKKeywordExt_2@)r# _selcharsg#  _selchars_length#( _duplicate_linkp#0 _hash_value#8 _final_index#< KeywordExtc2t6Mpkci2_v p    init_selchars_tuplecTinit_selchars_tuple6MrknJPositions_pkI_v p g init_selchars_multisetcWinit_selchars_multiset6MrknJPositions_pkI5_v p g g delete_selcharscPdelete_selchars6M_v pinit_selchars_lowcRinit_selchars_low6MrknJPositions_pkI5_pI  p g g KeywordExt_List__1nPKeywordExt_List_.\# KeywordExt_Listc2t6MpnKKeywordExt__v U pfirstcFfirst6kM_pnKKeywordExt_p restcErest6M_rp0 U)UgT4Output__1nGOutput_"$ _headU# _struct_declK# _struct_decl_lineno^# _return_type# _struct_tag#  _wordlist_eltype#( _verbatim_declarationsK#0 _verbatim_declarations_endK#8 _verbatim_declarations_lineno^#@ _verbatim_codeK#H _verbatim_code_endK#P _verbatim_code_lineno^#X _charset_dependentZ#\ _total_keysT#` _max_key_lenT#d _min_key_lenT#h _hash_includes_lenZ#l _key_positions"#p _alpha_inc+# _total_duplicatesT#  _min_hash_value#  _max_hash_value#  _alpha_size^#  _asso_values=# OutputMOpQ$ thispUheadMhstruct_declM`]struct_decl_linenoN\return_typeNPstruct_tagOHverbatim_declarationsO@verbatim_declarations_endP]verbatim_declarations_linenoQverbatim_codeRverbatim_code_endR]verbatim_code_linenoSZcharset_dependentStotal_keysTmax_key_lenTmin_key_lenTZhash_includes_lenU positionsUgalpha_incV~total_duplicatesV~]alpha_sizeW~4asso_valuesW~DoutputP$ thisp|ɬstyle&~ɴ$$style(h~nm h Dcompute_min_maxqQ8Q$ thisp tempUxhD!num_hash_valuesQR0*thisp countlQR( tempU`Doutput_constantsTV4*thisp+stylehD output_asso_values_refefx*thisp"poslD output_hash_functionfqP*thispjl columnsT~field_width ~jkDtrunc!~kDl count]$~lq<iter <~key_pos=~nq<opiv}Doutput_keylength_tableqpvl*thispcolumnsTlindentK`indexTcolumnPtempUHrdv rukeywordpu ulinkspDoutput_string_poolv~ *thispindentKhindexXtempUPwtz wzkeywordpy ylinkspz} z}keywordp|0|linksp0~Doutput_keyword_table*thispindenthindex\tempUPxD,keywordp< linkspXstringpool_indexDoutput_lookup_array4*thisp#duplicate_entryN1BPduplicate_entry hash_value# index# count#4DEFAULT_VALUETHduplicates+ @lookup_array lookup_array_sizedup_ptr+ lookup_ptr min5max6indentAfield_widthG~columnsTX~columnY~$tempU~ hash_value~ ptrp~8i~4val:~HHtruncK~Xneg_field_widthP~`truncQ~i\~Doutput_lookup_poolspX4*thispDoutput_lookup_tablesX*thispDoutput_lookup_function_body(8*thisp".comparison(h switch_size1Dnum_switches2@indentS(Xindent~(indent}D output_lookup_functionZ(*thispXstyle(hr$ T   DF$Output_Constants__1nQOutput_Constants_&%output_startcMoutput_start6M_v &%output_itemcLoutput_item6Mpkci_v &  %output_endcKoutput_end6M_v &&Output_Constantsِ'&thispD(~Output_ConstantsH'&thispD)~Output_Constants #Nvariant 1'&thispD0*__SLIP.DELETER__G0d'&thisp+deletel$$Output_Defines__1nOOutput_Defines_(_$#,output_startR`R(_thispD,output_itemRR(_thispnamehvaluedD$,output_endSS (_thispD&Output_Defines '(_thispD(~Output_Defines'(_thispD)~Output_Defines #Nvariant 1Ј'(_thispD0*__SLIP.DELETER__A(\'(_thisp+deletel&$Output_Enum__1nLOutput_Enum_*$# _indentation# _pending_commaZ#,output_startS@S*thispD,output_itemST8*thispnamehvaluedD$,output_endTXT*thispD&Output_Enumՠ'*thispindenthD(~Output_Enumh'*thispD)~Output_Enum #Nvariant 1'*thispD0*__SLIP.DELETER__B'*thisp+deletel(hF*$S,++7+%-Output_Expr__1nLOutput_Expr_,%output_exprcLoutput_expr6kM_v +..Output_Expr/,thispD0~Output_Expr؈/,thispD1~Output_Expr #Nvariant 18/,thispD02__SLIP.DELETER__H /,thisp+deletel+7+%-Output_Compare__1nOOutput_Compare_..%output_comparisoncRoutput_comparison6kMrknLOutput_Expr_3_v + , ,3output_firstchar_comparison?_`@Z+thisp",expr1?h",expr2@`D$.Output_Compare;ذ/.this;pD0~Output_Compare<h/.this<pD1~Output_Compare #Nvariant 1</.this<pD02__SLIP.DELETER__I<πϴ/.this<p+deletel,+        p   \ l 4output_upperlower_tableVXWx/ c]tD5output_upperlower_strcmpWY/D5output_upperlower_strncmpBY Z0D5output_upperlower_memcmp~Z\0WD5output_string\0],0"keyp"lenl\D]$\T]c0_D unsigned char5output_line_directive]P]1b"]linenotfile_namehD5output_const_type^^1"const_stringp"type_stringhD -Output_Expr1__1nMOutput_Expr1_3+7# _p1#6output_expr^^3thispD.Output_Expr1/3thisp"piece1hD0~Output_Expr1 ֘/3this pD1~Output_Expr1 #Nvariant 1 8/3this pD02__SLIP.DELETER__C xά/3this p+deletel131-Output_Compare_Strcmp__1nVOutput_Compare_Strcmp_]5,#6output_comparisone`pa5thisp",expr1eh",expr2f`firstchar_doneZh_D$.Output_Compare_Strcmpa@/5thisapD0~Output_Compare_Strcmpb/5thisbpD1~Output_Compare_Strcmp #Nvariant 1bѨ/5thisbpD02__SLIP.DELETER__Db T/5thisbp+deletel353-Output_Compare_Strncmp__1nWOutput_Compare_Strncmp_7,#6output_comparisonbc7thisp",expr1h",expr2`firstchar_doneZ_D$.Output_Compare_Strncmp`/8thispD0~Output_Compare_Strncmp(/8thispD1~Output_Compare_Strncmp #Nvariant 1/8thispD02__SLIP.DELETER__E/8thisp+deletel575-Output_Compare_Memcmp__1nVOutput_Compare_Memcmp_:%,#6output_comparisonceh:.thisp",expr1h",expr2`firstchar_doneZ_D$.Output_Compare_MemcmpԀ/:7thispD0~Output_Compare_MemcmpH/:7thispD1~Output_Compare_Memcmp #Nvariant 1/:7thispD02__SLIP.DELETER__Fpͤ/:7thisp+deletel8:%85output_keyword_entryL~0d:"ptempLp"stringpool_indexLl"indentL`D$5output_keyword_blank_entriesed;"countet"indentehcolumnsgdcolumns`<ditD 7output_switch_caseU"Ulistp"num_switchesl"sizeh"min_hash_valued"max_hash_value`"indent\part1Hpart2Dsize1@size2tempUHcountlowest_case_valueljumps_awayt(jumps_awayD08std__1nDstd_@9isprintxhcxtD:putcharZ"_xZtD;@FILEnEFILEJy__FILE__1nG__FILE_@ __pad@#? unsigned longvoidA A?__RTTI__1nOOutput_Defines_&?__RTTI__1CpnOOutput_Defines_(_&Am?__RTTI__1CpknOOutput_Defines_Av?__RTTI__1nLOutput_Enum_(h?__RTTI__1CpnLOutput_Enum_*(hA?__RTTI__1CpknLOutput_Enum_A?__RTTI__1nMOutput_Expr1_1?__RTTI__1CpnMOutput_Expr1_3?__RTTI__1CpknMOutput_Expr1_3?__RTTI__1nVOutput_Compare_Strcmp_3?__RTTI__1CpnVOutput_Compare_Strcmp_5?__RTTI__1CpknVOutput_Compare_Strcmp_5?__RTTI__1nWOutput_Compare_Strncmp_5?__RTTI__1CpnWOutput_Compare_Strncmp_8?__RTTI__1CpknWOutput_Compare_Strncmp_7?__RTTI__1nVOutput_Compare_Memcmp_8?__RTTI__1CpnVOutput_Compare_Memcmp_:7?__RTTI__1CpknVOutput_Compare_Memcmp_:.?__RTTI__1nQOutput_Constants_$?__RTTI__1nLOutput_Expr_+7?__RTTI__1nOOutput_Compare_,8__Crun__1nG__Crun_D@pure_errorcKpure_error6F_vA__assertD   DfloatOptions__1nHOptions_ uP _argument_count# _argument_vectorE# _option_word# _input_file_nameD# _output_file_nameD#  _language#( _jump#0 _initial_asso_value#4 _asso_iterations#8 _total_switches#< _size_multipleE #@ _function_name#H _slot_name#P _initializer_suffix#X _class_name#` _hash_name#h _wordlist_name#p _lengthtable_name#x _stringpool_name# _delimiters# _key_positions# Optionsc2t6M_v P ~Optionsc2T6M_v P parse_optionscNparse_options6Mippc_v P  E print_optionscNprint_options6kM_v Poperator[]c2F6kMnLOption_Type__bZ P P setcDset6MnLOption_Type__v P Pget_input_file_namecTget_input_file_name6kM_pkc Pget_output_file_namecUget_output_file_name6kM_pkc P set_languagecMset_language6Mpkc_v P get_jumpcIget_jump6kM_i Pget_initial_asso_valuecWget_initial_asso_value6kM_i Pget_asso_iterationscTget_asso_iterations6kM_i Pget_total_switchescSget_total_switches6kM_i P set_total_switchescSset_total_switches6Mi_v P get_size_multiplecRget_size_multiple6kM_fE  Pget_function_namecRget_function_name6kM_pkc P set_function_namecRset_function_name6Mpkc_v P get_slot_namecNget_slot_name6kM_pkc P set_slot_namecNset_slot_name6Mpkc_v P get_initializer_suffixcWget_initializer_suffix6kM_pkc P set_initializer_suffixcWset_initializer_suffix6Mpkc_v P get_class_namecOget_class_name6kM_pkc P set_class_namecOset_class_name6Mpkc_v P get_hash_namecNget_hash_name6kM_pkc P set_hash_namecNset_hash_name6Mpkc_v P get_wordlist_namecRget_wordlist_name6kM_pkc P set_wordlist_namecRset_wordlist_name6Mpkc_v P get_lengthtable_namecUget_lengthtable_name6kM_pkc P set_lengthtable_namecUset_lengthtable_name6Mpkc_v P get_stringpool_namecTget_stringpool_name6kM_pkc P set_stringpool_namecTset_stringpool_name6Mpkc_v P get_delimiterscOget_delimiters6kM_pkc P set_delimiterscOset_delimiters6Mpkc_v P get_key_positionscRget_key_positions6kM_rknJPositions_  P short_usagecLshort_usage6FpnG__FILE__v @ long_usagecKlong_usage6FpnG__FILE__v @EEPBOption_Type__1nLOption_Type_ #QTYPEUPPERLOWERKRCCANSICCPLUSPLUS SEVENBITLENTABLECOMPCONSTENUMINCLUDEGLOBAL NULLSTRINGSSHAREDLIBSWITCHNOTYPEPOSITIONSDUPNOLENGTH RANDOMDEBUG@ Q>yC__iobQDDDD?$D?BD>DD?DD?DD@ D@;D@jE0R~FyC__ctypeRcXD>GoptionE Cversion_string  const_always!  const_readonly_array$  const_for_struct' ;I./main.cc/var/tmp/gperf-3.0.4/src/ /opt/solstudio12.2/prod/bin/CC -xtarget=ultra -m64 -xcode=pic32 -g -I. -I./../lib -c ./main.cc -Qoption ccfe -prefix -Qoption ccfe \$XAoAMiK4GUfPk0x.ptf;ptx;ptk;g;R=5.11<>;G=$XAoAMiK4GUfPk0x.;A=2;backend;raw;cd;DBG_GEN 5.3.0,booltrueVfalseVKeyword_Factory__1nPKeyword_Factory_YpKeyword_Factoryc2t6M_vp~Keyword_Factoryc2T6M_vpcreate_keywordcOcreate_keyword6Mpkci2_pnHKeyword_p    }char y int  unsigned  Keyword__1nHKeyword_  _allchars# _allchars_length# _rest# _lineno#Keywordc2t6Mpkci2_v   KeywordExt_Factory__1nSKeywordExt_Factory_"/}#create_keyword)p/thispallchars)hallchars_length)drest)XD~KeywordExt_Factory"(</thispKeywordExt_Factory"`/thisp__SLIP.DELETER__A" /thispdeletel main1argc1targv1hexitcode3dfactoryCXinputter D~list H~HߌsearcherLuݸ|outputter$\lߌptr lߤpkeyword k`next_keyword k ||}}}t D y long#H# __FILE__1nG__FILE_| __pad+#std__1nDstd_ HFILEnEFILEJgetccc putccs  labssr/include/iso/stdlib_iso.h# #5 quot## rem##&ldiv_tnGldiv_t8ldivvnDstdGsize_t_N # # size_tnGsize_tPmemchrcusr/include/iso/string_iso.h   strchrctrpbrk  strpbrkpstrrchr  strrchrrstrstr  strstrs_1nHOptions_   unsigned longvoid p   Keyword_List__1nMKeyword_List_ _cdr # _car #Keyword_Listc2t6MpnHKeyword__v  !firstcFfirst6kM_pnHKeyword_ !restcErest6M_rp0    " #Input__1nFInput_ _stream # _factory # _input# _input_end# _verbatim_declarations#  _verbatim_declarations_end#( _verbatim_declarations_lineno#0 _verbatim_code#8 _verbatim_code_end#@ _verbatim_code_lineno#H _struct_decl#P _struct_decl_lineno#X _return_type#` _struct_tag#h _head #p _charset_dependentV#xInputc2t6MpnG__FILE_pnPKeyword_Factory__v  p~Inputc2T6M_v read_inputcKread_input6M_v     |$ %#&Positions__1nJPositions_! _useallV# _size# _positions #Positionsc2t6M_vPositionsc2t6Mi_v Positionsc2t6Mii_v  Positionsc2t6Mrk0_v !operator=c2G6Mrk0_r0 !is_useallcJis_useall6kM_bV!operator[]c2F6kMI_i !get_sizecIget_size6kM_Iset_useallcKset_useall6Mb_v V!pointercHpointer6M_piset_sizecIset_size6MI_v !sortcEsort6M_bV!iteratorcIiterator6kM_nQPositionIterator_!iteratorcIiterator6kMi_nQPositionIterator_ !reviteratorcLreviterator6kM_nXPositionReverseIterator_!reviteratorcLreviterator6kMi_nXPositionReverseIterator_ !containscIcontains6kMi_bV addcDadd6Mi_v removecGremove6Mi_v printcFprint6kM_v''(__anon_line_44_of_positions_hn9abSLpositionsQbUh,)MAX_KEY_POS ""  #PositionIterator__1nQPositionIterator_jv _set# _index#PositionIteratorc2t6Mrk0_vv !nextcEnext6M_iv!remainingcJremaining6kM_IPositionIteratorc2t6MrknJPositions__vv PositionIteratorc2t6MrknJPositions_i_vv  '  " #PositionReverseIterator__1nXPositionReverseIterator_O _set# _index# _minindex# PositionReverseIteratorc2t6Mrk0_vO a!nextcEnext6M_iO!remainingcJremaining6kM_IjPositionReverseIteratorc2t6MrknJPositions__vO PositionReverseIteratorc2t6MrknJPositions_i_vO  '  "X X  KeywordExt__1nKKeywordExt_2@# _selchars #  _selchars_length#( _duplicate_link #0 _hash_value#8 _final_index#<KeywordExtc2t6Mpkci2_v    init_selchars_tuplecTinit_selchars_tuple6MrknJPositions_pkI_v   init_selchars_multisetcWinit_selchars_multiset6MrknJPositions_pkI5_v   delete_selcharscPdelete_selchars6M_v !init_selchars_lowcRinit_selchars_low6MrknJPositions_pkI5_pIs   KeywordExt_List__1nPKeywordExt_List_. #KeywordExt_Listc2t6MpnKKeywordExt__v  !firstcFfirst6kM_pnKKeywordExt_ !restcErest6M_rp0   " s #Bool_Array__1nKBool_Array_ $ _size # _iteration_number# _storage_array#Bool_Arrayc2t6MI_v ~Bool_Arrayc2T6M_vclearcFclear6M_v!set_bitcHset_bit6MI_bV &Search__1nGSearch_ !p$% _head # _total_keys# _max_key_len#  _min_key_len# _hash_includes_lenV# _key_positions # _alpha_incs# _alpha_size# _alpha_unifys# _max_selchars_length# _total_duplicates# _occurrences# _asso_values# _list_len# _asso_value_max# _initial_asso_value# _jump# _max_hash_value# _collision_detector#Searchc2t6MpnPKeywordExt_List__v$% ~Searchc2T6M_v$%optimizecIoptimize6M_v$%preparecHprepare6M_v$%!compute_alpha_sizecScompute_alpha_size6kM_I$7!compute_alpha_unifycTcompute_alpha_unify6kM_pIs$7init_selchars_tuplecTinit_selchars_tuple6kMrknJPositions_pkI_v$7  delete_selcharscPdelete_selchars6kM_v$7!count_duplicates_tuplecWcount_duplicates_tuple6kMrknJPositions_pkI_I$7  find_positionscOfind_positions6M_v$%!count_duplicates_tuplecWcount_duplicates_tuple6kM_I$7!compute_alpha_sizecScompute_alpha_size6kMpkI_I$7 !compute_alpha_unifycTcompute_alpha_unify6kMrknJPositions_pkI_pIs$7  init_selchars_multisetcWinit_selchars_multiset6kMrknJPositions_pkI5_v$7  !count_duplicates_multisetcZcount_duplicates_multiset6kMpkI_I$7 find_alpha_inccOfind_alpha_inc6M_v$%prepare_asso_valuescTprepare_asso_values6M_v$%!compute_partitioncRcompute_partition6kMpb_pnQEquivalenceClass_$t$7 $@!count_possible_collisionscZcount_possible_collisions6kMpnQEquivalenceClass_I_I$7 $t !unchanged_partitioncTunchanged_partition6kMpnQEquivalenceClass_I_bV$7 $t find_asso_valuescQfind_asso_values6M_v$%!compute_hashcMcompute_hash6kMpnKKeywordExt__i$7 find_good_asso_valuescVfind_good_asso_values6M_v$%sortcEsort6M_v$%   $. V*EquivalenceClass__1nQEquivalenceClass_ $I  $&Output__1nGOutput_ ",F _head # _struct_decl# _struct_decl_lineno # _return_type# _struct_tag#  _wordlist_eltype#( _verbatim_declarations#0 _verbatim_declarations_end#8 _verbatim_declarations_lineno #@ _verbatim_code#H _verbatim_code_end#P _verbatim_code_lineno #X _charset_dependentV#\ _total_keys#` _max_key_len#d _min_key_len#h _hash_includes_lenV#l _key_positions$}#p _alpha_inc$# _total_duplicates#  _min_hash_value#  _max_hash_value#  _alpha_size #  _asso_values$# Outputc2t6MpnPKeywordExt_List_pkcI4444I44IbiiibrknJPositions_pkIiIpki_v,F           V    V    $outputcGoutput6M_v,Fcompute_min_maxcPcompute_min_max6M_v,F!num_hash_valuescPnum_hash_values6kM_i,Xoutput_constantscQoutput_constants6kMrnQOutput_Constants__v,X ,output_asso_values_refcWoutput_asso_values_ref6kMi_v,X output_hash_functioncUoutput_hash_function6kM_v,Xoutput_keylength_tablecWoutput_keylength_table6kM_v,Xoutput_string_poolcSoutput_string_pool6kM_v,Xoutput_keyword_tablecUoutput_keyword_table6kM_v,Xoutput_lookup_arraycToutput_lookup_array6kM_v,Xoutput_lookup_poolscToutput_lookup_pools6kM_v,Xoutput_lookup_tablescUoutput_lookup_tables6kM_v,Xoutput_lookup_function_bodycbBoutput_lookup_function_body6kMrknOOutput_Compare__v,X ,output_lookup_functioncWoutput_lookup_function6kM_v,X $ $ ,O*Output_Constants__1nQOutput_Constants_",a*Output_Compare__1nOOutput_Compare_ ,",+__RTTI__1nSKeywordExt_Factory_+__RTTI__1CpnSKeywordExt_Factory_/  - +__RTTI__1CpknSKeywordExt_Factory_-)float&Options__1nHOptions_ u8 _argument_count# _argument_vector# _option_word# _input_file_name# _output_file_name#  _language#( _jump#0 _initial_asso_value#4 _asso_iterations#8 _total_switches#< _size_multiple-]#@ _function_name#H _slot_name#P _initializer_suffix#X _class_name#` _hash_name#h _wordlist_name#p _lengthtable_name#x _stringpool_name# _delimiters# _key_positions #Optionsc2t6M_v8~Optionsc2T6M_v8parse_optionscNparse_options6Mippc_v8  print_optionscNprint_options6kM_v8!operator[]c2F6kMnLOption_Type__bV8 8setcDset6MnLOption_Type__v8 8!get_input_file_namecTget_input_file_name6kM_pkc8!get_output_file_namecUget_output_file_name6kM_pkc8set_languagecMset_language6Mpkc_v8 !get_jumpcIget_jump6kM_i8!get_initial_asso_valuecWget_initial_asso_value6kM_i8!get_asso_iterationscTget_asso_iterations6kM_i8!get_total_switchescSget_total_switches6kM_i8set_total_switchescSset_total_switches6Mi_v8 !get_size_multiplecRget_size_multiple6kM_f-]8!get_function_namecRget_function_name6kM_pkc8set_function_namecRset_function_name6Mpkc_v8 !get_slot_namecNget_slot_name6kM_pkc8set_slot_namecNset_slot_name6Mpkc_v8 !get_initializer_suffixcWget_initializer_suffix6kM_pkc8set_initializer_suffixcWset_initializer_suffix6Mpkc_v8 !get_class_namecOget_class_name6kM_pkc8set_class_namecOset_class_name6Mpkc_v8 !get_hash_namecNget_hash_name6kM_pkc8set_hash_namecNset_hash_name6Mpkc_v8 !get_wordlist_namecRget_wordlist_name6kM_pkc8set_wordlist_namecRset_wordlist_name6Mpkc_v8 !get_lengthtable_namecUget_lengthtable_name6kM_pkc8set_lengthtable_namecUset_lengthtable_name6Mpkc_v8 !get_stringpool_namecTget_stringpool_name6kM_pkc8set_stringpool_namecTset_stringpool_name6Mpkc_v8 !get_delimiterscOget_delimiters6kM_pkc8set_delimiterscOset_delimiters6Mpkc_v8 !get_key_positionscRget_key_positions6kM_rknJPositions_8short_usagecLshort_usage6FpnG__FILE__v long_usagecKlong_usage6FpnG__FILE__v -f -f 8,Option_Type__1nLOption_Type_ #:)TYPE)UPPERLOWER)KRC)C)ANSIC)CPLUSPLUS )SEVENBIT)LENTABLE)COMP)CONST)ENUM)INCLUDE)GLOBAL )NULLSTRINGS)SHAREDLIB)SWITCH)NOTYPE)POSITIONS)DUP)NOLENGTH )RANDOM)DEBUG-delete_list__1cLdelete_list6FpnMKeyword_List__v_:L $H :j#.__iob:L/////////i// // 2/ b/ 0option-f y;8#.empty_string;h#./getopt.c /var/tmp/gperf-3.0.4/lib /opt/solstudio12.2/prod/bin/c99 -xtarget=ultra -m64 -xcode=pic32 -features=extensions -D_XPG6 -L/usr/local/lib -I/usr/local/include -I. -c ./getopt.cXa;P;R=Sun C 5.11 SunOS_sparc 145354-01 2010/10/11;backend;raw;cd;DBG_GEN 5.3.0.R%./getopt1.c /var/tmp/gperf-3.0.4/lib /opt/solstudio12.2/prod/bin/c99 -xtarget=ultra -m64 -xcode=pic32 -features=extensions -D_XPG6 -L/usr/local/lib -I/usr/local/include -I. -c ./getopt1.cXa;P;R=Sun C 5.11 SunOS_sparc 145354-01 2010/10/11;backend;raw;cd;DBG_GEN 5.3.0../getline.cc/var/tmp/gperf-3.0.4/lib/ /opt/solstudio12.2/prod/bin/CC -xtarget=ultra -m64 -xcode=pic32 -g -I. -c ./getline.cc -Qoption ccfe -prefix -Qoption ccfe \$XAoAMiK0GUfPUXx.ptf;ptx;ptk;g;R=5.11<>;G=$XAoAMiK0GUfPUXx.;A=2;backend;raw;cd;DBG_GEN 5.3.0.booltrueQfalseQunsigned longstd__1nDstd_#xsize_tnGsize_t<HFILEnEFILEJgetccc|putccchr|memchrcusr/include/iso/string_iso.hstrchrctrpbrkstrpbrkpstrrchrstrrchrrstrstrstrstrs_assertlong#H # __FILE__1nG__FILE_| __pad+# intvoid  char  getstr'0lineptr'pn'h|stream'`terminator'_offset'Pnchars_avail)Hread_pos*@phc:|new_lineID,   get_linel}lineptrlpnlh|streaml`Dget_delimr0plineptrrpnrhdelimiterrd|streamrXD__assert8H V #__iob8 f./hash.cc/var/tmp/gperf-3.0.4/lib/ /opt/solstudio12.2/prod/bin/CC -xtarget=ultra -m64 -xcode=pic32 -g -I. -c ./hash.cc -Qoption ccfe -prefix -Qoption ccfe \$XAoAMiK0GUfPEax.ptf;ptx;ptk;g;R=5.11<>;G=$XAoAMiK0GUfPEax.;A=2;backend;raw;cd;DBG_GEN 5.3.0/booltrueKfalseKhashpjwDxplenlhhgdD unsignedunsigned char *  .version.cc= ./usr/include/usr/include/isopositions.ccpositions.hpositions.iccstdio_impl.hstdio_iso.hstdlib_iso.h p`= oh p  n01 n)  m- lx m$ k! k  e! e@&% e.% e9-4 fp4 f g8$ g g$= hp h h `P%  jX( j0 k( kX0 ^")$$1 _24)%4$5  a)% %% $4 b )  091  ./usr/include/usr/include/iso./../liboptions.ccoptions.hpositions.hoptions.iccstdio_impl.hstdio_iso.hctype_iso.hstdlib_iso.hgetopt.hstdio.hversion.h p k S %<0 $,=5 {h a |8$@I% <<%  $  $]$$ $$$$D@<4 E@$H\$E, 59$ 4$,4$14$$ ,E4$$$$$ 4 4,!!(44$!050%0d0\$,!H$ $HU$$ $ $$$i,]-H$ w!-!]!!5)!\-! -)   0 ("$ p) 0 ! 4(4(4(4= 7 0> p  X)$  0 0 p 80  0  0 0 0 p 0  h0  0 0 H0 p 0+ / qX= q)( (())()()()) ()  (()     ./usr/include/usr/include/isokeyword.cckeyword.hkeyword.iccpositions.hstdio_impl.hstdio_iso.hstdlib_iso.h 1 $0 , 0 $  -88(  1   H  #`=1X .keyword-list.cckeyword-list.hkeyword.hkeyword-list.icc !   ! %! X* 1 H0P), 8 x  U  9!     ./usr/include/usr/include/isoinput.ccinput.hstdio_impl.hstdio_iso.hstdlib_iso.hkeyword.hkeyword-list.hoptions.hpositions.h %  4(E ,,)5 (,!8)!,!%-!4!M1(0 ,!!!!!!-!4%  U LLU U U U U U LLLLLLL L U L U U 4-L M < $(0$1- 5Q95!!!5 !4 !!(,4H-1)(( d H!(((( $,! ! ,!M$E(!)!W!5190,5190,!I@!E0 (,1  4) P)#H5M  ) P)#5U0\LH5M  1 ()HH) P)#I0\LH5M( ./usr/include/usr/include/isobool-array.ccbool-array.hbool-array.iccstdio_impl.hstdio_iso.hoptions.hpositions.h  E,< < 85,=4 .1$a ./usr/include/usr/include/isohash-table.cchash-table.hkeyword.hpositions.hstdio_impl.hstdio_iso.h 8*!!!!!0,  H $-H)  $ ,,4 ,-<4h<`4 ' ./usr/include/usr/include/isosearch.ccsearch.hkeyword-list.hkeyword.hpositions.hbool-array.hhash-table.hstdio_impl.hstdio_iso.hstdlib_iso.htime_iso.hoptions.h ) GX H=5,,5M)q,`4X5 D )$ 5<=4 4$!,,  ,,@ ( )(( ! 8)(-t PL  ((,$0 ((D (8 @)X)(8=,  =8=E1)- 9,, %- 9,, %4 I -$5    $](( (   4l44=(000 $0((% 4,E$4$H%$45   h,  ,,0X    %((-)-8$1,-) D 8(L ,1X)(8=, ,,,%,),A ,)08!0!0  4854]5(0    Y)(0 !Du,T ,!@!<A<=40,)(1M=)$ 4L)H$X,P ]!lT #)-,4$$<!< - $-@ '0%(-),0) $(M *(%),0)$!  +(,-(,- ,E-!=,1,$,@)(,@E=%<-4]Q4)4),1%)$((,5)@,L= !$(E,!!$(E,$! )H$ $ =<-4]Q L AM( ? 5 ,!)$ <11( =91 C 4 'P! C@ 0 K(! z ./usr/include/iso/usr/includeoutput.ccoutput.hkeyword-list.hkeyword.hpositions.hctype_iso.hstdio_iso.hstdio_impl.hoptions.hversion.h M. #  NH9`+ ;  Op'B ِ H   R`  R 0 S    Ј  S@  S  < TX , ՠ/ h   (p&((9\ 8(8(8(8 4 = !!% i8!9$ =($  888" <% T Q84$$ Q(0 T$@@@@@$ e (,9  f8(!! 8<<E)P!- 8    ,)%4,- 9 ! $ $    qpi 1|% X(  X(, ) X(, (<  v"1|lM$ (M$ 11|!l) ( ) 1 )<   )01|!,  )$  1!(  = 4@9 ) , 'I &II4I?  : ;   DD%$> 'I I !I/D: ; D D  I8 2 .?  : ; 2 @ I4 :  D D I: ;  .?  : ; 2 @ I 4I : ;  *AD2 : ; ( &IID: ; D D .?  : ;2 @ I: ; .?  : ;2 @ III !I/ D: ; 9DID: ; .D? < ID I : ; !4I? <  : ; " DD%$> 'I .4  : @ D D I&II  !I/ D: ; D D  I8 2 .D? < 2 I4 I.D? < I2 *AD2 : ; ( ID: ; D D .?  : ;2 @ I4 :   4I : ; I: ; .?  : ; 2 @ II: ;  .?  : ; 2 @ D: ; .?  : ;2 @ ID : ;  I !!I/ "D: ; #9D$ID: ; %.?  : ; @ ID D &.?  : ;@ ID D '.D? < ID (: ; ).? < ID *4I? <  : ; +,4I? <  : ;-4I?  : ;  .I/!I04I : ;  1. : @  DD%$> 'I &IID: ;  I8 2 .?  : ; 2 @ I4 :  I: ;  D D I8 2 4I : ;  .?  : ; 2 @ I I !I/D: ; D D .D? < 2 I4 I.D? < I2 *AD2 : ; ( ID: ; D D D: ; D D D D .?  : ; 2 L M @ .D? < I2 L M .?  : ; @ .4  : ; @ !I:  ". : ; @ #I$I %!I/ &9D'ID: ; (.D? < ID ): ; *.D? < +4I?  : ;  ,4I? <  : ; - DD%$> 'I D: ;  I8 2 .?  : ; 2 @ I4 :  I: ;  D D .?  : ; 2 @ I I &I D: ; .D? < 2 I4 III8 2 D: < .D? < I2 .?  : ; @ I4I : ;   .?  : ; @ . : ; @ IIID: ;  DD%$> 'I I !I/ D: ;  I8 2 9D ID: ; .D? < ID I : ; I&I.D? < 2 I4 D: ; D D D D .D? < 2 L M .D? < I2 L M D: ; .D? < I2 ID: ; D D .?  : ; 2 @ I4 :  I: ;  D D .?  : ;2 @ 4I : ;  4I : ;   . : ; @ I!I "!I/#D: ; D D $*A%D2 : ; &( 'D : ; (.D? < I)4I? <  : ; *+4I? <  : ; DD%$> 'I &IID: ; D D  I8 2 .?  : ; 2 @ I4 :  I: ;  D D .?  : ; 2 @ I I !I/ D: ; 9DID: ; .D? < ID II !I/D: ; D D .D? < 2 I4 .D? < I2 *AD2 : ; ( ID : ; 4I? <  : ; !4I? <  : ; DD%$> 'I &IID: ;  I8 2 .D? < 2 I4 I I  !I/ D: ; D D .D? < I2 *AD2 : ; ( ID: ; D D I8 2 .?  : ; 2 @ I4 :  I: ;  4I : ;  D D .?  : ; 2 @ I .?  : ; 2 @ ID I !I/ 9D ID: ; !.D? < ID ".D? < I#4I? <  : ; $ DD%$> 'I D: ;  I8 2 .D? < 2 I4 I .D? < I2 I &I D: ;  II !I/D: ; D D *AD2 : ; ( D: ; D D I8 2 .?  : ; 2 @ I4 :  I: ;  D D .?  : ;2 @  4I : ; 4I : ;  .?  : ; 2 @ ID D D D DD !.?  : ;2 @ I"I: ; #.?  : ;2 @ ID $D: < %D: ; &. : ;@ '. : ;@ I(. : ;@ I)I *!I/ +9D,ID: ; -.D? < ID .: ; /.D? < I0.D? < 1I2D : ; 34I? <  : ; 454I? <  : ; DD%$> 'I . : ; @ II: ;  D D &II D: ;  I8 2 .D? < 2 I4 I.D? < I2 D: ; II !I/D: ; D D *AD2 : ; ( D: ; D D I8 2 .?  : ; 2 @ I4 :  .?  : ;2 @  4I : ; D D D D DD 4I : ;  !.?  : ; 2 @ I"I: ; #D: ; $D: ; D D D D %.D? < 2 L M &.?  : ; 2 @ D 'I4 : ;  (.?  : ; 2 L M @ D ).?  : ; @ D *.4  : ; @ +I:  ,.?  : ; 2 L M @ -D: ; D D D D ..?  : ;2 @ D /I4 : ; 0.?  : ;2 L M @ D 1.?  : ;@ D 2.4  : ;@ 3.?  : ;2 @ I4. : ; @ 5. : ;@ 6.?  : ;2 L M @ 7. : ;@ I89D9.?  : ; @ ID D :.?  : ;@ ID D ;ID: ; <.D? < ID =I >!I/ ?I@.D? < A.? < D BD : ; C4I? <  : ; DEIF!IG4I? <  : ; DD%$> 'I D: ; D D D D .D? < 2 I4 .D? < 2 L M .D? < I2 L M I I &I D: ;  I8 2 I8 2 .?  : ; 2 L M @ II4 :  I: ;  D D .4  : ; @ I:  .?  6 : ; @ ID 4I : ;   D D D D DD I !I/ 9DID: ; .D? < ID : ; D: ; !.D? < I2 "I#D: ; D D $I %!I/&D: ; D D '*A(D2 : ; )( *D: < +I,D : ; -.D? < .4I? <  : ; /04I? <  : ; DD% DD% DD%$> 'I 9DID: ; .D? < ID II  !I/ D: ;  I8 2 I &I. : ; @ II: ;  4I : ;   D D .?  : ; @ I.? < D I 4I? <  : ;  DD%$> 'I .?  : ; @ II: ;  4I : ;  D D &I I1version_string *Positions::PositionsePositions::PositionsPositions::PositionsPositions::PositionsaPositions::operator=Positions::is_useallPositions::operator[]QPositions::get_sizePositions::set_useall,Positions::pointermPositions::set_sizePositions::sortPositions::iteratorPositions::iteratorePositions::reviteratorPositions::reviterator:Positions::containsPositions::add !Positions::remove Positions::print PositionReverseIterator::PositionReverseIterator sPositionReverseIterator::next PositionReverseIterator::remaining PositionReverseIterator::PositionReverseIterator WPositionReverseIterator::PositionReverseIteratorPositionIterator::PositionIteratorPositionIterator::nextOPositionIterator::remainingPositionIterator::PositionIteratorPositionIterator::PositionIteratorc}' Options::Options!Options::~OptionsOptions::parse_optionsOptions::print_optionsOptions::operator[]Options::set;Options::get_input_file_nameOptions::get_output_file_nameOptions::set_language-Options::get_jumpoOptions::get_initial_asso_valueOptions::get_asso_iterations Options::get_total_switchesXOptions::set_total_switchesOptions::get_size_multipleOptions::get_function_nameQOptions::set_function_nameOptions::get_slot_nameOptions::set_slot_nameDOptions::get_initializer_suffixOptions::set_initializer_suffixOptions::get_class_nameAOptions::set_class_nameOptions::get_hash_nameOptions::set_hash_name1Options::get_wordlist_name|Options::set_wordlist_nameOptions::get_lengthtable_name"Options::set_lengthtable_name}Options::get_stringpool_nameOptions::set_stringpool_name$Options::get_delimiterslOptions::set_delimitersOptions::get_key_positionsOptions::short_usageQOptions::long_usagePositionStringParser::PositionStringParserPositionStringParser::nextPosition isdigit 8putchar$^option%Qprogram_name> @AKeyword::KeywordKeywordExt::KeywordExtKeywordExt::init_selchars_tupleKeywordExt::init_selchars_multiset=KeywordExt::delete_selchars~KeywordExt::init_selchars_lowKeyword_Factory::Keyword_Factory[Keyword_Factory::~Keyword_Factory Keyword_Factory::~Keyword_Factory #Nvariant 1empty_string@S` Keyword_List::Keyword_List-Keyword_List::firstlKeyword_List::restKeywordExt_List::KeywordExt_ListqKeywordExt_List::firstKeywordExt_List::restcopy_listcopy_listdelete_list 1mergesort_list mergesort_list_^- bInput::Input Input::~Input Input::read_input(Bool_Array::Bool_ArraywBool_Array::~Bool_ArrayBool_Array::clearBool_Array::set_bitHash_Table::Hash_TableHash_Table::~Hash_TableEHash_Table::insertHash_Table::dumpHash_Table::equal65Z Search::SearchVSearch::~Search>Search::optimizeSearch::prepareSearch::compute_alpha_sizeSearch::compute_alpha_unifySearch::init_selchars_tupleSearch::delete_selcharsSearch::count_duplicates_tuple%Search::find_positions!tSearch::count_duplicates_tuple!Search::compute_alpha_size"Search::compute_alpha_unify$Search::init_selchars_multiset%YSearch::count_duplicates_multiset&Search::find_alpha_inc)Search::prepare_asso_values-$Search::compute_partition.Search::count_possible_collisions0Search::unchanged_partition2Search::find_asso_values9Search::compute_hash:tSearch::find_good_asso_values<{Search::sortSG1Output::OutputOutput::outputOutput::compute_min_maxOutput::num_hash_valuesqOutput::output_constantsOutput::output_asso_values_ref#Output::output_hash_function|Output::output_keylength_tableOutput::output_string_poolOutput::output_keyword_tableOutput::output_lookup_array!Output::output_lookup_pools!Output::output_lookup_tables"5Output::output_lookup_function_body#xOutput::output_lookup_function$Output_Constants::Output_Constants%5Output_Constants::~Output_Constants%wOutput_Constants::~Output_Constants #Nvariant 1&^Output_Defines::output_start&Output_Defines::output_item'Output_Defines::output_end'HOutput_Defines::Output_Defines'Output_Defines::~Output_Defines'Output_Defines::~Output_Defines #Nvariant 1(Output_Enum::output_start)Output_Enum::output_item)Output_Enum::output_end)Output_Enum::Output_Enum*Output_Enum::~Output_Enum*NOutput_Enum::~Output_Enum #Nvariant 1+Output_Expr::Output_Expr+Output_Expr::~Output_Expr,Output_Expr::~Output_Expr #Nvariant 1-VOutput_Compare::output_firstchar_comparison-Output_Compare::Output_Compare.Output_Compare::~Output_Compare.VOutput_Compare::~Output_Compare #Nvariant 12Output_Expr1::output_expr2aOutput_Expr1::Output_Expr12Output_Expr1::~Output_Expr12Output_Expr1::~Output_Expr1 #Nvariant 13Output_Compare_Strcmp::output_comparison4Output_Compare_Strcmp::Output_Compare_Strcmp4Output_Compare_Strcmp::~Output_Compare_Strcmp5Output_Compare_Strcmp::~Output_Compare_Strcmp #Nvariant 16-Output_Compare_Strncmp::output_comparison6Output_Compare_Strncmp::Output_Compare_Strncmp7Output_Compare_Strncmp::~Output_Compare_Strncmp7NOutput_Compare_Strncmp::~Output_Compare_Strncmp #Nvariant 18`Output_Compare_Memcmp::output_comparison8Output_Compare_Memcmp::Output_Compare_Memcmp96Output_Compare_Memcmp::~Output_Compare_Memcmp9Output_Compare_Memcmp::~Output_Compare_Memcmp #Nvariant 1>isprint>putcharRk ;UKeywordExt_Factory::create_keyword8main= get_line}get_delim*rhashpjw@(#)stdio.h 1.84 04/09/28 SMI@(#)feature_tests.h 1.25 07/02/02 SMI@(#)ccompile.h 1.2 04/11/08 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stdio_iso.h 1.8 05/08/16 SMI@(#)va_list.h 1.15 04/11/19 SMI@(#)stdio_tag.h 1.4 04/09/28 SMI@(#)stdio_impl.h 1.15 07/03/05 SMI@(#)stdio_c99.h 1.2 04/03/29 SMI@(#)stdlib.h 1.51 04/06/30 SMI@(#)stdlib_iso.h 1.9 04/09/28 SMI@(#)stdlib_c99.h 1.2 04/03/29 SMI@(#)string.h 1.27 07/01/14 SMI@(#)string_iso.h 1.5 04/06/18 SMI@(#)stdio.h 1.84 04/09/28 SMI@(#)feature_tests.h 1.25 07/02/02 SMI@(#)ccompile.h 1.2 04/11/08 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stdio_iso.h 1.8 05/08/16 SMI@(#)va_list.h 1.15 04/11/19 SMI@(#)stdio_tag.h 1.4 04/09/28 SMI@(#)stdio_impl.h 1.15 07/03/05 SMI@(#)stdio_c99.h 1.2 04/03/29 SMI@(#)stdlib.h 1.51 04/06/30 SMI@(#)stdlib_iso.h 1.9 04/09/28 SMI@(#)stdlib_c99.h 1.2 04/03/29 SMI@(#)string.h 1.27 07/01/14 SMI@(#)string_iso.h 1.5 04/06/18 SMI@(#)ctype.h 1.35 04/09/28 SMI@(#)ctype_iso.h 1.3 04/09/28 SMI@(#)ctype_c99.h 1.2 04/09/28 SMI@(#)limits.h 1.59 04/08/24 SMI@(#)limits_iso.h 1.2 03/12/04 SMI@(#)int_limits.h 1.9 04/09/28 SMI@(#)stddef.h 1.18 04/09/28 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stddef_iso.h 1.2 03/03/06 SMI@(#)stdio.h 1.84 04/09/28 SMI@(#)feature_tests.h 1.25 07/02/02 SMI@(#)ccompile.h 1.2 04/11/08 SMI@(#)stdio_iso.h 1.8 05/08/16 SMI@(#)va_list.h 1.15 04/11/19 SMI@(#)stdio_tag.h 1.4 04/09/28 SMI@(#)stdio_impl.h 1.15 07/03/05 SMI@(#)stdio_c99.h 1.2 04/03/29 SMI@(#)stdlib.h 1.51 04/06/30 SMI@(#)stdlib_iso.h 1.9 04/09/28 SMI@(#)stdlib_c99.h 1.2 04/03/29 SMI@(#)stddef.h 1.18 04/09/28 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stddef_iso.h 1.2 03/03/06 SMI@(#)stdio.h 1.84 04/09/28 SMI@(#)feature_tests.h 1.25 07/02/02 SMI@(#)ccompile.h 1.2 04/11/08 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stdio_iso.h 1.8 05/08/16 SMI@(#)va_list.h 1.15 04/11/19 SMI@(#)stdio_tag.h 1.4 04/09/28 SMI@(#)stdio_impl.h 1.15 07/03/05 SMI@(#)stdio_c99.h 1.2 04/03/29 SMI@(#)stdlib.h 1.51 04/06/30 SMI@(#)stdlib_iso.h 1.9 04/09/28 SMI@(#)stdlib_c99.h 1.2 04/03/29 SMI@(#)string.h 1.27 07/01/14 SMI@(#)string_iso.h 1.5 04/06/18 SMI@(#)limits.h 1.59 04/08/24 SMI@(#)limits_iso.h 1.2 03/12/04 SMI@(#)int_limits.h 1.9 04/09/28 SMI@(#)stddef.h 1.18 04/09/28 SMI@(#)stddef_iso.h 1.2 03/03/06 SMI@(#)stdio.h 1.84 04/09/28 SMI@(#)feature_tests.h 1.25 07/02/02 SMI@(#)ccompile.h 1.2 04/11/08 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stdio_iso.h 1.8 05/08/16 SMI@(#)va_list.h 1.15 04/11/19 SMI@(#)stdio_tag.h 1.4 04/09/28 SMI@(#)stdio_impl.h 1.15 07/03/05 SMI@(#)stdio_c99.h 1.2 04/03/29 SMI@(#)string.h 1.27 07/01/14 SMI@(#)string_iso.h 1.5 04/06/18 SMI@(#)stdio.h 1.84 04/09/28 SMI@(#)feature_tests.h 1.25 07/02/02 SMI@(#)ccompile.h 1.2 04/11/08 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stdio_iso.h 1.8 05/08/16 SMI@(#)va_list.h 1.15 04/11/19 SMI@(#)stdio_tag.h 1.4 04/09/28 SMI@(#)stdio_impl.h 1.15 07/03/05 SMI@(#)stdio_c99.h 1.2 04/03/29 SMI@(#)string.h 1.27 07/01/14 SMI@(#)string_iso.h 1.5 04/06/18 SMI@(#)stdio.h 1.84 04/09/28 SMI@(#)feature_tests.h 1.25 07/02/02 SMI@(#)ccompile.h 1.2 04/11/08 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stdio_iso.h 1.8 05/08/16 SMI@(#)va_list.h 1.15 04/11/19 SMI@(#)stdio_tag.h 1.4 04/09/28 SMI@(#)stdio_impl.h 1.15 07/03/05 SMI@(#)stdio_c99.h 1.2 04/03/29 SMI@(#)stdlib.h 1.51 04/06/30 SMI@(#)stdlib_iso.h 1.9 04/09/28 SMI@(#)stdlib_c99.h 1.2 04/03/29 SMI@(#)string.h 1.27 07/01/14 SMI@(#)string_iso.h 1.5 04/06/18 SMI@(#)time.h 1.45 08/01/09 SMI@(#)time_iso.h 1.4 04/09/07 SMI@(#)types.h 1.86 07/09/20 SMI@(#)machtypes.h 1.13 99/05/04 SMI@(#)int_types.h 1.10 04/09/28 SMI@(#)select.h 1.19 04/01/28 SMI@(#)time_impl.h 1.11 05/05/19 SMI@(#)time.h 2.77 09/06/02 SMI@(#)math.h 2.24 04/10/23 SMI@(#)math_iso.h 1.9 04/10/23 SMI@(#)math_c99.h 1.9 04/11/01 SMI@(#)limits.h 1.59 04/08/24 SMI@(#)limits_iso.h 1.2 03/12/04 SMI@(#)int_limits.h 1.9 04/09/28 SMI@(#)stdio.h 1.84 04/09/28 SMI@(#)feature_tests.h 1.25 07/02/02 SMI@(#)ccompile.h 1.2 04/11/08 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stdio_iso.h 1.8 05/08/16 SMI@(#)va_list.h 1.15 04/11/19 SMI@(#)stdio_tag.h 1.4 04/09/28 SMI@(#)stdio_impl.h 1.15 07/03/05 SMI@(#)stdio_c99.h 1.2 04/03/29 SMI@(#)string.h 1.27 07/01/14 SMI@(#)string_iso.h 1.5 04/06/18 SMI@(#)ctype.h 1.35 04/09/28 SMI@(#)ctype_iso.h 1.3 04/09/28 SMI@(#)ctype_c99.h 1.2 04/09/28 SMI@(#)assert.h 1.10 04/05/18 SMI@(#)limits.h 1.59 04/08/24 SMI@(#)limits_iso.h 1.2 03/12/04 SMI@(#)int_limits.h 1.9 04/09/28 SMI@(#)stdio.h 1.84 04/09/28 SMI@(#)feature_tests.h 1.25 07/02/02 SMI@(#)ccompile.h 1.2 04/11/08 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stdio_iso.h 1.8 05/08/16 SMI@(#)va_list.h 1.15 04/11/19 SMI@(#)stdio_tag.h 1.4 04/09/28 SMI@(#)stdio_impl.h 1.15 07/03/05 SMI@(#)stdio_c99.h 1.2 04/03/29 SMI@(#)stdlib.h 1.51 04/06/30 SMI@(#)stdlib_iso.h 1.9 04/09/28 SMI@(#)stdlib_c99.h 1.2 04/03/29 SMI@(#)string.h 1.27 07/01/14 SMI@(#)string_iso.h 1.5 04/06/18 SMI@(#)stdio.h 1.84 04/09/28 SMI@(#)feature_tests.h 1.25 07/02/02 SMI@(#)ccompile.h 1.2 04/11/08 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stdio_iso.h 1.8 05/08/16 SMI@(#)va_list.h 1.15 04/11/19 SMI@(#)stdio_tag.h 1.4 04/09/28 SMI@(#)stdio_impl.h 1.15 07/03/05 SMI@(#)stdio_c99.h 1.2 04/03/29 SMIacomp: Sun C 5.11 SunOS_sparc 145354-01 2010/10/11@(#)stdio.h 1.84 04/09/28 SMI@(#)feature_tests.h 1.25 07/02/02 SMI@(#)ccompile.h 1.2 04/11/08 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stdio_iso.h 1.8 05/08/16 SMI@(#)va_list.h 1.15 04/11/19 SMI@(#)stdio_tag.h 1.4 04/09/28 SMI@(#)stdio_impl.h 1.15 07/03/05 SMI@(#)stdio_c99.h 1.2 04/03/29 SMIacomp: Sun C 5.11 SunOS_sparc 145354-01 2010/10/11@(#)stddef.h 1.18 04/09/28 SMI@(#)isa_defs.h 1.29 08/06/06 SMI@(#)stddef_iso.h 1.2 03/03/06 SMI@(#)stdio.h 1.84 04/09/28 SMI@(#)feature_tests.h 1.25 07/02/02 SMI@(#)ccompile.h 1.2 04/11/08 SMI@(#)stdio_iso.h 1.8 05/08/16 SMI@(#)va_list.h 1.15 04/11/19 SMI@(#)stdio_tag.h 1.4 04/09/28 SMI@(#)stdio_impl.h 1.15 07/03/05 SMI@(#)stdio_c99.h 1.2 04/03/29 SMI@(#)string.h 1.27 07/01/14 SMI@(#)string_iso.h 1.5 04/06/18 SMI@(#)assert.h 1.10 04/05/18 SMIld: Software Generation Utilities - Solaris Link Editors: 5.10-1.500 PositionReverseIteratoraPositionIteratorPositionsB__FILEvstd}'PositionIterator PositionReverseIterator$PositionsPositionStringParserpOption_Type__FILEstd wOptions"option> @Keyword #PositionIteratorPositionReverseIteratorPositionsKeywordExtKeyword_Factory__FILE;stda__CrunS` KeywordKeyword_ListKKeywordExtKeywordExt_List Keyword_Comparison^-__FILEstdKeyword\Keyword_FactorysKeyword_ListtInput\PositionIteratorPositionReverseIteratorGPositions+bOption_TypeOptionsBool_Arrayo__FILEstd PositionIterator PositionReverseIteratorPositionsOption_TypehOptionsKeywordPositionIterator PositionReverseIteratorPositions hKeywordExt Hash_Tableh__FILEstd65ZKeywordKeyword_List >PositionIterator PositionReverseIteratorPositions =KeywordExtKeywordExt_ListBool_ArraystdD__CrunPOption_TypeEOptionsfk ;UKeyword}Keyword_FactoryKeywordExt_FactoryH__FILE|std Keyword_List InputPositionIteratorPositionReverseIterator Positions|KeywordExtKeywordExt_ListBool_ArraySearch$Output8Option_Type-fOptions5H__FILEstd7}''q__STATIC_CONSTRUCTOR0> @sort_char_set(S` 3merge^-pretty_input_file_nameKis_declarationis_declaration_with_argis_define_declaration]5Z?delete_partition@iless_by_hash_value@equalsSGsmallest_integral_typesmallest_integral_type/Ooutput_upperlower_table/output_upperlower_strcmp/output_upperlower_strncmp0output_upperlower_memcmp0Woutput_string0output_line_directive1boutput_const_type:@output_keyword_entry:output_keyword_blank_entries;output_switch_case