pmodules/bash
0
0
Fork 0
mirror of https://https.git.savannah.gnu.org/git/bash.git synced 2026-07-15 16:10:50 +02:00
Code Issues Packages Projects Releases Wiki Activity

commit bash-20091015 snapshot

Browse Source
This commit is contained in:
Chet Ramey
2011-12-08 20:18:35 -05:00
parent d5362af881
commit e1e48bbabe
99 changed files with 30476 additions and 24169 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lib/glob/glob.c
+1 -1
View File
@@ -1030,7 +1030,7 @@ glob_filename (pathname, flags)
dflags |= GX_ALLDIRS|GX_ADDCURDIR;
#if 0
/* If we want all directories (dflags & GX_ALLDIRS) and we're not
being called recursively as something like `echo [star][star]/*.o'
being called recursively as something like `echo **/*.o'
((flags & GX_ALLDIRS) == 0), we want to prevent glob_vector from
adding a null directory name to the front of the temp_results
array. We turn off ADDCURDIR if not called recursively and
lib/readline/COPYING
-674
View File
@@ -1,674 +0,0 @@
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>.
lib/readline/COPYING
Symlink
+1
View File
@@ -0,0 +1 @@
../../COPYING
lib/readline/ansi_stdlib.h
-54
View File
@@ -1,54 +0,0 @@
/* ansi_stdlib.h -- An ANSI Standard stdlib.h. */
/* A minimal stdlib.h containing extern declarations for those functions
that bash uses. */
/* Copyright (C) 1993 Free Software Foundation, Inc.
This file is part of GNU Bash, the Bourne Again SHell.
Bash 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.
Bash 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 Bash. If not, see <http://www.gnu.org/licenses/>.
*/
#if !defined (_STDLIB_H_)
#define _STDLIB_H_ 1
/* String conversion functions. */
extern int atoi ();
extern double atof ();
extern double strtod ();
/* Memory allocation functions. */
/* Generic pointer type. */
#ifndef PTR_T
#if defined (__STDC__)
# define PTR_T void *
#else
# define PTR_T char *
#endif
#endif /* PTR_T */
extern PTR_T malloc ();
extern PTR_T realloc ();
extern void free ();
/* Other miscellaneous functions. */
extern void abort ();
extern void exit ();
extern char *getenv ();
extern void qsort ();
#endif /* _STDLIB_H */
lib/readline/ansi_stdlib.h
Symlink
+1
View File
@@ -0,0 +1 @@
../../include/ansi_stdlib.h
lib/readline/doc/fdl.texi
-506
View File
@@ -1,506 +0,0 @@
@c The GNU Free Documentation License.
@center Version 1.3, 3 November 2008
@c This file is intended to be included within another document,
@c hence no sectioning command or @node.
@display
Copyright @copyright{} 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
@uref{http://fsf.org/}
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
@end display
@enumerate 0
@item
PREAMBLE
The purpose of this License is to make a manual, textbook, or other
functional and useful document @dfn{free} in the sense of freedom: to
assure everyone the effective freedom to copy and redistribute it,
with or without modifying it, either commercially or noncommercially.
Secondarily, this License preserves for the author and publisher a way
to get credit for their work, while not being considered responsible
for modifications made by others.
This License is a kind of ``copyleft'', which means that derivative
works of the document must themselves be free in the same sense. It
complements the GNU General Public License, which is a copyleft
license designed for free software.
We have designed this License in order to use it for manuals for free
software, because free software needs free documentation: a free
program should come with manuals providing the same freedoms that the
software does. But this License is not limited to software manuals;
it can be used for any textual work, regardless of subject matter or
whether it is published as a printed book. We recommend this License
principally for works whose purpose is instruction or reference.
@item
APPLICABILITY AND DEFINITIONS
This License applies to any manual or other work, in any medium, that
contains a notice placed by the copyright holder saying it can be
distributed under the terms of this License. Such a notice grants a
world-wide, royalty-free license, unlimited in duration, to use that
work under the conditions stated herein. The ``Document'', below,
refers to any such manual or work. Any member of the public is a
licensee, and is addressed as ``you''. You accept the license if you
copy, modify or distribute the work in a way requiring permission
under copyright law.
A ``Modified Version'' of the Document means any work containing the
Document or a portion of it, either copied verbatim, or with
modifications and/or translated into another language.
A ``Secondary Section'' is a named appendix or a front-matter section
of the Document that deals exclusively with the relationship of the
publishers or authors of the Document to the Document's overall
subject (or to related matters) and contains nothing that could fall
directly within that overall subject. (Thus, if the Document is in
part a textbook of mathematics, a Secondary Section may not explain
any mathematics.) The relationship could be a matter of historical
connection with the subject or with related matters, or of legal,
commercial, philosophical, ethical or political position regarding
them.
The ``Invariant Sections'' are certain Secondary Sections whose titles
are designated, as being those of Invariant Sections, in the notice
that says that the Document is released under this License. If a
section does not fit the above definition of Secondary then it is not
allowed to be designated as Invariant. The Document may contain zero
Invariant Sections. If the Document does not identify any Invariant
Sections then there are none.
The ``Cover Texts'' are certain short passages of text that are listed,
as Front-Cover Texts or Back-Cover Texts, in the notice that says that
the Document is released under this License. A Front-Cover Text may
be at most 5 words, and a Back-Cover Text may be at most 25 words.
A ``Transparent'' copy of the Document means a machine-readable copy,
represented in a format whose specification is available to the
general public, that is suitable for revising the document
straightforwardly with generic text editors or (for images composed of
pixels) generic paint programs or (for drawings) some widely available
drawing editor, and that is suitable for input to text formatters or
for automatic translation to a variety of formats suitable for input
to text formatters. A copy made in an otherwise Transparent file
format whose markup, or absence of markup, has been arranged to thwart
or discourage subsequent modification by readers is not Transparent.
An image format is not Transparent if used for any substantial amount
of text. A copy that is not ``Transparent'' is called ``Opaque''.
Examples of suitable formats for Transparent copies include plain
@sc{ascii} without markup, Texinfo input format, La@TeX{} input
format, @acronym{SGML} or @acronym{XML} using a publicly available
@acronym{DTD}, and standard-conforming simple @acronym{HTML},
PostScript or @acronym{PDF} designed for human modification. Examples
of transparent image formats include @acronym{PNG}, @acronym{XCF} and
@acronym{JPG}. Opaque formats include proprietary formats that can be
read and edited only by proprietary word processors, @acronym{SGML} or
@acronym{XML} for which the @acronym{DTD} and/or processing tools are
not generally available, and the machine-generated @acronym{HTML},
PostScript or @acronym{PDF} produced by some word processors for
output purposes only.
The ``Title Page'' means, for a printed book, the title page itself,
plus such following pages as are needed to hold, legibly, the material
this License requires to appear in the title page. For works in
formats which do not have any title page as such, ``Title Page'' means
the text near the most prominent appearance of the work's title,
preceding the beginning of the body of the text.
The ``publisher'' means any person or entity that distributes copies
of the Document to the public.
A section ``Entitled XYZ'' means a named subunit of the Document whose
title either is precisely XYZ or contains XYZ in parentheses following
text that translates XYZ in another language. (Here XYZ stands for a
specific section name mentioned below, such as ``Acknowledgements'',
``Dedications'', ``Endorsements'', or ``History''.) To ``Preserve the Title''
of such a section when you modify the Document means that it remains a
section ``Entitled XYZ'' according to this definition.
The Document may include Warranty Disclaimers next to the notice which
states that this License applies to the Document. These Warranty
Disclaimers are considered to be included by reference in this
License, but only as regards disclaiming warranties: any other
implication that these Warranty Disclaimers may have is void and has
no effect on the meaning of this License.
@item
VERBATIM COPYING
You may copy and distribute the Document in any medium, either
commercially or noncommercially, provided that this License, the
copyright notices, and the license notice saying this License applies
to the Document are reproduced in all copies, and that you add no other
conditions whatsoever to those of this License. You may not use
technical measures to obstruct or control the reading or further
copying of the copies you make or distribute. However, you may accept
compensation in exchange for copies. If you distribute a large enough
number of copies you must also follow the conditions in section 3.
You may also lend copies, under the same conditions stated above, and
you may publicly display copies.
@item
COPYING IN QUANTITY
If you publish printed copies (or copies in media that commonly have
printed covers) of the Document, numbering more than 100, and the
Document's license notice requires Cover Texts, you must enclose the
copies in covers that carry, clearly and legibly, all these Cover
Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
the back cover. Both covers must also clearly and legibly identify
you as the publisher of these copies. The front cover must present
the full title with all words of the title equally prominent and
visible. You may add other material on the covers in addition.
Copying with changes limited to the covers, as long as they preserve
the title of the Document and satisfy these conditions, can be treated
as verbatim copying in other respects.
If the required texts for either cover are too voluminous to fit
legibly, you should put the first ones listed (as many as fit
reasonably) on the actual cover, and continue the rest onto adjacent
pages.
If you publish or distribute Opaque copies of the Document numbering
more than 100, you must either include a machine-readable Transparent
copy along with each Opaque copy, or state in or with each Opaque copy
a computer-network location from which the general network-using
public has access to download using public-standard network protocols
a complete Transparent copy of the Document, free of added material.
If you use the latter option, you must take reasonably prudent steps,
when you begin distribution of Opaque copies in quantity, to ensure
that this Transparent copy will remain thus accessible at the stated
location until at least one year after the last time you distribute an
Opaque copy (directly or through your agents or retailers) of that
edition to the public.
It is requested, but not required, that you contact the authors of the
Document well before redistributing any large number of copies, to give
them a chance to provide you with an updated version of the Document.
@item
MODIFICATIONS
You may copy and distribute a Modified Version of the Document under
the conditions of sections 2 and 3 above, provided that you release
the Modified Version under precisely this License, with the Modified
Version filling the role of the Document, thus licensing distribution
and modification of the Modified Version to whoever possesses a copy
of it. In addition, you must do these things in the Modified Version:
@enumerate A
@item
Use in the Title Page (and on the covers, if any) a title distinct
from that of the Document, and from those of previous versions
(which should, if there were any, be listed in the History section
of the Document). You may use the same title as a previous version
if the original publisher of that version gives permission.
@item
List on the Title Page, as authors, one or more persons or entities
responsible for authorship of the modifications in the Modified
Version, together with at least five of the principal authors of the
Document (all of its principal authors, if it has fewer than five),
unless they release you from this requirement.
@item
State on the Title page the name of the publisher of the
Modified Version, as the publisher.
@item
Preserve all the copyright notices of the Document.
@item
Add an appropriate copyright notice for your modifications
adjacent to the other copyright notices.
@item
Include, immediately after the copyright notices, a license notice
giving the public permission to use the Modified Version under the
terms of this License, in the form shown in the Addendum below.
@item
Preserve in that license notice the full lists of Invariant Sections
and required Cover Texts given in the Document's license notice.
@item
Include an unaltered copy of this License.
@item
Preserve the section Entitled ``History'', Preserve its Title, and add
to it an item stating at least the title, year, new authors, and
publisher of the Modified Version as given on the Title Page. If
there is no section Entitled ``History'' in the Document, create one
stating the title, year, authors, and publisher of the Document as
given on its Title Page, then add an item describing the Modified
Version as stated in the previous sentence.
@item
Preserve the network location, if any, given in the Document for
public access to a Transparent copy of the Document, and likewise
the network locations given in the Document for previous versions
it was based on. These may be placed in the ``History'' section.
You may omit a network location for a work that was published at
least four years before the Document itself, or if the original
publisher of the version it refers to gives permission.
@item
For any section Entitled ``Acknowledgements'' or ``Dedications'', Preserve
the Title of the section, and preserve in the section all the
substance and tone of each of the contributor acknowledgements and/or
dedications given therein.
@item
Preserve all the Invariant Sections of the Document,
unaltered in their text and in their titles. Section numbers
or the equivalent are not considered part of the section titles.
@item
Delete any section Entitled ``Endorsements''. Such a section
may not be included in the Modified Version.
@item
Do not retitle any existing section to be Entitled ``Endorsements'' or
to conflict in title with any Invariant Section.
@item
Preserve any Warranty Disclaimers.
@end enumerate
If the Modified Version includes new front-matter sections or
appendices that qualify as Secondary Sections and contain no material
copied from the Document, you may at your option designate some or all
of these sections as invariant. To do this, add their titles to the
list of Invariant Sections in the Modified Version's license notice.
These titles must be distinct from any other section titles.
You may add a section Entitled ``Endorsements'', provided it contains
nothing but endorsements of your Modified Version by various
parties---for example, statements of peer review or that the text has
been approved by an organization as the authoritative definition of a
standard.
You may add a passage of up to five words as a Front-Cover Text, and a
passage of up to 25 words as a Back-Cover Text, to the end of the list
of Cover Texts in the Modified Version. Only one passage of
Front-Cover Text and one of Back-Cover Text may be added by (or
through arrangements made by) any one entity. If the Document already
includes a cover text for the same cover, previously added by you or
by arrangement made by the same entity you are acting on behalf of,
you may not add another; but you may replace the old one, on explicit
permission from the previous publisher that added the old one.
The author(s) and publisher(s) of the Document do not by this License
give permission to use their names for publicity for or to assert or
imply endorsement of any Modified Version.
@item
COMBINING DOCUMENTS
You may combine the Document with other documents released under this
License, under the terms defined in section 4 above for modified
versions, provided that you include in the combination all of the
Invariant Sections of all of the original documents, unmodified, and
list them all as Invariant Sections of your combined work in its
license notice, and that you preserve all their Warranty Disclaimers.
The combined work need only contain one copy of this License, and
multiple identical Invariant Sections may be replaced with a single
copy. If there are multiple Invariant Sections with the same name but
different contents, make the title of each such section unique by
adding at the end of it, in parentheses, the name of the original
author or publisher of that section if known, or else a unique number.
Make the same adjustment to the section titles in the list of
Invariant Sections in the license notice of the combined work.
In the combination, you must combine any sections Entitled ``History''
in the various original documents, forming one section Entitled
``History''; likewise combine any sections Entitled ``Acknowledgements'',
and any sections Entitled ``Dedications''. You must delete all
sections Entitled ``Endorsements.''
@item
COLLECTIONS OF DOCUMENTS
You may make a collection consisting of the Document and other documents
released under this License, and replace the individual copies of this
License in the various documents with a single copy that is included in
the collection, provided that you follow the rules of this License for
verbatim copying of each of the documents in all other respects.
You may extract a single document from such a collection, and distribute
it individually under this License, provided you insert a copy of this
License into the extracted document, and follow this License in all
other respects regarding verbatim copying of that document.
@item
AGGREGATION WITH INDEPENDENT WORKS
A compilation of the Document or its derivatives with other separate
and independent documents or works, in or on a volume of a storage or
distribution medium, is called an ``aggregate'' if the copyright
resulting from the compilation is not used to limit the legal rights
of the compilation's users beyond what the individual works permit.
When the Document is included in an aggregate, this License does not
apply to the other works in the aggregate which are not themselves
derivative works of the Document.
If the Cover Text requirement of section 3 is applicable to these
copies of the Document, then if the Document is less than one half of
the entire aggregate, the Document's Cover Texts may be placed on
covers that bracket the Document within the aggregate, or the
electronic equivalent of covers if the Document is in electronic form.
Otherwise they must appear on printed covers that bracket the whole
aggregate.
@item
TRANSLATION
Translation is considered a kind of modification, so you may
distribute translations of the Document under the terms of section 4.
Replacing Invariant Sections with translations requires special
permission from their copyright holders, but you may include
translations of some or all Invariant Sections in addition to the
original versions of these Invariant Sections. You may include a
translation of this License, and all the license notices in the
Document, and any Warranty Disclaimers, provided that you also include
the original English version of this License and the original versions
of those notices and disclaimers. In case of a disagreement between
the translation and the original version of this License or a notice
or disclaimer, the original version will prevail.
If a section in the Document is Entitled ``Acknowledgements'',
``Dedications'', or ``History'', the requirement (section 4) to Preserve
its Title (section 1) will typically require changing the actual
title.
@item
TERMINATION
You may not copy, modify, sublicense, or distribute the Document
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense, or distribute it is void, and
will automatically terminate your rights under this License.
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, receipt of a copy of some or all of the same material does
not give you any rights to use it.
@item
FUTURE REVISIONS OF THIS LICENSE
The Free Software Foundation may publish new, revised versions
of the GNU Free Documentation License from time to time. Such new
versions will be similar in spirit to the present version, but may
differ in detail to address new problems or concerns. See
@uref{http://www.gnu.org/copyleft/}.
Each version of the License is given a distinguishing version number.
If the Document specifies that a particular numbered version of this
License ``or any later version'' applies to it, you have the option of
following the terms and conditions either of that specified version or
of any later version that has been published (not as a draft) by the
Free Software Foundation. If the Document does not specify a version
number of this License, you may choose any version ever published (not
as a draft) by the Free Software Foundation. If the Document
specifies that a proxy can decide which future versions of this
License can be used, that proxy's public statement of acceptance of a
version permanently authorizes you to choose that version for the
Document.
@item
RELICENSING
``Massive Multiauthor Collaboration Site'' (or ``MMC Site'') means any
World Wide Web server that publishes copyrightable works and also
provides prominent facilities for anybody to edit those works. A
public wiki that anybody can edit is an example of such a server. A
``Massive Multiauthor Collaboration'' (or ``MMC'') contained in the
site means any set of copyrightable works thus published on the MMC
site.
``CC-BY-SA'' means the Creative Commons Attribution-Share Alike 3.0
license published by Creative Commons Corporation, a not-for-profit
corporation with a principal place of business in San Francisco,
California, as well as future copyleft versions of that license
published by that same organization.
``Incorporate'' means to publish or republish a Document, in whole or
in part, as part of another Document.
An MMC is ``eligible for relicensing'' if it is licensed under this
License, and if all works that were first published under this License
somewhere other than this MMC, and subsequently incorporated in whole
or in part into the MMC, (1) had no cover texts or invariant sections,
and (2) were thus incorporated prior to November 1, 2008.
The operator of an MMC Site may republish an MMC contained in the site
under CC-BY-SA on the same site at any time before August 1, 2009,
provided the MMC is eligible for relicensing.
@end enumerate
@page
@heading ADDENDUM: How to use this License for your documents
To use this License in a document you have written, include a copy of
the License in the document and put the following copyright and
license notices just after the title page:
@smallexample
@group
Copyright (C) @var{year} @var{your name}.
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.3
or any later version published by the Free Software Foundation;
with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
Texts. A copy of the license is included in the section entitled ``GNU
Free Documentation License''.
@end group
@end smallexample
If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
replace the ``with@dots{}Texts.'' line with this:
@smallexample
@group
with the Invariant Sections being @var{list their titles}, with
the Front-Cover Texts being @var{list}, and with the Back-Cover Texts
being @var{list}.
@end group
@end smallexample
If you have Invariant Sections without Cover Texts, or some other
combination of the three, merge those two alternatives to suit the
situation.
If your document contains nontrivial examples of program code, we
recommend releasing these examples in parallel under your choice of
free software license, such as the GNU General Public License,
to permit their use in free software.
@c Local Variables:
@c ispell-local-pdict: "ispell-dict"
@c End:
lib/readline/doc/fdl.texi
Symlink
+1
View File
@@ -0,0 +1 @@
../../../doc/fdl.texi
lib/readline/doc/history.dvi
BIN
View File
Binary file not shown.
lib/readline/doc/history.html
+3 -3
View File
@@ -1,6 +1,6 @@
<HTML>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<!-- Created on March, 18 2009 by texi2html 1.64 -->
<!-- Created on October, 12 2009 by texi2html 1.64 -->
<!--
Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author)
Karl Berry <karl@freefriends.org>
@@ -2115,7 +2115,7 @@ to permit their use in free software.
<TD VALIGN="MIDDLE" ALIGN="LEFT">[<A HREF="history.html#SEC_About"> ? </A>]</TD>
</TR></TABLE>
<H1>About this document</H1>
This document was generated by <I>Chet Ramey</I> on <I>March, 18 2009</I>
This document was generated by <I>Chet Ramey</I> on <I>October, 12 2009</I>
using <A HREF="http://www.mathematik.uni-kl.de/~obachman/Texi2html
"><I>texi2html</I></A>
<P></P>
@@ -2277,7 +2277,7 @@ the following structure:
<BR>
<FONT SIZE="-1">
This document was generated
by <I>Chet Ramey</I> on <I>March, 18 2009</I>
by <I>Chet Ramey</I> on <I>October, 12 2009</I>
using <A HREF="http://www.mathematik.uni-kl.de/~obachman/Texi2html
"><I>texi2html</I></A>
lib/readline/doc/history.info
+25 -25
View File
@@ -1,9 +1,9 @@
This is history.info, produced by makeinfo version 4.13 from
./history.texi.
This document describes the GNU History library (version 6.0, 28
October 2008), a programming tool that provides a consistent user
interface for recalling lines of previously typed input.
This document describes the GNU History library (version 6.1, 9 October
2009), a programming tool that provides a consistent user interface for
recalling lines of previously typed input.
Copyright (C) 1988-2009 Free Software Foundation, Inc.
@@ -1368,27 +1368,27 @@ Appendix C Function and Variable Index

Tag Table:
Node: Top1269
Node: Using History Interactively1914
Node: History Interaction2422
Node: Event Designators3846
Node: Word Designators4781
Node: Modifiers6420
Node: Programming with GNU History7645
Node: Introduction to History8388
Node: History Storage10078
Node: History Functions11213
Node: Initializing History and State Management12202
Node: History List Management13014
Node: Information About the History List15046
Node: Moving Around the History List16543
Node: Searching the History List17544
Node: Managing the History File19476
Node: History Expansion21296
Node: History Variables23204
Node: History Programming Example26010
Node: GNU Free Documentation License28687
Node: Concept Index53878
Node: Function and Variable Index54583
Node: Top1268
Node: Using History Interactively1913
Node: History Interaction2421
Node: Event Designators3845
Node: Word Designators4780
Node: Modifiers6419
Node: Programming with GNU History7644
Node: Introduction to History8387
Node: History Storage10077
Node: History Functions11212
Node: Initializing History and State Management12201
Node: History List Management13013
Node: Information About the History List15045
Node: Moving Around the History List16542
Node: Searching the History List17543
Node: Managing the History File19475
Node: History Expansion21295
Node: History Variables23203
Node: History Programming Example26009
Node: GNU Free Documentation License28686
Node: Concept Index53877
Node: Function and Variable Index54582

End Tag Table
lib/readline/doc/history.log
+6 -6
View File
@@ -1,6 +1,6 @@
This is TeX, Version 3.141592 (Web2C 7.5.4) (format=tex 2008.12.11) 18 MAR 2009 08:22
**/Users/chet/src/bash/src/lib/readline/doc/history.texi
(/Users/chet/src/bash/src/lib/readline/doc/history.texi (./texinfo.tex
This is TeX, Version 3.141592 (Web2C 7.5.4) (format=tex 2008.12.11) 12 OCT 2009 10:10
**/usr/homes/chet/src/bash/src/lib/readline/doc/history.texi
(/usr/homes/chet/src/bash/src/lib/readline/doc/history.texi (./texinfo.tex
Loading texinfo [version 2009-01-18.17]:
\bindingoffset=\dimen16
\normaloffset=\dimen17
@@ -179,11 +179,11 @@ and turning on texinfo input format.) (./history.aux)
Appendix C [20] (./history.vrs) [21] )
Here is how much of TeX's memory you used:
1745 strings out of 97980
20831 string characters out of 1221004
66068 words of memory out of 1500000
20843 string characters out of 1221004
66066 words of memory out of 1500000
2572 multiletter control sequences out of 10000+50000
32127 words of font info for 112 fonts, out of 1200000 for 2000
51 hyphenation exceptions out of 8191
15i,6n,14p,325b,490s stack positions out of 5000i,500n,6000p,200000b,5000s
15i,6n,14p,329b,490s stack positions out of 5000i,500n,6000p,200000b,5000s
Output written on history.dvi (24 pages, 85440 bytes).
lib/readline/doc/history.ps
+10 -10
View File
@@ -11,7 +11,7 @@
%DVIPSWebPage: (www.radicaleye.com)
%DVIPSCommandLine: dvips -D 300 -o history.ps history.dvi
%DVIPSParameters: dpi=300
%DVIPSSource: TeX output 2009.03.18:0822
%DVIPSSource: TeX output 2009.10.12:1010
%%BeginProcSet: tex.pro 0 0
%!
/TeXDict 300 dict def TeXDict begin/N{def}def/B{bind def}N/S{exch}N/X{S
@@ -3205,19 +3205,19 @@ TeXDict begin
%%EndSetup
%%Page: 1 1
TeXDict begin 1 0 bop 75 659 a Fs(GNU)33 b(History)e(Library)p
75 709 1800 17 v 960 757 a Fr(Edition)14 b(6.0,)g(for)h
Fq(History)f(Library)g Fr(V)l(ersion)h(6.0.)1608 811
y(Octob)q(er)h(2008)75 2467 y Fp(Chet)22 b(Ramey)-6 b(,)23
75 709 1800 17 v 960 757 a Fr(Edition)14 b(6.1,)g(for)h
Fq(History)f(Library)g Fr(V)l(ersion)h(6.1.)1608 811
y(Octob)q(er)h(2009)75 2467 y Fp(Chet)22 b(Ramey)-6 b(,)23
b(Case)e(W)-6 b(estern)23 b(Reserv)n(e)f(Univ)n(ersit)n(y)75
2534 y(Brian)g(F)-6 b(o)n(x,)23 b(F)-6 b(ree)23 b(Soft)n(w)n(are)f(F)-6
b(oundation)p 75 2570 1800 9 v eop end
%%Page: 2 2
TeXDict begin 2 1 bop 75 1512 a Fr(This)17 b(do)q(cumen)o(t)i(describ)q
(es)f(the)g(GNU)g(History)f(library)f(\(v)o(ersion)h(6.0,)g(28)g(Octob)
q(er)i(2008\),)e(a)g(pro-)75 1567 y(gramming)10 b(to)q(ol)g(that)g(pro)
o(vides)h(a)g(consisten)o(t)f(user)i(in)o(terface)e(for)h(recalling)f
(lines)g(of)h(previously)g(t)o(yp)q(ed)75 1621 y(input.)75
1689 y(Cop)o(yrigh)o(t)301 1688 y(c)289 1689 y Fo(\015)k
TeXDict begin 2 1 bop 75 1512 a Fr(This)11 b(do)q(cumen)o(t)i(describ)q
(es)f(the)g(GNU)g(History)e(library)h(\(v)o(ersion)g(6.1,)g(9)g(Octob)q
(er)i(2009\),)d(a)i(program-)75 1567 y(ming)18 b(to)q(ol)g(that)h(pro)o
(vides)f(a)h(consisten)o(t)f(user)h(in)o(terface)f(for)h(recalling)e
(lines)i(of)f(previously)h(t)o(yp)q(ed)75 1621 y(input.)75
1689 y(Cop)o(yrigh)o(t)301 1688 y(c)289 1689 y Fo(\015)c
Fr(1988{2009)e(F)l(ree)i(Soft)o(w)o(are)f(F)l(oundation,)g(Inc.)75
1756 y(P)o(ermission)h(is)g(gran)o(ted)h(to)f(mak)o(e)h(and)g
(distribute)g(v)o(erbatim)e(copies)i(of)g(this)g(man)o(ual)f(pro)o
lib/readline/doc/readline.dvi
BIN
View File
Binary file not shown.
lib/readline/doc/readline.html
+700 -617
View File
File diff suppressed because it is too large Load Diff
lib/readline/doc/readline.info
+173 -106
View File
@@ -1,8 +1,8 @@
This is readline.info, produced by makeinfo version 4.13 from
./rlman.texi.
This manual describes the GNU Readline Library (version 6.0, 28 October
2008), a library which aids in the consistency of user interface across
This manual describes the GNU Readline Library (version 6.1, 9 October
2009), a library which aids in the consistency of user interface across
discrete programs which provide a command line interface.
Copyright (C) 1988-2009 Free Software Foundation, Inc.
@@ -441,11 +441,22 @@ Variable Settings
editing mode, where the keystrokes are most similar to Emacs.
This variable can be set to either `emacs' or `vi'.
`echo-control-characters'
When set to `on', on operating systems that indicate they
support it, readline echoes a character corresponding to a
signal generated from the keyboard. The default is `on'.
`enable-keypad'
When set to `on', Readline will try to enable the application
keypad when it is called. Some systems need this to enable
the arrow keys. The default is `off'.
`enable-meta-key'
When set to `on', Readline will try to enable any meta
modifier key the terminal claims to support when it is
called. On many terminals, the meta key is used to send
eight-bit characters. The default is `on'.
`expand-tilde'
If set to `on', tilde expansion is performed when Readline
attempts word completion. The default is `off'.
@@ -548,6 +559,19 @@ Variable Settings
be listed immediately instead of ringing the bell. The
default value is `off'.
`skip-completed-text'
If set to `on', this alters the default completion behavior
when inserting a single match into the line. It's only
active when performing completion in the middle of a word.
If enabled, readline does not insert characters from the
completion that match characters after point in the word
being completed, so portions of the word following the cursor
are not duplicated. For instance, if this is enabled,
attempting completion when the cursor is after the `e' in
`Makefile' will result in `Makefile' rather than
`Makefilefile', assuming there is a single possible
completion. The default value is `off'.
`visible-stats'
If set to `on', a character denoting a file's type is
appended to the filename when listing possible completions.
@@ -1162,6 +1186,11 @@ File: readline.info, Node: Commands For Completion, Next: Keyboard Macros, Pr
command is intended to be bound to <TAB>, but is unbound by
default.
`menu-complete-backward ()'
Identical to `menu-complete', but moves backward through the list
of possible completions, as if `menu-complete' had been given a
negative argument.
`delete-char-or-list ()'
Deletes the character under the cursor if not at the beginning or
end of the line (like `delete-char'). If at the end of the line,
@@ -1238,6 +1267,15 @@ File: readline.info, Node: Miscellaneous Commands, Prev: Keyboard Macros, Up:
of that character. A negative count searches for subsequent
occurrences.
`skip-csi-sequence ()'
Read enough characters to consume a multi-key sequence such as
those defined for keys like Home and End. Such sequences begin
with a Control Sequence Indicator (CSI), usually ESC-[. If this
sequence is bound to "\e[", keys producing such sequences will
have no effect unless explicitly bound to a readline command,
instead of inserting stray characters into the editing buffer.
This is unbound by default, but usually bound to ESC-[.
`insert-comment (M-#)'
Without a numeric argument, the value of the `comment-begin'
variable is inserted at the beginning of the current line. If a
@@ -1903,7 +1941,7 @@ which keymap to use.
-- Function: Keymap rl_make_bare_keymap (void)
Returns a new, empty keymap. The space for the keymap is
allocated with `malloc()'; the caller should free it by calling
`rl_discard_keymap()' when done.
`rl_free_keymap()' when done.
-- Function: Keymap rl_copy_keymap (Keymap map)
Return a new keymap which is a copy of MAP.
@@ -1915,7 +1953,12 @@ which keymap to use.
arguments.
-- Function: void rl_discard_keymap (Keymap keymap)
Free the storage associated with KEYMAP.
Free the storage associated with the data in KEYMAP. The caller
should free KEYMAP.
-- Function: void rl_free_keymap (Keymap keymap)
Free all storage associated with KEYMAP. This calls
`rl_discard_keymap' to free subordindate keymaps and macros.
Readline has several internal keymaps. These functions allow you to
change which keymap is active.
@@ -2930,6 +2973,21 @@ File: readline.info, Node: Completion Variables, Next: A Short Completion Exam
from the directory name, because its result will be passed
directly to `opendir()'.
-- Variable: rl_dequote_func_t * rl_filename_rewrite_hook
If non-zero, this is the address of a function called when reading
directory entries from the filesystem for completion and comparing
them to the partial word to be completed. The function should
perform any necesary application or system-specific conversion on
the filename, such as converting between character sets or
converting from a filesystem format to a character input format.
The function takes two arguments: FNAME, the filename to be
converted, and FNLEN, its length in bytes. It must either return
its first argument (if no conversion takes place) or the converted
filename in newly-allocated memory. The converted form is used to
compare against the word to be completed, and, if it matches, is
added to the list of matches. Readline will free the allocated
string.
-- Variable: rl_compdisp_func_t * rl_completion_display_matches_hook
If non-zero, then this is the address of a function to call when
completing a word would normally display the list of possible
@@ -4141,7 +4199,7 @@ Function and Variable Index
(line 45)
* delete-char (C-d): Commands For Text. (line 6)
* delete-char-or-list (): Commands For Completion.
(line 30)
(line 35)
* delete-horizontal-space (): Commands For Killing.
(line 37)
* digit-argument (M-0, M-1, ... M--): Numeric Arguments. (line 6)
@@ -4151,15 +4209,15 @@ Function and Variable Index
(line 14)
* downcase-word (M-l): Commands For Text. (line 45)
* dump-functions (): Miscellaneous Commands.
(line 61)
(line 70)
* dump-macros (): Miscellaneous Commands.
(line 73)
(line 82)
* dump-variables (): Miscellaneous Commands.
(line 67)
(line 76)
* editing-mode: Readline Init File Syntax.
(line 85)
* enable-keypad: Readline Init File Syntax.
(line 91)
(line 96)
* end-kbd-macro (C-x )): Keyboard Macros. (line 9)
* end-of-history (M->): Commands For History.
(line 22)
@@ -4167,32 +4225,32 @@ Function and Variable Index
* exchange-point-and-mark (C-x C-x): Miscellaneous Commands.
(line 36)
* expand-tilde: Readline Init File Syntax.
(line 96)
(line 107)
* forward-backward-delete-char (): Commands For Text. (line 15)
* forward-char (C-f): Commands For Moving. (line 12)
* forward-search-history (C-s): Commands For History.
(line 30)
* forward-word (M-f): Commands For Moving. (line 18)
* history-preserve-point: Readline Init File Syntax.
(line 100)
(line 111)
* history-search-backward (): Commands For History.
(line 50)
* history-search-forward (): Commands For History.
(line 45)
* history-size: Readline Init File Syntax.
(line 106)
(line 117)
* horizontal-scroll-mode: Readline Init File Syntax.
(line 111)
(line 122)
* input-meta: Readline Init File Syntax.
(line 118)
(line 129)
* insert-comment (M-#): Miscellaneous Commands.
(line 51)
(line 60)
* insert-completions (M-*): Commands For Completion.
(line 14)
* isearch-terminators: Readline Init File Syntax.
(line 125)
(line 136)
* keymap: Readline Init File Syntax.
(line 132)
(line 143)
* kill-line (C-k): Commands For Killing.
(line 6)
* kill-region (): Commands For Killing.
@@ -4202,15 +4260,17 @@ Function and Variable Index
* kill-word (M-d): Commands For Killing.
(line 19)
* mark-modified-lines: Readline Init File Syntax.
(line 145)
(line 156)
* mark-symlinked-directories: Readline Init File Syntax.
(line 150)
(line 161)
* match-hidden-files: Readline Init File Syntax.
(line 155)
(line 166)
* menu-complete (): Commands For Completion.
(line 18)
* menu-complete-backward (): Commands For Completion.
(line 30)
* meta-flag: Readline Init File Syntax.
(line 118)
(line 129)
* next-history (C-n): Commands For History.
(line 16)
* non-incremental-forward-search-history (M-n): Commands For History.
@@ -4218,10 +4278,10 @@ Function and Variable Index
* non-incremental-reverse-search-history (M-p): Commands For History.
(line 35)
* output-meta: Readline Init File Syntax.
(line 162)
(line 173)
* overwrite-mode (): Commands For Text. (line 53)
* page-completions: Readline Init File Syntax.
(line 167)
(line 178)
* possible-completions (M-?): Commands For Completion.
(line 11)
* prefix-meta (<ESC>): Miscellaneous Commands.
@@ -4236,7 +4296,7 @@ Function and Variable Index
* reverse-search-history (C-r): Commands For History.
(line 26)
* revert-all-at-newline: Readline Init File Syntax.
(line 177)
(line 188)
* revert-line (M-r): Miscellaneous Commands.
(line 25)
* rl_add_defun: Function Naming. (line 20)
@@ -4248,11 +4308,11 @@ Function and Variable Index
* rl_attempted_completion_function: Completion Variables.
(line 12)
* rl_attempted_completion_over: Completion Variables.
(line 210)
(line 225)
* rl_basic_quote_characters: Completion Variables.
(line 99)
(line 114)
* rl_basic_word_break_characters: Completion Variables.
(line 93)
(line 108)
* rl_begin_undo_group: Allowing Undoing. (line 29)
* rl_bind_key: Binding Keys. (line 22)
* rl_bind_key_if_unbound: Binding Keys. (line 32)
@@ -4285,39 +4345,39 @@ Function and Variable Index
* rl_complete_internal: Completion Functions.
(line 10)
* rl_completer_quote_characters: Completion Variables.
(line 116)
(line 131)
* rl_completer_word_break_characters: Completion Variables.
(line 102)
(line 117)
* rl_completion_append_character: Completion Variables.
(line 140)
(line 155)
* rl_completion_display_matches_hook: Completion Variables.
(line 80)
(line 95)
* rl_completion_entry_function <1>: How Completing Works.
(line 55)
* rl_completion_entry_function: Completion Variables.
(line 7)
* rl_completion_found_quote: Completion Variables.
(line 168)
(line 183)
* rl_completion_invoking_key: Completion Variables.
(line 233)
(line 248)
* rl_completion_mark_symlink_dirs: Completion Variables.
(line 175)
(line 190)
* rl_completion_matches: Completion Functions.
(line 45)
* rl_completion_mode: Completion Functions.
(line 37)
* rl_completion_query_items: Completion Variables.
(line 134)
(line 149)
* rl_completion_quote_character: Completion Variables.
(line 156)
(line 171)
* rl_completion_suppress_append: Completion Variables.
(line 150)
(line 165)
* rl_completion_suppress_quote: Completion Variables.
(line 162)
(line 177)
* rl_completion_type: Completion Variables.
(line 225)
(line 240)
* rl_completion_word_break_hook: Completion Variables.
(line 107)
(line 122)
* rl_copy_keymap: Keymaps. (line 17)
* rl_copy_text: Modifying Text. (line 15)
* rl_crlf: Redisplay. (line 30)
@@ -4347,19 +4407,22 @@ Function and Variable Index
* rl_explicit_arg: Readline Variables. (line 261)
* rl_extend_line_buffer: Utility Functions. (line 27)
* rl_filename_completion_desired: Completion Variables.
(line 190)
(line 205)
* rl_filename_completion_function: Completion Functions.
(line 59)
* rl_filename_dequoting_function: Completion Variables.
(line 37)
* rl_filename_quote_characters: Completion Variables.
(line 122)
(line 137)
* rl_filename_quoting_desired: Completion Variables.
(line 200)
(line 215)
* rl_filename_quoting_function: Completion Variables.
(line 24)
* rl_filename_rewrite_hook: Completion Variables.
(line 80)
* rl_forced_update_display: Redisplay. (line 11)
* rl_free: Utility Functions. (line 18)
* rl_free_keymap: Keymaps. (line 30)
* rl_free_line_state: Readline Signal Handling.
(line 72)
* rl_free_undo_list: Allowing Undoing. (line 45)
@@ -4370,9 +4433,9 @@ Function and Variable Index
* rl_funmap_names: Associating Function Names and Bindings.
(line 40)
* rl_generic_bind: Binding Keys. (line 89)
* rl_get_keymap: Keymaps. (line 32)
* rl_get_keymap_by_name: Keymaps. (line 38)
* rl_get_keymap_name: Keymaps. (line 43)
* rl_get_keymap: Keymaps. (line 37)
* rl_get_keymap_by_name: Keymaps. (line 43)
* rl_get_keymap_name: Keymaps. (line 48)
* rl_get_screen_size: Readline Signal Handling.
(line 108)
* rl_get_termcap: Miscellaneous Functions.
@@ -4381,11 +4444,11 @@ Function and Variable Index
* rl_getc_function: Readline Variables. (line 130)
* rl_gnu_readline_p: Readline Variables. (line 83)
* rl_ignore_completion_duplicates: Completion Variables.
(line 186)
(line 201)
* rl_ignore_some_completions_function: Completion Variables.
(line 56)
* rl_inhibit_completion: Completion Variables.
(line 239)
(line 254)
* rl_initialize: Utility Functions. (line 31)
* rl_insert_completions: Completion Functions.
(line 32)
@@ -4450,7 +4513,7 @@ Function and Variable Index
* rl_save_state: Utility Functions. (line 7)
* rl_set_key: Binding Keys. (line 73)
* rl_set_keyboard_input_timeout: Character Input. (line 35)
* rl_set_keymap: Keymaps. (line 35)
* rl_set_keymap: Keymaps. (line 40)
* rl_set_paren_blink_timeout: Miscellaneous Functions.
(line 37)
* rl_set_prompt: Redisplay. (line 78)
@@ -4460,9 +4523,9 @@ Function and Variable Index
(line 119)
* rl_show_char: Redisplay. (line 33)
* rl_sort_completion_matches: Completion Variables.
(line 217)
(line 232)
* rl_special_prefixes: Completion Variables.
(line 127)
(line 142)
* rl_startup_hook: Readline Variables. (line 115)
* rl_stuff_char: Character Input. (line 19)
* rl_terminal_name: Readline Variables. (line 87)
@@ -4484,9 +4547,13 @@ Function and Variable Index
* set-mark (C-@): Miscellaneous Commands.
(line 32)
* show-all-if-ambiguous: Readline Init File Syntax.
(line 183)
(line 194)
* show-all-if-unmodified: Readline Init File Syntax.
(line 189)
(line 200)
* skip-completed-text: Readline Init File Syntax.
(line 209)
* skip-csi-sequence (): Miscellaneous Commands.
(line 51)
* start-kbd-macro (C-x (): Keyboard Macros. (line 6)
* transpose-chars (C-t): Commands For Text. (line 30)
* transpose-words (M-t): Commands For Text. (line 36)
@@ -4501,7 +4568,7 @@ Function and Variable Index
(line 28)
* upcase-word (M-u): Commands For Text. (line 41)
* visible-stats: Readline Init File Syntax.
(line 198)
(line 222)
* yank (C-y): Commands For Killing.
(line 59)
* yank-last-arg (M-. or M-_): Commands For History.
@@ -4514,57 +4581,57 @@ Function and Variable Index

Tag Table:
Node: Top1285
Node: Command Line Editing1942
Node: Introduction and Notation2594
Node: Readline Interaction4217
Node: Readline Bare Essentials5409
Node: Readline Movement Commands7199
Node: Readline Killing Commands8165
Node: Readline Arguments10086
Node: Searching11131
Node: Readline Init File13283
Node: Readline Init File Syntax14437
Node: Conditional Init Constructs27390
Node: Sample Init File29924
Node: Bindable Readline Commands33042
Node: Commands For Moving34100
Node: Commands For History34962
Node: Commands For Text38087
Node: Commands For Killing40814
Node: Numeric Arguments42957
Node: Commands For Completion44097
Node: Keyboard Macros45642
Node: Miscellaneous Commands46214
Node: Readline vi Mode49576
Node: Programming with GNU Readline51400
Node: Basic Behavior52386
Node: Custom Functions55803
Node: Readline Typedefs57287
Node: Function Writing58926
Node: Readline Variables60233
Node: Readline Convenience Functions70899
Node: Function Naming71889
Node: Keymaps73151
Node: Binding Keys74923
Node: Associating Function Names and Bindings79470
Node: Allowing Undoing81755
Node: Redisplay84305
Node: Modifying Text88205
Node: Character Input89451
Node: Terminal Management91349
Node: Utility Functions92785
Node: Miscellaneous Functions95876
Node: Alternate Interface98173
Node: A Readline Example100332
Node: Readline Signal Handling102235
Node: Custom Completers108423
Node: How Completing Works109143
Node: Completion Functions112457
Node: Completion Variables116029
Node: A Short Completion Example129134
Node: GNU Free Documentation License141913
Node: Concept Index167106
Node: Function and Variable Index168627
Node: Top1284
Node: Command Line Editing1941
Node: Introduction and Notation2593
Node: Readline Interaction4216
Node: Readline Bare Essentials5408
Node: Readline Movement Commands7198
Node: Readline Killing Commands8164
Node: Readline Arguments10085
Node: Searching11130
Node: Readline Init File13282
Node: Readline Init File Syntax14436
Node: Conditional Init Constructs28642
Node: Sample Init File31176
Node: Bindable Readline Commands34294
Node: Commands For Moving35352
Node: Commands For History36214
Node: Commands For Text39339
Node: Commands For Killing42066
Node: Numeric Arguments44209
Node: Commands For Completion45349
Node: Keyboard Macros47087
Node: Miscellaneous Commands47659
Node: Readline vi Mode51516
Node: Programming with GNU Readline53340
Node: Basic Behavior54326
Node: Custom Functions57743
Node: Readline Typedefs59227
Node: Function Writing60866
Node: Readline Variables62173
Node: Readline Convenience Functions72839
Node: Function Naming73829
Node: Keymaps75091
Node: Binding Keys77084
Node: Associating Function Names and Bindings81631
Node: Allowing Undoing83916
Node: Redisplay86466
Node: Modifying Text90366
Node: Character Input91612
Node: Terminal Management93510
Node: Utility Functions94946
Node: Miscellaneous Functions98037
Node: Alternate Interface100334
Node: A Readline Example102493
Node: Readline Signal Handling104396
Node: Custom Completers110584
Node: How Completing Works111304
Node: Completion Functions114618
Node: Completion Variables118190
Node: A Short Completion Example132204
Node: GNU Free Documentation License144983
Node: Concept Index170176
Node: Function and Variable Index171697

End Tag Table
lib/readline/doc/readline.ps
+1189 -1102
View File
File diff suppressed because it is too large Load Diff
lib/readline/doc/rlman.aux
+2 -2
View File
@@ -30,9 +30,9 @@
@xrdef{Readline Init File Syntax-pg}{4}
@xrdef{Conditional Init Constructs-title}{Conditional Init Constructs}
@xrdef{Conditional Init Constructs-snt}{Section@tie 1.3.2}
@xrdef{Conditional Init Constructs-pg}{9}
@xrdef{Sample Init File-title}{Sample Init File}
@xrdef{Sample Init File-snt}{Section@tie 1.3.3}
@xrdef{Conditional Init Constructs-pg}{10}
@xrdef{Sample Init File-pg}{10}
@xrdef{Bindable Readline Commands-title}{Bindable Readline Commands}
@xrdef{Bindable Readline Commands-snt}{Section@tie 1.4}
@@ -57,9 +57,9 @@
@xrdef{Keyboard Macros-snt}{Section@tie 1.4.7}
@xrdef{Numeric Arguments-pg}{17}
@xrdef{Commands For Completion-pg}{17}
@xrdef{Keyboard Macros-pg}{17}
@xrdef{Miscellaneous Commands-title}{Some Miscellaneous Commands}
@xrdef{Miscellaneous Commands-snt}{Section@tie 1.4.8}
@xrdef{Keyboard Macros-pg}{18}
@xrdef{Miscellaneous Commands-pg}{18}
@xrdef{Readline vi Mode-title}{Readline vi Mode}
@xrdef{Readline vi Mode-snt}{Section@tie 1.5}
lib/readline/doc/rlman.fn
+16 -11
View File
@@ -6,7 +6,7 @@
\entry{convert-meta}{5}{convert-meta}
\entry{disable-completion}{5}{disable-completion}
\entry{editing-mode}{5}{editing-mode}
\entry{enable-keypad}{5}{enable-keypad}
\entry{enable-keypad}{6}{enable-keypad}
\entry{expand-tilde}{6}{expand-tilde}
\entry{history-preserve-point}{6}{history-preserve-point}
\entry{history-size}{6}{history-size}
@@ -15,7 +15,7 @@
\entry{meta-flag}{6}{meta-flag}
\entry{isearch-terminators}{6}{isearch-terminators}
\entry{keymap}{6}{keymap}
\entry{mark-modified-lines}{6}{mark-modified-lines}
\entry{mark-modified-lines}{7}{mark-modified-lines}
\entry{mark-symlinked-directories}{7}{mark-symlinked-directories}
\entry{match-hidden-files}{7}{match-hidden-files}
\entry{output-meta}{7}{output-meta}
@@ -23,7 +23,8 @@
\entry{revert-all-at-newline}{7}{revert-all-at-newline}
\entry{show-all-if-ambiguous}{7}{show-all-if-ambiguous}
\entry{show-all-if-unmodified}{7}{show-all-if-unmodified}
\entry{visible-stats}{7}{visible-stats}
\entry{skip-completed-text}{8}{skip-completed-text}
\entry{visible-stats}{8}{visible-stats}
\entry{beginning-of-line (C-a)}{13}{\code {beginning-of-line (C-a)}}
\entry{end-of-line (C-e)}{13}{\code {end-of-line (C-e)}}
\entry{forward-char (C-f)}{13}{\code {forward-char (C-f)}}
@@ -78,8 +79,9 @@
\entry{possible-completions (M-?)}{17}{\code {possible-completions (M-?)}}
\entry{insert-completions (M-*)}{17}{\code {insert-completions (M-*)}}
\entry{menu-complete ()}{17}{\code {menu-complete ()}}
\entry{menu-complete-backward ()}{17}{\code {menu-complete-backward ()}}
\entry{delete-char-or-list ()}{17}{\code {delete-char-or-list ()}}
\entry{start-kbd-macro (C-x ()}{17}{\code {start-kbd-macro (C-x ()}}
\entry{start-kbd-macro (C-x ()}{18}{\code {start-kbd-macro (C-x ()}}
\entry{end-kbd-macro (C-x ))}{18}{\code {end-kbd-macro (C-x ))}}
\entry{call-last-kbd-macro (C-x e)}{18}{\code {call-last-kbd-macro (C-x e)}}
\entry{re-read-init-file (C-x C-r)}{18}{\code {re-read-init-file (C-x C-r)}}
@@ -93,7 +95,8 @@
\entry{exchange-point-and-mark (C-x C-x)}{18}{\code {exchange-point-and-mark (C-x C-x)}}
\entry{character-search (C-])}{18}{\code {character-search (C-])}}
\entry{character-search-backward (M-C-])}{18}{\code {character-search-backward (M-C-])}}
\entry{insert-comment (M-#)}{18}{\code {insert-comment (M-#)}}
\entry{skip-csi-sequence ()}{19}{\code {skip-csi-sequence ()}}
\entry{insert-comment (M-#)}{19}{\code {insert-comment (M-#)}}
\entry{dump-functions ()}{19}{\code {dump-functions ()}}
\entry{dump-variables ()}{19}{\code {dump-variables ()}}
\entry{dump-macros ()}{19}{\code {dump-macros ()}}
@@ -140,6 +143,7 @@
\entry{rl_copy_keymap}{28}{\code {rl_copy_keymap}}
\entry{rl_make_keymap}{28}{\code {rl_make_keymap}}
\entry{rl_discard_keymap}{28}{\code {rl_discard_keymap}}
\entry{rl_free_keymap}{28}{\code {rl_free_keymap}}
\entry{rl_get_keymap}{28}{\code {rl_get_keymap}}
\entry{rl_set_keymap}{28}{\code {rl_set_keymap}}
\entry{rl_get_keymap_by_name}{28}{\code {rl_get_keymap_by_name}}
@@ -257,9 +261,10 @@
\entry{rl_char_is_quoted_p}{44}{\code {rl_char_is_quoted_p}}
\entry{rl_ignore_some_completions_function}{44}{\code {rl_ignore_some_completions_function}}
\entry{rl_directory_completion_hook}{44}{\code {rl_directory_completion_hook}}
\entry{rl_filename_rewrite_hook}{44}{\code {rl_filename_rewrite_hook}}
\entry{rl_completion_display_matches_hook}{44}{\code {rl_completion_display_matches_hook}}
\entry{rl_basic_word_break_characters}{44}{\code {rl_basic_word_break_characters}}
\entry{rl_basic_quote_characters}{44}{\code {rl_basic_quote_characters}}
\entry{rl_basic_word_break_characters}{45}{\code {rl_basic_word_break_characters}}
\entry{rl_basic_quote_characters}{45}{\code {rl_basic_quote_characters}}
\entry{rl_completer_word_break_characters}{45}{\code {rl_completer_word_break_characters}}
\entry{rl_completion_word_break_hook}{45}{\code {rl_completion_word_break_hook}}
\entry{rl_completer_quote_characters}{45}{\code {rl_completer_quote_characters}}
@@ -267,16 +272,16 @@
\entry{rl_special_prefixes}{45}{\code {rl_special_prefixes}}
\entry{rl_completion_query_items}{45}{\code {rl_completion_query_items}}
\entry{rl_completion_append_character}{45}{\code {rl_completion_append_character}}
\entry{rl_completion_suppress_append}{45}{\code {rl_completion_suppress_append}}
\entry{rl_completion_quote_character}{45}{\code {rl_completion_quote_character}}
\entry{rl_completion_suppress_append}{46}{\code {rl_completion_suppress_append}}
\entry{rl_completion_quote_character}{46}{\code {rl_completion_quote_character}}
\entry{rl_completion_suppress_quote}{46}{\code {rl_completion_suppress_quote}}
\entry{rl_completion_found_quote}{46}{\code {rl_completion_found_quote}}
\entry{rl_completion_mark_symlink_dirs}{46}{\code {rl_completion_mark_symlink_dirs}}
\entry{rl_ignore_completion_duplicates}{46}{\code {rl_ignore_completion_duplicates}}
\entry{rl_filename_completion_desired}{46}{\code {rl_filename_completion_desired}}
\entry{rl_filename_quoting_desired}{46}{\code {rl_filename_quoting_desired}}
\entry{rl_attempted_completion_over}{46}{\code {rl_attempted_completion_over}}
\entry{rl_sort_completion_matches}{46}{\code {rl_sort_completion_matches}}
\entry{rl_attempted_completion_over}{47}{\code {rl_attempted_completion_over}}
\entry{rl_sort_completion_matches}{47}{\code {rl_sort_completion_matches}}
\entry{rl_completion_type}{47}{\code {rl_completion_type}}
\entry{rl_completion_invoking_key}{47}{\code {rl_completion_invoking_key}}
\entry{rl_inhibit_completion}{47}{\code {rl_inhibit_completion}}
lib/readline/doc/rlman.fns
+16 -11
View File
@@ -46,7 +46,7 @@
\initial {E}
\entry {editing-mode}{5}
\entry {\code {emacs-editing-mode (C-e)}}{19}
\entry {enable-keypad}{5}
\entry {enable-keypad}{6}
\entry {\code {end-kbd-macro (C-x ))}}{18}
\entry {\code {end-of-history (M->)}}{14}
\entry {\code {end-of-line (C-e)}}{13}
@@ -65,7 +65,7 @@
\entry {horizontal-scroll-mode}{6}
\initial {I}
\entry {input-meta}{6}
\entry {\code {insert-comment (M-#)}}{18}
\entry {\code {insert-comment (M-#)}}{19}
\entry {\code {insert-completions (M-*)}}{17}
\entry {isearch-terminators}{6}
\initial {K}
@@ -75,10 +75,11 @@
\entry {\code {kill-whole-line ()}}{16}
\entry {\code {kill-word (M-d)}}{16}
\initial {M}
\entry {mark-modified-lines}{6}
\entry {mark-modified-lines}{7}
\entry {mark-symlinked-directories}{7}
\entry {match-hidden-files}{7}
\entry {\code {menu-complete ()}}{17}
\entry {\code {menu-complete-backward ()}}{17}
\entry {meta-flag}{6}
\initial {N}
\entry {\code {next-history (C-n)}}{14}
@@ -107,9 +108,9 @@
\entry {\code {rl_alphabetic}}{35}
\entry {\code {rl_already_prompted}}{24}
\entry {\code {rl_attempted_completion_function}}{43}
\entry {\code {rl_attempted_completion_over}}{46}
\entry {\code {rl_basic_quote_characters}}{44}
\entry {\code {rl_basic_word_break_characters}}{44}
\entry {\code {rl_attempted_completion_over}}{47}
\entry {\code {rl_basic_quote_characters}}{45}
\entry {\code {rl_basic_word_break_characters}}{45}
\entry {\code {rl_begin_undo_group}}{31}
\entry {\code {rl_bind_key}}{29}
\entry {\code {rl_bind_key_if_unbound}}{29}
@@ -143,8 +144,8 @@
\entry {\code {rl_completion_matches}}{42}
\entry {\code {rl_completion_mode}}{42}
\entry {\code {rl_completion_query_items}}{45}
\entry {\code {rl_completion_quote_character}}{45}
\entry {\code {rl_completion_suppress_append}}{45}
\entry {\code {rl_completion_quote_character}}{46}
\entry {\code {rl_completion_suppress_append}}{46}
\entry {\code {rl_completion_suppress_quote}}{46}
\entry {\code {rl_completion_type}}{47}
\entry {\code {rl_completion_word_break_hook}}{45}
@@ -180,8 +181,10 @@
\entry {\code {rl_filename_quote_characters}}{45}
\entry {\code {rl_filename_quoting_desired}}{46}
\entry {\code {rl_filename_quoting_function}}{43}
\entry {\code {rl_filename_rewrite_hook}}{44}
\entry {\code {rl_forced_update_display}}{32}
\entry {\code {rl_free}}{35}
\entry {\code {rl_free_keymap}}{28}
\entry {\code {rl_free_line_state}}{40}
\entry {\code {rl_free_undo_list}}{32}
\entry {\code {rl_function_dumper}}{31}
@@ -258,7 +261,7 @@
\entry {\code {rl_set_screen_size}}{40}
\entry {\code {rl_set_signals}}{41}
\entry {\code {rl_show_char}}{32}
\entry {\code {rl_sort_completion_matches}}{46}
\entry {\code {rl_sort_completion_matches}}{47}
\entry {\code {rl_special_prefixes}}{45}
\entry {\code {rl_startup_hook}}{25}
\entry {\code {rl_stuff_char}}{34}
@@ -278,7 +281,9 @@
\entry {\code {set-mark (C-@)}}{18}
\entry {show-all-if-ambiguous}{7}
\entry {show-all-if-unmodified}{7}
\entry {\code {start-kbd-macro (C-x ()}}{17}
\entry {skip-completed-text}{8}
\entry {\code {skip-csi-sequence ()}}{19}
\entry {\code {start-kbd-macro (C-x ()}}{18}
\initial {T}
\entry {\code {tab-insert (M-\key {TAB})}}{15}
\entry {\code {tilde-expand (M-~)}}{18}
@@ -293,7 +298,7 @@
\entry {\code {upcase-word (M-u)}}{15}
\initial {V}
\entry {\code {vi-editing-mode (M-C-j)}}{19}
\entry {visible-stats}{7}
\entry {visible-stats}{8}
\initial {Y}
\entry {\code {yank (C-y)}}{16}
\entry {\code {yank-last-arg (M-. or M-_)}}{14}
lib/readline/doc/rlman.log
+10 -10
View File
@@ -1,6 +1,6 @@
This is TeX, Version 3.141592 (Web2C 7.5.4) (format=tex 2008.12.11) 18 MAR 2009 08:22
**/Users/chet/src/bash/src/lib/readline/doc/rlman.texi
(/Users/chet/src/bash/src/lib/readline/doc/rlman.texi (./texinfo.tex
This is TeX, Version 3.141592 (Web2C 7.5.4) (format=tex 2008.12.11) 12 OCT 2009 10:10
**/usr/homes/chet/src/bash/src/lib/readline/doc/rlman.texi
(/usr/homes/chet/src/bash/src/lib/readline/doc/rlman.texi (./texinfo.tex
Loading texinfo [version 2009-01-18.17]:
\bindingoffset=\dimen16
\normaloffset=\dimen17
@@ -176,7 +176,7 @@ and turning on texinfo input format.) (./rlman.aux)
] [2]
[3] [4] [5]
Underfull \hbox (badness 5231) in paragraph at lines 524--540
Underfull \hbox (badness 5231) in paragraph at lines 535--551
@texttt emacs-meta[]@textrm , @texttt emacs-ctlx[]@textrm , @texttt vi[]@textr
m , @texttt vi-move[]@textrm , @texttt vi-command[]@textrm , and
@@ -189,7 +189,7 @@ m , @texttt vi-move[]@textrm , @texttt vi-command[]@textrm , and
.etc.
[6] [7] [8] [9] [10]
Overfull \hbox (26.43913pt too wide) in paragraph at lines 846--846
Overfull \hbox (26.43913pt too wide) in paragraph at lines 871--871
[]@texttt Meta-Control-h: backward-kill-word Text after the function name is i
gnored[] |
@@ -204,7 +204,7 @@ gnored[] |
[11] [12] [13] [14] [15] [16] [17] [18]) (./rltech.texi Chapter 2 [19] [20]
[21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35]
[36] [37] [38] [39] [40] [41] [42] [43] [44] [45]
Underfull \hbox (badness 7379) in paragraph at lines 1870--1875
Underfull \hbox (badness 7379) in paragraph at lines 1905--1910
[]@textrm If an application-specific com-ple-tion func-tion as-signed to @text
tt rl_attempted_
@@ -221,11 +221,11 @@ tt rl_attempted_
(Function and Variable Index) [64] (./rlman.fns [65] [66] [67]) [68] )
Here is how much of TeX's memory you used:
1839 strings out of 97980
23013 string characters out of 1221004
83614 words of memory out of 1500000
23025 string characters out of 1221004
88497 words of memory out of 1500000
2666 multiletter control sequences out of 10000+50000
32127 words of font info for 112 fonts, out of 1200000 for 2000
51 hyphenation exceptions out of 8191
16i,6n,14p,323b,534s stack positions out of 5000i,500n,6000p,200000b,5000s
16i,6n,14p,327b,534s stack positions out of 5000i,500n,6000p,200000b,5000s
Output written on rlman.dvi (72 pages, 292044 bytes).
Output written on rlman.dvi (72 pages, 296928 bytes).
lib/readline/doc/rlman.toc
+2 -2
View File
@@ -8,7 +8,7 @@
@numsubsecentry{Searching for Commands in the History}{1.2.5}{Searching}{3}
@numsecentry{Readline Init File}{1.3}{Readline Init File}{4}
@numsubsecentry{Readline Init File Syntax}{1.3.1}{Readline Init File Syntax}{4}
@numsubsecentry{Conditional Init Constructs}{1.3.2}{Conditional Init Constructs}{9}
@numsubsecentry{Conditional Init Constructs}{1.3.2}{Conditional Init Constructs}{10}
@numsubsecentry{Sample Init File}{1.3.3}{Sample Init File}{10}
@numsecentry{Bindable Readline Commands}{1.4}{Bindable Readline Commands}{13}
@numsubsecentry{Commands For Moving}{1.4.1}{Commands For Moving}{13}
@@ -17,7 +17,7 @@
@numsubsecentry{Killing And Yanking}{1.4.4}{Commands For Killing}{16}
@numsubsecentry{Specifying Numeric Arguments}{1.4.5}{Numeric Arguments}{17}
@numsubsecentry{Letting Readline Type For You}{1.4.6}{Commands For Completion}{17}
@numsubsecentry{Keyboard Macros}{1.4.7}{Keyboard Macros}{17}
@numsubsecentry{Keyboard Macros}{1.4.7}{Keyboard Macros}{18}
@numsubsecentry{Some Miscellaneous Commands}{1.4.8}{Miscellaneous Commands}{18}
@numsecentry{Readline vi Mode}{1.5}{Readline vi Mode}{19}
@numchapentry{Programming with GNU Readline}{2}{Programming with GNU Readline}{20}
lib/readline/doc/rluserman.aux
+2 -2
View File
@@ -30,9 +30,9 @@
@xrdef{Readline Init File Syntax-pg}{4}
@xrdef{Conditional Init Constructs-title}{Conditional Init Constructs}
@xrdef{Conditional Init Constructs-snt}{Section@tie 1.3.2}
@xrdef{Conditional Init Constructs-pg}{9}
@xrdef{Sample Init File-title}{Sample Init File}
@xrdef{Sample Init File-snt}{Section@tie 1.3.3}
@xrdef{Conditional Init Constructs-pg}{10}
@xrdef{Sample Init File-pg}{10}
@xrdef{Bindable Readline Commands-title}{Bindable Readline Commands}
@xrdef{Bindable Readline Commands-snt}{Section@tie 1.4}
@@ -57,9 +57,9 @@
@xrdef{Keyboard Macros-snt}{Section@tie 1.4.7}
@xrdef{Numeric Arguments-pg}{17}
@xrdef{Commands For Completion-pg}{17}
@xrdef{Keyboard Macros-pg}{17}
@xrdef{Miscellaneous Commands-title}{Some Miscellaneous Commands}
@xrdef{Miscellaneous Commands-snt}{Section@tie 1.4.8}
@xrdef{Keyboard Macros-pg}{18}
@xrdef{Miscellaneous Commands-pg}{18}
@xrdef{Readline vi Mode-title}{Readline vi Mode}
@xrdef{Readline vi Mode-snt}{Section@tie 1.5}
lib/readline/doc/rluserman.dvi
BIN
View File
Binary file not shown.
lib/readline/doc/rluserman.fn
+4 -2
View File
@@ -52,8 +52,9 @@
\entry{possible-completions (M-?)}{17}{\code {possible-completions (M-?)}}
\entry{insert-completions (M-*)}{17}{\code {insert-completions (M-*)}}
\entry{menu-complete ()}{17}{\code {menu-complete ()}}
\entry{menu-complete-backward ()}{17}{\code {menu-complete-backward ()}}
\entry{delete-char-or-list ()}{17}{\code {delete-char-or-list ()}}
\entry{start-kbd-macro (C-x ()}{17}{\code {start-kbd-macro (C-x ()}}
\entry{start-kbd-macro (C-x ()}{18}{\code {start-kbd-macro (C-x ()}}
\entry{end-kbd-macro (C-x ))}{18}{\code {end-kbd-macro (C-x ))}}
\entry{call-last-kbd-macro (C-x e)}{18}{\code {call-last-kbd-macro (C-x e)}}
\entry{re-read-init-file (C-x C-r)}{18}{\code {re-read-init-file (C-x C-r)}}
@@ -67,7 +68,8 @@
\entry{exchange-point-and-mark (C-x C-x)}{18}{\code {exchange-point-and-mark (C-x C-x)}}
\entry{character-search (C-])}{18}{\code {character-search (C-])}}
\entry{character-search-backward (M-C-])}{18}{\code {character-search-backward (M-C-])}}
\entry{insert-comment (M-#)}{18}{\code {insert-comment (M-#)}}
\entry{skip-csi-sequence ()}{19}{\code {skip-csi-sequence ()}}
\entry{insert-comment (M-#)}{19}{\code {insert-comment (M-#)}}
\entry{dump-functions ()}{19}{\code {dump-functions ()}}
\entry{dump-variables ()}{19}{\code {dump-variables ()}}
\entry{dump-macros ()}{19}{\code {dump-macros ()}}
lib/readline/doc/rluserman.fns
+4 -2
View File
@@ -44,7 +44,7 @@
\entry {\code {history-search-backward ()}}{14}
\entry {\code {history-search-forward ()}}{14}
\initial {I}
\entry {\code {insert-comment (M-#)}}{18}
\entry {\code {insert-comment (M-#)}}{19}
\entry {\code {insert-completions (M-*)}}{17}
\initial {K}
\entry {\code {kill-line (C-k)}}{16}
@@ -53,6 +53,7 @@
\entry {\code {kill-word (M-d)}}{16}
\initial {M}
\entry {\code {menu-complete ()}}{17}
\entry {\code {menu-complete-backward ()}}{17}
\initial {N}
\entry {\code {next-history (C-n)}}{14}
\entry {\code {non-incremental-forward-search-history (M-n)}}{14}
@@ -73,7 +74,8 @@
\initial {S}
\entry {\code {self-insert (a, b, A, 1, !, \dots {})}}{15}
\entry {\code {set-mark (C-@)}}{18}
\entry {\code {start-kbd-macro (C-x ()}}{17}
\entry {\code {skip-csi-sequence ()}}{19}
\entry {\code {start-kbd-macro (C-x ()}}{18}
\initial {T}
\entry {\code {tab-insert (M-\key {TAB})}}{15}
\entry {\code {tilde-expand (M-~)}}{18}
lib/readline/doc/rluserman.html
+202 -154
View File
@@ -1,6 +1,6 @@
<HTML>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<!-- Created on March, 18 2009 by texi2html 1.64 -->
<!-- Created on October, 12 2009 by texi2html 1.64 -->
<!--
Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author)
Karl Berry <karl@freefriends.org>
@@ -648,6 +648,12 @@ mode, where the keystrokes are most similar to Emacs. This variable can be
set to either <SAMP>`emacs'</SAMP> or <SAMP>`vi'</SAMP>.
<P>
<DT><CODE>echo-control-characters</CODE>
<DD>When set to <SAMP>`on'</SAMP>, on operating systems that indicate they support it,
readline echoes a character corresponding to a signal generated from the
keyboard. The default is <SAMP>`on'</SAMP>.
<P>
<DT><CODE>enable-keypad</CODE>
<DD><A NAME="IDX13"></A>
When set to <SAMP>`on'</SAMP>, Readline will try to enable the application
@@ -655,6 +661,13 @@ keypad when it is called. Some systems need this to enable the
arrow keys. The default is <SAMP>`off'</SAMP>.
<P>
<DT><CODE>enable-meta-key</CODE>
<DD>When set to <SAMP>`on'</SAMP>, Readline will try to enable any meta modifier
key the terminal claims to support when it is called. On many terminals,
the meta key is used to send eight-bit characters.
The default is <SAMP>`on'</SAMP>.
<P>
<DT><CODE>expand-tilde</CODE>
<DD><A NAME="IDX14"></A>
If set to <SAMP>`on'</SAMP>, tilde expansion is performed when Readline
@@ -798,8 +811,23 @@ of ringing the bell.
The default value is <SAMP>`off'</SAMP>.
<P>
<DT><CODE>visible-stats</CODE>
<DT><CODE>skip-completed-text</CODE>
<DD><A NAME="IDX30"></A>
If set to <SAMP>`on'</SAMP>, this alters the default completion behavior when
inserting a single match into the line. It's only active when
performing completion in the middle of a word. If enabled, readline
does not insert characters from the completion that match characters
after point in the word being completed, so portions of the word
following the cursor are not duplicated.
For instance, if this is enabled, attempting completion when the cursor
is after the <SAMP>`e'</SAMP> in <SAMP>`Makefile'</SAMP> will result in <SAMP>`Makefile'</SAMP>
rather than <SAMP>`Makefilefile'</SAMP>, assuming there is a single possible
completion.
The default value is <SAMP>`off'</SAMP>.
<P>
<DT><CODE>visible-stats</CODE>
<DD><A NAME="IDX31"></A>
If set to <SAMP>`on'</SAMP>, a character denoting a file's type
is appended to the filename when listing possible
completions. The default is <SAMP>`off'</SAMP>.
@@ -1215,54 +1243,54 @@ The text between the point and mark is referred to as the <EM>region</EM>.
<H3> 1.4.1 Commands For Moving </H3>
<!--docid::SEC14::-->
<DL COMPACT>
<A NAME="IDX31"></A>
<A NAME="IDX32"></A>
<DT><CODE>beginning-of-line (C-a)</CODE>
<DD><A NAME="IDX32"></A>
<DD><A NAME="IDX33"></A>
Move to the start of the current line.
<P>
<A NAME="IDX33"></A>
<A NAME="IDX34"></A>
<DT><CODE>end-of-line (C-e)</CODE>
<DD><A NAME="IDX34"></A>
<DD><A NAME="IDX35"></A>
Move to the end of the line.
<P>
<A NAME="IDX35"></A>
<A NAME="IDX36"></A>
<DT><CODE>forward-char (C-f)</CODE>
<DD><A NAME="IDX36"></A>
<DD><A NAME="IDX37"></A>
Move forward a character.
<P>
<A NAME="IDX37"></A>
<A NAME="IDX38"></A>
<DT><CODE>backward-char (C-b)</CODE>
<DD><A NAME="IDX38"></A>
<DD><A NAME="IDX39"></A>
Move back a character.
<P>
<A NAME="IDX39"></A>
<A NAME="IDX40"></A>
<DT><CODE>forward-word (M-f)</CODE>
<DD><A NAME="IDX40"></A>
<DD><A NAME="IDX41"></A>
Move forward to the end of the next word.
Words are composed of letters and digits.
<P>
<A NAME="IDX41"></A>
<A NAME="IDX42"></A>
<DT><CODE>backward-word (M-b)</CODE>
<DD><A NAME="IDX42"></A>
<DD><A NAME="IDX43"></A>
Move back to the start of the current or previous word.
Words are composed of letters and digits.
<P>
<A NAME="IDX43"></A>
<A NAME="IDX44"></A>
<DT><CODE>clear-screen (C-l)</CODE>
<DD><A NAME="IDX44"></A>
<DD><A NAME="IDX45"></A>
Clear the screen and redraw the current line,
leaving the current line at the top of the screen.
<P>
<A NAME="IDX45"></A>
<A NAME="IDX46"></A>
<DT><CODE>redraw-current-line ()</CODE>
<DD><A NAME="IDX46"></A>
<DD><A NAME="IDX47"></A>
Refresh the current line. By default, this is unbound.
<P>
@@ -1288,9 +1316,9 @@ Refresh the current line. By default, this is unbound.
<P>
<DL COMPACT>
<A NAME="IDX47"></A>
<A NAME="IDX48"></A>
<DT><CODE>accept-line (Newline or Return)</CODE>
<DD><A NAME="IDX48"></A>
<DD><A NAME="IDX49"></A>
Accept the line regardless of where the cursor is.
If this line is
non-empty, it may be added to the history list for future recall with
@@ -1299,81 +1327,81 @@ If this line is a modified history line, the history line is restored
to its original state.
<P>
<A NAME="IDX49"></A>
<A NAME="IDX50"></A>
<DT><CODE>previous-history (C-p)</CODE>
<DD><A NAME="IDX50"></A>
<DD><A NAME="IDX51"></A>
Move `back' through the history list, fetching the previous command.
<P>
<A NAME="IDX51"></A>
<A NAME="IDX52"></A>
<DT><CODE>next-history (C-n)</CODE>
<DD><A NAME="IDX52"></A>
<DD><A NAME="IDX53"></A>
Move `forward' through the history list, fetching the next command.
<P>
<A NAME="IDX53"></A>
<A NAME="IDX54"></A>
<DT><CODE>beginning-of-history (M-&#60;)</CODE>
<DD><A NAME="IDX54"></A>
<DD><A NAME="IDX55"></A>
Move to the first line in the history.
<P>
<A NAME="IDX55"></A>
<A NAME="IDX56"></A>
<DT><CODE>end-of-history (M-&#62;)</CODE>
<DD><A NAME="IDX56"></A>
<DD><A NAME="IDX57"></A>
Move to the end of the input history, i.e., the line currently
being entered.
<P>
<A NAME="IDX57"></A>
<A NAME="IDX58"></A>
<DT><CODE>reverse-search-history (C-r)</CODE>
<DD><A NAME="IDX58"></A>
<DD><A NAME="IDX59"></A>
Search backward starting at the current line and moving `up' through
the history as necessary. This is an incremental search.
<P>
<A NAME="IDX59"></A>
<A NAME="IDX60"></A>
<DT><CODE>forward-search-history (C-s)</CODE>
<DD><A NAME="IDX60"></A>
<DD><A NAME="IDX61"></A>
Search forward starting at the current line and moving `down' through
the the history as necessary. This is an incremental search.
<P>
<A NAME="IDX61"></A>
<A NAME="IDX62"></A>
<DT><CODE>non-incremental-reverse-search-history (M-p)</CODE>
<DD><A NAME="IDX62"></A>
<DD><A NAME="IDX63"></A>
Search backward starting at the current line and moving `up'
through the history as necessary using a non-incremental search
for a string supplied by the user.
<P>
<A NAME="IDX63"></A>
<A NAME="IDX64"></A>
<DT><CODE>non-incremental-forward-search-history (M-n)</CODE>
<DD><A NAME="IDX64"></A>
<DD><A NAME="IDX65"></A>
Search forward starting at the current line and moving `down'
through the the history as necessary using a non-incremental search
for a string supplied by the user.
<P>
<A NAME="IDX65"></A>
<A NAME="IDX66"></A>
<DT><CODE>history-search-forward ()</CODE>
<DD><A NAME="IDX66"></A>
<DD><A NAME="IDX67"></A>
Search forward through the history for the string of characters
between the start of the current line and the point.
This is a non-incremental search.
By default, this command is unbound.
<P>
<A NAME="IDX67"></A>
<A NAME="IDX68"></A>
<DT><CODE>history-search-backward ()</CODE>
<DD><A NAME="IDX68"></A>
<DD><A NAME="IDX69"></A>
Search backward through the history for the string of characters
between the start of the current line and the point. This
is a non-incremental search. By default, this command is unbound.
<P>
<A NAME="IDX69"></A>
<A NAME="IDX70"></A>
<DT><CODE>yank-nth-arg (M-C-y)</CODE>
<DD><A NAME="IDX70"></A>
<DD><A NAME="IDX71"></A>
Insert the first argument to the previous command (usually
the second word on the previous line) at point.
With an argument <VAR>n</VAR>,
@@ -1384,9 +1412,9 @@ Once the argument <VAR>n</VAR> is computed, the argument is extracted
as if the <SAMP>`!<VAR>n</VAR>'</SAMP> history expansion had been specified.
<P>
<A NAME="IDX71"></A>
<A NAME="IDX72"></A>
<DT><CODE>yank-last-arg (M-. or M-_)</CODE>
<DD><A NAME="IDX72"></A>
<DD><A NAME="IDX73"></A>
Insert last argument to the previous command (the last word of the
previous history entry). With an
argument, behave exactly like <CODE>yank-nth-arg</CODE>.
@@ -1418,52 +1446,52 @@ as if the <SAMP>`!$'</SAMP> history expansion had been specified.
<P>
<DL COMPACT>
<A NAME="IDX73"></A>
<A NAME="IDX74"></A>
<DT><CODE>delete-char (C-d)</CODE>
<DD><A NAME="IDX74"></A>
<DD><A NAME="IDX75"></A>
Delete the character at point. If point is at the
beginning of the line, there are no characters in the line, and
the last character typed was not bound to <CODE>delete-char</CODE>, then
return EOF.
<P>
<A NAME="IDX75"></A>
<A NAME="IDX76"></A>
<DT><CODE>backward-delete-char (Rubout)</CODE>
<DD><A NAME="IDX76"></A>
<DD><A NAME="IDX77"></A>
Delete the character behind the cursor. A numeric argument means
to kill the characters instead of deleting them.
<P>
<A NAME="IDX77"></A>
<A NAME="IDX78"></A>
<DT><CODE>forward-backward-delete-char ()</CODE>
<DD><A NAME="IDX78"></A>
<DD><A NAME="IDX79"></A>
Delete the character under the cursor, unless the cursor is at the
end of the line, in which case the character behind the cursor is
deleted. By default, this is not bound to a key.
<P>
<A NAME="IDX79"></A>
<A NAME="IDX80"></A>
<DT><CODE>quoted-insert (C-q or C-v)</CODE>
<DD><A NAME="IDX80"></A>
<DD><A NAME="IDX81"></A>
Add the next character typed to the line verbatim. This is
how to insert key sequences like <KBD>C-q</KBD>, for example.
<P>
<A NAME="IDX81"></A>
<A NAME="IDX82"></A>
<DT><CODE>tab-insert (M-<KBD>TAB</KBD>)</CODE>
<DD><A NAME="IDX82"></A>
<DD><A NAME="IDX83"></A>
Insert a tab character.
<P>
<A NAME="IDX83"></A>
<A NAME="IDX84"></A>
<DT><CODE>self-insert (a, b, A, 1, !, <small>...</small>)</CODE>
<DD><A NAME="IDX84"></A>
<DD><A NAME="IDX85"></A>
Insert yourself.
<P>
<A NAME="IDX85"></A>
<A NAME="IDX86"></A>
<DT><CODE>transpose-chars (C-t)</CODE>
<DD><A NAME="IDX86"></A>
<DD><A NAME="IDX87"></A>
Drag the character before the cursor forward over
the character at the cursor, moving the
cursor forward as well. If the insertion point
@@ -1472,39 +1500,39 @@ transposes the last two characters of the line.
Negative arguments have no effect.
<P>
<A NAME="IDX87"></A>
<A NAME="IDX88"></A>
<DT><CODE>transpose-words (M-t)</CODE>
<DD><A NAME="IDX88"></A>
<DD><A NAME="IDX89"></A>
Drag the word before point past the word after point,
moving point past that word as well.
If the insertion point is at the end of the line, this transposes
the last two words on the line.
<P>
<A NAME="IDX89"></A>
<A NAME="IDX90"></A>
<DT><CODE>upcase-word (M-u)</CODE>
<DD><A NAME="IDX90"></A>
<DD><A NAME="IDX91"></A>
Uppercase the current (or following) word. With a negative argument,
uppercase the previous word, but do not move the cursor.
<P>
<A NAME="IDX91"></A>
<A NAME="IDX92"></A>
<DT><CODE>downcase-word (M-l)</CODE>
<DD><A NAME="IDX92"></A>
<DD><A NAME="IDX93"></A>
Lowercase the current (or following) word. With a negative argument,
lowercase the previous word, but do not move the cursor.
<P>
<A NAME="IDX93"></A>
<A NAME="IDX94"></A>
<DT><CODE>capitalize-word (M-c)</CODE>
<DD><A NAME="IDX94"></A>
<DD><A NAME="IDX95"></A>
Capitalize the current (or following) word. With a negative argument,
capitalize the previous word, but do not move the cursor.
<P>
<A NAME="IDX95"></A>
<A NAME="IDX96"></A>
<DT><CODE>overwrite-mode ()</CODE>
<DD><A NAME="IDX96"></A>
<DD><A NAME="IDX97"></A>
Toggle overwrite mode. With an explicit positive numeric argument,
switches to overwrite mode. With an explicit non-positive numeric
argument, switches to insert mode. This command affects only
@@ -1544,106 +1572,106 @@ By default, this command is unbound.
<DL COMPACT>
<A NAME="IDX97"></A>
<A NAME="IDX98"></A>
<DT><CODE>kill-line (C-k)</CODE>
<DD><A NAME="IDX98"></A>
<DD><A NAME="IDX99"></A>
Kill the text from point to the end of the line.
<P>
<A NAME="IDX99"></A>
<A NAME="IDX100"></A>
<DT><CODE>backward-kill-line (C-x Rubout)</CODE>
<DD><A NAME="IDX100"></A>
<DD><A NAME="IDX101"></A>
Kill backward to the beginning of the line.
<P>
<A NAME="IDX101"></A>
<A NAME="IDX102"></A>
<DT><CODE>unix-line-discard (C-u)</CODE>
<DD><A NAME="IDX102"></A>
<DD><A NAME="IDX103"></A>
Kill backward from the cursor to the beginning of the current line.
<P>
<A NAME="IDX103"></A>
<A NAME="IDX104"></A>
<DT><CODE>kill-whole-line ()</CODE>
<DD><A NAME="IDX104"></A>
<DD><A NAME="IDX105"></A>
Kill all characters on the current line, no matter where point is.
By default, this is unbound.
<P>
<A NAME="IDX105"></A>
<A NAME="IDX106"></A>
<DT><CODE>kill-word (M-d)</CODE>
<DD><A NAME="IDX106"></A>
<DD><A NAME="IDX107"></A>
Kill from point to the end of the current word, or if between
words, to the end of the next word.
Word boundaries are the same as <CODE>forward-word</CODE>.
<P>
<A NAME="IDX107"></A>
<A NAME="IDX108"></A>
<DT><CODE>backward-kill-word (M-<KBD>DEL</KBD>)</CODE>
<DD><A NAME="IDX108"></A>
<DD><A NAME="IDX109"></A>
Kill the word behind point.
Word boundaries are the same as <CODE>backward-word</CODE>.
<P>
<A NAME="IDX109"></A>
<A NAME="IDX110"></A>
<DT><CODE>unix-word-rubout (C-w)</CODE>
<DD><A NAME="IDX110"></A>
<DD><A NAME="IDX111"></A>
Kill the word behind point, using white space as a word boundary.
The killed text is saved on the kill-ring.
<P>
<A NAME="IDX111"></A>
<A NAME="IDX112"></A>
<DT><CODE>unix-filename-rubout ()</CODE>
<DD><A NAME="IDX112"></A>
<DD><A NAME="IDX113"></A>
Kill the word behind point, using white space and the slash character
as the word boundaries.
The killed text is saved on the kill-ring.
<P>
<A NAME="IDX113"></A>
<A NAME="IDX114"></A>
<DT><CODE>delete-horizontal-space ()</CODE>
<DD><A NAME="IDX114"></A>
<DD><A NAME="IDX115"></A>
Delete all spaces and tabs around point. By default, this is unbound.
<P>
<A NAME="IDX115"></A>
<A NAME="IDX116"></A>
<DT><CODE>kill-region ()</CODE>
<DD><A NAME="IDX116"></A>
<DD><A NAME="IDX117"></A>
Kill the text in the current region.
By default, this command is unbound.
<P>
<A NAME="IDX117"></A>
<A NAME="IDX118"></A>
<DT><CODE>copy-region-as-kill ()</CODE>
<DD><A NAME="IDX118"></A>
<DD><A NAME="IDX119"></A>
Copy the text in the region to the kill buffer, so it can be yanked
right away. By default, this command is unbound.
<P>
<A NAME="IDX119"></A>
<A NAME="IDX120"></A>
<DT><CODE>copy-backward-word ()</CODE>
<DD><A NAME="IDX120"></A>
<DD><A NAME="IDX121"></A>
Copy the word before point to the kill buffer.
The word boundaries are the same as <CODE>backward-word</CODE>.
By default, this command is unbound.
<P>
<A NAME="IDX121"></A>
<A NAME="IDX122"></A>
<DT><CODE>copy-forward-word ()</CODE>
<DD><A NAME="IDX122"></A>
<DD><A NAME="IDX123"></A>
Copy the word following point to the kill buffer.
The word boundaries are the same as <CODE>forward-word</CODE>.
By default, this command is unbound.
<P>
<A NAME="IDX123"></A>
<A NAME="IDX124"></A>
<DT><CODE>yank (C-y)</CODE>
<DD><A NAME="IDX124"></A>
<DD><A NAME="IDX125"></A>
Yank the top of the kill ring into the buffer at point.
<P>
<A NAME="IDX125"></A>
<A NAME="IDX126"></A>
<DT><CODE>yank-pop (M-y)</CODE>
<DD><A NAME="IDX126"></A>
<DD><A NAME="IDX127"></A>
Rotate the kill-ring, and yank the new top. You can only do this if
the prior command is <CODE>yank</CODE> or <CODE>yank-pop</CODE>.
</DL>
@@ -1667,16 +1695,16 @@ the prior command is <CODE>yank</CODE> or <CODE>yank-pop</CODE>.
<!--docid::SEC18::-->
<DL COMPACT>
<A NAME="IDX127"></A>
<A NAME="IDX128"></A>
<DT><CODE>digit-argument (<KBD>M-0</KBD>, <KBD>M-1</KBD>, <small>...</small> <KBD>M--</KBD>)</CODE>
<DD><A NAME="IDX128"></A>
<DD><A NAME="IDX129"></A>
Add this digit to the argument already accumulating, or start a new
argument. <KBD>M--</KBD> starts a negative argument.
<P>
<A NAME="IDX129"></A>
<A NAME="IDX130"></A>
<DT><CODE>universal-argument ()</CODE>
<DD><A NAME="IDX130"></A>
<DD><A NAME="IDX131"></A>
This is another way to specify an argument.
If this command is followed by one or more digits, optionally with a
leading minus sign, those digits define the argument.
@@ -1711,30 +1739,30 @@ By default, this is not bound to a key.
<P>
<DL COMPACT>
<A NAME="IDX131"></A>
<A NAME="IDX132"></A>
<DT><CODE>complete (<KBD>TAB</KBD>)</CODE>
<DD><A NAME="IDX132"></A>
<DD><A NAME="IDX133"></A>
Attempt to perform completion on the text before point.
The actual completion performed is application-specific.
The default is filename completion.
<P>
<A NAME="IDX133"></A>
<A NAME="IDX134"></A>
<DT><CODE>possible-completions (M-?)</CODE>
<DD><A NAME="IDX134"></A>
<DD><A NAME="IDX135"></A>
List the possible completions of the text before point.
<P>
<A NAME="IDX135"></A>
<A NAME="IDX136"></A>
<DT><CODE>insert-completions (M-*)</CODE>
<DD><A NAME="IDX136"></A>
<DD><A NAME="IDX137"></A>
Insert all completions of the text before point that would have
been generated by <CODE>possible-completions</CODE>.
<P>
<A NAME="IDX137"></A>
<A NAME="IDX138"></A>
<DT><CODE>menu-complete ()</CODE>
<DD><A NAME="IDX138"></A>
<DD><A NAME="IDX139"></A>
Similar to <CODE>complete</CODE>, but replaces the word to be completed
with a single match from the list of possible completions.
Repeated execution of <CODE>menu-complete</CODE> steps through the list
@@ -1749,9 +1777,17 @@ This command is intended to be bound to <KBD>TAB</KBD>, but is unbound
by default.
<P>
<A NAME="IDX139"></A>
<A NAME="IDX140"></A>
<DT><CODE>menu-complete-backward ()</CODE>
<DD><A NAME="IDX141"></A>
Identical to <CODE>menu-complete</CODE>, but moves backward through the list
of possible completions, as if <CODE>menu-complete</CODE> had been given a
negative argument.
<P>
<A NAME="IDX142"></A>
<DT><CODE>delete-char-or-list ()</CODE>
<DD><A NAME="IDX140"></A>
<DD><A NAME="IDX143"></A>
Deletes the character under the cursor if not at the beginning or
end of the line (like <CODE>delete-char</CODE>).
If at the end of the line, behaves identically to
@@ -1780,22 +1816,22 @@ This command is unbound by default.
<!--docid::SEC20::-->
<DL COMPACT>
<A NAME="IDX141"></A>
<A NAME="IDX144"></A>
<DT><CODE>start-kbd-macro (C-x ()</CODE>
<DD><A NAME="IDX142"></A>
<DD><A NAME="IDX145"></A>
Begin saving the characters typed into the current keyboard macro.
<P>
<A NAME="IDX143"></A>
<A NAME="IDX146"></A>
<DT><CODE>end-kbd-macro (C-x ))</CODE>
<DD><A NAME="IDX144"></A>
<DD><A NAME="IDX147"></A>
Stop saving the characters typed into the current keyboard macro
and save the definition.
<P>
<A NAME="IDX145"></A>
<A NAME="IDX148"></A>
<DT><CODE>call-last-kbd-macro (C-x e)</CODE>
<DD><A NAME="IDX146"></A>
<DD><A NAME="IDX149"></A>
Re-execute the last keyboard macro defined, by making the characters
in the macro appear as if typed at the keyboard.
<P>
@@ -1821,87 +1857,99 @@ in the macro appear as if typed at the keyboard.
<!--docid::SEC21::-->
<DL COMPACT>
<A NAME="IDX147"></A>
<A NAME="IDX150"></A>
<DT><CODE>re-read-init-file (C-x C-r)</CODE>
<DD><A NAME="IDX148"></A>
<DD><A NAME="IDX151"></A>
Read in the contents of the <VAR>inputrc</VAR> file, and incorporate
any bindings or variable assignments found there.
<P>
<A NAME="IDX149"></A>
<A NAME="IDX152"></A>
<DT><CODE>abort (C-g)</CODE>
<DD><A NAME="IDX150"></A>
<DD><A NAME="IDX153"></A>
Abort the current editing command and
ring the terminal's bell (subject to the setting of
<CODE>bell-style</CODE>).
<P>
<A NAME="IDX151"></A>
<A NAME="IDX154"></A>
<DT><CODE>do-uppercase-version (M-a, M-b, M-<VAR>x</VAR>, <small>...</small>)</CODE>
<DD><A NAME="IDX152"></A>
<DD><A NAME="IDX155"></A>
If the metafied character <VAR>x</VAR> is lowercase, run the command
that is bound to the corresponding uppercase character.
<P>
<A NAME="IDX153"></A>
<A NAME="IDX156"></A>
<DT><CODE>prefix-meta (<KBD>ESC</KBD>)</CODE>
<DD><A NAME="IDX154"></A>
<DD><A NAME="IDX157"></A>
Metafy the next character typed. This is for keyboards
without a meta key. Typing <SAMP>`<KBD>ESC</KBD> f'</SAMP> is equivalent to typing
<KBD>M-f</KBD>.
<P>
<A NAME="IDX155"></A>
<A NAME="IDX158"></A>
<DT><CODE>undo (C-_ or C-x C-u)</CODE>
<DD><A NAME="IDX156"></A>
<DD><A NAME="IDX159"></A>
Incremental undo, separately remembered for each line.
<P>
<A NAME="IDX157"></A>
<A NAME="IDX160"></A>
<DT><CODE>revert-line (M-r)</CODE>
<DD><A NAME="IDX158"></A>
<DD><A NAME="IDX161"></A>
Undo all changes made to this line. This is like executing the <CODE>undo</CODE>
command enough times to get back to the beginning.
<P>
<A NAME="IDX159"></A>
<A NAME="IDX162"></A>
<DT><CODE>tilde-expand (M-~)</CODE>
<DD><A NAME="IDX160"></A>
<DD><A NAME="IDX163"></A>
Perform tilde expansion on the current word.
<P>
<A NAME="IDX161"></A>
<A NAME="IDX164"></A>
<DT><CODE>set-mark (C-@)</CODE>
<DD><A NAME="IDX162"></A>
<DD><A NAME="IDX165"></A>
Set the mark to the point. If a
numeric argument is supplied, the mark is set to that position.
<P>
<A NAME="IDX163"></A>
<A NAME="IDX166"></A>
<DT><CODE>exchange-point-and-mark (C-x C-x)</CODE>
<DD><A NAME="IDX164"></A>
<DD><A NAME="IDX167"></A>
Swap the point with the mark. The current cursor position is set to
the saved position, and the old cursor position is saved as the mark.
<P>
<A NAME="IDX165"></A>
<A NAME="IDX168"></A>
<DT><CODE>character-search (C-])</CODE>
<DD><A NAME="IDX166"></A>
<DD><A NAME="IDX169"></A>
A character is read and point is moved to the next occurrence of that
character. A negative count searches for previous occurrences.
<P>
<A NAME="IDX167"></A>
<A NAME="IDX170"></A>
<DT><CODE>character-search-backward (M-C-])</CODE>
<DD><A NAME="IDX168"></A>
<DD><A NAME="IDX171"></A>
A character is read and point is moved to the previous occurrence
of that character. A negative count searches for subsequent
occurrences.
<P>
<A NAME="IDX169"></A>
<A NAME="IDX172"></A>
<DT><CODE>skip-csi-sequence ()</CODE>
<DD><A NAME="IDX173"></A>
Read enough characters to consume a multi-key sequence such as those
defined for keys like Home and End. Such sequences begin with a
Control Sequence Indicator (CSI), usually ESC-[. If this sequence is
bound to "\e[", keys producing such sequences will have no effect
unless explicitly bound to a readline command, instead of inserting
stray characters into the editing buffer. This is unbound by default,
but usually bound to ESC-[.
<P>
<A NAME="IDX174"></A>
<DT><CODE>insert-comment (M-#)</CODE>
<DD><A NAME="IDX170"></A>
<DD><A NAME="IDX175"></A>
Without a numeric argument, the value of the <CODE>comment-begin</CODE>
variable is inserted at the beginning of the current line.
If a numeric argument is supplied, this command acts as a toggle: if
@@ -1912,43 +1960,43 @@ the line.
In either case, the line is accepted as if a newline had been typed.
<P>
<A NAME="IDX171"></A>
<A NAME="IDX176"></A>
<DT><CODE>dump-functions ()</CODE>
<DD><A NAME="IDX172"></A>
<DD><A NAME="IDX177"></A>
Print all of the functions and their key bindings to the
Readline output stream. If a numeric argument is supplied,
the output is formatted in such a way that it can be made part
of an <VAR>inputrc</VAR> file. This command is unbound by default.
<P>
<A NAME="IDX173"></A>
<A NAME="IDX178"></A>
<DT><CODE>dump-variables ()</CODE>
<DD><A NAME="IDX174"></A>
<DD><A NAME="IDX179"></A>
Print all of the settable variables and their values to the
Readline output stream. If a numeric argument is supplied,
the output is formatted in such a way that it can be made part
of an <VAR>inputrc</VAR> file. This command is unbound by default.
<P>
<A NAME="IDX175"></A>
<A NAME="IDX180"></A>
<DT><CODE>dump-macros ()</CODE>
<DD><A NAME="IDX176"></A>
<DD><A NAME="IDX181"></A>
Print all of the Readline key sequences bound to macros and the
strings they output. If a numeric argument is supplied,
the output is formatted in such a way that it can be made part
of an <VAR>inputrc</VAR> file. This command is unbound by default.
<P>
<A NAME="IDX177"></A>
<A NAME="IDX182"></A>
<DT><CODE>emacs-editing-mode (C-e)</CODE>
<DD><A NAME="IDX178"></A>
<DD><A NAME="IDX183"></A>
When in <CODE>vi</CODE> command mode, this causes a switch to <CODE>emacs</CODE>
editing mode.
<P>
<A NAME="IDX179"></A>
<A NAME="IDX184"></A>
<DT><CODE>vi-editing-mode (M-C-j)</CODE>
<DD><A NAME="IDX180"></A>
<DD><A NAME="IDX185"></A>
When in <CODE>emacs</CODE> editing mode, this causes a switch to <CODE>vi</CODE>
editing mode.
<P>
@@ -2675,7 +2723,7 @@ to permit their use in free software.
<TD VALIGN="MIDDLE" ALIGN="LEFT">[<A HREF="rluserman.html#SEC_About"> ? </A>]</TD>
</TR></TABLE>
<H1>About this document</H1>
This document was generated by <I>Chet Ramey</I> on <I>March, 18 2009</I>
This document was generated by <I>Chet Ramey</I> on <I>October, 12 2009</I>
using <A HREF="http://www.mathematik.uni-kl.de/~obachman/Texi2html
"><I>texi2html</I></A>
<P></P>
@@ -2837,7 +2885,7 @@ the following structure:
<BR>
<FONT SIZE="-1">
This document was generated
by <I>Chet Ramey</I> on <I>March, 18 2009</I>
by <I>Chet Ramey</I> on <I>October, 12 2009</I>
using <A HREF="http://www.mathematik.uni-kl.de/~obachman/Texi2html
"><I>texi2html</I></A>
lib/readline/doc/rluserman.info
+63 -25
View File
@@ -2,7 +2,7 @@ This is rluserman.info, produced by makeinfo version 4.13 from
./rluserman.texi.
This manual describes the end user interface of the GNU Readline Library
(version 6.0, 28 October 2008), a library which aids in the consistency
(version 6.1, 9 October 2009), a library which aids in the consistency
of user interface across discrete programs which provide a command line
interface.
@@ -438,11 +438,22 @@ Variable Settings
editing mode, where the keystrokes are most similar to Emacs.
This variable can be set to either `emacs' or `vi'.
`echo-control-characters'
When set to `on', on operating systems that indicate they
support it, readline echoes a character corresponding to a
signal generated from the keyboard. The default is `on'.
`enable-keypad'
When set to `on', Readline will try to enable the application
keypad when it is called. Some systems need this to enable
the arrow keys. The default is `off'.
`enable-meta-key'
When set to `on', Readline will try to enable any meta
modifier key the terminal claims to support when it is
called. On many terminals, the meta key is used to send
eight-bit characters. The default is `on'.
`expand-tilde'
If set to `on', tilde expansion is performed when Readline
attempts word completion. The default is `off'.
@@ -545,6 +556,19 @@ Variable Settings
be listed immediately instead of ringing the bell. The
default value is `off'.
`skip-completed-text'
If set to `on', this alters the default completion behavior
when inserting a single match into the line. It's only
active when performing completion in the middle of a word.
If enabled, readline does not insert characters from the
completion that match characters after point in the word
being completed, so portions of the word following the cursor
are not duplicated. For instance, if this is enabled,
attempting completion when the cursor is after the `e' in
`Makefile' will result in `Makefile' rather than
`Makefilefile', assuming there is a single possible
completion. The default value is `off'.
`visible-stats'
If set to `on', a character denoting a file's type is
appended to the filename when listing possible completions.
@@ -1159,6 +1183,11 @@ File: rluserman.info, Node: Commands For Completion, Next: Keyboard Macros, P
command is intended to be bound to <TAB>, but is unbound by
default.
`menu-complete-backward ()'
Identical to `menu-complete', but moves backward through the list
of possible completions, as if `menu-complete' had been given a
negative argument.
`delete-char-or-list ()'
Deletes the character under the cursor if not at the beginning or
end of the line (like `delete-char'). If at the end of the line,
@@ -1235,6 +1264,15 @@ File: rluserman.info, Node: Miscellaneous Commands, Prev: Keyboard Macros, Up
of that character. A negative count searches for subsequent
occurrences.
`skip-csi-sequence ()'
Read enough characters to consume a multi-key sequence such as
those defined for keys like Home and End. Such sequences begin
with a Control Sequence Indicator (CSI), usually ESC-[. If this
sequence is bound to "\e[", keys producing such sequences will
have no effect unless explicitly bound to a readline command,
instead of inserting stray characters into the editing buffer.
This is unbound by default, but usually bound to ESC-[.
`insert-comment (M-#)'
Without a numeric argument, the value of the `comment-begin'
variable is inserted at the beginning of the current line. If a
@@ -1783,29 +1821,29 @@ permit their use in free software.

Tag Table:
Node: Top1328
Node: Command Line Editing1782
Node: Introduction and Notation2436
Node: Readline Interaction4060
Node: Readline Bare Essentials5253
Node: Readline Movement Commands7044
Node: Readline Killing Commands8011
Node: Readline Arguments9933
Node: Searching10979
Node: Readline Init File13132
Node: Readline Init File Syntax14287
Node: Conditional Init Constructs27241
Node: Sample Init File29776
Node: Bindable Readline Commands32895
Node: Commands For Moving33954
Node: Commands For History34817
Node: Commands For Text37943
Node: Commands For Killing40671
Node: Numeric Arguments42815
Node: Commands For Completion43956
Node: Keyboard Macros45502
Node: Miscellaneous Commands46075
Node: Readline vi Mode49438
Node: GNU Free Documentation License50359
Node: Top1327
Node: Command Line Editing1781
Node: Introduction and Notation2435
Node: Readline Interaction4059
Node: Readline Bare Essentials5252
Node: Readline Movement Commands7043
Node: Readline Killing Commands8010
Node: Readline Arguments9932
Node: Searching10978
Node: Readline Init File13131
Node: Readline Init File Syntax14286
Node: Conditional Init Constructs28493
Node: Sample Init File31028
Node: Bindable Readline Commands34147
Node: Commands For Moving35206
Node: Commands For History36069
Node: Commands For Text39195
Node: Commands For Killing41923
Node: Numeric Arguments44067
Node: Commands For Completion45208
Node: Keyboard Macros46947
Node: Miscellaneous Commands47520
Node: Readline vi Mode51378
Node: GNU Free Documentation License52299

End Tag Table
lib/readline/doc/rluserman.log
+9 -9
View File
@@ -1,6 +1,6 @@
This is TeX, Version 3.141592 (Web2C 7.5.4) (format=tex 2008.12.11) 18 MAR 2009 08:22
**/Users/chet/src/bash/src/lib/readline/doc/rluserman.texi
(/Users/chet/src/bash/src/lib/readline/doc/rluserman.texi (./texinfo.tex
This is TeX, Version 3.141592 (Web2C 7.5.4) (format=tex 2008.12.11) 12 OCT 2009 10:10
**/usr/homes/chet/src/bash/src/lib/readline/doc/rluserman.texi
(/usr/homes/chet/src/bash/src/lib/readline/doc/rluserman.texi (./texinfo.tex
Loading texinfo [version 2009-01-18.17]:
\bindingoffset=\dimen16
\normaloffset=\dimen17
@@ -176,7 +176,7 @@ and turning on texinfo input format.) (./rluserman.aux)
\openout9 = `rluserman.bt'.
] [2] [3] [4] [5]
Underfull \hbox (badness 5231) in paragraph at lines 524--540
Underfull \hbox (badness 5231) in paragraph at lines 535--551
@texttt emacs-meta[]@textrm , @texttt emacs-ctlx[]@textrm , @texttt vi[]@textr
m , @texttt vi-move[]@textrm , @texttt vi-command[]@textrm , and
@@ -189,7 +189,7 @@ m , @texttt vi-move[]@textrm , @texttt vi-command[]@textrm , and
.etc.
[6] [7] [8] [9] [10]
Overfull \hbox (26.43913pt too wide) in paragraph at lines 846--846
Overfull \hbox (26.43913pt too wide) in paragraph at lines 871--871
[]@texttt Meta-Control-h: backward-kill-word Text after the function name is i
gnored[] |
@@ -205,11 +205,11 @@ gnored[] |
[21] [22] [23] [24] [25] [26]) [27] )
Here is how much of TeX's memory you used:
1743 strings out of 97980
20809 string characters out of 1221004
75544 words of memory out of 1500000
20821 string characters out of 1221004
80427 words of memory out of 1500000
2579 multiletter control sequences out of 10000+50000
32127 words of font info for 112 fonts, out of 1200000 for 2000
51 hyphenation exceptions out of 8191
16i,6n,14p,327b,534s stack positions out of 5000i,500n,6000p,200000b,5000s
16i,6n,14p,331b,534s stack positions out of 5000i,500n,6000p,200000b,5000s
Output written on rluserman.dvi (30 pages, 98540 bytes).
Output written on rluserman.dvi (30 pages, 100828 bytes).
lib/readline/doc/rluserman.ps
+459 -413
View File
File diff suppressed because it is too large Load Diff
lib/readline/doc/rluserman.toc
+2 -2
View File
@@ -8,7 +8,7 @@
@numsubsecentry{Searching for Commands in the History}{1.2.5}{Searching}{3}
@numsecentry{Readline Init File}{1.3}{Readline Init File}{4}
@numsubsecentry{Readline Init File Syntax}{1.3.1}{Readline Init File Syntax}{4}
@numsubsecentry{Conditional Init Constructs}{1.3.2}{Conditional Init Constructs}{9}
@numsubsecentry{Conditional Init Constructs}{1.3.2}{Conditional Init Constructs}{10}
@numsubsecentry{Sample Init File}{1.3.3}{Sample Init File}{10}
@numsecentry{Bindable Readline Commands}{1.4}{Bindable Readline Commands}{13}
@numsubsecentry{Commands For Moving}{1.4.1}{Commands For Moving}{13}
@@ -17,7 +17,7 @@
@numsubsecentry{Killing And Yanking}{1.4.4}{Commands For Killing}{16}
@numsubsecentry{Specifying Numeric Arguments}{1.4.5}{Numeric Arguments}{17}
@numsubsecentry{Letting Readline Type For You}{1.4.6}{Commands For Completion}{17}
@numsubsecentry{Keyboard Macros}{1.4.7}{Keyboard Macros}{17}
@numsubsecentry{Keyboard Macros}{1.4.7}{Keyboard Macros}{18}
@numsubsecentry{Some Miscellaneous Commands}{1.4.8}{Miscellaneous Commands}{18}
@numsecentry{Readline vi Mode}{1.5}{Readline vi Mode}{19}
@appentry{GNU Free Documentation License}{A}{GNU Free Documentation License}{20}
lib/readline/doc/rluserman.vr
+4 -3
View File
@@ -6,7 +6,7 @@
\entry{convert-meta}{5}{\code {convert-meta}}
\entry{disable-completion}{5}{\code {disable-completion}}
\entry{editing-mode}{5}{\code {editing-mode}}
\entry{enable-keypad}{5}{\code {enable-keypad}}
\entry{enable-keypad}{6}{\code {enable-keypad}}
\entry{expand-tilde}{6}{\code {expand-tilde}}
\entry{history-preserve-point}{6}{\code {history-preserve-point}}
\entry{history-size}{6}{\code {history-size}}
@@ -15,7 +15,7 @@
\entry{meta-flag}{6}{\code {meta-flag}}
\entry{isearch-terminators}{6}{\code {isearch-terminators}}
\entry{keymap}{6}{\code {keymap}}
\entry{mark-modified-lines}{6}{\code {mark-modified-lines}}
\entry{mark-modified-lines}{7}{\code {mark-modified-lines}}
\entry{mark-symlinked-directories}{7}{\code {mark-symlinked-directories}}
\entry{match-hidden-files}{7}{\code {match-hidden-files}}
\entry{output-meta}{7}{\code {output-meta}}
@@ -23,4 +23,5 @@
\entry{revert-all-at-newline}{7}{\code {revert-all-at-newline}}
\entry{show-all-if-ambiguous}{7}{\code {show-all-if-ambiguous}}
\entry{show-all-if-unmodified}{7}{\code {show-all-if-unmodified}}
\entry{visible-stats}{7}{\code {visible-stats}}
\entry{skip-completed-text}{8}{\code {skip-completed-text}}
\entry{visible-stats}{8}{\code {visible-stats}}
lib/readline/doc/rluserman.vrs
+4 -3
View File
@@ -10,7 +10,7 @@
\entry {\code {disable-completion}}{5}
\initial {E}
\entry {\code {editing-mode}}{5}
\entry {\code {enable-keypad}}{5}
\entry {\code {enable-keypad}}{6}
\entry {\code {expand-tilde}}{6}
\initial {H}
\entry {\code {history-preserve-point}}{6}
@@ -22,7 +22,7 @@
\initial {K}
\entry {\code {keymap}}{6}
\initial {M}
\entry {\code {mark-modified-lines}}{6}
\entry {\code {mark-modified-lines}}{7}
\entry {\code {mark-symlinked-directories}}{7}
\entry {\code {match-hidden-files}}{7}
\entry {\code {meta-flag}}{6}
@@ -35,5 +35,6 @@
\initial {S}
\entry {\code {show-all-if-ambiguous}}{7}
\entry {\code {show-all-if-unmodified}}{7}
\entry {\code {skip-completed-text}}{8}
\initial {V}
\entry {\code {visible-stats}}{7}
\entry {\code {visible-stats}}{8}
lib/readline/posixdir.h
-61
View File
@@ -1,61 +0,0 @@
/* posixdir.h -- Posix directory reading includes and defines. */
/* Copyright (C) 1987,1991 Free Software Foundation, Inc.
This file is part of GNU Bash, the Bourne Again SHell.
Bash 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.
Bash 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 Bash. If not, see <http://www.gnu.org/licenses/>.
*/
/* This file should be included instead of <dirent.h> or <sys/dir.h>. */
#if !defined (_POSIXDIR_H_)
#define _POSIXDIR_H_
#if defined (HAVE_DIRENT_H)
# include <dirent.h>
# if defined (HAVE_STRUCT_DIRENT_D_NAMLEN)
# define D_NAMLEN(d) ((d)->d_namlen)
# else
# define D_NAMLEN(d) (strlen ((d)->d_name))
# endif /* !HAVE_STRUCT_DIRENT_D_NAMLEN */
#else
# if defined (HAVE_SYS_NDIR_H)
# include <sys/ndir.h>
# endif
# if defined (HAVE_SYS_DIR_H)
# include <sys/dir.h>
# endif
# if defined (HAVE_NDIR_H)
# include <ndir.h>
# endif
# if !defined (dirent)
# define dirent direct
# endif /* !dirent */
# define D_NAMLEN(d) ((d)->d_namlen)
#endif /* !HAVE_DIRENT_H */
#if defined (HAVE_STRUCT_DIRENT_D_INO) && !defined (HAVE_STRUCT_DIRENT_D_FILENO)
# define d_fileno d_ino
#endif
#if defined (_POSIX_SOURCE) && (!defined (HAVE_STRUCT_DIRENT_D_INO) || defined (BROKEN_DIRENT_D_INO))
/* Posix does not require that the d_ino field be present, and some
systems do not provide it. */
# define REAL_DIR_ENTRY(dp) 1
#else
# define REAL_DIR_ENTRY(dp) (dp->d_ino != 0)
#endif /* _POSIX_SOURCE */
#endif /* !_POSIXDIR_H_ */
lib/readline/posixdir.h
Symlink
+1
View File
@@ -0,0 +1 @@
../../include/posixdir.h
lib/readline/posixjmp.h
-40
View File
@@ -1,40 +0,0 @@
/* posixjmp.h -- wrapper for setjmp.h with changes for POSIX systems. */
/* Copyright (C) 1987,1991 Free Software Foundation, Inc.
This file is part of GNU Bash, the Bourne Again SHell.
Bash 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.
Bash 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 Bash. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _POSIXJMP_H_
#define _POSIXJMP_H_
#include <setjmp.h>
/* This *must* be included *after* config.h */
#if defined (HAVE_POSIX_SIGSETJMP)
# define procenv_t sigjmp_buf
# if !defined (__OPENNT)
# undef setjmp
# define setjmp(x) sigsetjmp((x), 1)
# undef longjmp
# define longjmp(x, n) siglongjmp((x), (n))
# endif /* !__OPENNT */
#else
# define procenv_t jmp_buf
#endif
#endif /* _POSIXJMP_H_ */
lib/readline/posixjmp.h
Symlink
+1
View File
@@ -0,0 +1 @@
../../include/posixjmp.h
lib/readline/posixselect.h
-47
View File
@@ -1,47 +0,0 @@
/* posixselect.h -- wrapper for select(2) includes and definitions */
/* Copyright (C) 2009 Free Software Foundation, Inc.
This file is part of GNU Bash, the Bourne Again SHell.
Bash 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.
Bash 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 Bash. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _POSIXSELECT_H_
#define _POSIXSELECT_H_
#if defined (FD_SET) && !defined (HAVE_SELECT)
# define HAVE_SELECT 1
#endif
#if defined (HAVE_SELECT)
# if !defined (HAVE_SYS_SELECT_H) || !defined (M_UNIX)
# include <sys/time.h>
# endif
#endif /* HAVE_SELECT */
#if defined (HAVE_SYS_SELECT_H)
# include <sys/select.h>
#endif
#ifndef USEC_PER_SEC
# define USEC_PER_SEC 1000000
#endif
#define USEC_TO_TIMEVAL(us, tv) \
do { \
(tv).tv_sec = (us) / USEC_PER_SEC; \
(tv).tv_usec = (us) % USEC_PER_SEC; \
} while (0)
#endif /* _POSIXSELECT_H_ */
lib/readline/posixselect.h
Symlink
+1
View File
@@ -0,0 +1 @@
../../include/posixselect.h
lib/readline/posixstat.h
-142
View File
@@ -1,142 +0,0 @@
/* posixstat.h -- Posix stat(2) definitions for systems that
don't have them. */
/* Copyright (C) 1987,1991 Free Software Foundation, Inc.
This file is part of GNU Bash, the Bourne Again SHell.
Bash 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.
Bash 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 Bash. If not, see <http://www.gnu.org/licenses/>.
*/
/* This file should be included instead of <sys/stat.h>.
It relies on the local sys/stat.h to work though. */
#if !defined (_POSIXSTAT_H_)
#define _POSIXSTAT_H_
#include <sys/stat.h>
#if defined (STAT_MACROS_BROKEN)
# undef S_ISBLK
# undef S_ISCHR
# undef S_ISDIR
# undef S_ISFIFO
# undef S_ISREG
# undef S_ISLNK
#endif /* STAT_MACROS_BROKEN */
/* These are guaranteed to work only on isc386 */
#if !defined (S_IFDIR) && !defined (S_ISDIR)
# define S_IFDIR 0040000
#endif /* !S_IFDIR && !S_ISDIR */
#if !defined (S_IFMT)
# define S_IFMT 0170000
#endif /* !S_IFMT */
/* Posix 1003.1 5.6.1.1 <sys/stat.h> file types */
/* Some Posix-wannabe systems define _S_IF* macros instead of S_IF*, but
do not provide the S_IS* macros that Posix requires. */
#if defined (_S_IFMT) && !defined (S_IFMT)
#define S_IFMT _S_IFMT
#endif
#if defined (_S_IFIFO) && !defined (S_IFIFO)
#define S_IFIFO _S_IFIFO
#endif
#if defined (_S_IFCHR) && !defined (S_IFCHR)
#define S_IFCHR _S_IFCHR
#endif
#if defined (_S_IFDIR) && !defined (S_IFDIR)
#define S_IFDIR _S_IFDIR
#endif
#if defined (_S_IFBLK) && !defined (S_IFBLK)
#define S_IFBLK _S_IFBLK
#endif
#if defined (_S_IFREG) && !defined (S_IFREG)
#define S_IFREG _S_IFREG
#endif
#if defined (_S_IFLNK) && !defined (S_IFLNK)
#define S_IFLNK _S_IFLNK
#endif
#if defined (_S_IFSOCK) && !defined (S_IFSOCK)
#define S_IFSOCK _S_IFSOCK
#endif
/* Test for each symbol individually and define the ones necessary (some
systems claiming Posix compatibility define some but not all). */
#if defined (S_IFBLK) && !defined (S_ISBLK)
#define S_ISBLK(m) (((m)&S_IFMT) == S_IFBLK) /* block device */
#endif
#if defined (S_IFCHR) && !defined (S_ISCHR)
#define S_ISCHR(m) (((m)&S_IFMT) == S_IFCHR) /* character device */
#endif
#if defined (S_IFDIR) && !defined (S_ISDIR)
#define S_ISDIR(m) (((m)&S_IFMT) == S_IFDIR) /* directory */
#endif
#if defined (S_IFREG) && !defined (S_ISREG)
#define S_ISREG(m) (((m)&S_IFMT) == S_IFREG) /* file */
#endif
#if defined (S_IFIFO) && !defined (S_ISFIFO)
#define S_ISFIFO(m) (((m)&S_IFMT) == S_IFIFO) /* fifo - named pipe */
#endif
#if defined (S_IFLNK) && !defined (S_ISLNK)
#define S_ISLNK(m) (((m)&S_IFMT) == S_IFLNK) /* symbolic link */
#endif
#if defined (S_IFSOCK) && !defined (S_ISSOCK)
#define S_ISSOCK(m) (((m)&S_IFMT) == S_IFSOCK) /* socket */
#endif
/*
* POSIX 1003.1 5.6.1.2 <sys/stat.h> File Modes
*/
#if !defined (S_IRWXU)
# if !defined (S_IREAD)
# define S_IREAD 00400
# define S_IWRITE 00200
# define S_IEXEC 00100
# endif /* S_IREAD */
# if !defined (S_IRUSR)
# define S_IRUSR S_IREAD /* read, owner */
# define S_IWUSR S_IWRITE /* write, owner */
# define S_IXUSR S_IEXEC /* execute, owner */
# define S_IRGRP (S_IREAD >> 3) /* read, group */
# define S_IWGRP (S_IWRITE >> 3) /* write, group */
# define S_IXGRP (S_IEXEC >> 3) /* execute, group */
# define S_IROTH (S_IREAD >> 6) /* read, other */
# define S_IWOTH (S_IWRITE >> 6) /* write, other */
# define S_IXOTH (S_IEXEC >> 6) /* execute, other */
# endif /* !S_IRUSR */
# define S_IRWXU (S_IRUSR | S_IWUSR | S_IXUSR)
# define S_IRWXG (S_IRGRP | S_IWGRP | S_IXGRP)
# define S_IRWXO (S_IROTH | S_IWOTH | S_IXOTH)
#endif /* !S_IRWXU */
/* These are non-standard, but are used in builtins.c$symbolic_umask() */
#define S_IRUGO (S_IRUSR | S_IRGRP | S_IROTH)
#define S_IWUGO (S_IWUSR | S_IWGRP | S_IWOTH)
#define S_IXUGO (S_IXUSR | S_IXGRP | S_IXOTH)
#endif /* _POSIXSTAT_H_ */
lib/readline/posixstat.h
Symlink
+1
View File
@@ -0,0 +1 @@
../../include/posixstat.h
lib/readline/tilde.c
-502
View File
@@ -1,502 +0,0 @@
/* tilde.c -- Tilde expansion code (~/foo := $HOME/foo). */
/* Copyright (C) 1988-2009 Free Software Foundation, Inc.
This file is part of the GNU Readline Library (Readline), a library
for reading lines of text with interactive input and history editing.
Readline 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.
Readline 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 Readline. If not, see <http://www.gnu.org/licenses/>.
*/
#if defined (HAVE_CONFIG_H)
# include <config.h>
#endif
#if defined (HAVE_UNISTD_H)
# ifdef _MINIX
# include <sys/types.h>
# endif
# include <unistd.h>
#endif
#if defined (HAVE_STRING_H)
# include <string.h>
#else /* !HAVE_STRING_H */
# include <strings.h>
#endif /* !HAVE_STRING_H */
#if defined (HAVE_STDLIB_H)
# include <stdlib.h>
#else
# include "ansi_stdlib.h"
#endif /* HAVE_STDLIB_H */
#include <sys/types.h>
#if defined (HAVE_PWD_H)
#include <pwd.h>
#endif
#include "tilde.h"
#if defined (TEST) || defined (STATIC_MALLOC)
static void *xmalloc (), *xrealloc ();
#else
# include "xmalloc.h"
#endif /* TEST || STATIC_MALLOC */
#if !defined (HAVE_GETPW_DECLS)
# if defined (HAVE_GETPWUID)
extern struct passwd *getpwuid PARAMS((uid_t));
# endif
# if defined (HAVE_GETPWNAM)
extern struct passwd *getpwnam PARAMS((const char *));
# endif
#endif /* !HAVE_GETPW_DECLS */
#if !defined (savestring)
#define savestring(x) strcpy ((char *)xmalloc (1 + strlen (x)), (x))
#endif /* !savestring */
#if !defined (NULL)
# if defined (__STDC__)
# define NULL ((void *) 0)
# else
# define NULL 0x0
# endif /* !__STDC__ */
#endif /* !NULL */
/* If being compiled as part of bash, these will be satisfied from
variables.o. If being compiled as part of readline, they will
be satisfied from shell.o. */
extern char *sh_get_home_dir PARAMS((void));
extern char *sh_get_env_value PARAMS((const char *));
/* The default value of tilde_additional_prefixes. This is set to
whitespace preceding a tilde so that simple programs which do not
perform any word separation get desired behaviour. */
static const char *default_prefixes[] =
{ " ~", "\t~", (const char *)NULL };
/* The default value of tilde_additional_suffixes. This is set to
whitespace or newline so that simple programs which do not
perform any word separation get desired behaviour. */
static const char *default_suffixes[] =
{ " ", "\n", (const char *)NULL };
/* If non-null, this contains the address of a function that the application
wants called before trying the standard tilde expansions. The function
is called with the text sans tilde, and returns a malloc()'ed string
which is the expansion, or a NULL pointer if the expansion fails. */
tilde_hook_func_t *tilde_expansion_preexpansion_hook = (tilde_hook_func_t *)NULL;
/* If non-null, this contains the address of a function to call if the
standard meaning for expanding a tilde fails. The function is called
with the text (sans tilde, as in "foo"), and returns a malloc()'ed string
which is the expansion, or a NULL pointer if there is no expansion. */
tilde_hook_func_t *tilde_expansion_failure_hook = (tilde_hook_func_t *)NULL;
/* When non-null, this is a NULL terminated array of strings which
are duplicates for a tilde prefix. Bash uses this to expand
`=~' and `:~'. */
char **tilde_additional_prefixes = (char **)default_prefixes;
/* When non-null, this is a NULL terminated array of strings which match
the end of a username, instead of just "/". Bash sets this to
`:' and `=~'. */
char **tilde_additional_suffixes = (char **)default_suffixes;
static int tilde_find_prefix PARAMS((const char *, int *));
static int tilde_find_suffix PARAMS((const char *));
static char *isolate_tilde_prefix PARAMS((const char *, int *));
static char *glue_prefix_and_suffix PARAMS((char *, const char *, int));
/* Find the start of a tilde expansion in STRING, and return the index of
the tilde which starts the expansion. Place the length of the text
which identified this tilde starter in LEN, excluding the tilde itself. */
static int
tilde_find_prefix (string, len)
const char *string;
int *len;
{
register int i, j, string_len;
register char **prefixes;
prefixes = tilde_additional_prefixes;
string_len = strlen (string);
*len = 0;
if (*string == '\0' || *string == '~')
return (0);
if (prefixes)
{
for (i = 0; i < string_len; i++)
{
for (j = 0; prefixes[j]; j++)
{
if (strncmp (string + i, prefixes[j], strlen (prefixes[j])) == 0)
{
*len = strlen (prefixes[j]) - 1;
return (i + *len);
}
}
}
}
return (string_len);
}
/* Find the end of a tilde expansion in STRING, and return the index of
the character which ends the tilde definition. */
static int
tilde_find_suffix (string)
const char *string;
{
register int i, j, string_len;
register char **suffixes;
suffixes = tilde_additional_suffixes;
string_len = strlen (string);
for (i = 0; i < string_len; i++)
{
#if defined (__MSDOS__)
if (string[i] == '/' || string[i] == '\\' /* || !string[i] */)
#else
if (string[i] == '/' /* || !string[i] */)
#endif
break;
for (j = 0; suffixes && suffixes[j]; j++)
{
if (strncmp (string + i, suffixes[j], strlen (suffixes[j])) == 0)
return (i);
}
}
return (i);
}
/* Return a new string which is the result of tilde expanding STRING. */
char *
tilde_expand (string)
const char *string;
{
char *result;
int result_size, result_index;
result_index = result_size = 0;
if (result = strchr (string, '~'))
result = (char *)xmalloc (result_size = (strlen (string) + 16));
else
result = (char *)xmalloc (result_size = (strlen (string) + 1));
/* Scan through STRING expanding tildes as we come to them. */
while (1)
{
register int start, end;
char *tilde_word, *expansion;
int len;
/* Make START point to the tilde which starts the expansion. */
start = tilde_find_prefix (string, &len);
/* Copy the skipped text into the result. */
if ((result_index + start + 1) > result_size)
result = (char *)xrealloc (result, 1 + (result_size += (start + 20)));
strncpy (result + result_index, string, start);
result_index += start;
/* Advance STRING to the starting tilde. */
string += start;
/* Make END be the index of one after the last character of the
username. */
end = tilde_find_suffix (string);
/* If both START and END are zero, we are all done. */
if (!start && !end)
break;
/* Expand the entire tilde word, and copy it into RESULT. */
tilde_word = (char *)xmalloc (1 + end);
strncpy (tilde_word, string, end);
tilde_word[end] = '\0';
string += end;
expansion = tilde_expand_word (tilde_word);
xfree (tilde_word);
len = strlen (expansion);
#ifdef __CYGWIN__
/* Fix for Cygwin to prevent ~user/xxx from expanding to //xxx when
$HOME for `user' is /. On cygwin, // denotes a network drive. */
if (len > 1 || *expansion != '/' || *string != '/')
#endif
{
if ((result_index + len + 1) > result_size)
result = (char *)xrealloc (result, 1 + (result_size += (len + 20)));
strcpy (result + result_index, expansion);
result_index += len;
}
xfree (expansion);
}
result[result_index] = '\0';
return (result);
}
/* Take FNAME and return the tilde prefix we want expanded. If LENP is
non-null, the index of the end of the prefix into FNAME is returned in
the location it points to. */
static char *
isolate_tilde_prefix (fname, lenp)
const char *fname;
int *lenp;
{
char *ret;
int i;
ret = (char *)xmalloc (strlen (fname));
#if defined (__MSDOS__)
for (i = 1; fname[i] && fname[i] != '/' && fname[i] != '\\'; i++)
#else
for (i = 1; fname[i] && fname[i] != '/'; i++)
#endif
ret[i - 1] = fname[i];
ret[i - 1] = '\0';
if (lenp)
*lenp = i;
return ret;
}
#if 0
/* Public function to scan a string (FNAME) beginning with a tilde and find
the portion of the string that should be passed to the tilde expansion
function. Right now, it just calls tilde_find_suffix and allocates new
memory, but it can be expanded to do different things later. */
char *
tilde_find_word (fname, flags, lenp)
const char *fname;
int flags, *lenp;
{
int x;
char *r;
x = tilde_find_suffix (fname);
if (x == 0)
{
r = savestring (fname);
if (lenp)
*lenp = 0;
}
else
{
r = (char *)xmalloc (1 + x);
strncpy (r, fname, x);
r[x] = '\0';
if (lenp)
*lenp = x;
}
return r;
}
#endif
/* Return a string that is PREFIX concatenated with SUFFIX starting at
SUFFIND. */
static char *
glue_prefix_and_suffix (prefix, suffix, suffind)
char *prefix;
const char *suffix;
int suffind;
{
char *ret;
int plen, slen;
plen = (prefix && *prefix) ? strlen (prefix) : 0;
slen = strlen (suffix + suffind);
ret = (char *)xmalloc (plen + slen + 1);
if (plen)
strcpy (ret, prefix);
strcpy (ret + plen, suffix + suffind);
return ret;
}
/* Do the work of tilde expansion on FILENAME. FILENAME starts with a
tilde. If there is no expansion, call tilde_expansion_failure_hook.
This always returns a newly-allocated string, never static storage. */
char *
tilde_expand_word (filename)
const char *filename;
{
char *dirname, *expansion, *username;
int user_len;
struct passwd *user_entry;
if (filename == 0)
return ((char *)NULL);
if (*filename != '~')
return (savestring (filename));
/* A leading `~/' or a bare `~' is *always* translated to the value of
$HOME or the home directory of the current user, regardless of any
preexpansion hook. */
if (filename[1] == '\0' || filename[1] == '/')
{
/* Prefix $HOME to the rest of the string. */
expansion = sh_get_env_value ("HOME");
/* If there is no HOME variable, look up the directory in
the password database. */
if (expansion == 0)
expansion = sh_get_home_dir ();
return (glue_prefix_and_suffix (expansion, filename, 1));
}
username = isolate_tilde_prefix (filename, &user_len);
if (tilde_expansion_preexpansion_hook)
{
expansion = (*tilde_expansion_preexpansion_hook) (username);
if (expansion)
{
dirname = glue_prefix_and_suffix (expansion, filename, user_len);
xfree (username);
free (expansion);
return (dirname);
}
}
/* No preexpansion hook, or the preexpansion hook failed. Look in the
password database. */
dirname = (char *)NULL;
#if defined (HAVE_GETPWNAM)
user_entry = getpwnam (username);
#else
user_entry = 0;
#endif
if (user_entry == 0)
{
/* If the calling program has a special syntax for expanding tildes,
and we couldn't find a standard expansion, then let them try. */
if (tilde_expansion_failure_hook)
{
expansion = (*tilde_expansion_failure_hook) (username);
if (expansion)
{
dirname = glue_prefix_and_suffix (expansion, filename, user_len);
free (expansion);
}
}
/* If we don't have a failure hook, or if the failure hook did not
expand the tilde, return a copy of what we were passed. */
if (dirname == 0)
dirname = savestring (filename);
}
#if defined (HAVE_GETPWENT)
else
dirname = glue_prefix_and_suffix (user_entry->pw_dir, filename, user_len);
#endif
xfree (username);
#if defined (HAVE_GETPWENT)
endpwent ();
#endif
return (dirname);
}
#if defined (TEST)
#undef NULL
#include <stdio.h>
main (argc, argv)
int argc;
char **argv;
{
char *result, line[512];
int done = 0;
while (!done)
{
printf ("~expand: ");
fflush (stdout);
if (!gets (line))
strcpy (line, "done");
if ((strcmp (line, "done") == 0) ||
(strcmp (line, "quit") == 0) ||
(strcmp (line, "exit") == 0))
{
done = 1;
break;
}
result = tilde_expand (line);
printf (" --> %s\n", result);
free (result);
}
exit (0);
}
static void memory_error_and_abort ();
static void *
xmalloc (bytes)
size_t bytes;
{
void *temp = (char *)malloc (bytes);
if (!temp)
memory_error_and_abort ();
return (temp);
}
static void *
xrealloc (pointer, bytes)
void *pointer;
int bytes;
{
void *temp;
if (!pointer)
temp = malloc (bytes);
else
temp = realloc (pointer, bytes);
if (!temp)
memory_error_and_abort ();
return (temp);
}
static void
memory_error_and_abort ()
{
fprintf (stderr, "readline: out of virtual memory\n");
abort ();
}
/*
* Local variables:
* compile-command: "gcc -g -DTEST -o tilde tilde.c"
* end:
*/
#endif /* TEST */
lib/readline/tilde.c
Symlink
+1
View File
@@ -0,0 +1 @@
../tilde/tilde.c
lib/readline/tilde.h
-80
View File
@@ -1,80 +0,0 @@
/* tilde.h: Externally available variables and function in libtilde.a. */
/* Copyright (C) 1992-2009 Free Software Foundation, Inc.
This file contains the Readline Library (Readline), a set of
routines for providing Emacs style line input to programs that ask
for it.
Readline 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.
Readline 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 Readline. If not, see <http://www.gnu.org/licenses/>.
*/
#if !defined (_TILDE_H_)
# define _TILDE_H_
#ifdef __cplusplus
extern "C" {
#endif
/* A function can be defined using prototypes and compile on both ANSI C
and traditional C compilers with something like this:
extern char *func PARAMS((char *, char *, int)); */
#if !defined (PARAMS)
# if defined (__STDC__) || defined (__GNUC__) || defined (__cplusplus)
# define PARAMS(protos) protos
# else
# define PARAMS(protos) ()
# endif
#endif
typedef char *tilde_hook_func_t PARAMS((char *));
/* If non-null, this contains the address of a function that the application
wants called before trying the standard tilde expansions. The function
is called with the text sans tilde, and returns a malloc()'ed string
which is the expansion, or a NULL pointer if the expansion fails. */
extern tilde_hook_func_t *tilde_expansion_preexpansion_hook;
/* If non-null, this contains the address of a function to call if the
standard meaning for expanding a tilde fails. The function is called
with the text (sans tilde, as in "foo"), and returns a malloc()'ed string
which is the expansion, or a NULL pointer if there is no expansion. */
extern tilde_hook_func_t *tilde_expansion_failure_hook;
/* When non-null, this is a NULL terminated array of strings which
are duplicates for a tilde prefix. Bash uses this to expand
`=~' and `:~'. */
extern char **tilde_additional_prefixes;
/* When non-null, this is a NULL terminated array of strings which match
the end of a username, instead of just "/". Bash sets this to
`:' and `=~'. */
extern char **tilde_additional_suffixes;
/* Return a new string which is the result of tilde expanding STRING. */
extern char *tilde_expand PARAMS((const char *));
/* Do the work of tilde expansion on FILENAME. FILENAME starts with a
tilde. If there is no expansion, call tilde_expansion_failure_hook. */
extern char *tilde_expand_word PARAMS((const char *));
/* Find the portion of the string beginning with ~ that should be expanded. */
extern char *tilde_find_word PARAMS((const char *, int, int *));
#ifdef __cplusplus
}
#endif
#endif /* _TILDE_H_ */
lib/readline/tilde.h
Symlink
+1
View File
@@ -0,0 +1 @@
../tilde/tilde.h
lib/sh/fnxform.c
+1
View File
@@ -185,6 +185,7 @@ char *
fnx_tofs (string)
char *string;
{
bar
return string;
}