Lines Matching defs:tree
103 * Each structure forms an internal node of an n-way tree. Each node selects
105 * root of the tree, a slice of the low-order bits of the vendor ID are
119 * (i.e., to pull-up levels of the n-way tree when all the children's children
141 * Root of the PCI vendor ID search tree.
143 _pci_hidden struct pci_id_node * tree = NULL;
148 * If the vendor ID does not exist in the tree, it is added.
156 if ( tree == NULL ) {
157 tree = calloc( 1, sizeof( struct pci_id_node ) );
159 if ( tree == NULL )
162 tree->bits = 4;
165 n = tree;
183 if ( tree == NULL )
194 if ( tree == NULL )
229 /* If the device tree for this vendor is already populated, don't do