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 (const char *msg)
38 caml_raise_with_string (*caml_named_value ("Augeas.Error"), msg);
41 /* Map OCaml flags to C flags. */
42 static int flag_map[] = {
43 /* AugSaveBackup */ AUG_SAVE_BACKUP,
44 /* AugSaveNewFile */ AUG_SAVE_NEWFILE,
45 /* AugTypeCheck */ AUG_TYPE_CHECK,
46 /* AugNoStdinc */ AUG_NO_STDINC,
47 /* AugSaveNoop */ AUG_SAVE_NOOP,
48 /* AugNoLoad */ AUG_NO_LOAD,
51 /* Wrap and unwrap augeas_t handles, with a finalizer. */
52 #define Augeas_t_val(rv) (*(augeas_t *)Data_custom_val(rv))
55 augeas_t_finalize (value tv)
57 augeas_t t = Augeas_t_val (tv);
61 static struct custom_operations custom_operations = {
62 (char *) "augeas_t_custom_operations",
64 custom_compare_default,
66 custom_serialize_default,
67 custom_deserialize_default
70 static value Val_augeas_t (augeas_t t)
74 /* We could choose these so that the GC can make better decisions.
75 * See 18.9.2 of the OCaml manual.
80 rv = caml_alloc_custom (&custom_operations,
81 sizeof (augeas_t), used, max);
87 #pragma GCC diagnostic ignored "-Wmissing-prototypes"
89 /* val create : string -> string option -> flag list -> t */
91 ocaml_augeas_create (value rootv, value loadpathv, value flagsv)
94 char *root = String_val (rootv);
99 /* Optional loadpath. */
101 loadpathv == Val_int (0)
103 : String_val (Field (loadpathv, 0));
105 /* Convert list of flags to C. */
106 for (; flagsv != Val_int (0); flagsv = Field (flagsv, 1)) {
107 i = Int_val (Field (flagsv, 0));
108 flags |= flag_map[i];
111 t = aug_init (root, loadpath, flags);
114 raise_error ("Augeas.create");
116 CAMLreturn (Val_augeas_t (t));
119 /* val close : t -> unit */
121 ocaml_augeas_close (value tv)
124 augeas_t t = Augeas_t_val (tv);
128 Augeas_t_val(tv) = NULL; /* So the finalizer doesn't double-free. */
131 CAMLreturn (Val_unit);
134 /* val get : t -> path -> value option */
136 ocaml_augeas_get (value tv, value pathv)
138 CAMLparam2 (tv, pathv);
139 CAMLlocal2 (optv, v);
140 augeas_t t = Augeas_t_val (tv);
141 char *path = String_val (pathv);
145 r = aug_get (t, path, &val);
146 if (r == 1) { /* Return Some val */
147 v = caml_copy_string (val);
148 optv = caml_alloc (1, 0);
150 } else if (r == 0) /* Return None */
152 else if (r == -1) /* Error or multiple matches */
153 raise_error ("Augeas.get");
155 failwith ("Augeas.get: bad return value");
160 /* val exists : t -> path -> bool */
162 ocaml_augeas_exists (value tv, value pathv)
164 CAMLparam2 (tv, pathv);
166 augeas_t t = Augeas_t_val (tv);
167 char *path = String_val (pathv);
170 r = aug_get (t, path, NULL);
171 if (r == 1) /* Return true. */
173 else if (r == 0) /* Return false */
175 else if (r == -1) /* Error or multiple matches */
176 raise_error ("Augeas.exists");
178 failwith ("Augeas.exists: bad return value");
183 /* val insert : t -> ?before:bool -> path -> string -> unit */
185 ocaml_augeas_insert (value tv, value beforev, value pathv, value labelv)
187 CAMLparam4 (tv, beforev, pathv, labelv);
188 augeas_t t = Augeas_t_val (tv);
189 char *path = String_val (pathv);
190 char *label = String_val (labelv);
193 before = beforev == Val_int (0) ? 0 : Int_val (Field (beforev, 0));
195 if (aug_insert (t, path, label, before) == -1)
196 raise_error ("Augeas.insert");
198 CAMLreturn (Val_unit);
201 /* val rm : t -> path -> int */
203 ocaml_augeas_rm (value tv, value pathv)
205 CAMLparam2 (tv, pathv);
206 augeas_t t = Augeas_t_val (tv);
207 char *path = String_val (pathv);
210 r = aug_rm (t, path);
212 raise_error ("Augeas.rm");
214 CAMLreturn (Val_int (r));
217 /* val matches : t -> path -> path list */
219 ocaml_augeas_match (value tv, value pathv)
221 CAMLparam2 (tv, pathv);
222 CAMLlocal3 (rv, v, cons);
223 augeas_t t = Augeas_t_val (tv);
224 char *path = String_val (pathv);
228 r = aug_match (t, path, &matches);
230 raise_error ("Augeas.matches");
232 /* Copy the paths to a list. */
234 for (i = 0; i < r; ++i) {
235 v = caml_copy_string (matches[i]);
237 cons = caml_alloc (2, 0);
238 Field (cons, 1) = rv;
248 /* val count_matches : t -> path -> int */
250 ocaml_augeas_count_matches (value tv, value pathv)
252 CAMLparam2 (tv, pathv);
253 augeas_t t = Augeas_t_val (tv);
254 char *path = String_val (pathv);
257 r = aug_match (t, path, NULL);
259 raise_error ("Augeas.count_matches");
261 CAMLreturn (Val_int (r));
264 /* val save : t -> unit */
266 ocaml_augeas_save (value tv)
269 augeas_t t = Augeas_t_val (tv);
271 if (aug_save (t) == -1)
272 raise_error ("Augeas.save");
274 CAMLreturn (Val_unit);