/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | sbitmap.c | 247 memcpy (dst->elms, src->elms, sizeof (SBITMAP_ELT_TYPE) * dst->size); in sbitmap_copy() 257 memcpy (dst->elms, src->elms, sizeof (SBITMAP_ELT_TYPE) * n); in sbitmap_copy_n() 266 return !memcmp (a->elms, b->elms, sizeof (SBITMAP_ELT_TYPE) * a->size); in sbitmap_equal() 276 if (bmap->elms[i]) in sbitmap_empty_p() 294 elm = bmap->elms[i]; in sbitmap_range_empty_p() 447 dst->elms[n-1] = dst->elms[n-1] in sbitmap_not() 662 for (ap = a->elms, bp = b->elms, i = 0; i < n; i++, ap++, bp++) in sbitmap_a_subset_b_p() 792 r = dst->elms; in sbitmap_intersection_of_succs() 834 r = dst->elms; in sbitmap_intersection_of_preds() 876 r = dst->elms; in sbitmap_union_of_succs() [all …]
|
H A D | sbitmap.h | 44 SBITMAP_ELT_TYPE elms[1]; /* The elements. */ member 53 ((BITMAP)->elms [(BITNO) / SBITMAP_ELT_BITS] >> (BITNO) % SBITMAP_ELT_BITS & 1) 68 map->elms[bitno / SBITMAP_ELT_BITS] in SET_BIT() 87 map->elms[bitno / SBITMAP_ELT_BITS] in RESET_BIT() 118 i->ptr = bmp->elms; in sbitmap_iter_init() 178 SBITMAP_ELT_TYPE *ptr_ = (SBITMAP)->elms; \
|
H A D | sparseset.c | 39 set->dense = &(set->elms[0]); in sparseset_alloc() 40 set->sparse = &(set->elms[n_elms]); in sparseset_alloc()
|
H A D | sparseset.h | 38 SPARSESET_ELT_TYPE elms[2]; /* Combined dense and sparse arrays. */ member
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | sbitmap.c | 86 bmap->elms[bmap->size - 1] in sbitmap_resize() 92 bmap->elms[size - 1] in sbitmap_resize() 103 bmap->elms[size - 1] in sbitmap_resize() 185 memcpy (dst->elms, src->elms, sizeof (SBITMAP_ELT_TYPE) * dst->size); in bitmap_copy() 194 return !memcmp (a->elms, b->elms, sizeof (SBITMAP_ELT_TYPE) * a->size); in bitmap_equal_p() 204 if (bmap->elms[i]) in bitmap_empty_p() 411 if (bmap->elms[i]) in bitmap_count_bits() 447 bmap->elms[bmap->size - 1] in bitmap_ones() 484 sbitmap_ptr dstp = dst->elms; in bitmap_ior_and_compl() 518 dst->elms[n-1] = dst->elms[n-1] in bitmap_not() [all …]
|
H A D | sbitmap.h | 90 SBITMAP_ELT_TYPE elms[1]; /* The elements. */ member 124 return (map->elms[i] >> s) & (SBITMAP_ELT_TYPE) 1; in bitmap_bit_p() 134 map->elms[bitno / SBITMAP_ELT_BITS] in bitmap_set_bit() 145 map->elms[bitno / SBITMAP_ELT_BITS] in bitmap_clear_bit() 177 i->ptr = bmp->elms; in bmp_iter_set_init()
|
H A D | cfganal.c | 1382 p = src[e->dest->index]->elms; in bitmap_intersection_of_succs() 1383 r = dst->elms; in bitmap_intersection_of_succs() 1421 p = src[e->src->index]->elms; in bitmap_intersection_of_preds() 1422 r = dst->elms; in bitmap_intersection_of_preds() 1460 p = src[e->dest->index]->elms; in bitmap_union_of_succs() 1461 r = dst->elms; in bitmap_union_of_succs() 1499 p = src[e->src->index]->elms; in bitmap_union_of_preds() 1500 r = dst->elms; in bitmap_union_of_preds()
|
H A D | sparseset.c | 41 set->dense = &(set->elms[0]); in sparseset_alloc() 42 set->sparse = &(set->elms[n_elms]); in sparseset_alloc()
|
H A D | sparseset.h | 98 SPARSESET_ELT_TYPE elms[2]; /* Combined dense and sparse arrays. */ member
|
/dragonfly/sys/vfs/hammer/ |
H A D | hammer_btree.c | 820 bcopy(&node->elms[i], &node->elms[i+1], in hammer_btree_insert() 823 node->elms[i].leaf = *elm; in hammer_btree_insert() 904 bcopy(&ondisk->elms[i+1], &ondisk->elms[i], in hammer_btree_delete() 1092 elm = &node->elms[i]; in btree_search() 1132 elm = &node->elms[0]; in btree_search() 1157 elms[0]); in btree_search() 1193 elm = &node->elms[i]; in btree_search() 1209 elm = &node->elms[i]; in btree_search() 1292 elm = &node->elms[i]; in btree_search() 2656 elm = &ondisk->elms[i]; in hammer_btree_lock_children() [all …]
|
H A D | hammer_rebalance.c | 194 elm = &cursor.node->ondisk->elms[cursor.index].leaf; in hammer_ioc_rebalance() 378 elm = &lockroot.node->ondisk->elms[ in rebalance_node() 381 elm = &node->ondisk->elms[i]; in rebalance_node() 406 elm = &base_item->copy->elms[base_count]; in rebalance_node() 407 *elm = node->ondisk->elms[i]; in rebalance_node() 429 if (lockroot.copy->elms[root_count]. in rebalance_node() 431 lockroot.copy->elms[root_count]. in rebalance_node() 475 elm = &lockroot.node->ondisk->elms[lockroot.node->ondisk->count]; in rebalance_node() 480 lockroot.copy->elms[root_count] = *elm; in rebalance_node() 564 base_elm = &base_item->copy->elms[base_count]; in rebalance_closeout() [all …]
|
H A D | hammer_prune.c | 102 user_elms = prune->elms; in hammer_ioc_prune() 106 prune->elms = copy_elms; in hammer_ioc_prune() 153 elm = &cursor.node->ondisk->elms[cursor.index].leaf; in hammer_ioc_prune() 262 prune->elms = user_elms; in hammer_ioc_prune() 289 scan = &prune->elms[i]; in prune_should_delete() 394 elm = &cursor->node->ondisk->elms[cursor->index]; 406 scan = &prune->elms[realign_cre]; 439 scan = &prune->elms[realign_del];
|
H A D | hammer_cursor.c | 507 elm = &parent->ondisk->elms[parent_index]; in hammer_load_cursor_parent() 639 elm = &node->ondisk->elms[cursor->parent_index]; in hammer_cursor_down() 927 if (cursor->leaf == &ondisk->elms[cursor->index].leaf) in hammer_cursor_replaced_node() 928 cursor->leaf = &nndisk->elms[cursor->index].leaf; in hammer_cursor_replaced_node() 962 if (cursor->leaf == &ondisk->elms[cursor->index].leaf) in hammer_cursor_removed_node() 993 if (cursor->leaf == &ondisk->elms[cursor->index].leaf) in hammer_cursor_split_node() 1034 if (cursor->leaf == &ondisk->elms[oindex].leaf) in hammer_cursor_moved_element() 1035 cursor->leaf = &nndisk->elms[nindex].leaf; in hammer_cursor_moved_element() 1069 if (cursor->leaf == &ondisk->elms[oindex].leaf) in hammer_cursor_moved_element() 1070 cursor->leaf = &nndisk->elms[nindex].leaf; in hammer_cursor_moved_element() [all …]
|
H A D | hammer_reblock.c | 147 elm = &cursor.node->ondisk->elms[cursor.index]; in hammer_ioc_reblock() 356 elm = &ondisk->elms[cursor->index]; in hammer_reblock_helper() 422 elm = &cursor->parent->ondisk->elms[cursor->parent_index]; in hammer_reblock_helper() 678 &nnode->ondisk->elms[i]); in hammer_move_node()
|
H A D | hammer_btree.h | 244 union hammer_btree_elm elms[HAMMER_BTREE_LEAF_ELMS]; member
|
H A D | hammer_pfs.c | 476 key_cur = cursor.node->ondisk->elms[cursor.index].base; in hammer_pfs_rollback() 513 elm = &cursor->node->ondisk->elms[cursor->index].leaf; in hammer_pfs_delete_at_cursor()
|
H A D | hammer_mirror.c | 185 elm = &cursor.node->ondisk->elms[cursor.index].leaf; in hammer_ioc_mirror_read() 736 elm = &cursor->node->ondisk->elms[cursor->index].leaf; in hammer_mirror_delete_to()
|
H A D | hammer_object.c | 1504 elm = &cursor->node->ondisk->elms[cursor->index]; in _hammer_ip_reseek() 1649 elm = &cursor->node->ondisk->elms[cursor->index]; in hammer_ip_next() 1734 elm = &cursor->node->ondisk->elms[cursor->index]; in hammer_ip_next() 1889 cursor->leaf = &cursor->node->ondisk->elms[cursor->index].leaf; in hammer_ip_resolve_data() 2446 elm = &node->ondisk->elms[cursor->index]; in hammer_delete_at_cursor()
|
H A D | hammer_ioctl.h | 101 struct hammer_ioc_prune_elm *elms; /* user supplied array */ member
|
/dragonfly/sbin/hammer/ |
H A D | cmd_softprune.c | 485 scan->prune.elms = realloc(scan->prune.elms, in hammer_softprune_addelm() 493 elm = &scan->prune.elms[scan->prune.nelms]; in hammer_softprune_addelm() 544 qsort(scan->prune.elms, scan->prune.nelms, sizeof(*elm), in hammer_softprune_finalize() 548 elm = &scan->prune.elms[i]; in hammer_softprune_finalize() 581 elm = &scan->prune.elms[i]; in hammer_softprune_finalize() 593 bcopy(&scan->prune.elms[i], &scan->prune.elms[0], in hammer_softprune_finalize() 595 scan->prune.elms[0].end_tid = HAMMER_MAX_TID; in hammer_softprune_finalize() 606 bcopy(&scan->prune.elms[1], &scan->prune.elms[0], in hammer_softprune_finalize() 607 (scan->prune.nelms - 1) * sizeof(scan->prune.elms[0])); in hammer_softprune_finalize() 617 elm = &scan->prune.elms[scan->prune.nelms]; in hammer_softprune_finalize() [all …]
|
H A D | cmd_show.c | 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()
|
H A D | cmd_recover.c | 270 buf[i] = hammer_elm_btype(&node->elms[i]); in print_node() 305 elm = &node->elms[i]; in recover_top()
|
/dragonfly/sys/dev/drm/ |
H A D | linux_rcu.c | 57 rcu_elm_t *elms; member 80 elm = &rcu->elms[rcu->s & rcu->mask]; in rcu_timer() 143 oelms = rcu->elms; in rcu_expand() 149 rcu->elms = nelms; in rcu_expand() 175 elm = &rcu->elms[rcu->e & rcu->mask]; in __kfree_rcu() 200 elm = &rcu->elms[rcu->e & rcu->mask]; in call_rcu()
|
/dragonfly/stand/lib/ |
H A D | hammer1.c | 284 r = hammer_btree_cmp(elm, &node->elms[i].leaf.base); in hammer_btree_search_node() 444 hprintb(&node->elms[i].base); in hfind() 449 hprintb(&node->elms[node->count].base); in hfind() 459 e = &node->elms[n]; in hfind() 468 e = &node->elms[--n]; in hfind()
|
/dragonfly/sbin/newfs_hammer/ |
H A D | newfs_hammer.c | 731 elm = &bnode->elms[0]; in format_root_directory() 752 elm = &bnode->elms[1]; in format_root_directory()
|