HomeSort by relevance Sort by last modified time
    Searched full:btree (Results 1 - 25 of 64) sorted by null

1 2 3

  /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/h264/
BTree.java 25 * Simple BTree implementation needed for haffman tables
29 public class BTree {
30 private BTree zero;
31 private BTree one;
46 BTree branch;
49 zero = new BTree();
53 one = new BTree();
59 public BTree down(int b) {
  /external/kernel-headers/original/uapi/linux/
bcache.h 20 /* Btree keys - all units are in sectors */
137 * Version 2: Seed pointer into btree node checksum
264 * last_seq is the oldest journal entry that still has keys the btree hasn't
335 /* Btree nodes */
337 /* Version 1: Seed pointer into btree node checksum
343 * Btree nodes
345 * On disk a btree node is a list/log of these; within each set the keys are
btrfs_tree.h 326 * type of 2 may point to file data in the btree and type == 3 may point to
420 * item in the btree
458 * items in the extent btree are used to record the objectid of the
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/scripts/
db2pickle.py 10 -b - open as bsddb btree file
53 ["hash", "btree", "recno", "dbm",
81 elif opt in ("-b", "--btree"):
pickle2db.py 11 -b - open as bsddb btree file
22 hash or btree database using db2pickle.py and reconstitute it to a recno
58 ["hash", "btree", "recno", "dbm", "anydbm",
86 elif opt in ("-b", "--btree"):
  /external/llvm/test/CodeGen/X86/
2009-04-29-RegAllocAssert.ll 13 %struct.BtCursor = type { %struct.Btree*, %struct.BtShared*, %struct.BtCursor*, %struct.BtCursor*, i32 (i8*, i32, i8*, i32, i8*)*, i8*, i32, %struct.MemPage*, i32, %struct.CellInfo, i8, i8, i8*, i64, i32, i8, i32* }
14 %struct.BtLock = type { %struct.Btree*, i32, i8, %struct.BtLock* }
15 %struct.BtShared = type { %struct.Pager*, %struct.sqlite3*, %struct.BtCursor*, %struct.MemPage*, i8, i8, i8, i8, i8, i8, i8, i8, i32, i16, i16, i32, i32, i32, i32, i8, i32, i8*, void (i8*)*, %struct.sqlite3_mutex*, %struct.BusyHandler, i32, %struct.BtShared*, %struct.BtLock*, %struct.Btree* }
16 %struct.Btree = type { %struct.sqlite3*, %struct.BtShared*, i8, i8, i8, i32, %struct.Btree*, %struct.Btree* }
17 %struct.BtreeMutexArray = type { i32, [11 x %struct.Btree*] }
24 %struct.Cursor = type { %struct.BtCursor*, i32, i64, i64, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i64, %struct.Btree*, i32, i8*, i64, i8*, %struct.KeyInfo*, i32, i64, %struct.sqlite3_vtab_cursor*, %struct.sqlite3_module*, i32, i32, i32*, i32*, i8* }
25 %struct.Db = type { i8*, %struct.Btree*, i8, i8, i8*, void (i8*)*, %struct.Schema* }
  /external/llvm/test/Transforms/GVN/
2009-01-22-SortInvalidation.ll 11 %struct.BtCursor = type { %struct.Btree*, %struct.BtShared*, %struct.BtCursor*, %struct.BtCursor*, i32 (i8*, i32, i8*, i32, i8*)*, i8*, i32, %struct.MemPage*, i32, %struct.CellInfo, i8, i8, i8*, i64, i32, i8, i32* }
12 %struct.BtLock = type { %struct.Btree*, i32, i8, %struct.BtLock* }
13 %struct.BtShared = type { %struct.Pager*, %struct.sqlite3*, %struct.BtCursor*, %struct.MemPage*, i8, i8, i8, i8, i8, i8, i8, i8, i32, i16, i16, i32, i32, i32, i32, i8, i32, i8*, void (i8*)*, %struct.sqlite3_mutex*, %struct.BusyHandler, i32, %struct.BtShared*, %struct.BtLock*, %struct.Btree* }
14 %struct.Btree = type { %struct.sqlite3*, %struct.BtShared*, i8, i8, i8, i32, %struct.Btree*, %struct.Btree* }
15 %struct.BtreeMutexArray = type { i32, [11 x %struct.Btree*] }
22 %struct.Cursor = type { %struct.BtCursor*, i32, i64, i64, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i64, %struct.Btree*, i32, i8*, i64, i8*, %struct.KeyInfo*, i32, i64, %struct.sqlite3_vtab_cursor*, %struct.sqlite3_module*, i32, i32, i32*, i32*, i8* }
23 %struct.Db = type { i8*, %struct.Btree*, i8, i8, i8*, void (i8*)*, %struct.Schema* }
  /external/swiftshader/third_party/LLVM/test/CodeGen/X86/
2009-04-29-RegAllocAssert.ll 13 %struct.BtCursor = type { %struct.Btree*, %struct.BtShared*, %struct.BtCursor*, %struct.BtCursor*, i32 (i8*, i32, i8*, i32, i8*)*, i8*, i32, %struct.MemPage*, i32, %struct.CellInfo, i8, i8, i8*, i64, i32, i8, i32* }
14 %struct.BtLock = type { %struct.Btree*, i32, i8, %struct.BtLock* }
15 %struct.BtShared = type { %struct.Pager*, %struct.sqlite3*, %struct.BtCursor*, %struct.MemPage*, i8, i8, i8, i8, i8, i8, i8, i8, i32, i16, i16, i32, i32, i32, i32, i8, i32, i8*, void (i8*)*, %struct.sqlite3_mutex*, %struct.BusyHandler, i32, %struct.BtShared*, %struct.BtLock*, %struct.Btree* }
16 %struct.Btree = type { %struct.sqlite3*, %struct.BtShared*, i8, i8, i8, i32, %struct.Btree*, %struct.Btree* }
17 %struct.BtreeMutexArray = type { i32, [11 x %struct.Btree*] }
24 %struct.Cursor = type { %struct.BtCursor*, i32, i64, i64, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i64, %struct.Btree*, i32, i8*, i64, i8*, %struct.KeyInfo*, i32, i64, %struct.sqlite3_vtab_cursor*, %struct.sqlite3_module*, i32, i32, i32*, i32*, i8* }
25 %struct.Db = type { i8*, %struct.Btree*, i8, i8, i8*, void (i8*)*, %struct.Schema* }
  /external/swiftshader/third_party/LLVM/test/Transforms/GVN/
2009-01-22-SortInvalidation.ll 11 %struct.BtCursor = type { %struct.Btree*, %struct.BtShared*, %struct.BtCursor*, %struct.BtCursor*, i32 (i8*, i32, i8*, i32, i8*)*, i8*, i32, %struct.MemPage*, i32, %struct.CellInfo, i8, i8, i8*, i64, i32, i8, i32* }
12 %struct.BtLock = type { %struct.Btree*, i32, i8, %struct.BtLock* }
13 %struct.BtShared = type { %struct.Pager*, %struct.sqlite3*, %struct.BtCursor*, %struct.MemPage*, i8, i8, i8, i8, i8, i8, i8, i8, i32, i16, i16, i32, i32, i32, i32, i8, i32, i8*, void (i8*)*, %struct.sqlite3_mutex*, %struct.BusyHandler, i32, %struct.BtShared*, %struct.BtLock*, %struct.Btree* }
14 %struct.Btree = type { %struct.sqlite3*, %struct.BtShared*, i8, i8, i8, i32, %struct.Btree*, %struct.Btree* }
15 %struct.BtreeMutexArray = type { i32, [11 x %struct.Btree*] }
22 %struct.Cursor = type { %struct.BtCursor*, i32, i64, i64, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i64, %struct.Btree*, i32, i8*, i64, i8*, %struct.KeyInfo*, i32, i64, %struct.sqlite3_vtab_cursor*, %struct.sqlite3_module*, i32, i32, i32*, i32*, i8* }
23 %struct.Db = type { i8*, %struct.Btree*, i8, i8, i8*, void (i8*)*, %struct.Schema* }
  /external/syslinux/core/fs/xfs/
xfs_dir2.c 599 xfs_da_node_entry_t *btree; local
642 /* Given a hash to lookup, you read the node's btree array and first
649 for (btree = &node->btree[probe];
650 span > 4; btree = &node->btree[probe]) {
652 hash = be32_to_cpu(btree->hashval);
662 while ((probe > 0) && (be32_to_cpu(btree->hashval) >= hashwant)) {
663 btree--;
667 while ((probe < max) && (be32_to_cpu(btree->hashval) < hashwant))
    [all...]
xfs_ag.h 48 * Btree number 0 is bno, 1 is cnt. This value gives the size of the
72 uint32_t agf_levels[XFS_BTNUM_AGF]; /* btree levels */
148 * of block pointers to blocks owned by the allocation btree code.
xfs.h 239 uint32_t agi_root; /* root of inode btree */
240 uint32_t agi_level; /* levels in inode btree */
252 * Bmap btree record and extent descriptor.
335 uint64_t di_nblocks; /* # of direct & btree blocks used */
613 uint32_t before; /* Btree block before this key */
614 } btree[1]; member in struct:xfs_da_intnode
652 * Generic btree header.
695 /* btree pointer type */
699 * Btree block header size depends on a superblock flag.
744 * Calculate number of records in a bmap btree inode root
    [all...]
xfs_types.h 110 * Min numbers of data/attr fork btree root pointers.
  /external/clang/include/clang/Rewrite/Core/
DeltaTree.h 21 /// DeltaTree - a multiway search tree (BTree) structure with some fancy
  /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/h264/read/
CAVLCReader.java 24 import com.googlecode.mp4parser.h264.BTree;
134 public Object readCE(BTree bt, String message) throws IOException {
  /external/freetype/src/gzip/
infutil.h 19 BTREE, /* get bit lengths tree for a dynamic block */
infblock.c 74 if (s->mode == BTREE || s->mode == DTREE)
237 s->mode = BTREE;
238 case BTREE:
  /external/syslinux/extlinux/
xfs_types.h 110 * Min numbers of data/attr fork btree root pointers.
  /external/clang/lib/Rewrite/
DeltaTree.cpp 20 /// The DeltaTree class is a multiway search tree (BTree) structure with some
63 /// WidthFactor - This controls the number of K/V slots held in the BTree:
64 /// how wide it is. Each level of the BTree is guaranteed to have at least
77 /// IsLeaf - This is true if this is a leaf of the btree. If false, this is
340 /// VerifyTree - Walk the btree performing assertions on various properties to
  /prebuilts/gdb/darwin-x86/lib/python2.7/bsddb/test/
test_compat.py 125 # on btree databases and raises KeyError on others.
  /prebuilts/gdb/linux-x86/lib/python2.7/bsddb/test/
test_compat.py 125 # on btree databases and raises KeyError on others.
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/bsddb/test/
test_compat.py 125 # on btree databases and raises KeyError on others.
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/bsddb/test/
test_compat.py 125 # on btree databases and raises KeyError on others.
  /prebuilts/tools/common/m2/repository/org/gradle/gradle-tooling-api/3.2/
gradle-tooling-api-3.2-sources.jar 
  /prebuilts/tools/common/m2/repository/org/gradle/gradle-tooling-api/2.0/
gradle-tooling-api-2.0-sources.jar 

Completed in 1638 milliseconds

1 2 3