/freebsd-9.3-release/sys/gnu/fs/xfs/ |
H A D | xfs_dir2_leaf.c | 62 * Convert a block form directory to a leaf form directory. 69 __be16 *bestsp; /* leaf's bestsp entries */ 70 xfs_dablk_t blkno; /* leaf block's bno */ 72 xfs_dir2_leaf_entry_t *blp; /* block's leaf entries */ 76 xfs_dabuf_t *lbp; /* leaf block's buffer */ 77 xfs_dir2_db_t ldb; /* leaf block's bno */ 78 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 79 xfs_dir2_leaf_tail_t *ltp; /* leaf's tail */ 90 * Add the leaf bloc 179 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 560 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 604 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 660 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1151 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1207 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1231 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1250 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1267 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1294 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1349 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1449 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1586 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1636 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1693 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1758 xfs_dir2_leaf_t *leaf; /* leaf structure */ local [all...] |
H A D | xfs_dir2_node.c | 103 * Convert a leaf-format directory to a node-format directory. 104 * We need to change the magic number of the leaf block, and copy 105 * the freespace table out of the leaf block into its own block. 110 xfs_dabuf_t *lbp) /* leaf buffer */ 118 int i; /* leaf freespace index */ 119 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 120 xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ 147 leaf = lbp->data; 148 ltp = XFS_DIR2_LEAF_TAIL_P(mp, leaf); 192 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 350 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 379 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 411 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 857 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1132 xfs_dir2_leaf_t *leaf; /* leaf structure */ local 1865 xfs_dir2_leaf_t *leaf; /* leaf structure */ local [all...] |
H A D | xfs_dir_leaf.c | 48 * Routines to implement leaf blocks of directories as Btrees of hashed names. 168 * Catch the case where the conversion from shortform to leaf 218 * Catch the case where the conversion from shortform to leaf 271 * Catch the case where the conversion from shortform to leaf 305 * Convert from using the shortform to the leaf. 322 * Catch the case where the conversion from shortform to leaf 583 * Catch the case where the conversion from shortform to leaf 619 * Convert a leaf directory to shortform structure 624 xfs_dir_leafblock_t *leaf; local 645 leaf 706 xfs_dir_leafblock_t *leaf; local 770 xfs_dir_leafblock_t *leaf; local 858 xfs_dir_leafblock_t *leaf; local 934 xfs_dir_leafblock_t *leaf; local 1315 xfs_dir_leafblock_t *leaf; local 1441 xfs_dir_leafblock_t *leaf; local 1692 xfs_dir_leafblock_t *leaf; local 1905 xfs_dir_leafblock_t *leaf; local 1930 xfs_dir_leafblock_t *leaf; local [all...] |
H A D | xfs_attr_leaf.c | 51 * Routines to implement leaf blocks of attributes as Btrees of hashed names. 93 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index); 422 * Convert from using the shortform to the leaf. 703 * Check a leaf attribute block to see if all the entries would fit into 709 xfs_attr_leafblock_t *leaf; local 714 leaf = bp->data; 715 ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC); 717 entry = &leaf->entries[0]; 719 for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) { 724 name_loc = XFS_ATTR_LEAF_NAME_LOCAL(leaf, 745 xfs_attr_leafblock_t *leaf; local 832 xfs_attr_leafblock_t *leaf; local 896 xfs_attr_leafblock_t *leaf; local 987 xfs_attr_leafblock_t *leaf; local 1056 xfs_attr_leafblock_t *leaf; local 1516 xfs_attr_leafblock_t *leaf; local 1638 xfs_attr_leafblock_t *leaf; local 1904 xfs_attr_leafblock_t *leaf; local 2019 xfs_attr_leafblock_t *leaf; local 2249 xfs_attr_leafblock_t *leaf; local 2265 xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index) argument 2315 xfs_attr_leafblock_t *leaf; local 2491 xfs_attr_leafblock_t *leaf; local 2562 xfs_attr_leafblock_t *leaf; local 2894 xfs_attr_leafblock_t *leaf; local [all...] |
H A D | xfs_dir.c | 599 * Add a name to the leaf directory structure 622 * Remove a name from the leaf directory structure 628 xfs_dir_leafblock_t *leaf; local 637 leaf = bp->data; 638 ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_DIR_LEAF_MAGIC); 642 *count = INT_GET(leaf->hdr.count, ARCH_CONVERT); 643 *totallen = INT_GET(leaf->hdr.namebytes, ARCH_CONVERT); 651 * Look up a name in a leaf directory structure. 671 * Copy out directory entries for getdents(), for leaf directories. 691 * Look up a name in a leaf director 700 xfs_dir_leafblock_t *leaf; local 884 xfs_dir_leafblock_t *leaf = NULL; local 1034 xfs_dir_leafblock_t *leaf; local 1143 xfs_dir_trace_g_dul(char *where, xfs_inode_t *dp, uio_t *uio, xfs_dir_leafblock_t *leaf) argument [all...] |
H A D | xfs_dir2_block.h | 46 __be32 count; /* count of leaf entries */ 56 xfs_dir2_leaf_entry_t leaf[1]; member in struct:xfs_dir2_block 61 * Pointer to the leaf header embedded in a data block (1-block format) 72 * Pointer to the leaf entries embedded in a data block (1-block format)
|
H A D | xfs_attr_sf.h | 90 #define XFS_ATTR_KTRACE_L_CL 4 /* context, leaf */ 98 struct xfs_attr_leafblock *leaf);
|
H A D | xfs_dir2_block.c | 63 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */ 66 int compact; /* need to compact leaf ents */ 75 int lfloghigh=0; /* last final leaf to log */ 76 int lfloglow=0; /* first final leaf to log */ 117 * No stale entries? Need space for entry and new leaf. 121 * Tag just before the first leaf entry. 125 * Data object just before the first leaf entry. 130 * the space before the first leaf entry needs to be free so it 144 * to hold the new leaf too? 171 * If there are stale entries we'll use one for the leaf 891 xfs_dir2_leaf_t *leaf; /* leaf structure */ local [all...] |
H A D | xfs_dir_sf.h | 127 #define XFS_DIR_KTRACE_G_DUL 4 /* dp, uio, leaf */ 128 #define XFS_DIR_KTRACE_G_DUE 5 /* dp, uio, leaf entry */ 137 struct xfs_dir_leafblock *leaf);
|
H A D | xfs_attr.c | 298 * upgrade it to a single-leaf-block attribute list. 345 * It won't fit in the shortform, transform to a leaf block. 371 * Commit the leaf transformation. We'll need another (linked) 372 * transaction to add the new attribute to the leaf. 822 * Add a name to the leaf attribute list structure 824 * This leaf block cannot have a "remote" value, we only call this routine 846 * Look up the given attribute in the leaf block. Figure out if 866 * Add the attribute to the leaf block, transitioning to a Btree 1019 * Remove a name from the leaf attribute list structure 1021 * This leaf bloc 1120 xfs_attr_leafblock_t *leaf; local 1743 xfs_attr_leafblock_t *leaf; local 2269 xfs_attr_trace_l_cl(char *where, struct xfs_attr_list_context *context, struct xfs_attr_leafblock *leaf) argument [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | traits.hpp | 52 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp> 116 leaf; typedef in struct:pb_ds::detail::trie_traits 138 leaf, 149 leaf, 160 leaf, 171 leaf, 181 leaf, 193 leaf, 277 leaf; typedef in struct:pb_ds::detail::trie_traits 299 leaf, [all...] |
H A D | cond_dtor_entry_dealtor.hpp | 75 m_p_nd->~leaf();
|
H A D | erase_fn_imps.hpp | 128 p_l->~leaf(); 169 static_cast<leaf_pointer>(p_nd)->~leaf();
|
H A D | pat_trie_.hpp | 149 typedef typename Node_And_It_Traits::leaf leaf; typedef in class:pb_ds::detail::PB_DS_CLASS_NAME 150 typedef typename Allocator::template rebind<leaf>::other leaf_allocator;
|
/freebsd-9.3-release/contrib/libucl/tests/ |
H A D | 3.in | 16 leaf: query -e '%a == 0' '%n-%v', 17 leaf: query -e '%a == 0' '%n-%v',
|
/freebsd-9.3-release/contrib/ncurses/ncurses/tinfo/ |
H A D | access.c | 117 char *leaf = _nc_basename(strcpy(head, path)); local 119 if (leaf == 0) 120 leaf = head; 121 *leaf = '\0'; 122 if (head == leaf)
|
/freebsd-9.3-release/include/ |
H A D | search.h | 33 leaf enumerator in enum:__anon5002
|
/freebsd-9.3-release/lib/libc/stdlib/ |
H A D | twalk.c | 38 (*action)(root, leaf, level);
|
/freebsd-9.3-release/contrib/libcxxrt/ |
H A D | dynamic_cast.cc | 37 /** Offset of the leaf object. */ 208 void *leaf = ADD_TO_PTR((void*)sub, header->leaf_offset); local 209 return header->type->cast_to(leaf, dst);
|
/freebsd-9.3-release/gnu/lib/libodialog/ |
H A D | tree.c | 22 struct leaf { struct 23 unsigned char *name; /* name of leaf */ 24 unsigned char *branches; /* branches that going by leaf */ 25 unsigned char slip; /* slip of leaf*/ 29 static int mk_slip(struct leaf array[], int arr_size, 47 struct leaf **p_array); 62 struct leaf **p_array); 70 static void free_leafs(struct leaf *array, int size); 149 static void print_item(WINDOW *win, struct leaf item, int choice, int selected); 158 int item_no, struct leaf item [all...] |
/freebsd-9.3-release/contrib/dialog/ |
H A D | fselect.c | 108 char *leaf = strrchr(path, '/'); local 109 if (leaf != 0) 110 leaf++; 112 leaf = path; 113 return leaf; 306 char *leaf = leaf_of(input); local 308 return show_list(leaf, d_list, keep) | show_list(leaf, f_list, keep); 437 char *leaf; local 457 if ((leaf [all...] |
/freebsd-9.3-release/etc/ |
H A D | protocols | 35 leaf-1 25 LEAF-1 # Leaf-1 36 leaf-2 26 LEAF-2 # Leaf-2
|
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 189 // Both leaf and branch nodes store vectors of pairs. 432 // Compute the leaf node branching factor that makes a node fit in three 446 // Now that we have the leaf branching factor, compute the actual allocation 455 /// Allocator - The recycling allocator used for both branch and leaf nodes. 478 // A NodeRef doesn't know whether it references a leaf node or a branch node. 690 // When all of the leaf nodes from all the subtrees are concatenated, they must 691 // satisfy the same constraints as a single leaf node. They must be sorted, 786 /// path - The path entries, path[0] is the root node, path.back() is a leaf. 799 template <typename NodeT> NodeT &leaf() const { 979 // 1: Root points to leaf [all...] |
/freebsd-9.3-release/contrib/bsnmp/gensnmptree/ |
H A D | gensnmptree.c | 47 * leaf := head type STRING ACCESS ')' 67 * element := tree | leaf | column 164 struct leaf { struct in union:node::__anon838 165 enum snmp_syntax syntax; /* syntax for this leaf */ 167 } leaf; member in union:node::__anon838 802 node->u.leaf.func = savetok(); 803 node->u.leaf.syntax = syntax; 931 /* leaf or column */ 946 syntax = np->u.leaf.syntax; 997 fprintf(fp, "%s, ", np->u.leaf [all...] |
/freebsd-9.3-release/contrib/binutils/gas/ |
H A D | cgen.c | 723 (field ? field->val.leaf->name : "??")); 728 rightshift -= field->val.leaf->length; 902 start = fixP->fx_cgen.field->val.leaf->start; 903 length = fixP->fx_cgen.field->val.leaf->length;
|