tree 89 ext/dom/documentfragment.c static void php_dom_xmlSetTreeDoc(xmlNodePtr tree, xmlDocPtr doc) /* {{{ */ tree 94 ext/dom/documentfragment.c if (tree) { tree 95 ext/dom/documentfragment.c if(tree->type == XML_ELEMENT_NODE) { tree 96 ext/dom/documentfragment.c prop = tree->properties; tree 109 ext/dom/documentfragment.c if (tree->children != NULL) { tree 110 ext/dom/documentfragment.c cur = tree->children; tree 116 ext/dom/documentfragment.c tree->doc = doc; tree 698 ext/dom/element.c static xmlNsPtr _dom_new_reconNs(xmlDocPtr doc, xmlNodePtr tree, xmlNsPtr ns) /* {{{ */ tree 704 ext/dom/element.c if ((tree == NULL) || (ns == NULL) || (ns->type != XML_NAMESPACE_DECL)) { tree 718 ext/dom/element.c def = xmlSearchNs(doc, tree, prefix); tree 726 ext/dom/element.c def = xmlSearchNs(doc, tree, prefix); tree 732 ext/dom/element.c def = xmlNewNs(tree, ns->href, prefix); tree 4662 ext/imap/php_imap.c static void build_thread_tree_helper(THREADNODE *cur, zval *tree, long *numNodes, char *buf) tree 4669 ext/imap/php_imap.c add_assoc_long(tree, buf, cur->num); tree 4674 ext/imap/php_imap.c add_assoc_long(tree, buf, *numNodes); tree 4675 ext/imap/php_imap.c build_thread_tree_helper(cur->next, tree, numNodes, buf); tree 4677 ext/imap/php_imap.c add_assoc_long(tree, buf, 0); tree 4683 ext/imap/php_imap.c add_assoc_long(tree, buf, *numNodes); tree 4684 ext/imap/php_imap.c build_thread_tree_helper(cur->branch, tree, numNodes, buf); tree 4686 ext/imap/php_imap.c add_assoc_long(tree, buf, 0); tree 4693 ext/imap/php_imap.c static int build_thread_tree(THREADNODE *top, zval **tree) tree 4698 ext/imap/php_imap.c array_init(*tree); tree 4700 ext/imap/php_imap.c build_thread_tree_helper(top, *tree, &numNodes, buf); tree 154240 ext/sqlite3/libsqlite/sqlite3.c Rtree tree; tree 154245 ext/sqlite3/libsqlite/sqlite3.c memset(&tree, 0, sizeof(Rtree)); tree 154246 ext/sqlite3/libsqlite/sqlite3.c tree.nDim = sqlite3_value_int(apArg[0]); tree 154247 ext/sqlite3/libsqlite/sqlite3.c tree.nBytesPerCell = 8 + 8 * tree.nDim; tree 154256 ext/sqlite3/libsqlite/sqlite3.c nodeGetCell(&tree, &node, ii, &cell); tree 154259 ext/sqlite3/libsqlite/sqlite3.c for(jj=0; jj<tree.nDim*2; jj++){ tree 33 sapi/phpdbg/phpdbg_btree.c void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth) { tree 34 sapi/phpdbg/phpdbg_btree.c tree->depth = depth; tree 35 sapi/phpdbg/phpdbg_btree.c tree->branch = NULL; tree 36 sapi/phpdbg/phpdbg_btree.c tree->count = 0; tree 39 sapi/phpdbg/phpdbg_btree.c phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx) { tree 40 sapi/phpdbg/phpdbg_btree.c phpdbg_btree_branch *branch = tree->branch; tree 41 sapi/phpdbg/phpdbg_btree.c int i = tree->depth - 1; tree 66 sapi/phpdbg/phpdbg_btree.c phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx) { tree 67 sapi/phpdbg/phpdbg_btree.c phpdbg_btree_branch *branch = tree->branch; tree 68 sapi/phpdbg/phpdbg_btree.c int i = tree->depth - 1, last_superior_i = -1; tree 85 sapi/phpdbg/phpdbg_btree.c branch = tree->branch; tree 86 sapi/phpdbg/phpdbg_btree.c i = tree->depth - 1; tree 118 sapi/phpdbg/phpdbg_btree.c phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulong higher_idx) { tree 121 sapi/phpdbg/phpdbg_btree.c pos.tree = tree; tree 129 sapi/phpdbg/phpdbg_btree.c phpdbg_btree_result *result = phpdbg_btree_find_closest(pos->tree, pos->cur); tree 140 sapi/phpdbg/phpdbg_btree.c int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags) { tree 141 sapi/phpdbg/phpdbg_btree.c int i = tree->depth - 1; tree 142 sapi/phpdbg/phpdbg_btree.c phpdbg_btree_branch **branch = &tree->branch; tree 163 sapi/phpdbg/phpdbg_btree.c tree->count++; tree 175 sapi/phpdbg/phpdbg_btree.c int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx) { tree 176 sapi/phpdbg/phpdbg_btree.c int i = tree->depth; tree 177 sapi/phpdbg/phpdbg_btree.c phpdbg_btree_branch *branch = tree->branch; tree 196 sapi/phpdbg/phpdbg_btree.c tree->count--; tree 199 sapi/phpdbg/phpdbg_btree.c efree(tree->branch); tree 200 sapi/phpdbg/phpdbg_btree.c tree->branch = NULL; tree 44 sapi/phpdbg/phpdbg_btree.h phpdbg_btree *tree; tree 49 sapi/phpdbg/phpdbg_btree.h void phpdbg_btree_init(phpdbg_btree *tree, zend_ulong depth); tree 50 sapi/phpdbg/phpdbg_btree.h phpdbg_btree_result *phpdbg_btree_find(phpdbg_btree *tree, zend_ulong idx); tree 51 sapi/phpdbg/phpdbg_btree.h phpdbg_btree_result *phpdbg_btree_find_closest(phpdbg_btree *tree, zend_ulong idx); tree 52 sapi/phpdbg/phpdbg_btree.h phpdbg_btree_position phpdbg_btree_find_between(phpdbg_btree *tree, zend_ulong lower_idx, zend_ulong higher_idx); tree 54 sapi/phpdbg/phpdbg_btree.h int phpdbg_btree_delete(phpdbg_btree *tree, zend_ulong idx); tree 60 sapi/phpdbg/phpdbg_btree.h int phpdbg_btree_insert_or_update(phpdbg_btree *tree, zend_ulong idx, void *ptr, int flags); tree 61 sapi/phpdbg/phpdbg_btree.h #define phpdbg_btree_insert(tree, idx, ptr) phpdbg_btree_insert_or_update(tree, idx, ptr, PHPDBG_BTREE_INSERT) tree 62 sapi/phpdbg/phpdbg_btree.h #define phpdbg_btree_update(tree, idx, ptr) phpdbg_btree_insert_or_update(tree, idx, ptr, PHPDBG_BTREE_UPDATE) tree 63 sapi/phpdbg/phpdbg_btree.h #define phpdbg_btree_overwrite(tree, idx, ptr) phpdbg_btree_insert_or_update(tree, idx, ptr, PHPDBG_BTREE_OWERWRITE)