Searched refs:subnodes (Results 1 – 12 of 12) sorted by relevance
| /third_party/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
| D | LigatureTree.java | 29 Lignode[] subnodes = null; field in LigatureTree.Lignode
53 if (subnodes != null) { in subnode()
54 int len = subnodes.length; in subnode()
56 if (c <= subnodes[len - 1].target) { in subnode()
58 int t = subnodes[i].target; in subnode()
65 return subnodes[i]; in subnode()
108 if (subnodes == null) { in insert()
109 subnodes = new Lignode[1]; in insert()
110 subnodes[0] = new Lignode(c); in insert()
111 subnodes[0].insert(chars, index + 1); in insert()
[all …]
|
| /third_party/lwip/src/include/lwip/apps/ |
| D | snmp_core.h | 231 const struct snmp_node* const *subnodes; member
234 #define SNMP_CREATE_TREE_NODE(oid, subnodes) \ argument
236 (u16_t)LWIP_ARRAYSIZE(subnodes), (subnodes) }
|
| /third_party/mesa3d/src/microsoft/compiler/ |
| D | dxil_internal.h | 284 const struct dxil_mdnode **subnodes; member
295 const struct dxil_mdnode **subnodes; member
|
| D | dxil_module.c | 2317 const struct dxil_mdnode *subnodes[], in dxil_get_metadata_node() argument
2324 !memcmp(n->node.subnodes, subnodes, sizeof(struct dxil_mdnode *) * in dxil_get_metadata_node()
2335 memcpy(tmp, subnodes, sizeof(struct dxil_mdnode *) * num_subnodes); in dxil_get_metadata_node()
2336 n->node.subnodes = tmp; in dxil_get_metadata_node()
2400 const struct dxil_mdnode *subnodes[], in dxil_add_metadata_named_node() argument
2416 memcpy(tmp, subnodes, sizeof(struct dxil_mdnode *) * num_subnodes); in dxil_add_metadata_named_node()
2417 n->subnodes = tmp; in dxil_add_metadata_named_node()
2458 const struct dxil_mdnode *subnodes[], in emit_metadata_node() argument
2464 data[i] = subnodes[i] ? subnodes[i]->id : 0; in emit_metadata_node()
2480 return emit_metadata_node(m, n->node.subnodes, n->node.num_subnodes); in emit_mdnode()
[all …]
|
| D | dxil_module.h | 374 const struct dxil_mdnode *subnodes[],
379 const struct dxil_mdnode *subnodes[],
|
| D | dxil_dump.c | 670 if (node->node.subnodes[i]) in dump_mdnode()
671 dump_mdnode(d, node->node.subnodes[i]); in dump_mdnode()
695 if (node->subnodes[i]) in dump_named_nodes()
696 dump_mdnode(d, node->subnodes[i]); in dump_named_nodes()
|
| /third_party/boost/libs/property_tree/doc/ |
| D | intro.qbk | 12 the tree stores its own value, plus an ordered list of its subnodes and their
|
| /third_party/lwip/src/apps/snmp/ |
| D | snmp_core.c | 993 node = (*(const struct snmp_tree_node * const *)node)->subnodes; in snmp_mib_tree_resolve_exact()
1035 node = node_stack[nsi]->subnodes; in snmp_mib_tree_resolve_next()
1067 node = node_stack[nsi]->subnodes; in snmp_mib_tree_resolve_next()
|
| /third_party/boost/boost/spirit/home/classic/tree/impl/ |
| D | parse_tree_utils.ipp | 94 // look at subnodes now
|
| D | tree_to_xml.ipp | 417 get_token_id, get_token_value); // dump all subnodes
457 // dump all subnodes
|
| /third_party/python/Doc/library/ |
| D | xml.dom.minidom.rst | 141 The *addindent* parameter is the incremental indentation to use for subnodes
|
| /third_party/mesa3d/src/gallium/drivers/r600/sb/ |
| D | notes.markdown | 94 nodes contain a list of subnodes.
|