#define _bt_list_first_entry(ptr, type, member) \
bt_list_entry((ptr)->next, type, member)
#define _bt_list_first_entry(ptr, type, member) \
bt_list_entry((ptr)->next, type, member)
static
int ctf_enumerator_list_visit(FILE *fd, int depth,
struct ctf_node *enumerator,
static
int ctf_enumerator_list_visit(FILE *fd, int depth,
struct ctf_node *enumerator,
enum_signed_insert(enum_declaration, start, end, q);
} else {
uint64_t start, end;
enum_signed_insert(enum_declaration, start, end, q);
} else {
uint64_t start, end;
enum_unsigned_insert(enum_declaration, start, end, q);
}
return 0;
enum_unsigned_insert(enum_declaration, start, end, q);
}
return 0;
struct declaration *declaration;
struct declaration_enum *enum_declaration;
struct declaration_integer *integer_declaration;
struct declaration *declaration;
struct declaration_enum *enum_declaration;
struct declaration_integer *integer_declaration;
integer_declaration = container_of(declaration, struct declaration_integer, p);
enum_declaration = enum_declaration_new(integer_declaration);
declaration_unref(&integer_declaration->p); /* leave ref to enum */
integer_declaration = container_of(declaration, struct declaration_integer, p);
enum_declaration = enum_declaration_new(integer_declaration);
declaration_unref(&integer_declaration->p); /* leave ref to enum */
- ret = ctf_enumerator_list_visit(fd, depth + 1, iter, enum_declaration);
+ ret = ctf_enumerator_list_visit(fd, depth + 1, iter, enum_declaration,
+ &last_value);