Searched refs:leaf (Results 1 - 25 of 46) sorted by relevance

12

/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/fs/xfs/
H A Dxfs_dir2_leaf.c60 * Convert a block form directory to a leaf form directory.
67 __be16 *bestsp; /* leaf's bestsp entries */
68 xfs_dablk_t blkno; /* leaf block's bno */
70 xfs_dir2_leaf_entry_t *blp; /* block's leaf entries */
74 xfs_dabuf_t *lbp; /* leaf block's buffer */
75 xfs_dir2_db_t ldb; /* leaf block's bno */
76 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
77 xfs_dir2_leaf_tail_t *ltp; /* leaf's tail */
88 * Add the leaf bloc
176 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
557 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
601 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
657 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1148 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1204 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1228 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1247 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1264 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1291 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1346 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1446 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1583 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1633 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1690 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
1755 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
[all...]
H A Dxfs_dir2_node.c101 * Convert a leaf-format directory to a node-format directory.
102 * We need to change the magic number of the leaf block, and copy
103 * the freespace table out of the leaf block into its own block.
108 xfs_dabuf_t *lbp) /* leaf buffer */
116 int i; /* leaf freespace index */
117 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
118 xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */
145 leaf = lbp->data;
146 ltp = XFS_DIR2_LEAF_TAIL_P(mp, leaf);
190 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
348 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
377 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
409 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 Dxfs_attr_leaf.c49 * Routines to implement leaf blocks of attributes as Btrees of hashed names.
91 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
478 * Convert from using the shortform to the leaf.
758 * Check a leaf attribute block to see if all the entries would fit into
764 xfs_attr_leafblock_t *leaf; local
769 leaf = bp->data;
770 ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
772 entry = &leaf->entries[0];
774 for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
779 name_loc = XFS_ATTR_LEAF_NAME_LOCAL(leaf,
801 xfs_attr_leafblock_t *leaf; local
888 xfs_attr_leafblock_t *leaf; local
952 xfs_attr_leafblock_t *leaf; local
1043 xfs_attr_leafblock_t *leaf; local
1112 xfs_attr_leafblock_t *leaf; local
1571 xfs_attr_leafblock_t *leaf; local
1693 xfs_attr_leafblock_t *leaf; local
1959 xfs_attr_leafblock_t *leaf; local
2065 xfs_attr_leafblock_t *leaf; local
2295 xfs_attr_leafblock_t *leaf; local
2311 xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index) argument
2361 xfs_attr_leafblock_t *leaf; local
2488 xfs_attr_leafblock_t *leaf; local
2559 xfs_attr_leafblock_t *leaf; local
2891 xfs_attr_leafblock_t *leaf; local
[all...]
H A Dxfs_dir2_block.h46 __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 Dxfs_attr_sf.h90 #define XFS_ATTR_KTRACE_L_CL 4 /* context, leaf */
98 struct xfs_attr_leafblock *leaf);
H A Dxfs_dir2_block.c72 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
75 int compact; /* need to compact leaf ents */
84 int lfloghigh=0; /* last final leaf to log */
85 int lfloglow=0; /* first final leaf to log */
126 * No stale entries? Need space for entry and new leaf.
130 * Tag just before the first leaf entry.
134 * Data object just before the first leaf entry.
139 * the space before the first leaf entry needs to be free so it
153 * to hold the new leaf too?
180 * If there are stale entries we'll use one for the leaf
892 xfs_dir2_leaf_t *leaf; /* leaf structure */ local
[all...]
H A Dxfs_attr.c298 * upgrade it to a single-leaf-block attribute list.
344 * It won't fit in the shortform, transform to a leaf block.
370 * Commit the leaf transformation. We'll need another (linked)
371 * transaction to add the new attribute to the leaf.
916 * Add a name to the leaf attribute list structure
918 * This leaf block cannot have a "remote" value, we only call this routine
940 * Look up the given attribute in the leaf block. Figure out if
960 * Add the attribute to the leaf block, transitioning to a Btree
1112 * Remove a name from the leaf attribute list structure
1114 * This leaf bloc
1213 xfs_attr_leafblock_t *leaf; local
1833 xfs_attr_leafblock_t *leaf; local
2363 xfs_attr_trace_l_cl(char *where, struct xfs_attr_list_context *context, struct xfs_attr_leafblock *leaf) argument
[all...]
H A Dxfs_attr_leaf.h25 * elements are in the leaf nodes. Attribute names are hashed into an int,
46 * This is the structure of the leaf nodes in the Btree.
59 * to work "forw"ard. If none matches, continue with the "forw"ard leaf
277 int xfs_attr_leaf_lookup_int(struct xfs_dabuf *leaf,
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/drivers/net/tulip/
H A Deeprom.c69 0x8001, /* 1 leaf, extended type, bogus len */
242 struct medialeaf *leaf = &mtable->mleaf[i]; local
245 leaf->type = 0;
246 leaf->media = p[0] & 0x3f;
247 leaf->leafdata = p;
252 leaf->type = p[1];
255 leaf->media = p[2] & 0x0f;
261 leaf->leafdata = p + 2;
268 leaf->media = 11;
274 leaf
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/gettext-0.17/gettext-runtime/intl/
H A Dtsearch.h42 leaf enumerator in enum:__anon2199
65 - for non-leaf nodes: 3 times, before the left subtree traversal,
68 - for leaf nodes: once.
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/net/ipv6/
H A Dip6_fib.c172 .leaf = &ip6_null_entry,
207 .leaf = &ip6_null_entry,
219 table->tb6_root.leaf = &ip6_null_entry;
300 for (rt = w->leaf; rt; rt = rt->u.dst.rt6_next) {
304 w->leaf = rt;
309 w->leaf = NULL;
446 key = (struct rt6key *)((u8 *)fn->leaf + offset);
462 rt6_release(fn->leaf);
463 fn->leaf = NULL;
484 * Create new leaf nod
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/net/sched/
H A Dsch_htb.c88 /* interior & leaf nodes; props specific to leaves are marked L: */
119 } leaf; member in union:htb_class::__anon10933
151 int prio; /* For parent to leaf return possible here */
153 /* of un.leaf originals should be done. */
241 * should be passed directly thru. In all other cases leaf class is returned.
246 * have no valid leaf we try to use MAJOR:default leaf. It still unsuccessfull
294 return cl; /* we hit leaf; return it */
575 * htb_activate - inserts leaf cl into appropriate active feeds
577 * Routine learns (new) priority of leaf an
[all...]
H A Dsch_api.c208 struct Qdisc *leaf; local
217 leaf = cops->leaf(p, cl);
219 return leaf;
597 struct Qdisc *leaf; local
601 leaf = cops->leaf(q, cl);
602 if (leaf) {
603 if (leaf == arg->p || arg->depth > 7)
605 return check_loop(leaf, ar
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/drivers/ieee1394/
H A Dcsr1212.h148 struct csr1212_leaf leaf; member in union:csr1212_keyval::__anon4467
227 (be32_to_cpu((kv)->value.leaf.data[0]) >> \
230 (be32_to_cpu((kv)->value.leaf.data[0]) & \
243 (be32_to_cpu((kv)->value.leaf.data[1]) >> \
246 ((be32_to_cpu((kv)->value.leaf.data[1]) >> \
250 (be32_to_cpu((kv)->value.leaf.data[1]) & \
253 (&((kv)->value.leaf.data[2]))
H A Dcsr1212.c93 CSR1212_FREE(kv->value.leaf.data);
257 kv->value.leaf.data = CSR1212_MALLOC(data_len);
258 if (!kv->value.leaf.data) {
264 memcpy(kv->value.leaf.data, data, data_len);
266 kv->value.leaf.data = NULL;
269 kv->value.leaf.len = bytes_to_quads(data_len);
362 (&((kv)->value.leaf.data[1]))
365 ((kv)->value.leaf.data[0] = \
369 ((kv)->value.leaf.data[0] = \
446 kv->value.leaf
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/fs/gfs2/
H A Ddir.c37 * beginning of the leaf block. The dirents reside in leaves when
44 * used as an array of 64-bit block pointers pointing to the leaf blocks. The
46 * block pointer in the array that points to the same leaf. In fact, when a
48 * point to the same leaf.
50 * When a leaf is completely full, the size of the hash table can be
77 #define IS_LEAF 1 /* Hashed (leaf) directory */
536 * return first dirent whether bh points to leaf or stuffed dinode
710 * get_leaf_nr - Get a leaf number associated with the index
759 struct gfs2_leaf *leaf; local
777 leaf
808 struct gfs2_leaf *leaf; local
842 struct gfs2_leaf *leaf; local
1273 int leaf = 0; local
1515 struct gfs2_leaf *leaf, *oleaf; local
1573 struct gfs2_leaf *leaf; local
1665 struct gfs2_leaf *leaf = (struct gfs2_leaf *)bh->b_data; local
1748 struct gfs2_leaf *leaf; local
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/net/ipv4/
H A Dfib_trie.c113 struct leaf { struct
232 If n is a leaf, every bit in its key is significant. Its presence is
234 searching for a leaf - unless we are doing an insertion) we will completely
312 kfree(container_of(head, struct leaf, rcu));
320 static inline void free_leaf_info(struct leaf_info *leaf) argument
322 call_rcu(&leaf->rcu, __leaf_info_free_rcu);
354 struct leaf *l = (struct leaf *) tn;
360 static struct leaf *leaf_new(void)
362 struct leaf *
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/include/net/
H A Dip6_fib.h56 struct rt6_info *leaf; member in struct:fib6_node
119 struct rt6_info *leaf; member in struct:fib6_walker_t
H A Dsch_generic.h62 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl); member in struct:Qdisc_class_ops
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/arch/mips/kernel/
H A Dprocess.c312 if (info->pc_offset < 0) /* leaf */
370 int leaf; local
410 leaf = get_frame_info(&info);
411 if (leaf < 0)
418 if (leaf)
421 * consider wrongly a nested function as a leaf
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/fs/jfs/
H A Djfs_dmap.c1133 s8 *leaf; local
1144 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);
1158 /* check if the starting leaf indicates that anything
1161 if (leaf[word] == NOFREE)
1173 * single leaf may describe the free space of multiple dmap
1206 /* does the leaf describe any free space ?
1208 if (leaf[word] < BUDMIN)
1212 * by this leaf.
1215 min((int)leaf[word], NLSTOL2BSZ(nwords));
1239 * starting with the dmap leaf tha
1265 s8 *leaf; local
2083 s8 *leaf; local
2566 s8 *leaf = tp->dmt_stree + le32_to_cpu(tp->dmt_leafidx); local
2631 s8 *leaf = tp->dmt_stree + le32_to_cpu(tp->dmt_leafidx); local
2709 s8 *leaf; local
3170 s8 oldroot, *leaf; local
[all...]
H A Djfs_dtree.h32 } leaf; member in union:__anon7474
81 * leaf node entry head/only segment
114 u8 slot; /* 1: slot within leaf page of entry */
115 u8 addr1; /* 1: upper 8 bits of leaf page address */
116 __le32 addr2; /* 4: lower 32 bits of leaf page address -OR-
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/arch/i386/kernel/cpu/
H A Dintel_cacheinfo.c170 static void __cpuinit amd_cpuid4(int leaf, union _cpuid4_leaf_eax *eax, argument
186 if (leaf > 2 || !l1d.val || !l1i.val || !l2.val)
190 eax->split.type = types[leaf];
191 eax->split.level = levels[leaf];
195 if (leaf <= 1) {
196 union l1_cache *l1 = leaf == 0 ? &l1d : &l1i;
279 * parameters cpuid leaf to find the cache details
419 /* pointer to _cpuid4_info array (for each cache leaf) */
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/openssl-0.9.8e/crypto/
H A Dsparccpuid.S145 be 1f ! could have been a leaf function...
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/router/busybox-1.x/miscutils/
H A Dmakedevs.c230 # error makedevs configuration error, either leaf or table must be selected

Completed in 205 milliseconds

12