#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 { \
int
do_aug_init (const char *root, int flags)
{
+#ifdef HAVE_AUGEAS
char *buf;
int len;
aug = NULL;
}
- len = strlen (root) + 8;
+ len = strlen (root) + 9;
buf = malloc (len);
if (!buf) {
reply_with_perror ("malloc");
}
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)
{
+#ifdef HAVE_AUG_DEFVAR
int r;
NEED_AUG (-1);
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)
{
+#ifdef HAVE_AUG_DEFNODE
static guestfs_aug_defnode_ret r;
int created;
}
r.created = created;
return &r;
+#else
+ reply_with_error ("%s is not available", __func__);
+ return NULL;
+#endif
}
char *
do_aug_get (const char *path)
{
+#ifdef HAVE_AUGEAS
const char *value = NULL;
char *v;
int r;
}
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)
{
+#ifdef HAVE_AUGEAS
int r;
NEED_AUG (-1);
}
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)
{
+#ifdef HAVE_AUGEAS
int r;
NEED_AUG (-1);
}
return 0;
+#else
+ reply_with_error ("%s is not available", __func__);
+ return -1;
+#endif
}
int
do_aug_rm (const char *path)
{
+#ifdef HAVE_AUGEAS
int r;
NEED_AUG (-1);
}
return r;
+#else
+ reply_with_error ("%s is not available", __func__);
+ return -1;
+#endif
}
int
do_aug_mv (const char *src, const char *dest)
{
+#ifdef HAVE_AUGEAS
int r;
NEED_AUG (-1);
}
return 0;
+#else
+ reply_with_error ("%s is not available", __func__);
+ return -1;
+#endif
}
char **
do_aug_match (const char *path)
{
+#ifdef HAVE_AUGEAS
char **matches = NULL;
void *vp;
int r;
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) {
}
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) {
}
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)
+{
+#ifdef HAVE_AUGEAS
+ char **matches;
+ char *buf;
+ int len;
+
+ NEED_AUG (NULL);
+
+ ABS_PATH (path, NULL);
+
+ len = strlen (path);
+
+ if (len > 1 &&
+ (path[len-1] == '/' || path[len-1] == ']' || path[len-1] == '*')) {
+ reply_with_error ("don't use aug-ls with a path that ends with / ] *");
+ return NULL;
+ }
+
+ if (len == 1)
+ /* we know path must be "/" because of ABS_PATH above */
+ matches = do_aug_match ("/");
+ else {
+ len += 3; /* / * + terminating \0 */
+ buf = malloc (len);
+ if (buf == NULL) {
+ reply_with_perror ("malloc");
+ return NULL;
+ }
+
+ snprintf (buf, len, "%s/*", path);
+ matches = do_aug_match (buf);
+ free (buf);
+ }
+
+ if (matches == NULL)
+ return NULL; /* do_aug_match has already sent the error */
+
+ sort_strings (matches, count_strings (matches));
+ return matches; /* Caller frees. */
+#else
+ reply_with_error ("%s is not available", __func__);
+ return NULL;
+#endif
}