Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 24 of 24) sorted by relevance

/l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/regex/
A Dregex_internal.c25 const re_node_set *nodes,
28 const re_node_set *nodes,
1335 dfa->nodes = new_nodes; in re_dfa_add_node()
1368 hash += nodes->elems[i]; in calc_state_hash()
1384 const re_node_set *nodes) in re_acquire_state() argument
1403 if (re_node_set_compare (&state->nodes, nodes)) in re_acquire_state()
1434 if (nodes->nelem == 0) in re_acquire_state_context()
1527 err = re_node_set_init_copy (&newstate->nodes, nodes); in create_ci_newstate()
1537 re_token_t *node = dfa->nodes + nodes->elems[i]; in create_ci_newstate()
1578 err = re_node_set_init_copy (&newstate->nodes, nodes); in create_cd_newstate()
[all …]
A Dregexec.c148 const re_node_set *nodes)
588 if (dfa->init_state->nodes.nelem == 0 in re_search_internal()
1152 return state->nodes.elems[i]; in check_halt_state_context()
1211 if (dfa->nodes[node].accept_mb) in proceed_next_node()
1664 &src[st_idx]->nodes); in merge_state_array()
1848 switch (dfa->nodes[node].type) in check_dst_limits_calc_pos_1()
2055 type = dfa->nodes[node].type; in sift_states_bkref()
2483 for (i = 0; i < nodes->nelem; ++i) in transit_state_bkref()
2486 int node_idx = nodes->elems[i]; in transit_state_bkref()
2673 const re_node_set *nodes; in get_subexp() local
[all …]
A Dregcomp.c312 *p++ = dfa->nodes[node].opr.c; in re_compile_fastmap_iter()
315 && dfa->nodes[node].mb_partial) in re_compile_fastmap_iter()
316 *p++ = dfa->nodes[node].opr.c; in re_compile_fastmap_iter()
547 if (dfa->nodes) in free_dfa_content()
549 free_token (dfa->nodes + i); in free_dfa_content()
563 re_free (dfa->nodes); in free_dfa_content()
1011 switch (dfa->nodes[node].type) in optimize_utf8()
1014 if (dfa->nodes[node].opr.c >= 0x80) in optimize_utf8()
1018 switch (dfa->nodes[node].opr.idx) in optimize_utf8()
1058 dfa->nodes[node].mb_partial = 0; in optimize_utf8()
[all …]
A Dregex_internal.h439 re_node_set nodes; member
555 re_token_t *nodes; member
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/python/libstdcxx/v6/
A Dprinters.py488 def _is_nonempty_tuple (nodes): argument
489 if len (nodes) == 2:
492 elif len (nodes) == 1:
494 elif len (nodes) == 0:
503 nodes = self.head.type.fields ()
504 if self._is_nonempty_tuple (nodes):
517 nodes = self.head.type.fields ()
519 if len (nodes) == 0:
522 if len (nodes) > 2:
525 if len (nodes) == 1:
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-4.9/python/libstdcxx/v6/
A Dprinters.py318 nodes = self.head.type.fields ()
319 if len (nodes) == 1:
321 self.head = self.head.cast (nodes[0].type)
322 elif len (nodes) != 0:
330 nodes = self.head.type.fields ()
332 if len (nodes) == 0:
335 if len (nodes) != 2:
342 impl = self.head.cast (nodes[1].type)
345 self.head = self.head.cast (nodes[0].type)
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/python/libstdcxx/v6/
A Dprinters.py343 nodes = self.head.type.fields ()
344 if len (nodes) == 1:
346 self.head = self.head.cast (nodes[0].type)
347 elif len (nodes) != 0:
359 nodes = self.head.type.fields ()
361 if len (nodes) == 0:
364 if len (nodes) > 2:
367 if len (nodes) == 1:
369 impl = self.head.cast (nodes[0].type)
379 impl = self.head.cast (nodes[1].type)
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/python/libstdcxx/v6/
A Dprinters.py325 nodes = self.head.type.fields ()
326 if len (nodes) == 1:
328 self.head = self.head.cast (nodes[0].type)
329 elif len (nodes) != 0:
341 nodes = self.head.type.fields ()
343 if len (nodes) == 0:
346 if len (nodes) > 2:
349 if len (nodes) == 1:
351 impl = self.head.cast (nodes[0].type)
361 impl = self.head.cast (nodes[1].type)
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/python/libstdcxx/v6/
A Dprinters.py490 def _is_nonempty_tuple (nodes): argument
491 if len (nodes) == 2:
494 elif len (nodes) == 1:
496 elif len (nodes) == 0:
505 nodes = self.head.type.fields ()
506 if self._is_nonempty_tuple (nodes):
519 nodes = self.head.type.fields ()
521 if len (nodes) == 0:
524 if len (nodes) > 2:
527 if len (nodes) == 1:
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/python/libstdcxx/v6/
A Dprinters.py509 def _is_nonempty_tuple (nodes): argument
510 if len (nodes) == 2:
513 elif len (nodes) == 1:
515 elif len (nodes) == 0:
524 nodes = self.head.type.fields ()
525 if self._is_nonempty_tuple (nodes):
538 nodes = self.head.type.fields ()
540 if len (nodes) == 0:
543 if len (nodes) > 2:
546 if len (nodes) == 1:
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/python/libstdcxx/v6/
A Dprinters.py430 nodes = self.head.type.fields ()
431 if len (nodes) == 1:
433 self.head = self.head.cast (nodes[0].type)
434 elif len (nodes) != 0:
446 nodes = self.head.type.fields ()
448 if len (nodes) == 0:
451 if len (nodes) > 2:
454 if len (nodes) == 1:
456 impl = self.head.cast (nodes[0].type)
466 impl = self.head.cast (nodes[1].type)
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-7/python/libstdcxx/v6/
A Dprinters.py367 nodes = self.head.type.fields ()
368 if len (nodes) == 1:
370 self.head = self.head.cast (nodes[0].type)
371 elif len (nodes) != 0:
383 nodes = self.head.type.fields ()
385 if len (nodes) == 0:
388 if len (nodes) > 2:
391 if len (nodes) == 1:
393 impl = self.head.cast (nodes[0].type)
403 impl = self.head.cast (nodes[1].type)
[all …]
/l4re-core-master/cxx/lib/tl/include/
A Davl_tree91 * \tparam Node The data type of the nodes (must inherit from Avl_tree_node).
96 * nodes of the tree. `Compare()(l, r)` must return true if
100 * responsibility of the caller to allocate nodes before inserting them and
102 * Conversely, the caller must also ensure that nodes are removed
115 /// Provide access to keys of nodes.
A Davl_set105 /// Internal, key-getter for Avl_set nodes.
117 * Internal: AVL set with internally managed nodes.
124 * \tparam ALLOC The allocator to use for the nodes of the AVL set.
216 /// The allocator for new nodes
436 * \tparam ALLOC The allocator to use for the nodes of the AVL set.
A Davl_map51 * \tparam ALLOC Type of the allocator used for the nodes.
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/include/ext/
A Drope538 // Internal rope nodes potentially store a copy of the allocator
844 // concatenation nodes. But in the case of very long flat ropes
1085 // point to concatenation nodes.
1574 // (Returns nonzero only if all nodes in the path have a refcount
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/include/ext/
A Drope538 // Internal rope nodes potentially store a copy of the allocator
844 // concatenation nodes. But in the case of very long flat ropes
1085 // point to concatenation nodes.
1574 // (Returns nonzero only if all nodes in the path have a refcount
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/include/ext/
A Drope538 // Internal rope nodes potentially store a copy of the allocator
844 // concatenation nodes. But in the case of very long flat ropes
1085 // point to concatenation nodes.
1574 // (Returns nonzero only if all nodes in the path have a refcount
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-7/include/ext/
A Drope538 // Internal rope nodes potentially store a copy of the allocator
844 // concatenation nodes. But in the case of very long flat ropes
1085 // point to concatenation nodes.
1574 // (Returns nonzero only if all nodes in the path have a refcount
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/include/ext/
A Drope534 // Internal rope nodes potentially store a copy of the allocator
843 // concatenation nodes. But in the case of very long flat ropes
1085 // point to concatenation nodes.
1577 // (Returns nonzero only if all nodes in the path have a refcount
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/include/ext/
A Drope538 // Internal rope nodes potentially store a copy of the allocator
844 // concatenation nodes. But in the case of very long flat ropes
1085 // point to concatenation nodes.
1574 // (Returns nonzero only if all nodes in the path have a refcount
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-4.9/include/ext/
A Drope538 // Internal rope nodes potentially store a copy of the allocator
844 // concatenation nodes. But in the case of very long flat ropes
1085 // point to concatenation nodes.
1574 // (Returns nonzero only if all nodes in the path have a refcount
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/include/ext/
A Drope534 // Internal rope nodes potentially store a copy of the allocator
843 // concatenation nodes. But in the case of very long flat ropes
1085 // point to concatenation nodes.
1577 // (Returns nonzero only if all nodes in the path have a refcount
/l4re-core-master/uclibc/doc/
A Duclibc.cfg1175 # graphs generated by dot. A depth value of 3 means that only nodes reachable

Completed in 158 milliseconds