A | |
aug_close | |
aug_defnode | |
aug_defvar | |
aug_get | |
aug_init | |
aug_insert | |
aug_load | |
aug_match | |
aug_mv | |
aug_print | |
aug_rm | |
aug_save | |
aug_set | |
aug_setm | |
aug_span | |
C | |
close_memstream, memstream | |
E | |
escape | |
I | |
init_memstream, memstream | |
M | |
make_tree, tree | |
P | |
print_chars | |
print_pos | |
U | |
unescape | |
X | |
xread_file |
Close this Augeas instance and free any storage associated with it.
void aug_close( augeas * aug )
Define a variable NAME whose value is the result of evaluating EXPR, which must be non-NULL and evaluate to a nodeset.
int aug_defnode( augeas * aug, const char * name, const char * expr, const char * value, int * created )
Define a variable NAME whose value is the result of evaluating EXPR.
int aug_defvar( augeas * aug, const char * name, const char * expr )
Lookup the value associated with PATH.
int aug_get( const augeas * aug, const char * path, const char ** value )
Initialize the library.
augeas *aug_init( const char * root, const char * loadpath, unsigned int flags )
Create a new sibling LABEL for PATH by inserting into the tree just before PATH if BEFORE == 1 or just after PATH if BEFORE == 0.
int aug_insert( augeas * aug, const char * path, const char * label, int before )
Load files into the tree.
int aug_load( augeas * aug )
the number of matches of the path expression PATH in AUG.
int aug_match( const augeas * aug, const char * path, char *** matches )
Move the node SRC to DST.
int aug_mv( augeas * aug, const char * src, const char * dst )
Print each node matching PATH and its descendants to OUT.
int aug_print( const augeas * aug, FILE * out, const char * path )
Remove path and all its children.
int aug_rm( augeas * aug, const char * path )
Write all pending changes to disk.
int aug_save( augeas * aug )
Set the value associated with PATH to VALUE.
int aug_set( augeas * aug, const char * path, const char * value )
Set the value of multiple nodes in one operation.
int aug_setm( augeas * aug, const char * base, const char * sub, const char * value )
Get the span according to input file of the node associated with PATH.
int aug_span( augeas * aug, const char * path, char ** filename, unsigned int * label_start, unsigned int * label_end, unsigned int * value_start, unsigned int * value_end, unsigned int * span_start, unsigned int * span_end )
Close a memstream.
int close_memstream( struct memstream * ms )
Escape nonprintable characters within TEXT, similar to how it’s done in C string literals.
char *escape( const char * text, int cnt )
Initialize a memstream.
int init_memstream( struct memstream * ms )
Allocate a new tree node with the given LABEL, VALUE, and CHILDREN, which are not copied.
struct tree *make_tree( char * label, char * value, struct tree * parent, struct tree * children )
int print_chars( FILE * out, const char * text, int cnt )
Print a pretty representation of being at position POS within TEXT
void print_pos( FILE * out, const char * text, int pos )
char *unescape( const char * s, int len )
Read the contents of file PATH and return them as one long string.
char* xread_file( const char * path )