X-Git-Url: http://git.annexia.org/?p=libguestfs.git;a=blobdiff_plain;f=daemon%2Faugeas.c;h=9b45f976922d9263437c25948d6e2223cba67ebb;hp=76b85d934833495129c6b7b8c2956e5c34ed87fc;hb=215041c7178922341ecbfdb23eb203f2bb8c29c4;hpb=1c8f9c274adb342b263d083f0ac0c24e4b600974

diff --git a/daemon/augeas.c b/daemon/augeas.c
index 76b85d9..9b45f97 100644
--- a/daemon/augeas.c
+++ b/daemon/augeas.c
@@ -22,16 +22,21 @@
 #include <stdlib.h>
 #include <string.h>
 #include <unistd.h>
+
+#ifdef HAVE_AUGEAS
 #include <augeas.h>
+#endif
 
 #include "daemon.h"
 #include "actions.h"
 
+#ifdef HAVE_AUGEAS
 /* The Augeas handle.  We maintain a single handle per daemon, which
  * is all that is necessary and reduces the complexity of the API
  * considerably.
  */
 static augeas *aug = NULL;
+#endif
 
 #define NEED_AUG(errcode)						\
   do {									\
@@ -44,8 +49,9 @@ static augeas *aug = NULL;
 
 /* We need to rewrite the root path so it is based at /sysroot. */
 int
-do_aug_init (const char *root, int flags)
+do_aug_init (char *root, int flags)
 {
+#ifdef HAVE_AUGEAS
   char *buf;
   int len;
 
@@ -74,22 +80,32 @@ do_aug_init (const char *root, int flags)
   }
 
   return 0;
+#else
+  reply_with_error ("%s is not available", __func__);
+  return -1;
+#endif
 }
 
 int
 do_aug_close (void)
 {
+#ifdef HAVE_AUGEAS
   NEED_AUG(-1);
 
   aug_close (aug);
   aug = NULL;
 
   return 0;
+#else
+  reply_with_error ("%s is not available", __func__);
+  return -1;
+#endif
 }
 
 int
-do_aug_defvar (const char *name, const char *expr)
+do_aug_defvar (char *name, char *expr)
 {
+#ifdef HAVE_AUG_DEFVAR
   int r;
 
   NEED_AUG (-1);
@@ -100,11 +116,16 @@ do_aug_defvar (const char *name, const char *expr)
     return -1;
   }
   return r;
+#else
+  reply_with_error ("%s is not available", __func__);
+  return -1;
+#endif
 }
 
 guestfs_aug_defnode_ret *
-do_aug_defnode (const char *name, const char *expr, const char *val)
+do_aug_defnode (char *name, char *expr, char *val)
 {
+#ifdef HAVE_AUG_DEFNODE
   static guestfs_aug_defnode_ret r;
   int created;
 
@@ -117,11 +138,16 @@ do_aug_defnode (const char *name, const char *expr, const char *val)
   }
   r.created = created;
   return &r;
+#else
+  reply_with_error ("%s is not available", __func__);
+  return NULL;
+#endif
 }
 
 char *
-do_aug_get (const char *path)
+do_aug_get (char *path)
 {
+#ifdef HAVE_AUGEAS
   const char *value = NULL;
   char *v;
   int r;
@@ -155,11 +181,16 @@ do_aug_get (const char *path)
   }
 
   return v;			/* Caller frees. */
+#else
+  reply_with_error ("%s is not available", __func__);
+  return NULL;
+#endif
 }
 
 int
-do_aug_set (const char *path, const char *val)
+do_aug_set (char *path, char *val)
 {
+#ifdef HAVE_AUGEAS
   int r;
 
   NEED_AUG (-1);
@@ -171,11 +202,16 @@ do_aug_set (const char *path, const char *val)
   }
 
   return 0;
+#else
+  reply_with_error ("%s is not available", __func__);
+  return -1;
+#endif
 }
 
 int
-do_aug_insert (const char *path, const char *label, int before)
+do_aug_insert (char *path, char *label, int before)
 {
+#ifdef HAVE_AUGEAS
   int r;
 
   NEED_AUG (-1);
@@ -187,11 +223,16 @@ do_aug_insert (const char *path, const char *label, int before)
   }
 
   return 0;
+#else
+  reply_with_error ("%s is not available", __func__);
+  return -1;
+#endif
 }
 
 int
-do_aug_rm (const char *path)
+do_aug_rm (char *path)
 {
+#ifdef HAVE_AUGEAS
   int r;
 
   NEED_AUG (-1);
@@ -203,11 +244,16 @@ do_aug_rm (const char *path)
   }
 
   return r;
+#else
+  reply_with_error ("%s is not available", __func__);
+  return -1;
+#endif
 }
 
 int
-do_aug_mv (const char *src, const char *dest)
+do_aug_mv (char *src, char *dest)
 {
+#ifdef HAVE_AUGEAS
   int r;
 
   NEED_AUG (-1);
@@ -219,11 +265,16 @@ do_aug_mv (const char *src, const char *dest)
   }
 
   return 0;
+#else
+  reply_with_error ("%s is not available", __func__);
+  return -1;
+#endif
 }
 
 char **
-do_aug_match (const char *path)
+do_aug_match (char *path)
 {
+#ifdef HAVE_AUGEAS
   char **matches = NULL;
   void *vp;
   int r;
@@ -249,11 +300,16 @@ do_aug_match (const char *path)
   matches[r] = NULL;
 
   return matches;		/* Caller frees. */
+#else
+  reply_with_error ("%s is not available", __func__);
+  return NULL;
+#endif
 }
 
 int
 do_aug_save (void)
 {
+#ifdef HAVE_AUGEAS
   NEED_AUG (-1);
 
   if (aug_save (aug) == -1) {
@@ -262,11 +318,16 @@ do_aug_save (void)
   }
 
   return 0;
+#else
+  reply_with_error ("%s is not available", __func__);
+  return -1;
+#endif
 }
 
 int
 do_aug_load (void)
 {
+#ifdef HAVE_AUG_LOAD
   NEED_AUG (-1);
 
   if (aug_load (aug) == -1) {
@@ -275,12 +336,17 @@ do_aug_load (void)
   }
 
   return 0;
+#else
+  reply_with_error ("%s is not available", __func__);
+  return -1;
+#endif
 }
 
 /* Simpler version of aug-match, which also sorts the output. */
 char **
-do_aug_ls (const char *path)
+do_aug_ls (char *path)
 {
+#ifdef HAVE_AUGEAS
   char **matches;
   char *buf;
   int len;
@@ -318,4 +384,8 @@ do_aug_ls (const char *path)
 
   sort_strings (matches, count_strings (matches));
   return matches;		/* Caller frees. */
+#else
+  reply_with_error ("%s is not available", __func__);
+  return NULL;
+#endif
 }