/external/openssl/crypto/x509v3/ |
H A D | pcy_lib.c | 70 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) argument 72 if (!tree) 74 return tree->nlevel; 78 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i) argument 80 if (!tree || (i < 0) || (i >= tree->nlevel)) 82 return tree->levels + i; 86 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree) 88 if (!tree) 90 return tree [all...] |
H A D | pcy_node.c | 103 X509_POLICY_TREE *tree) 132 if (tree) 134 if (!tree->extra_data) 135 tree->extra_data = sk_X509_POLICY_DATA_new_null(); 136 if (!tree->extra_data) 138 if (!sk_X509_POLICY_DATA_push(tree->extra_data, data)) 100 level_add_node(X509_POLICY_LEVEL *level, X509_POLICY_DATA *data, X509_POLICY_NODE *parent, X509_POLICY_TREE *tree) argument
|
H A D | pcy_tree.c | 65 /* Initialize policy tree. Return values: 69 * 2 Policy tree is empty. 77 X509_POLICY_TREE *tree; local 149 /* If we get this far initialize the tree */ 151 tree = OPENSSL_malloc(sizeof(X509_POLICY_TREE)); 153 if (!tree) 156 tree->flags = 0; 157 tree->levels = OPENSSL_malloc(sizeof(X509_POLICY_LEVEL) * n); 158 tree->nlevel = 0; 159 tree 283 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument 338 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument 414 tree_calculate_authority_set(X509_POLICY_TREE *tree, STACK_OF(X509_POLICY_NODE) **pnodes) argument 460 tree_calculate_user_set(X509_POLICY_TREE *tree, STACK_OF(ASN1_OBJECT) *policy_oids, STACK_OF(X509_POLICY_NODE) *auth_nodes) argument 524 tree_evaluate(X509_POLICY_TREE *tree) argument 555 X509_policy_tree_free(X509_POLICY_TREE *tree) argument 600 X509_POLICY_TREE *tree = NULL; local [all...] |
/external/bluetooth/glib/tests/ |
H A D | tree-test.c | 108 GTree *tree; local 113 tree = g_tree_new (my_compare); 116 g_tree_insert (tree, &chars[i], &chars[i]); 118 g_tree_foreach (tree, my_traverse, NULL); 120 g_assert (g_tree_nnodes (tree) == strlen (chars)); 121 g_assert (g_tree_height (tree) == 6); 124 g_tree_foreach (tree, check_order, &p); 128 removed = g_tree_remove (tree, &chars[i + 10]); 133 removed = g_tree_remove (tree, &c); 136 g_tree_foreach (tree, my_travers [all...] |
H A D | testglib.c | 407 GTree *tree; local 411 tree = g_tree_new (my_compare); 416 g_tree_insert (tree, &chars[i], &chars[i]); 421 g_tree_insert (tree, &chars[i], &chars[i]); 426 g_tree_insert (tree, &chars[i], &chars[i]); 429 g_assert_cmpint (g_tree_nnodes (tree), ==, 10 + 26 + 26); 430 g_assert_cmpint (g_tree_height (tree), ==, 6); 434 g_print ("tree: "); 435 g_tree_foreach (tree, my_traverse, NULL); 440 g_tree_remove (tree, [all...] |
/external/junit/src/junit/swingui/ |
H A D | TestSuitePanel.java | 15 import javax.swing.tree.DefaultTreeCellRenderer; 16 import javax.swing.tree.TreeModel; 17 import javax.swing.tree.TreePath; 24 * A Panel showing a test suite as a tree. 55 public Component getTreeCellRendererComponent(JTree tree, Object value, argument 58 Component c= super.getTreeCellRendererComponent(tree, value, sel, expanded, leaf, row, hasFocus); 59 TreeModel model= tree.getModel();
|
/external/stlport/test/unit/ |
H A D | set_test.cpp | 240 set<int> tree; local 241 tree.insert(1); 242 set<int>::iterator it = tree.begin(); 246 CPPUNIT_ASSERT( it == tree.end() ); 247 CPPUNIT_ASSERT( it != tree.begin() ); 249 set<int>::const_iterator cit = tree.begin(); 256 set<int> tree; local 257 tree.insert(1); 258 tree.insert(2); 261 set<int>::reverse_iterator rit(tree [all...] |
/external/v8/test/cctest/ |
H A D | test-heap-profiler.cc | 75 static JSObjectsCluster AddHeapObjectToTree(JSObjectsRetainerTree* tree, argument 88 tree->Insert(o, &loc); 94 static void AddSelfReferenceToTree(JSObjectsRetainerTree* tree, argument 97 CHECK(tree->Find(*self_ref, &loc)); 149 JSObjectsRetainerTree tree; local 156 AddHeapObjectToTree(&tree, i::Heap::Object_symbol(), 0x100, &function); 159 AddHeapObjectToTree(&tree, i::Heap::Object_symbol(), 0x200, &function); 162 AddHeapObjectToTree(&tree, i::Heap::Object_symbol(), 0x300, &a, &b); 165 AddHeapObjectToTree(&tree, i::Heap::Object_symbol(), 0x400, &b, &a); 168 AddHeapObjectToTree(&tree, 188 JSObjectsRetainerTree tree; local 219 JSObjectsRetainerTree tree; local 272 JSObjectsRetainerTree tree; local [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | ext3_extents.h | 42 #define ext_debug(tree,fmt,a...) \ 44 if (test_opt((tree)->inode->i_sb, EXTDEBUG)) \ 48 #define ext_debug(tree,fmt,a...) 63 * - tree depth (0 mean there is no tree yet. all extents in the inode) 69 * it's used at the bottom of the tree 97 __u16 eh_depth; /* has tree real underlaying blocks? */ 98 __u32 eh_generation; /* generation of the tree */ 147 #define EXT_ROOT_HDR(tree) \ 148 ((struct ext3_extent_header *) (tree) 229 ext3_ext_invalidate_cache(struct ext3_extents_tree *tree) argument [all...] |
/external/iproute2/tc/ |
H A D | m_ematch.c | 173 static int parse_tree(struct nlmsghdr *n, struct ematch *tree) argument 178 for (t = tree; t; t = t->next) { 227 static int flatten_tree(struct ematch *head, struct ematch *tree) argument 235 if (tree->child) { 237 t->next = tree->child; 238 count += flatten_tree(head, tree->child); 241 if (tree->relation == 0) 244 tree = tree->next; 474 fprintf(stderr, "Missing ematch tree heade 545 print_ematch_tree(const struct ematch *tree) argument [all...] |
/external/icu4c/common/ |
H A D | rbbitblb.cpp | 59 // table from the RBBI rules parse tree. 75 // Walk through the tree, replacing any references to $variables with a copy of the 76 // parse tree for the substition expression. 81 RBBIDebugPuts("Parse tree after flattening variable references."); 88 // add a {bof} <cat> <former root of tree> to the 89 // tree. Means that all matches must start out with the 111 // Appears as a cat-node, left child being the original tree, 133 // Replace all references to UnicodeSets with the tree for the equivalent 139 RBBIDebugPuts("Parse tree after flattening Unicode Set references."); 147 // nodes in the parse tree 385 calcChainedFollowPos(RBBINode *tree) argument [all...] |
/external/libxml2/ |
H A D | legacy.c | 16 #include <libxml/tree.h> 990 * @tree: the tree of enumerated value set 998 xmlEnumerationPtr tree) 1002 tree); 1010 * @content: the element value tree 996 attributeDecl(void *ctx, const xmlChar * elem, const xmlChar * fullname, int type, int def, const xmlChar * defaultValue, xmlEnumerationPtr tree) argument
|
H A D | SAX2.c | 2 * SAX2.c : Default SAX2 handler to build a tree. 16 #include <libxml/tree.h> 698 * @tree: the tree of enumerated value set 705 xmlEnumerationPtr tree) 735 (xmlAttributeDefault) def, defaultValue, tree); 739 (xmlAttributeDefault) def, defaultValue, tree); 744 xmlFreeEnumeration(tree); 766 * @content: the element value tree 1462 * the element should be instantiated in the tree i 703 xmlSAX2AttributeDecl(void *ctx, const xmlChar *elem, const xmlChar *fullname, int type, int def, const xmlChar *defaultValue, xmlEnumerationPtr tree) argument [all...] |
H A D | debugXML.c | 2 * debugXML.c : This is a set of routines used for debugging the tree 22 #include <libxml/tree.h> 536 if (attr->tree != NULL) { 538 xmlEnumerationPtr cur = attr->tree; 1864 "%s is an XSLT value tree\n", arg); 2496 * @node: a node in the tree 2667 * @tree: a node defining a subtree 2671 * show the structure of the subtree under node @tree 2672 * If @tree is null, the command works on the current node. 2678 char *arg ATTRIBUTE_UNUSED, xmlNodePtr tree, 2677 xmlShellDu(xmlShellCtxtPtr ctxt, char *arg ATTRIBUTE_UNUSED, xmlNodePtr tree, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument [all...] |
H A D | xinclude.c | 17 #include <libxml/tree.h> 90 xmlXIncludeDoProcess(xmlXIncludeCtxtPtr ctxt, xmlDocPtr doc, xmlNodePtr tree); 895 * Build a node list tree copy of the XPointer result. 898 * The caller has to free the node tree. 929 * list is the pointer to the root of the output tree 930 * listParent is a pointer to the parent of output tree (within 932 * last is a pointer to the last node added to the output tree 937 * Check if our output tree needs a parent 1067 /* don't consider it part of the tree content */ 1107 * Build a node list tree cop 2326 xmlXIncludeDoProcess(xmlXIncludeCtxtPtr ctxt, xmlDocPtr doc, xmlNodePtr tree) argument 2442 xmlNodePtr tree; local 2504 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, int flags) argument 2533 xmlXIncludeProcessTree(xmlNodePtr tree) argument [all...] |
/external/qemu/distrib/zlib-1.2.3/ |
H A D | trees.c | 12 * Each code tree is stored in a compressed form which is itself 91 /* The static literal tree. Since the bit lengths are imposed, there is no 93 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init 98 /* The static distance tree. (Actually a trivial tree since all codes use 122 const ct_data *static_tree; /* static tree or NULL */ 125 int elems; /* max number of elements in the tree */ 144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); 146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); 148 local void scan_tree OF((deflate_state *s, ct_data *tree, in 494 ct_data *tree = desc->dyn_tree; local 623 ct_data *tree = desc->dyn_tree; local [all...] |
/external/v8/src/ |
H A D | heap-profiler.cc | 49 static void InsertIntoTree(JSObjectsClusterTree* tree, 51 static void InsertReferenceIntoTree(JSObjectsClusterTree* tree, argument 53 InsertIntoTree(tree, cluster, 0); 63 static void InsertIntoTree(JSObjectsClusterTree* tree, 90 void Clusterizer::InsertIntoTree(JSObjectsClusterTree* tree, argument 94 InsertIntoTree(tree, cluster, GetObjectSize(obj)); 98 void Clusterizer::InsertIntoTree(JSObjectsClusterTree* tree, argument 101 tree->Insert(cluster, &loc); 181 // Visitor for printing a cluster tree. 207 // Visitor for printing a retainer tree 219 Call(const JSObjectsCluster& cluster, JSObjectsClusterTree* tree) argument 269 Call(const JSObjectsCluster& cluster, JSObjectsClusterTree* tree) argument 301 Call(const JSObjectsCluster& cluster, JSObjectsClusterTree* tree) argument 429 Call(const JSObjectsCluster& cluster, JSObjectsClusterTree* tree) argument 466 Process(JSObjectsRetainerTree* tree) argument 478 DoProcess(JSObjectsRetainerTree* tree) argument [all...] |
/external/zlib/ |
H A D | trees.c | 12 * Each code tree is stored in a compressed form which is itself 91 /* The static literal tree. Since the bit lengths are imposed, there is no 93 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init 98 /* The static distance tree. (Actually a trivial tree since all codes use 122 const ct_data *static_tree; /* static tree or NULL */ 125 int elems; /* max number of elements in the tree */ 144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); 146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); 148 local void scan_tree OF((deflate_state *s, ct_data *tree, in 494 ct_data *tree = desc->dyn_tree; local 623 ct_data *tree = desc->dyn_tree; local [all...] |
/external/clearsilver/cs/ |
H A D | cs.h | 166 CSTREE *tree; member in struct:_macro 273 CSTREE *tree; member in struct:_parse 322 * appended to the current parse tree stored in the CSPARSE 340 * tree. For this reason, ownership of the string is 344 * parse tree. During parse, the only HDF variables which 359 * Function: cs_render - render a CS parse tree 360 * Description: cs_render will evaluate a CS parse tree, calling the 362 * cs_render multiple times on the same parse tree may or 367 * Input: parse - the CSPARSE structure containing the CS parse tree 382 * Function: cs_dump - dump the cs parse tree [all...] |
/external/dbus/dbus/ |
H A D | dbus-object-tree.c | 2 /* dbus-object-tree.c DBusObjectTree (internals of DBusConnection) 23 #include "dbus-object-tree.h" 35 * @brief DBusObjectTree is used by DBusConnection to track the object tree 58 DBusConnection *connection; /**< Connection this tree belongs to */ 60 DBusObjectSubtree *root; /**< Root of the tree ("/" node) */ 83 * Creates a new object tree, representing a mapping from paths 86 * @param connection the connection this tree belongs to 87 * @returns the new tree or #NULL if no memory 92 DBusObjectTree *tree; local 99 tree 127 _dbus_object_tree_ref(DBusObjectTree *tree) argument 141 _dbus_object_tree_unref(DBusObjectTree *tree) argument 321 find_subtree(DBusObjectTree *tree, const char **path, int *index_in_parent) argument 340 lookup_subtree(DBusObjectTree *tree, const char **path) argument 350 find_handler(DBusObjectTree *tree, const char **path, dbus_bool_t *exact_match) argument 365 ensure_subtree(DBusObjectTree *tree, const char **path) argument 385 _dbus_object_tree_register(DBusObjectTree *tree, dbus_bool_t fallback, const char **path, const DBusObjectPathVTable *vtable, void *user_data) argument 428 _dbus_object_tree_unregister_and_unlock(DBusObjectTree *tree, const char **path) argument 547 _dbus_object_tree_free_all_unlocked(DBusObjectTree *tree) argument 556 _dbus_object_tree_list_registered_unlocked(DBusObjectTree *tree, const char **parent_path, char ***child_entries) argument 600 handle_default_introspect_and_unlock(DBusObjectTree *tree, DBusMessage *message, const char **path) argument 731 _dbus_object_tree_dispatch_and_unlock(DBusObjectTree *tree, DBusMessage *message) argument 899 _dbus_object_tree_get_user_data_unlocked(DBusObjectTree *tree, const char **path) argument 1022 _dbus_object_tree_list_registered_and_unlock(DBusObjectTree *tree, const char **parent_path, char ***child_entries) argument 1309 do_register(DBusObjectTree *tree, const char **path, dbus_bool_t fallback, int i, TreeTestData *tree_test_data) argument 1335 do_test_dispatch(DBusObjectTree *tree, const char **path, int i, TreeTestData *tree_test_data, int n_test_data) argument 1491 DBusObjectTree *tree; local [all...] |
/external/e2fsprogs/e2fsck/ |
H A D | dict.c | 77 * Perform a ``left rotation'' adjustment on the tree. The given node P and 80 * for P. The ordering of the keys within the tree is thus preserved. 134 * Do a postorder traversal of the tree rooted at the specified 149 * search tree. It performs an inorder traversal of the tree using the 217 * Compute the actual count of nodes by traversing the tree and 233 * Verify that the tree contains the given node. This is done by 294 * from the tree before deleting it is required. 390 * this function succeeds doesn't mean that the tree is not corrupt. Certain 391 * corruptions in the tree ma 1084 dnode_t *tree[DICT_DEPTH_MAX] = { 0 }; local [all...] |
/external/openssl/crypto/x509/ |
H A D | x509_vfy.h | 255 X509_POLICY_TREE *tree; /* Valid policy tree */ member in struct:x509_store_ctx_st 507 void X509_policy_tree_free(X509_POLICY_TREE *tree); 509 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree); 511 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i); 514 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree); variable 517 X509_policy_tree_get0_user_policies(const X509_POLICY_TREE *tree); variable
|
/external/openssl/include/openssl/ |
H A D | x509_vfy.h | 255 X509_POLICY_TREE *tree; /* Valid policy tree */ member in struct:x509_store_ctx_st 507 void X509_policy_tree_free(X509_POLICY_TREE *tree); 509 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree); 511 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i); 514 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree); variable 517 X509_policy_tree_get0_user_policies(const X509_POLICY_TREE *tree); variable
|
/external/srec/seti/sltsEngine/src/ |
H A D | run_seq_lts.c | 503 RT_LTREE * tree = NULL; local 547 trees[let] = tree = (RT_LTREE*) lts_alloc(1, sizeof(RT_LTREE)); 548 if (tree == NULL) { 553 tree->num_nodes = load_int(fp); 555 tree->values_or_question1 = (short*) lts_alloc(tree->num_nodes, sizeof(short)); 556 if (tree->values_or_question1 == NULL) { 561 tree->question2 = (short*) lts_alloc(tree->num_nodes, sizeof(short)); 562 if (tree 619 RT_LTREE * tree; local 1312 RT_LTREE *tree; local [all...] |
/external/webkit/JavaScriptCore/runtime/ |
H A D | JSArray.cpp | 830 // The maximum tree depth is compiled in - but the caller is clearly up to no good 841 AVLTree<AVLTreeAbstractorForArrayCompare, 44> tree; // Depth 44 is enough for 2^31 items local 842 tree.abstractor().m_exec = exec; 843 tree.abstractor().m_compareFunction = compareFunction; 844 tree.abstractor().m_compareCallType = callType; 845 tree.abstractor().m_compareCallData = &callData; 846 tree.abstractor().m_globalThisValue = exec->globalThisValue(); 847 tree.abstractor().m_nodes.resize(usedVectorLength + (m_storage->m_sparseValueMap ? m_storage->m_sparseValueMap->size() : 0)); 850 tree.abstractor().m_cachedCall.set(new CachedCall(exec, asFunction(compareFunction), 2, exec->exceptionSlot())); 852 if (!tree [all...] |