Home
last modified time | relevance | path

Searched refs:elm (Results 1 – 25 of 60) sorted by relevance

123

/dragonfly/lib/libssh/openbsd-compat/
H A Dsys-queue.h205 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
235 (elm)->field.sle_next = (elm)->field.sle_next->field.sle_next; \
279 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
316 (head)->lh_first = (elm); \
323 (elm)->field.le_prev; \
324 *(elm)->field.le_prev = (elm)->field.le_next; \
362 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
406 if (((elm)->field.sqe_next = (elm)->field.sqe_next->field.sqe_next) \
442 #define XSIMPLEQ_NEXT(head, elm, field) XSIMPLEQ_XOR(head, ((elm)->field.sqx_next)) argument
522 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
[all …]
H A Dsys-tree.h144 elm = SPLAY_RIGHT(elm, field); \
146 elm = SPLAY_LEFT(elm, field); \
538 elm = RB_RIGHT(elm, field); \
669 elm = RB_RIGHT(elm, field); \
671 elm = RB_LEFT(elm, field); \
675 elm = RB_PARENT(elm, field); \
679 elm = RB_PARENT(elm, field); \
680 elm = RB_PARENT(elm, field); \
691 elm = RB_LEFT(elm, field); \
693 elm = RB_RIGHT(elm, field); \
[all …]
/dragonfly/sys/sys/
H A Dqueue.h206 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
223 SLIST_NEXT(elm, field) = \
308 *(head)->stqh_last = (elm); \
317 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
396 if (*(elm)->field.le_prev != (elm)) \
458 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
467 (elm)->field.le_prev; \
468 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
529 if (*(elm)->field.tqe_prev != (elm)) \
641 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
[all …]
H A Dtree.h145 elm = SPLAY_RIGHT(elm, field); \
147 elm = SPLAY_LEFT(elm, field); \
603 elm = RB_RIGHT(elm, field); \
818 elm = RB_RIGHT(elm, field); \
820 elm = RB_LEFT(elm, field); \
824 elm = RB_PARENT(elm, field); \
828 elm = RB_PARENT(elm, field); \
829 elm = RB_PARENT(elm, field); \
840 elm = RB_LEFT(elm, field); \
842 elm = RB_RIGHT(elm, field); \
[all …]
H A Ddmsg.h315 #define DMSG_HDR_ENCODE(elm) (((uint32_t)sizeof(struct elm) + \ argument
319 #define DMSG_LNK(cmd, elm) (DMSG_PROTO_LNK | \ argument
321 DMSG_HDR_ENCODE(elm))
323 #define DMSG_DBG(cmd, elm) (DMSG_PROTO_DBG | \ argument
325 DMSG_HDR_ENCODE(elm))
327 #define DMSG_HM2(cmd, elm) (DMSG_PROTO_HM2 | \ argument
329 DMSG_HDR_ENCODE(elm))
331 #define DMSG_BLK(cmd, elm) (DMSG_PROTO_BLK | \ argument
333 DMSG_HDR_ENCODE(elm))
335 #define DMSG_VOP(cmd, elm) (DMSG_PROTO_VOP | \ argument
[all …]
/dragonfly/sbin/hammer/
H A Dcmd_show.c172 hammer_btree_elm_t elm; in print_btree_node() local
216 elm = &node->elms[i]; in print_btree_node()
234 elm = &node->elms[i]; in print_btree_node()
241 elm = &node->elms[i]; in print_btree_node()
247 print_subtree(elm); in print_btree_node()
339 int i = ((char*)elm - (char*)node) / (int)sizeof(*elm) - 1; in print_btree_elm()
366 if (elm->base.delete_tid) in print_btree_elm()
413 print_record(elm); in print_btree_elm()
417 elm->leaf.data_len); in print_btree_elm()
438 int i = ((char*)elm - (char*)node) / (int)sizeof(*elm) - 1; in get_elm_flags()
[all …]
H A Dcmd_softprune.c494 elm->beg_tid = tid; in hammer_softprune_addelm()
495 elm->end_tid = 0; in hammer_softprune_addelm()
496 elm->mod_tid = 0; in hammer_softprune_addelm()
498 elm->mod_tid = ct; in hammer_softprune_addelm()
554 } else if (elm[0].beg_tid == elm[-1].beg_tid) { in hammer_softprune_finalize()
560 bcopy(elm + 1, elm, in hammer_softprune_finalize()
569 elm->end_tid = elm[-1].beg_tid; in hammer_softprune_finalize()
618 elm->beg_tid = 1; in hammer_softprune_finalize()
619 elm->end_tid = elm[-1].beg_tid; in hammer_softprune_finalize()
628 elm->mod_tid = elm->end_tid - elm->beg_tid; in hammer_softprune_finalize()
[all …]
H A Dcmd_blockmap.c280 hammer_btree_elm_t elm; in check_btree_node() local
315 elm = &node->elms[i]; in check_btree_node()
319 if (elm->internal.subtree_offset) { in check_btree_node()
320 collect_btree_internal(elm); in check_btree_node()
326 if (elm->leaf.data_offset) in check_btree_node()
327 collect_btree_leaf(elm); in check_btree_node()
411 collect_btree_internal(hammer_btree_elm_t elm) in collect_btree_internal() argument
413 collect_blockmap(elm->internal.subtree_offset, in collect_btree_internal()
420 collect_btree_leaf(hammer_btree_elm_t elm) in collect_btree_leaf() argument
424 switch (elm->base.rec_type) { in collect_btree_leaf()
[all …]
/dragonfly/sys/vfs/hammer/
H A Dhammer_prune.c57 hammer_btree_leaf_elm_t elm; in hammer_ioc_prune() local
154 prune->key_cur = elm->base; in hammer_ioc_prune()
175 (intmax_t)elm->base.obj_id, in hammer_ioc_prune()
176 (intmax_t)elm->base.key, in hammer_ioc_prune()
184 (intmax_t)elm->base.obj_id, in hammer_ioc_prune()
185 (intmax_t)elm->base.key); in hammer_ioc_prune()
232 (intmax_t)elm->base.key); in hammer_ioc_prune()
302 if (elm->base.delete_tid && in prune_should_delete()
328 if (elm->base.delete_tid != 0) in prune_check_nlinks()
348 (intmax_t)elm->base.obj_id); in prune_check_nlinks()
[all …]
H A Dhammer_btree.c127 hammer_btree_elm_t elm; in hammer_btree_iterate() local
304 &elm->base); in hammer_btree_iterate()
358 hammer_btree_elm_t elm; in hammer_cursor_mirror_filter() local
375 ++elm; in hammer_cursor_mirror_filter()
767 (intmax_t)elm->leaf.data_offset, elm->leaf.data_len); in hammer_btree_extract()
1196 &elm->base, sizeof(elm->base)); in btree_search()
1842 hammer_make_separator(&elm[-1].base, &elm[0].base, &parent_elm->base); in btree_split_leaf()
2311 bcopy(&elm[1], &elm[0], in btree_remove()
3020 elm->base.rec_type, in hammer_debug_btree_elm()
3045 elm, in hammer_debug_btree_parent()
[all …]
H A Dhammer_reblock.c48 hammer_btree_elm_t elm);
63 hammer_btree_elm_t elm; in hammer_ioc_reblock() local
344 leaf = elm->leaf; in hammer_reblock_helper()
373 cursor, elm); in hammer_reblock_helper()
424 elm = NULL; in hammer_reblock_helper()
489 &elm->leaf); in hammer_reblock_data()
494 elm->leaf.data_offset, elm->leaf.data_len); in hammer_reblock_data()
505 (elm ? elm->base.localization : -1), in hammer_reblock_data()
555 (elm ? elm->base.localization : -1), in hammer_reblock_leaf_node()
615 (elm ? elm->base.localization : -1), in hammer_reblock_int_node()
[all …]
H A Dhammer_rebalance.c40 hammer_btree_elm_t elm);
59 hammer_btree_leaf_elm_t elm; in hammer_ioc_rebalance() local
195 rebal->key_cur = elm->base; in hammer_ioc_rebalance()
274 hammer_btree_elm_t elm; in rebalance_node() local
407 *elm = node->ondisk->elms[i]; in rebalance_node()
527 hammer_btree_elm_t elm) in rebalance_closeout() argument
566 if (bcmp(base_elm, elm, sizeof(*elm)) != 0 || in rebalance_closeout()
569 elm->base.btype) { in rebalance_closeout()
570 *base_elm = *elm; in rebalance_closeout()
590 if (bcmp(&rbound_elm->base, &elm->base, sizeof(elm->base)) != 0) { in rebalance_closeout()
[all …]
H A Dhammer_ioctl.c280 hammer_btree_elm_t elm);
288 hammer_btree_elm_t elm; in hammer_ioc_gethistory() local
390 add_history(ip, hist, elm); in hammer_ioc_gethistory()
413 hammer_btree_elm_t elm) in add_history() argument
424 if (hist->nxt_key > elm->leaf.base.key - elm->leaf.data_len && in add_history()
425 hist->key < elm->leaf.base.key - elm->leaf.data_len) { in add_history()
426 hist->nxt_key = elm->leaf.base.key - elm->leaf.data_len; in add_history()
443 if (elm->leaf.base.key - elm->leaf.data_len > hist->key) in add_history()
458 if (elm->leaf.base.key > hist->key) in add_history()
490 if (elm->leaf.base.delete_tid && in add_history()
[all …]
H A Dhammer_btree.h256 hammer_is_internal_node_elm(hammer_btree_elm_t elm) in hammer_is_internal_node_elm() argument
258 switch (elm->base.btype) { in hammer_is_internal_node_elm()
272 hammer_is_leaf_node_elm(hammer_btree_elm_t elm) in hammer_is_leaf_node_elm() argument
274 switch (elm->base.btype) { in hammer_is_leaf_node_elm()
296 hammer_elm_btype(hammer_btree_elm_t elm) in hammer_elm_btype() argument
298 switch(elm->base.btype) { in hammer_elm_btype()
303 return(elm->base.btype); /* ascii */ in hammer_elm_btype()
/dragonfly/usr.bin/systat/
H A Dpftop.c328 if (elm->seq == tcp_pcb_seq && elm->save_bw > 0) { in showpftop()
329 array[i++] = elm; in showpftop()
335 delm = elm; in showpftop()
350 elm = array[i]; in showpftop()
524 elm = malloc(sizeof(*elm)); in updatestate()
525 bzero(elm, sizeof(*elm)); in updatestate()
529 elm->save_bw = elm->best_bw; in updatestate()
538 elm->last_state = elm->state; in updatestate()
541 if (elm->save_bw < elm->best_bw) in updatestate()
542 elm->save_bw = elm->best_bw; in updatestate()
[all …]
H A Dnetbw.c284 struct mytcpcb *elm; in shownetbw() local
320 delm = elm; in shownetbw()
346 elm->xtcp.xt_inp.inp_af, in netbwline()
473 struct mytcpcb *elm; in updatepcb() local
477 elm = malloc(sizeof(*elm)); in updatepcb()
478 bzero(elm, sizeof(*elm)); in updatepcb()
479 elm->xtcp = *xtcp; in updatepcb()
480 elm->last_xtcp = *xtcp; in updatepcb()
483 elm->last_xtcp = elm->xtcp; in updatepcb()
484 elm->xtcp = *xtcp; in updatepcb()
[all …]
/dragonfly/usr.bin/monitor/
H A Dmonitor.c121 monitor_elm_t elm; in monitor_add() local
125 elm = malloc(sizeof(*elm)); in monitor_add()
126 bzero(elm, sizeof(*elm)); in monitor_add()
127 elm->path = path; in monitor_add()
128 elm->fd = open(path, O_RDONLY); in monitor_add()
129 if (elm->fd < 0) { in monitor_add()
143 if (elm->fd >= NumFiles) { in monitor_add()
149 Elms[elm->fd] = elm; in monitor_add()
158 monitor_elm_t elm; in monitor_events() local
167 elm = Elms[kev->ident]; in monitor_events()
[all …]
/dragonfly/usr.bin/flame_graph/
H A Dprocess.c37 typedef struct elm { struct
38 struct elm *next; argument
59 elm_t *elm; in flame_process_loop() argument
70 elm = elm_lookup(s); in flame_process_loop()
72 ++elm->ticks; in flame_process_loop()
125 elm_t *elm; in flame_process_dump() local
129 for (elm = elm_hash_array[i]; elm; elm = elm->next) { in flame_process_dump()
131 elm->ticks, in flame_process_dump()
132 (double)elm->ticks * 100.0 / in flame_process_dump()
134 (int)elm->idlen, (int)elm->idlen, elm->id); in flame_process_dump()
/dragonfly/sys/dev/drm/
H A Dlinux_rcu.c75 rcu_elm_t *elm; in rcu_timer() local
85 switch(elm->type) { in rcu_timer()
89 elm->func(elm->ptr); in rcu_timer()
92 kfree(elm->ptr); in rcu_timer()
165 rcu_elm_t *elm; in __kfree_rcu() local
179 elm->ticks = ticks; in __kfree_rcu()
180 elm->ptr = ptr; in __kfree_rcu()
190 rcu_elm_t *elm; in call_rcu() local
204 elm->ticks = ticks; in call_rcu()
205 elm->func = func; in call_rcu()
[all …]
/dragonfly/sys/kern/
H A Dkern_caps.c65 __syscapelm_t elm; in caps_check_cred() local
229 __syscapelm_t elm; in caps_exec() local
243 elm = cred->cr_caps.caps[i]; in caps_exec()
244 elm = ((elm & __SYSCAP_EXECMASK) >> 1) | in caps_exec()
245 (elm & __SYSCAP_EXECMASK); in caps_exec()
246 if (elm != cred->cr_caps.caps[i]) in caps_exec()
257 elm = cred->cr_caps.caps[i]; in caps_exec()
258 elm = ((elm & __SYSCAP_EXECMASK) >> 1) | in caps_exec()
259 (elm & __SYSCAP_EXECMASK); in caps_exec()
260 cred->cr_caps.caps[i] = elm; in caps_exec()
[all …]
/dragonfly/sbin/newfs_hammer/
H A Dnewfs_hammer.c680 hammer_btree_elm_t elm; in format_root_directory() local
731 elm = &bnode->elms[0]; in format_root_directory()
736 elm->leaf.base.key = 0; in format_root_directory()
738 elm->leaf.base.delete_tid = 0; in format_root_directory()
743 elm->leaf.data_offset = idata_off; in format_root_directory()
744 elm->leaf.data_len = sizeof(*idata); in format_root_directory()
752 elm = &bnode->elms[1]; in format_root_directory()
757 elm->leaf.base.key = 0; in format_root_directory()
759 elm->leaf.base.delete_tid = 0; in format_root_directory()
764 elm->leaf.data_offset = pfsd_off; in format_root_directory()
[all …]
/dragonfly/contrib/elftoolchain/common/
H A D_elftc.h153 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
155 (head)->stqh_last = &(elm)->field.stqe_next; \
156 (head)->stqh_first = (elm); \
162 (elm)->field.stqe_next = NULL; \
163 *(head)->stqh_last = (elm); \
164 (head)->stqh_last = &(elm)->field.stqe_next; \
171 (head)->stqh_last = &(elm)->field.stqe_next; \
172 (listelm)->field.stqe_next = (elm); \
184 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
189 if ((head)->stqh_first == (elm)) { \
[all …]
/dragonfly/lib/libc/citrus/
H A Dcitrus_hash.h45 #define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field) argument
46 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \ argument
47 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
48 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \ argument
50 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) \
51 if (matchfunc((elm), key) == 0) \
/dragonfly/libexec/rtld-elf/
H A Drtld.c1865 if (elm->obj != NULL && elm->obj->z_nodelete && in process_nodelete()
2386 LD_UTRACE(UTRACE_FINI_CALL, elm->obj, (void *)elm->obj->fini, in objlist_call_fini()
2388 call_initfini_pointer(elm->obj, elm->obj->fini); in objlist_call_fini()
2393 free(elm); in objlist_call_fini()
2453 LD_UTRACE(UTRACE_INIT_CALL, elm->obj, (void *)elm->obj->init, in objlist_call_init()
2455 call_initfini_pointer(elm->obj, elm->obj->init); in objlist_call_init()
2482 free(elm); in objlist_clear()
2493 return elm; in objlist_find()
2533 elm->obj = obj; in objlist_put_after()
2547 free(elm); in objlist_remove()
[all …]
/dragonfly/test/debug/
H A Dvmpagehash.c160 struct vm_page_hash_elm *elm; in main() local
162 elm = &vm_page_hash[i]; in main()
165 if (elm[0].m && elm[1].m && elm[2].m && elm[3].m) in main()
169 printf(" %016jx %9d ", elm->m, elm->ticks); in main()
171 if (elm->m) { in main()
172 kkread_vmpage(kd, (u_long)elm->m, &m); in main()
175 checkpage(kd, elm->m, &m, &obj); in main()

123