ruby-augeas-0.5.0/0000775000076400007640000000000012117721166013376 5ustar lutterlutterruby-augeas-0.5.0/NEWS0000664000076400007640000000240212117717141014071 0ustar lutterlutter0.5.0 - 2013-03-XX - add libxml2 headers and library to Makefile - add libxml2-devel build req to rpm spec - split out header, add memstream utils from Augeas - integrate with Travis CI - Takefile: add gem authors metadata - Augeas::transform: add .lns suffix if a module name is passed to match aug_transform behaviour - add Augeas::clearm - add Augeas::context and Augeas::context= - add Augeas::label - add Augeas::rename - add Augeas::srun - add Augeas::text_retrieve - add Augeas::text_store 0.4.1 - 2011-03-29 - remove object files from release tarball 0.4.0 - 2011-03-25 - set can now set multiple elements at once - expose aug_setm as Augeas#setm - expose error functions through Augeas#error - expose aug_span as Augeas#span 0.3.0 - 2009-08-12 - Require augeas >= 0.5.1 - Bindings for aug_load, aug_defvar, and aug_defnode - Map flags AUG_NO_STDINC, AUG_NO_LOAD, AUG_NO_MODL_AUTOLOAD - Augeas::transform: convenience method for setting up transforms - Augeas::set: allow passing in nil as the value - Augeas::open: make args optional, accept block - Exception raising versions of set, load, and save 0.2.0 - 2008-08-26 Details for this and earlier releases need to be extracted from the history of the git repo ruby-augeas-0.5.0/Rakefile0000664000076400007640000000675512117720252015053 0ustar lutterlutter# -*- ruby -*- # Rakefile: build ruby auges bindings # # Copyright (C) 2008 Red Hat, Inc. # # Distributed under the GNU Lesser General Public License v2.1 or later. # See COPYING for details # # Bryan Kearney require 'rake/clean' require 'rdoc/task' require 'rake/testtask' require 'rubygems/package_task' PKG_NAME='ruby-augeas' GEM_NAME=PKG_NAME # we'd like 'augeas' but that makes RPM fail PKG_VERSION='0.5.0' EXT_CONF='ext/augeas/extconf.rb' MAKEFILE="ext/augeas/Makefile" AUGEAS_MODULE="ext/augeas/_augeas.so" SPEC_FILE="ruby-augeas.spec" AUGEAS_SRC=AUGEAS_MODULE.gsub(/.so$/, ".c") # # Building the actual bits # CLEAN.include [ "**/*~", "ext/**/*.o", AUGEAS_MODULE, "ext/**/depend" ] CLOBBER.include [ "config.save", "ext/**/mkmf.log", MAKEFILE ] file MAKEFILE => EXT_CONF do |t| Dir::chdir(File::dirname(EXT_CONF)) do unless sh "ruby #{File::basename(EXT_CONF)}" $stderr.puts "Failed to run extconf" break end end end file AUGEAS_MODULE => [ MAKEFILE, AUGEAS_SRC ] do |t| Dir::chdir(File::dirname(EXT_CONF)) do unless sh "make" $stderr.puts "make failed" break end end end desc "Build the native library" task :build => AUGEAS_MODULE # # Testing # Rake::TestTask.new(:test) do |t| t.test_files = FileList['tests/tc_*.rb'] t.libs = [ 'lib', 'ext/augeas' ] end task :test => :build # # Generate the documentation # RDoc::Task.new do |rd| rd.main = "README.rdoc" rd.rdoc_dir = "doc/site/api" rd.rdoc_files.include("README.rdoc", "ext/**/*.[ch]","lib/**/*.rb") end # # Packaging # PKG_FILES = FileList[ "Rakefile", "COPYING","README.rdoc", "NEWS", "ext/**/*.[ch]", "lib/**/*.rb", "ext/**/MANIFEST", "ext/**/extconf.rb", "tests/**/*", "spec/**/*" ] DIST_FILES = FileList[ "pkg/*.tgz", "pkg/*.gem" ] SPEC = Gem::Specification.new do |s| s.name = GEM_NAME s.version = PKG_VERSION s.email = "augeas-devel@redhat.com" s.homepage = "http://augeas.net/" s.summary = "Ruby bindings for augeas" s.authors = [ "Bryan Kearney", "David Lutterkort" ] s.files = PKG_FILES s.autorequire = "augeas" s.required_ruby_version = '>= 1.8.1' s.extensions = "ext/augeas/extconf.rb" s.description = "Provides bindings for augeas." end Gem::PackageTask.new(SPEC) do |pkg| pkg.need_tar = true pkg.need_zip = true end desc "Build (S)RPM for #{PKG_NAME}" task :rpm => [ :package ] do |t| system("sed -e 's/@VERSION@/#{PKG_VERSION}/' #{SPEC_FILE} > pkg/#{SPEC_FILE}") Dir::chdir("pkg") do |dir| dir = File::expand_path(".") system("rpmbuild --define '_topdir #{dir}' --define '_sourcedir #{dir}' --define '_srcrpmdir #{dir}' --define '_rpmdir #{dir}' --define '_builddir #{dir}' -ba #{SPEC_FILE} > rpmbuild.log 2>&1") if $? != 0 raise "rpmbuild failed" end end end desc "Release a version to the site" task :dist => [ :rpm ] do |t| puts "Copying files" unless sh "scp -p #{DIST_FILES.to_s} et:/var/www/sites/augeas.et.redhat.com/download/ruby" $stderr.puts "Copy to et failed" break end puts "Commit and tag #{PKG_VERSION}" system "git commit -a -m 'Released version #{PKG_VERSION}'" system "git tag -s -m 'Tag release #{PKG_VERSION}' release-#{PKG_VERSION}" end task :sync do |t| system "rsync -rav doc/site/ et:/var/www/sites/augeas.et.redhat.com/docs/ruby/" end task :default => [:build, :test] ruby-augeas-0.5.0/README.rdoc0000664000076400007640000000203012104527224015172 0ustar lutterlutter= Ruby bindings for augeas The class Augeas provides bindings to augeas [http://augeas.net] library. == Usage: Setting Data Augeas::open do |aug| aug.set("/files/etc/sysconfig/firstboot/RUN_FIRSTBOOT", "YES") unless aug.save raise IOError, "Failed to save changes" end end == Usage: Accessing Data firstboot = Augeas::open { |aug| aug.get("/files/etc/sysconfig/firstboot/RUN_FIRSTBOOT") } == Usage: Removing Data Augeas::open do |aug| aug.rm("/files/etc/sysconfig/firstboot/RUN_FIRSTBOOT") unless aug.save raise IOError, "Failed to save changes" end end == Usage: Minimal Setup with a Custom Root By passing +NO_MODL_AUTOLOAD+, no files are read on startup; that allows setting up a custom transform. Augeas::open("/var/tmp/augeas-root", "/usr/local/share/mylenses", Augeas::NO_MODL_AUTOLOAD) do |aug| aug.transform(:lens => "Aliases.lns", :incl => "/etc/aliases") aug.load aug.get("/files/etc/aliases/*[name = 'postmaster']/value") end ruby-augeas-0.5.0/COPYING0000664000076400007640000006365011212061126014427 0ustar lutterlutter GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. ^L Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. ^L GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. ^L Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. ^L 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. ^L 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. ^L 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. ^L 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS ^L How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! ruby-augeas-0.5.0/ext/0000775000076400007640000000000012117721166014176 5ustar lutterlutterruby-augeas-0.5.0/ext/augeas/0000775000076400007640000000000012117721166015443 5ustar lutterlutterruby-augeas-0.5.0/ext/augeas/_augeas.h0000664000076400007640000000250211703724261017216 0ustar lutterlutter/* * augeas.h: internal headers for Augeas Ruby bindings * * Copyright (C) 2008-2011 Red Hat Inc. * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library 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 * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include #ifndef _AUGEAS_H_ #define _AUGEAS_H_ #define StringValueCStrOrNull(v) \ NIL_P(v) ? NULL : StringValueCStr(v) /* memstream support from Augeas internal.h */ struct memstream { FILE *stream; char *buf; size_t size; }; int __aug_init_memstream(struct memstream *ms); int __aug_close_memstream(struct memstream *ms); #endif /* * Local variables: * indent-tabs-mode: nil * c-indent-level: 4 * c-basic-offset: 4 * tab-width: 4 * End: */ ruby-augeas-0.5.0/ext/augeas/extconf.rb0000664000076400007640000000211711703724261017436 0ustar lutterlutter## # extconf.rb: Ruby extension configuration # # Copyright (C) 200 Red Hat Inc. # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # # Author: Bryan Kearney ## require 'mkmf' extension_name = '_augeas' unless pkg_config("augeas") raise "augeas-devel not installed" end unless pkg_config("libxml-2.0") raise "libxml2-devel not installed" end create_makefile(extension_name) ruby-augeas-0.5.0/ext/augeas/_augeas.c0000664000076400007640000003647312117720367017232 0ustar lutterlutter/* * augeas.c: Ruby bindings for augeas * * Copyright (C) 2008-2011 Red Hat Inc. * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library 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 * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * * Author: Bryan Kearney */ #include "_augeas.h" #include #include static VALUE c_augeas; static augeas *aug_handle(VALUE s) { augeas *aug; Data_Get_Struct(s, struct augeas, aug); if (aug == NULL) { rb_raise(rb_eSystemCallError, "Failed to retrieve connection"); } return aug; } static void augeas_free(augeas *aug) { if (aug != NULL) aug_close(aug); } /* * call-seq: * get(PATH) -> String * * Lookup the value associated with PATH */ VALUE augeas_get(VALUE s, VALUE path) { augeas *aug = aug_handle(s); const char *cpath = StringValueCStr(path); const char *value; aug_get(aug, cpath, &value); if (value != NULL) { return rb_str_new(value, strlen(value)) ; } else { return Qnil; } } /* * call-seq: * exists(PATH) -> boolean * * Return true if there is an entry for this path, false otherwise */ VALUE augeas_exists(VALUE s, VALUE path) { augeas *aug = aug_handle(s); const char *cpath = StringValueCStr(path); int ret = aug_get(aug, cpath, NULL); return (ret == 1) ? Qtrue : Qfalse; } /* * call-seq: * set(PATH, VALUE) -> boolean * * Set the value associated with PATH to VALUE. VALUE is copied into the * internal data structure. Intermediate entries are created if they don't * exist. */ VALUE augeas_set(VALUE s, VALUE path, VALUE value) { augeas *aug = aug_handle(s); const char *cpath = StringValueCStr(path) ; const char *cvalue = StringValueCStrOrNull(value) ; int callValue = aug_set(aug, cpath, cvalue) ; VALUE returnValue ; if (callValue == 0) returnValue = Qtrue ; else returnValue = Qfalse ; return returnValue ; } /* * call-seq: * setm(BASE, SUB, VALUE) -> boolean * * Set multiple nodes in one operation. Find or create a node matching * SUB by interpreting SUB as a path expression relative to each node * matching BASE. SUB may be NULL, in which case all the nodes matching * BASE will be modified. */ VALUE augeas_setm(VALUE s, VALUE base, VALUE sub, VALUE value) { augeas *aug = aug_handle(s); const char *cbase = StringValueCStr(base) ; const char *csub = StringValueCStrOrNull(sub) ; const char *cvalue = StringValueCStrOrNull(value) ; int callValue = aug_setm(aug, cbase, csub, cvalue) ; return INT2FIX(callValue); } /* * call-seq: * insert(PATH, LABEL, BEFORE) -> int * * Make LABEL a sibling of PATH by inserting it directly before or after PATH. * The boolean BEFORE determines if LABEL is inserted before or after PATH. */ VALUE augeas_insert(VALUE s, VALUE path, VALUE label, VALUE before) { augeas *aug = aug_handle(s); const char *cpath = StringValueCStr(path) ; const char *clabel = StringValueCStr(label) ; int callValue = aug_insert(aug, cpath, clabel, RTEST(before)); return INT2FIX(callValue) ; } /* * call-seq: * mv(SRC, DST) -> int * * Move the node SRC to DST. SRC must match exactly one node in the * tree. DST must either match exactly one node in the tree, or may not * exist yet. If DST exists already, it and all its descendants are * deleted. If DST does not exist yet, it and all its missing ancestors are * created. */ VALUE augeas_mv(VALUE s, VALUE src, VALUE dst) { augeas *aug = aug_handle(s); const char *csrc = StringValueCStr(src); const char *cdst = StringValueCStr(dst); int r = aug_mv(aug, csrc, cdst); return INT2FIX(r); } /* * call-seq: * rm(PATH) -> int * * Remove path and all its children. Returns the number of entries removed */ VALUE augeas_rm(VALUE s, VALUE path, VALUE sibling) { augeas *aug = aug_handle(s); const char *cpath = StringValueCStr(path) ; int callValue = aug_rm(aug, cpath) ; return INT2FIX(callValue) ; } /* * call-seq: * match(PATH) -> an_array * * Return all the paths that match the path expression PATH as an aray of * strings. */ VALUE augeas_match(VALUE s, VALUE p) { augeas *aug = aug_handle(s); const char *path = StringValueCStr(p); char **matches = NULL; int cnt, i; cnt = aug_match(aug, path, &matches) ; if (cnt < 0) rb_raise(rb_eSystemCallError, "Matching path expression '%s' failed", path); VALUE result = rb_ary_new(); for (i = 0; i < cnt; i++) { rb_ary_push(result, rb_str_new(matches[i], strlen(matches[i]))); free(matches[i]) ; } free (matches) ; return result ; } /* * call-seq: * save() -> boolean * * Write all pending changes to disk */ VALUE augeas_save(VALUE s) { augeas *aug = aug_handle(s); int callValue = aug_save(aug) ; VALUE returnValue ; if (callValue == 0) returnValue = Qtrue ; else returnValue = Qfalse ; return returnValue ; } /* * call-seq: * load() -> boolean * * Load files from disk according to the transforms under +/augeas/load+ */ VALUE augeas_load(VALUE s) { augeas *aug = aug_handle(s); int callValue = aug_load(aug); VALUE returnValue ; if (callValue == 0) returnValue = Qtrue ; else returnValue = Qfalse ; return returnValue ; } /* * call-seq: * defvar(NAME, EXPR) -> boolean * * Define a variable NAME whose value is the result of evaluating EXPR. If * a variable NAME already exists, its name will be replaced with the * result of evaluating EXPR. * * If EXPR is NULL, the variable NAME will be removed if it is defined. * */ VALUE augeas_defvar(VALUE s, VALUE name, VALUE expr) { augeas *aug = aug_handle(s); const char *cname = StringValueCStr(name); const char *cexpr = StringValueCStrOrNull(expr); int r = aug_defvar(aug, cname, cexpr); return (r < 0) ? Qfalse : Qtrue; } /* * call-seq: * defnode(NAME, EXPR, VALUE) -> boolean * * Define a variable NAME whose value is the result of evaluating EXPR, * which must be non-NULL and evaluate to a nodeset. If a variable NAME * already exists, its name will be replaced with the result of evaluating * EXPR. * * If EXPR evaluates to an empty nodeset, a node is created, equivalent to * calling AUG_SET(AUG, EXPR, VALUE) and NAME will be the nodeset containing * that single node. * * Returns +false+ if +aug_defnode+ fails, and the number of nodes in the * nodeset on success. */ VALUE augeas_defnode(VALUE s, VALUE name, VALUE expr, VALUE value) { augeas *aug = aug_handle(s); const char *cname = StringValueCStr(name); const char *cexpr = StringValueCStrOrNull(expr); const char *cvalue = StringValueCStrOrNull(value); /* FIXME: Figure out a way to return created, maybe accept a block that gets run when created == 1 ? */ int r = aug_defnode(aug, cname, cexpr, cvalue, NULL); return (r < 0) ? Qfalse : INT2NUM(r); } VALUE augeas_init(VALUE m, VALUE r, VALUE l, VALUE f) { unsigned int flags = NUM2UINT(f); const char *root = StringValueCStrOrNull(r); const char *loadpath = StringValueCStrOrNull(l); augeas *aug = NULL; aug = aug_init(root, loadpath, flags); if (aug == NULL) { rb_raise(rb_eSystemCallError, "Failed to initialize Augeas"); } return Data_Wrap_Struct(c_augeas, NULL, augeas_free, aug); } VALUE augeas_close (VALUE s) { augeas *aug = aug_handle(s); aug_close(aug); DATA_PTR(s) = NULL; return Qnil; } static void hash_set(VALUE hash, const char *sym, VALUE v) { rb_hash_aset(hash, ID2SYM(rb_intern(sym)), v); } /* * call-seq: * error -> HASH * * Retrieve details about the last error encountered and return those * details in a HASH with the following entries: * - :code error code from +aug_error+ * - :message error message from +aug_error_message+ * - :minor minor error message from +aug_minor_error_message+ * - :details error details from +aug_error_details+ */ VALUE augeas_error(VALUE s) { augeas *aug = aug_handle(s); int code; const char *msg; VALUE result; result = rb_hash_new(); code = aug_error(aug); hash_set(result, "code", INT2NUM(code)); msg = aug_error_message(aug); if (msg != NULL) hash_set(result, "message", rb_str_new2(msg)); msg = aug_error_minor_message(aug); if (msg != NULL) hash_set(result, "minor", rb_str_new2(msg)); msg = aug_error_details(aug); if (msg != NULL) hash_set(result, "details", rb_str_new2(msg)); return result; } static void hash_set_range(VALUE hash, const char *sym, unsigned int start, unsigned int end) { VALUE r; r = rb_range_new(INT2NUM(start), INT2NUM(end), 0); hash_set(hash, sym, r); } VALUE augeas_span(VALUE s, VALUE path) { augeas *aug = aug_handle(s); char *cpath = StringValueCStr(path); char *filename = NULL; unsigned int label_start, label_end, value_start, value_end, span_start, span_end; int r; VALUE result; r = aug_span(aug, cpath, &filename, &label_start, &label_end, &value_start, &value_end, &span_start, &span_end); result = rb_hash_new(); if (r == 0) { hash_set(result, "filename", rb_str_new2(filename)); hash_set_range(result, "label", label_start, label_end); hash_set_range(result, "value", value_start, value_end); hash_set_range(result, "span", span_start, span_end); } free(filename); return result; } /* * call-seq: * srun(COMMANDS) -> [int, String] * * Run one or more newline-separated commands, returning their output. * * Returns: * an array where the first element is the number of executed commands on * success, -1 on failure, and -2 if a 'quit' command was encountered. * The second element is a string of the output from all commands. */ VALUE augeas_srun(VALUE s, VALUE text) { augeas *aug = aug_handle(s); const char *ctext = StringValueCStr(text); struct memstream ms; __aug_init_memstream(&ms); int r = aug_srun(aug, ms.stream, ctext); __aug_close_memstream(&ms); VALUE result = rb_ary_new(); rb_ary_push(result, INT2NUM(r)); rb_ary_push(result, rb_str_new2(ms.buf)); free(ms.buf); return result; } /* * call-seq: * label(PATH) -> String * * Lookup the label associated with PATH */ VALUE augeas_label(VALUE s, VALUE path) { augeas *aug = aug_handle(s); const char *cpath = StringValueCStr(path); const char *label; aug_label(aug, cpath, &label); if (label != NULL) { return rb_str_new(label, strlen(label)) ; } else { return Qnil; } } /* * call-seq: * rename(SRC, LABEL) -> int * * Rename the label of all nodes matching SRC to LABEL. * * Returns +false+ if +aug_rename+ fails, and the number of nodes renamed * on success. */ VALUE augeas_rename(VALUE s, VALUE src, VALUE label) { augeas *aug = aug_handle(s); const char *csrc = StringValueCStr(src); const char *clabel = StringValueCStr(label); int r = aug_rename(aug, csrc, clabel); return (r < 0) ? Qfalse : INT2NUM(r); } /* * call-seq: * text_store(LENS, NODE, PATH) -> boolean * * Use the value of node NODE as a string and transform it into a tree * using the lens LENS and store it in the tree at PATH, which will be * overwritten. PATH and NODE are path expressions. */ VALUE augeas_text_store(VALUE s, VALUE lens, VALUE node, VALUE path) { augeas *aug = aug_handle(s); const char *clens = StringValueCStr(lens); const char *cnode = StringValueCStr(node); const char *cpath = StringValueCStr(path); int r = aug_text_store(aug, clens, cnode, cpath); return (r < 0) ? Qfalse : Qtrue; } /* * call-seq: * text_retrieve(LENS, NODE_IN, PATH, NODE_OUT) -> boolean * * Transform the tree at PATH into a string using lens LENS and store it in * the node NODE_OUT, assuming the tree was initially generated using the * value of node NODE_IN. PATH, NODE_IN, and NODE_OUT are path expressions. */ VALUE augeas_text_retrieve(VALUE s, VALUE lens, VALUE node_in, VALUE path, VALUE node_out) { augeas *aug = aug_handle(s); const char *clens = StringValueCStr(lens); const char *cnode_in = StringValueCStr(node_in); const char *cpath = StringValueCStr(path); const char *cnode_out = StringValueCStr(node_out); int r = aug_text_retrieve(aug, clens, cnode_in, cpath, cnode_out); return (r < 0) ? Qfalse : Qtrue; } void Init__augeas() { /* Define the ruby class */ c_augeas = rb_define_class("Augeas", rb_cObject) ; /* Constants for enum aug_flags */ #define DEF_AUG_FLAG(name) \ rb_define_const(c_augeas, #name, INT2NUM(AUG_##name)) DEF_AUG_FLAG(NONE); DEF_AUG_FLAG(SAVE_BACKUP); DEF_AUG_FLAG(SAVE_NEWFILE); DEF_AUG_FLAG(TYPE_CHECK); DEF_AUG_FLAG(NO_STDINC); DEF_AUG_FLAG(SAVE_NOOP); DEF_AUG_FLAG(NO_LOAD); DEF_AUG_FLAG(NO_MODL_AUTOLOAD); DEF_AUG_FLAG(ENABLE_SPAN); #undef DEF_AUG_FLAG /* Constants for enum aug_errcode_t */ #define DEF_AUG_ERR(name) \ rb_define_const(c_augeas, #name, INT2NUM(AUG_##name)) DEF_AUG_ERR(NOERROR); DEF_AUG_ERR(ENOMEM); DEF_AUG_ERR(EINTERNAL); DEF_AUG_ERR(EPATHX); DEF_AUG_ERR(ENOMATCH); DEF_AUG_ERR(EMMATCH); DEF_AUG_ERR(ESYNTAX); DEF_AUG_ERR(ENOLENS); DEF_AUG_ERR(EMXFM); DEF_AUG_ERR(ENOSPAN); DEF_AUG_ERR(ECMDRUN); #undef DEF_AUG_ERR /* Define the methods */ rb_define_singleton_method(c_augeas, "open3", augeas_init, 3); rb_define_method(c_augeas, "defvar", augeas_defvar, 2); rb_define_method(c_augeas, "defnode", augeas_defnode, 3); rb_define_method(c_augeas, "get", augeas_get, 1); rb_define_method(c_augeas, "exists", augeas_exists, 1); rb_define_method(c_augeas, "insert", augeas_insert, 3); rb_define_method(c_augeas, "mv", augeas_mv, 2); rb_define_method(c_augeas, "rm", augeas_rm, 1); rb_define_method(c_augeas, "match", augeas_match, 1); rb_define_method(c_augeas, "save", augeas_save, 0); rb_define_method(c_augeas, "load", augeas_load, 0); rb_define_method(c_augeas, "set_internal", augeas_set, 2); rb_define_method(c_augeas, "setm", augeas_setm, 3); rb_define_method(c_augeas, "close", augeas_close, 0); rb_define_method(c_augeas, "error", augeas_error, 0); rb_define_method(c_augeas, "span", augeas_span, 1); rb_define_method(c_augeas, "srun", augeas_srun, 1); rb_define_method(c_augeas, "label", augeas_label, 1); rb_define_method(c_augeas, "rename", augeas_rename, 2); rb_define_method(c_augeas, "text_store", augeas_text_store, 3); rb_define_method(c_augeas, "text_retrieve", augeas_text_retrieve, 4); } /* * Local variables: * indent-tabs-mode: nil * c-indent-level: 4 * c-basic-offset: 4 * tab-width: 4 * End: */ ruby-augeas-0.5.0/tests/0000775000076400007640000000000012117721166014540 5ustar lutterlutterruby-augeas-0.5.0/tests/tc_augeas.rb0000664000076400007640000002214012104530003016777 0ustar lutterlutterrequire 'test/unit' TOPDIR = File::expand_path(File::join(File::dirname(__FILE__), "..")) $:.unshift(File::join(TOPDIR, "lib")) $:.unshift(File::join(TOPDIR, "ext", "augeas")) require 'augeas' require 'fileutils' class TestAugeas < Test::Unit::TestCase SRC_ROOT = File::expand_path(File::join(TOPDIR, "tests", "root")) + "/." TST_ROOT = File::expand_path(File::join(TOPDIR, "build", "root")) + "/" def test_basics aug = aug_open(Augeas::SAVE_NEWFILE) assert_equal("newfile", aug.get("/augeas/save")) assert_equal(TST_ROOT, aug.get("/augeas/root")) assert(aug.exists("/augeas/root")) assert_not_nil(aug.get("/augeas/root")) node = "/ruby/test/node" assert_nothing_raised { aug.set(node, "value") } assert_equal("value", aug.get(node)) assert_nothing_raised { aug.clear(node) } assert_equal(nil, aug.get(node)) m = aug.match("/*") ["/augeas", "/ruby"].each do |p| assert(m.include?(p)) assert(aug.exists(p)) end end def test_no_new assert_raise NoMethodError do Augeas.new end end def test_close aug = Augeas::open("/tmp", nil, Augeas::SAVE_NEWFILE) assert_equal("newfile", aug.get("/augeas/save")) aug.close assert_raise(SystemCallError) { aug.get("/augeas/save") } assert_raise(SystemCallError) { aug.close } end def test_mv Augeas::open("/dev/null") do |aug| aug.set("/a/b", "value") aug.mv("/a/b", "/x/y") assert_equal("value", aug.get("/x/y")) end end def test_load aug = aug_open(Augeas::NO_LOAD) assert_equal([], aug.match("/files/etc/*")) aug.rm("/augeas/load/*"); assert_nothing_raised { aug.load } assert_equal([], aug.match("/files/etc/*")) end def test_transform aug = aug_open(Augeas::NO_LOAD) aug.clear_transforms aug.transform(:lens => "Hosts.lns", :incl => "/etc/hosts") assert_raise(ArgumentError) { aug.transform(:name => "Fstab", :incl => [ "/etc/fstab" ], :excl => [ "*~", "*.rpmnew" ]) } aug.transform(:lens => "Inittab", :incl => "/etc/inittab") aug.transform(:lens => "Fstab.lns", :incl => "/etc/fstab*", :excl => "*~") assert_equal(["/augeas/load/Fstab", "/augeas/load/Fstab/excl", "/augeas/load/Fstab/incl", "/augeas/load/Fstab/lens", "/augeas/load/Hosts", "/augeas/load/Hosts/incl", "/augeas/load/Hosts/lens", "/augeas/load/Inittab", "/augeas/load/Inittab/incl", "/augeas/load/Inittab/lens"], aug.match("/augeas/load//*").sort) aug.load assert_equal(["/files/etc/hosts", "/files/etc/inittab"], aug.match("/files/etc/*").sort) end def test_defvar Augeas::open("/dev/null") do |aug| aug.set("/a/b", "bval") aug.set("/a/c", "cval") assert aug.defvar("var", "/a/b") assert_equal(["/a/b"], aug.match("$var")) assert aug.defvar("var", nil) assert_raises(SystemCallError) { aug.match("$var") } assert ! aug.defvar("var", "/foo/") end end def test_defnode aug = aug_open assert aug.defnode("x", "/files/etc/hosts/*[ipaddr = '127.0.0.1']", nil) assert_equal(["/files/etc/hosts/1"], aug.match("$x")) end def test_save! aug = aug_open aug.set("/files/etc/hosts/1/garbage", "trash") assert_raises(Augeas::Error) { aug.save! } end def test_set! aug = aug_open assert_raises(Augeas::Error) { aug.set!("files/etc/hosts/*", nil) } end def test_set aug = aug_open aug.set("/files/etc/group/disk/user[last()+1]",["user1","user2"]) assert_equal( aug.get("/files/etc/group/disk/user[1]"),"root" ) assert_equal( aug.get("/files/etc/group/disk/user[2]"),"user1" ) assert_equal( aug.get("/files/etc/group/disk/user[3]"),"user2" ) aug.set("/files/etc/group/new_group/user[last()+1]", "nuser1",["nuser2","nuser3"]) assert_equal( aug.get("/files/etc/group/new_group/user[1]"),"nuser1") assert_equal( aug.get("/files/etc/group/new_group/user[2]"),"nuser2" ) assert_equal( aug.get("/files/etc/group/new_group/user[3]"),"nuser3" ) aug.rm("/files/etc/group/disk/user") aug.set("/files/etc/group/disk/user[last()+1]","testuser") assert_equal( aug.get("/files/etc/group/disk/user"),"testuser") aug.rm("/files/etc/group/disk/user") aug.set("/files/etc/group/disk/user[last()+1]", nil) assert_equal( aug.get("/files/etc/group/disk/user"), nil) end def test_setm aug = aug_open aug.setm("/files/etc/group/*[label() =~ regexp(\"rpc.*\")]","users", "testuser1") assert_equal( aug.get("/files/etc/group/rpc/users"), "testuser1") assert_equal( aug.get("/files/etc/group/rpcuser/users"), "testuser1") aug.setm("/files/etc/group/*[label() =~ regexp(\"rpc.*\")]/users",nil, "testuser2") assert_equal( aug.get("/files/etc/group/rpc/users"), "testuser2") assert_equal( aug.get("/files/etc/group/rpcuser/users"), "testuser2") end def test_error aug = aug_open # Cause an error aug.get("/files/etc/hosts/*") err = aug.error assert_equal(Augeas::EMMATCH, err[:code]) assert err[:message] assert err[:details] assert err[:minor].nil? end def test_span aug = aug_open span = aug.span("/files/etc/ssh/sshd_config/Protocol") assert_equal({}, span) aug.set("/augeas/span", "enable") aug.rm("/files/etc") aug.load span = aug.span("/files/etc/ssh/sshd_config/Protocol") assert_not_nil(span[:filename]) assert_equal(29..37, span[:label]) assert_equal(38..39, span[:value]) assert_equal(29..40, span[:span]) end def test_srun aug = aug_open path = "/files/etc/hosts/*[canonical='localhost.localdomain']/ipaddr" r, out = aug.srun("get #{path}\n") assert_equal(1, r) assert_equal("#{path} = 127.0.0.1\n", out) assert_equal(0, aug.srun(" ")[0]) assert_equal(-1, aug.srun("foo")[0]) assert_equal(-1, aug.srun("set")[0]) assert_equal(-2, aug.srun("quit")[0]) end def test_label Augeas::open("/dev/null") do |aug| assert_equal 'augeas', aug.label('/augeas') assert_equal 'files', aug.label('/files') end end def test_rename Augeas::open("/dev/null") do |aug| assert_equal false, aug.rename('/files', 'invalid/label') assert_equal 0, aug.rename('/nonexistent', 'label') assert_equal ['/files'], aug.match('/files') assert_equal 1, aug.rename('/files', 'label') end end def test_text_store_retrieve Augeas::open("/dev/null") do |aug| # text_store errors assert_equal false, aug.text_store('Simplelines.lns', '/input', '/store') # text_store aug.set('/input', "line1\nline2\n") assert aug.text_store('Simplelines.lns', '/input', '/store') assert_equal 'line2', aug.get('/store/2') # text_retrieve errors assert_equal false, aug.text_retrieve('Simplelines.lns', '/unknown', '/store', '/output') # text_retrieve aug.set('/store/3', 'line3') assert aug.text_retrieve('Simplelines.lns', '/input', '/store', '/output') assert_equal "line1\nline2\nline3\n", aug.get('/output') end end def test_context Augeas::open("/dev/null") do |aug| aug.context = '/augeas' assert_equal '/augeas', aug.get('/augeas/context') assert_equal '/augeas', aug.get('context') assert_equal '/augeas', aug.context end end def test_touch Augeas::open("/dev/null") do |aug| assert_equal [], aug.match('/foo') aug.touch '/foo' assert_equal ['/foo'], aug.match('/foo') aug.set '/foo', 'bar' aug.touch '/foo' assert_equal 'bar', aug.get('/foo') end end def test_clearm Augeas::open("/dev/null") do |aug| aug.set('/foo/a', '1') aug.set('/foo/b', '2') aug.clearm('/foo', '*') assert_nil aug.get('/foo/a') assert_nil aug.get('/foo/b') end end private def aug_open(flags = Augeas::NONE) if File::directory?(TST_ROOT) FileUtils::rm_rf(TST_ROOT) end FileUtils::mkdir_p(TST_ROOT) FileUtils::cp_r(SRC_ROOT, TST_ROOT) Augeas::open(TST_ROOT, nil, flags) end end ruby-augeas-0.5.0/tests/root/0000775000076400007640000000000012117721166015523 5ustar lutterlutterruby-augeas-0.5.0/tests/root/etc/0000775000076400007640000000000012117721166016276 5ustar lutterlutterruby-augeas-0.5.0/tests/root/etc/ssh/0000775000076400007640000000000012117721166017073 5ustar lutterlutterruby-augeas-0.5.0/tests/root/etc/ssh/sshd_config0000664000076400007640000000005011701151516021271 0ustar lutterlutter# Used by the test_span test Protocol 7 ruby-augeas-0.5.0/tests/root/etc/group0000664000076400007640000000060011701151515017342 0ustar lutterlutterroot:x:0:root bin:x:1:root,bin,daemon daemon:x:2:root,bin,daemon sys:x:3:root,bin,adm adm:x:4:root,adm,daemon tty:x:5: disk:x:6:root lp:x:7:daemon,lp mem:x:8: kmem:x:9: wheel:x:10:root mail:x:12:mail,postfix uucp:x:14:uucp man:x:15: games:x:20: gopher:x:30: dip:x:40: ftp:x:50: lock:x:54: nobody:x:99: users:x:100: floppy:x:19: vcsa:x:69: rpc:x:32:asfd rpcuser:x:29: nfsnobody:x:499: ruby-augeas-0.5.0/tests/root/etc/hosts0000664000076400007640000000046511240334013017351 0ustar lutterlutter# Do not remove the following line, or various programs # that require network functionality will fail. 127.0.0.1 localhost.localdomain localhost galia.watzmann.net galia #172.31.122.254 granny.watzmann.net granny puppet #172.31.122.1 galia.watzmann.net galia 172.31.122.14 orange.watzmann.net orange ruby-augeas-0.5.0/tests/root/etc/inittab0000664000076400007640000000320211240334013017633 0ustar lutterlutter# # inittab This file describes how the INIT process should set up # the system in a certain run-level. # # Author: Miquel van Smoorenburg, # Modified for RHS Linux by Marc Ewing and Donnie Barnes # # Default runlevel. The runlevels used by RHS are: # 0 - halt (Do NOT set initdefault to this) # 1 - Single user mode # 2 - Multiuser, without NFS (The same as 3, if you do not have networking) # 3 - Full multiuser mode # 4 - unused # 5 - X11 # 6 - reboot (Do NOT set initdefault to this) # id:5:initdefault: # System initialization. si::sysinit:/etc/rc.d/rc.sysinit l0:0:wait:/etc/rc.d/rc 0 l1:1:wait:/etc/rc.d/rc 1 l2:2:wait:/etc/rc.d/rc 2 l3:3:wait:/etc/rc.d/rc 3 l4:4:wait:/etc/rc.d/rc 4 l5:5:wait:/etc/rc.d/rc 5 l6:6:wait:/etc/rc.d/rc 6 # Trap CTRL-ALT-DELETE ca::ctrlaltdel:/sbin/shutdown -t3 -r now # When our UPS tells us power has failed, assume we have a few minutes # of power left. Schedule a shutdown for 2 minutes from now. # This does, of course, assume you have powerd installed and your # UPS connected and working correctly. pf::powerfail:/sbin/shutdown -f -h +2 "Power Failure; System Shutting Down" # If power was restored before the shutdown kicked in, cancel it. pr:12345:powerokwait:/sbin/shutdown -c "Power Restored; Shutdown Cancelled" # Run gettys in standard runlevels 1:2345:respawn:/sbin/mingetty tty1 2:2345:respawn:/sbin/mingetty tty2 3:2345:respawn:/sbin/mingetty tty3 4:2345:respawn:/sbin/mingetty tty4 5:2345:respawn:/sbin/mingetty tty5 6:2345:respawn:/sbin/mingetty tty6 # Run xdm in runlevel 5 x:5:respawn:/etc/X11/prefdm -nodaemon ruby-augeas-0.5.0/lib/0000775000076400007640000000000012117721166014144 5ustar lutterlutterruby-augeas-0.5.0/lib/augeas.rb0000664000076400007640000001140312104527566015741 0ustar lutterlutter## # augeas.rb: Ruby wrapper for augeas # # Copyright (C) 2008 Red Hat Inc. # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # # Author: Bryan Kearney ## require "_augeas" # Wrapper class for the augeas[http://augeas.net] library. class Augeas private_class_method :new class Error < RuntimeError; end # Create a new Augeas instance and return it. # # Use +root+ as the filesystem root. If +root+ is +nil+, use the value # of the environment variable +AUGEAS_ROOT+. If that doesn't exist # either, use "/". # # +loadpath+ is a colon-spearated list of directories that modules # should be searched in. This is in addition to the standard load path # and the directories in +AUGEAS_LENS_LIB+ # # +flags+ is a bitmask (see enum aug_flags) # # When a block is given, the Augeas instance is passed as the only # argument into the block and closed when the block exits. In that # case, the return value of the block is the return value of # +open+. With no block, the Augeas instance is returned. def self.open(root = nil, loadpath = nil, flags = NONE, &block) aug = open3(root, loadpath, flags) if block_given? begin rv = yield aug return rv ensure aug.close end else return aug end end # Set one or multiple elemens to path. # Multiple elements are mainly sensible with a path like # .../array[last()+1], since this will append all elements. def set(path, *values) values.flatten.each { |v| set_internal(path, v) } end # The same as +set+, but raises Augeas::Error if setting fails def set!(path, *values) values.flatten.each do |v| raise Augeas::Error unless set_internal(path, v) end end # Clear the +path+, i.e. make its value +nil+ def clear(path) set_internal(path, nil) end # Clear multiple nodes values in one operation. Find or create a node matching +sub+ # by interpreting +sub+ as a path expression relative to each node matching # +base+. If +sub+ is '.', the nodes matching +base+ will be modified. def clearm(base, sub) setm(base, sub, nil) end # Create the +path+ with empty value if it doesn't exist def touch(path) set_internal(path, nil) if match(path).empty? end # Clear all transforms under /augeas/load. If +load+ # is called right after this, there will be no files # under +/files+ def clear_transforms rm("/augeas/load/*") end # Add a transform under /augeas/load # # The HASH can contain the following entries # * :lens - the name of the lens to use # * :name - a unique name; use the module name of the LENS when omitted # * :incl - a list of glob patterns for the files to transform # * :excl - a list of the glob patterns to remove from the list that matches :INCL def transform(hash) lens = hash[:lens] name = hash[:name] incl = hash[:incl] excl = hash[:excl] raise ArgumentError, "No lens specified" unless lens raise ArgumentError, "No files to include" unless incl lens = "#{lens}.lns" unless lens.include? '.' name = lens.split(".")[0].sub("@", "") unless name xfm = "/augeas/load/#{name}/" set(xfm + "lens", lens) set(xfm + "incl[last()+1]", incl) set(xfm + "excl[last()+1]", excl) if excl end # The same as +save+, but raises Augeas::Error if saving fails def save! raise Augeas::Error unless save end # The same as +load+, but raises Augeas::Error if loading fails def load! raise Augeas::Error unless load end # Set path expression context to +path+ (in /augeas/context) def context=(path) set_internal('/augeas/context', path) end # Get path expression context (from /augeas/context) def context get('/augeas/context') end end