1 /* Augeas OCaml bindings
2 * Copyright (C) 2008-2012 Red Hat Inc., Richard W.M. Jones
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
18 * $Id: augeas_c.c,v 1.1 2008/05/06 10:48:20 rjones Exp $
25 #include <caml/alloc.h>
26 #include <caml/memory.h>
27 #include <caml/mlvalues.h>
28 #include <caml/fail.h>
29 #include <caml/callback.h>
30 #include <caml/custom.h>
32 typedef augeas *augeas_t;
34 /* Raise an Augeas.Error exception. */
36 raise_error (augeas_t t, const char *msg)
38 caml_raise_with_string (*caml_named_value ("Augeas.Error"), msg);
42 raise_init_error (const char *msg)
44 caml_raise_with_string (*caml_named_value ("Augeas.Error"), msg);
47 /* Map OCaml flags to C flags. */
48 static int flag_map[] = {
49 /* AugSaveBackup */ AUG_SAVE_BACKUP,
50 /* AugSaveNewFile */ AUG_SAVE_NEWFILE,
51 /* AugTypeCheck */ AUG_TYPE_CHECK,
52 /* AugNoStdinc */ AUG_NO_STDINC,
53 /* AugSaveNoop */ AUG_SAVE_NOOP,
54 /* AugNoLoad */ AUG_NO_LOAD,
57 /* Wrap and unwrap augeas_t handles, with a finalizer. */
58 #define Augeas_t_val(rv) (*(augeas_t *)Data_custom_val(rv))
61 augeas_t_finalize (value tv)
63 augeas_t t = Augeas_t_val (tv);
67 static struct custom_operations custom_operations = {
68 (char *) "augeas_t_custom_operations",
70 custom_compare_default,
72 custom_serialize_default,
73 custom_deserialize_default
76 static value Val_augeas_t (augeas_t t)
80 /* We could choose these so that the GC can make better decisions.
81 * See 18.9.2 of the OCaml manual.
86 rv = caml_alloc_custom (&custom_operations,
87 sizeof (augeas_t), used, max);
93 #pragma GCC diagnostic ignored "-Wmissing-prototypes"
95 /* val create : string -> string option -> flag list -> t */
97 ocaml_augeas_create (value rootv, value loadpathv, value flagsv)
100 char *root = String_val (rootv);
105 /* Optional loadpath. */
107 loadpathv == Val_int (0)
109 : String_val (Field (loadpathv, 0));
111 /* Convert list of flags to C. */
112 for (; flagsv != Val_int (0); flagsv = Field (flagsv, 1)) {
113 i = Int_val (Field (flagsv, 0));
114 flags |= flag_map[i];
117 t = aug_init (root, loadpath, flags);
120 raise_init_error ("Augeas.create");
122 CAMLreturn (Val_augeas_t (t));
125 /* val close : t -> unit */
127 ocaml_augeas_close (value tv)
130 augeas_t t = Augeas_t_val (tv);
134 Augeas_t_val(tv) = NULL; /* So the finalizer doesn't double-free. */
137 CAMLreturn (Val_unit);
140 /* val get : t -> path -> value option */
142 ocaml_augeas_get (value tv, value pathv)
144 CAMLparam2 (tv, pathv);
145 CAMLlocal2 (optv, v);
146 augeas_t t = Augeas_t_val (tv);
147 char *path = String_val (pathv);
151 r = aug_get (t, path, &val);
152 if (r == 1) { /* Return Some val */
153 v = caml_copy_string (val);
154 optv = caml_alloc (1, 0);
156 } else if (r == 0) /* Return None */
158 else if (r == -1) /* Error or multiple matches */
159 raise_error (t, "Augeas.get");
161 failwith ("Augeas.get: bad return value");
166 /* val exists : t -> path -> bool */
168 ocaml_augeas_exists (value tv, value pathv)
170 CAMLparam2 (tv, pathv);
172 augeas_t t = Augeas_t_val (tv);
173 char *path = String_val (pathv);
176 r = aug_get (t, path, NULL);
177 if (r == 1) /* Return true. */
179 else if (r == 0) /* Return false */
181 else if (r == -1) /* Error or multiple matches */
182 raise_error (t, "Augeas.exists");
184 failwith ("Augeas.exists: bad return value");
189 /* val insert : t -> ?before:bool -> path -> string -> unit */
191 ocaml_augeas_insert (value tv, value beforev, value pathv, value labelv)
193 CAMLparam4 (tv, beforev, pathv, labelv);
194 augeas_t t = Augeas_t_val (tv);
195 char *path = String_val (pathv);
196 char *label = String_val (labelv);
199 before = beforev == Val_int (0) ? 0 : Int_val (Field (beforev, 0));
201 if (aug_insert (t, path, label, before) == -1)
202 raise_error (t, "Augeas.insert");
204 CAMLreturn (Val_unit);
207 /* val rm : t -> path -> int */
209 ocaml_augeas_rm (value tv, value pathv)
211 CAMLparam2 (tv, pathv);
212 augeas_t t = Augeas_t_val (tv);
213 char *path = String_val (pathv);
216 r = aug_rm (t, path);
218 raise_error (t, "Augeas.rm");
220 CAMLreturn (Val_int (r));
223 /* val matches : t -> path -> path list */
225 ocaml_augeas_match (value tv, value pathv)
227 CAMLparam2 (tv, pathv);
228 CAMLlocal3 (rv, v, cons);
229 augeas_t t = Augeas_t_val (tv);
230 char *path = String_val (pathv);
234 r = aug_match (t, path, &matches);
236 raise_error (t, "Augeas.matches");
238 /* Copy the paths to a list. */
240 for (i = 0; i < r; ++i) {
241 v = caml_copy_string (matches[i]);
243 cons = caml_alloc (2, 0);
244 Field (cons, 1) = rv;
254 /* val count_matches : t -> path -> int */
256 ocaml_augeas_count_matches (value tv, value pathv)
258 CAMLparam2 (tv, pathv);
259 augeas_t t = Augeas_t_val (tv);
260 char *path = String_val (pathv);
263 r = aug_match (t, path, NULL);
265 raise_error (t, "Augeas.count_matches");
267 CAMLreturn (Val_int (r));
270 /* val save : t -> unit */
272 ocaml_augeas_save (value tv)
275 augeas_t t = Augeas_t_val (tv);
277 if (aug_save (t) == -1)
278 raise_error (t, "Augeas.save");
280 CAMLreturn (Val_unit);
283 /* val load : t -> unit */
285 ocaml_augeas_load (value tv)
288 augeas_t t = Augeas_t_val (tv);
290 if (aug_load (t) == -1)
291 raise_error (t, "Augeas.load");
293 CAMLreturn (Val_unit);