Home
last modified time | relevance | path

Searched refs:trees (Results 1 – 11 of 11) sorted by relevance

/linux-2.4.37.9/lib/zlib_inflate/
Dinfblock.c191 s->sub.trees.table = t = (uInt)b & 0x3fff;
202 s->sub.trees.blens = WS(z)->working_blens;
205 s->sub.trees.index = 0;
208 while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
211 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
214 while (s->sub.trees.index < 19)
215 s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
216 s->sub.trees.bb = 7;
217 t = zlib_inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb,
218 &s->sub.trees.tb, s->hufts, z);
[all …]
Dinfutil.h46 } trees; /* if DTREE, decoding info for trees */ member
/linux-2.4.37.9/arch/ppc/boot/lib/
Dzlib.c606 } trees; /* if DTREE, decoding info for trees */ member
748 ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
889 s->sub.trees.table = t = (uInt)b & 0x3fff;
902 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
907 s->sub.trees.nblens = t;
909 s->sub.trees.index = 0;
913 while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
916 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
919 while (s->sub.trees.index < 19)
920 s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
[all …]
/linux-2.4.37.9/arch/ppc64/boot/
Dzlib.c629 } trees; /* if DTREE, decoding info for trees */ member
771 ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
912 s->sub.trees.table = t = (uInt)b & 0x3fff;
925 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
930 s->sub.trees.nblens = t;
932 s->sub.trees.index = 0;
936 while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
939 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
942 while (s->sub.trees.index < 19)
943 s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
[all …]
/linux-2.4.37.9/Documentation/BK-usage/
Dbk-kernel-howto.txt47 to is having multiple copies of source trees lying around. This -really-
48 takes some getting used to, for some people. Separate source trees
51 CVS become separate source trees, or "clones" in BitKeeper [heh,
60 Once you have established a common baseline between two source trees --
62 trees with ease. Merging changes into a tree is called a "pull", and
76 The "-l" uses hard links instead of copying data, since both trees are
110 A big part of using BitKeeper is organizing the various trees you have
112 trees, and remote trees. If one were to graph the relationships between
130 not all changes from "peer parent" trees. For example, pushing a change
133 personal-hacks trees into the target tree.
[all …]
/linux-2.4.37.9/Documentation/filesystems/
Dhpfs.txt178 Old versions of this driver created sometimes unbalanced dnode trees. OS/2
180 unbalanced trees too :-) but both HPFS and HPFS386 contain bug that it rarely
181 crashes when the tree is not balanced. This driver handles unbalanced trees
/linux-2.4.37.9/Documentation/
DSubmittingDrivers5 various kernel trees. Note that if you are interested in video card drivers
DConfigure.help16664 Balanced trees are more efficient than traditional file system
18049 replicating potentially large trees or keeping laptop/desktop copies
/linux-2.4.37.9/Documentation/networking/
Deql.txt13 source trees. (Yes, it worked fine.)
/linux-2.4.37.9/fs/befs/
DChangeLog125 * Added workaround for mis-understanding of the nature of the b+trees used
/linux-2.4.37.9/fs/hfs/
DChangeLog1105 (get_new_node()) that doesn't retry, since B-trees can't shrink.
1897 Updated to use truncate() to grow full trees.
2167 even B*-trees now have that information in the inode.
2275 hfs_btree_extend(): for extending B*-trees.
2339 fixed to work for B*-trees.