26 if (!
sp->spacestack) {
79 return strcmp(incoming,
s->name);
93 return strcmp(
a->name,
b->name);
135 if (
sp->current == space) {
160 rz_list_foreach (
names, lit,
n) {
197 if (!oname && !
sp->current) {
218 .data.rename.newname = nname,
219 .data.rename.space =
s
RZ_API void Ht_() free(HtName_(Ht) *ht)
RZ_API RZ_OWN RzList * rz_list_newf(RzListFree f)
Returns a new initialized RzList pointer and sets the free method.
RZ_API RZ_OWN void * rz_list_pop(RZ_NONNULL RzList *list)
Removes and returns the last element of the list.
RZ_API RZ_OWN RzList * rz_list_new(void)
Returns a new initialized RzList pointer (free method is not initialized)
RZ_API RZ_BORROW RzListIter * rz_list_push(RZ_NONNULL RzList *list, void *item)
Alias for rz_list_append.
RZ_API RZ_BORROW RzListIter * rz_list_append(RZ_NONNULL RzList *list, void *data)
Appends at the end of the list a new element.
RZ_API void rz_list_free(RZ_NONNULL RzList *list)
Empties the list and frees the list pointer.
RZ_API void rz_list_purge(RZ_NONNULL RzList *list)
Empties the list without freeing the list pointer.
return strdup("=SP r13\n" "=LR r14\n" "=PC r15\n" "=A0 r0\n" "=A1 r1\n" "=A2 r2\n" "=A3 r3\n" "=ZF zf\n" "=SF nf\n" "=OF vf\n" "=CF cf\n" "=SN or0\n" "gpr lr .32 56 0\n" "gpr pc .32 60 0\n" "gpr cpsr .32 64 0 ____tfiae_________________qvczn\n" "gpr or0 .32 68 0\n" "gpr tf .1 64.5 0 thumb\n" "gpr ef .1 64.9 0 endian\n" "gpr jf .1 64.24 0 java\n" "gpr qf .1 64.27 0 sticky_overflow\n" "gpr vf .1 64.28 0 overflow\n" "gpr cf .1 64.29 0 carry\n" "gpr zf .1 64.30 0 zero\n" "gpr nf .1 64.31 0 negative\n" "gpr itc .4 64.10 0 if_then_count\n" "gpr gef .4 64.16 0 great_or_equal\n" "gpr r0 .32 0 0\n" "gpr r1 .32 4 0\n" "gpr r2 .32 8 0\n" "gpr r3 .32 12 0\n" "gpr r4 .32 16 0\n" "gpr r5 .32 20 0\n" "gpr r6 .32 24 0\n" "gpr r7 .32 28 0\n" "gpr r8 .32 32 0\n" "gpr r9 .32 36 0\n" "gpr r10 .32 40 0\n" "gpr r11 .32 44 0\n" "gpr r12 .32 48 0\n" "gpr r13 .32 52 0\n" "gpr r14 .32 56 0\n" "gpr r15 .32 60 0\n" "gpr r16 .32 64 0\n" "gpr r17 .32 68 0\n")
#define rz_return_val_if_fail(expr, val)
RZ_API void rz_event_send(RzEvent *ev, int type, void *data)
RZ_API void rz_event_free(RzEvent *ev)
RZ_API RzEvent * rz_event_new(void *user)
void(* RzListFree)(void *ptr)
RZ_API RBNode * rz_rbtree_find(RBNode *root, void *data, RBComparator cmp, void *user)
RZ_API void rz_rbtree_free(RZ_NULLABLE RBNode *root, RBNodeFree freefn, void *user)
RZ_API bool rz_rbtree_insert(RBNode **root, void *data, RBNode *node, RBComparator cmp, void *user)
Returns true if the node was inserted successfully.
RZ_API bool rz_rbtree_delete(RBNode **root, void *data, RBComparator cmp, void *cmp_user, RBNodeFree freefn, void *free_user)
Returns true if a node with an equal key is deleted.
#define rz_spaces_foreach(sp, it, s)
#define container_of(ptr, type, member)
RZ_API RzSpace * rz_spaces_get(RzSpaces *sp, const char *name)
RZ_API void rz_spaces_free(RzSpaces *sp)
RZ_API bool rz_spaces_push(RzSpaces *sp, const char *name)
RZ_API void rz_spaces_fini(RzSpaces *sp)
RZ_API RzSpaces * rz_spaces_new(const char *name)
RZ_API RzSpace * rz_spaces_set(RzSpaces *sp, const char *name)
static void space_free(RzSpace *s)
RZ_API RzSpace * rz_spaces_add(RzSpaces *sp, const char *name)
RZ_API int rz_spaces_count(RzSpaces *sp, const char *name)
static int name_space_cmp(const void *incoming, const RBNode *rb, void *user)
RZ_API bool rz_spaces_pop(RzSpaces *sp)
RZ_API void rz_spaces_purge(RzSpaces *sp)
static bool spaces_unset_single(RzSpaces *sp, const char *name)
static void space_node_free(RBNode *n, void *user)
static int space_cmp(const void *incoming, const RBNode *rb, void *user)
RZ_API bool rz_spaces_init(RzSpaces *sp, const char *name)
RZ_API bool rz_spaces_rename(RzSpaces *sp, const char *oname, const char *nname)
RZ_API bool rz_spaces_unset(RzSpaces *sp, const char *name)
struct rz_space_event_t::@311::@314 rename
struct rz_space_event_t::@311::@313 unset
struct rz_space_event_t::@311::@312 count
union rz_space_event_t::@311 data