NetBSD Cross-Reference & Source Code Search Engine

Home	Sort by: relevance \| last modified time \| path

Full Search

in project(s):

Definition

Symbol

File Path

History

| | Help

Searched defs:interior (Results 1 - 4 of 4) sorted by relevancy

/src/external/gpl3/binutils/dist/bfd/
dwarf2.c	98 nodes, leaves and interior nodes. (Almost all nodes are leaves, so they 101 and when we get to a leaf, we scan through it linearly. Interior nodes 107 interior node if possible.) This gives us near-constant lookup times; 128 /* If zero, we are an interior node. 2146 in case of a leaf-to-interior conversion, or expansion of a leaf, it may be 2210 convert to an interior node. / 2223 children of the new interior node, instead of throwing it away. / 2267 /* Now we are definitely an interior node, so recurse into all 2288 struct trie_interior interior = (struct trie_interior ) trie; local 2289 struct trie_node *child = interior->children[ch] [all...]
/src/external/gpl3/binutils.old/dist/bfd/
dwarf2.c	98 nodes, leaves and interior nodes. (Almost all nodes are leaves, so they 101 and when we get to a leaf, we scan through it linearly. Interior nodes 107 interior node if possible.) This gives us near-constant lookup times; 128 /* If zero, we are an interior node. 2146 in case of a leaf-to-interior conversion, or expansion of a leaf, it may be 2210 convert to an interior node. / 2223 children of the new interior node, instead of throwing it away. / 2267 /* Now we are definitely an interior node, so recurse into all 2288 struct trie_interior interior = (struct trie_interior ) trie; local 2289 struct trie_node *child = interior->children[ch] [all...]
/src/external/gpl3/gdb/dist/bfd/
dwarf2.c	98 nodes, leaves and interior nodes. (Almost all nodes are leaves, so they 101 and when we get to a leaf, we scan through it linearly. Interior nodes 107 interior node if possible.) This gives us near-constant lookup times; 128 /* If zero, we are an interior node. 2146 in case of a leaf-to-interior conversion, or expansion of a leaf, it may be 2210 convert to an interior node. / 2223 children of the new interior node, instead of throwing it away. / 2267 /* Now we are definitely an interior node, so recurse into all 2288 struct trie_interior interior = (struct trie_interior ) trie; local 2289 struct trie_node *child = interior->children[ch] [all...]
/src/external/gpl3/gdb.old/dist/bfd/
dwarf2.c	98 nodes, leaves and interior nodes. (Almost all nodes are leaves, so they 101 and when we get to a leaf, we scan through it linearly. Interior nodes 107 interior node if possible.) This gives us near-constant lookup times; 128 /* If zero, we are an interior node. 2139 in case of a leaf-to-interior conversion, or expansion of a leaf, it may be 2203 convert to an interior node. / 2216 children of the new interior node, instead of throwing it away. / 2260 /* Now we are definitely an interior node, so recurse into all 2281 struct trie_interior interior = (struct trie_interior ) trie; local 2282 struct trie_node *child = interior->children[ch] [all...]

Completed in 101 milliseconds