Home
last modified time | relevance | path

Searched refs:n_child (Results 1 – 25 of 106) sorted by relevance

12345

/dports/lang/python-legacy/Python-2.7.18/Parser/
H A Dnode.c17 n->n_child = NULL; in PyNode_New()
97 n = n1->n_child; in PyNode_AddChild()
102 n1->n_child = n; in PyNode_AddChild()
105 n = &n1->n_child[n1->n_nchildren++]; in PyNode_AddChild()
111 n->n_child = NULL; in PyNode_AddChild()
145 if (n->n_child != NULL) in freechildren()
146 PyObject_FREE(n->n_child); in freechildren()
158 if (n->n_child != NULL) in sizeofchildren()
/dports/lang/python37/Python-3.7.12/Parser/
H A Dnode.c17 n->n_child = NULL; in PyNode_New()
97 n = n1->n_child; in PyNode_AddChild()
102 n1->n_child = n; in PyNode_AddChild()
105 n = &n1->n_child[n1->n_nchildren++]; in PyNode_AddChild()
111 n->n_child = NULL; in PyNode_AddChild()
145 if (n->n_child != NULL) in freechildren()
146 PyObject_FREE(n->n_child); in freechildren()
158 if (n->n_child != NULL) in sizeofchildren()
/dports/lang/python27/Python-2.7.18/Parser/
H A Dnode.c17 n->n_child = NULL; in PyNode_New()
97 n = n1->n_child; in PyNode_AddChild()
102 n1->n_child = n; in PyNode_AddChild()
105 n = &n1->n_child[n1->n_nchildren++]; in PyNode_AddChild()
111 n->n_child = NULL; in PyNode_AddChild()
145 if (n->n_child != NULL) in freechildren()
146 PyObject_FREE(n->n_child); in freechildren()
158 if (n->n_child != NULL) in sizeofchildren()
/dports/devel/py-typed-ast/typed_ast-1.5.0/ast3/Parser/
H A Dnode.c17 n->n_child = NULL; in Ta3Node_New()
97 n = n1->n_child; in Ta3Node_AddChild()
102 n1->n_child = n; in Ta3Node_AddChild()
105 n = &n1->n_child[n1->n_nchildren++]; in Ta3Node_AddChild()
111 n->n_child = NULL; in Ta3Node_AddChild()
145 if (n->n_child != NULL) in freechildren()
146 PyObject_FREE(n->n_child); in freechildren()
158 if (n->n_child != NULL) in sizeofchildren()
/dports/devel/py-typed-ast/typed_ast-1.5.0/ast27/Parser/
H A Dnode.c17 n->n_child = NULL; in Ta27Node_New()
97 n = n1->n_child; in Ta27Node_AddChild()
102 n1->n_child = n; in Ta27Node_AddChild()
105 n = &n1->n_child[n1->n_nchildren++]; in Ta27Node_AddChild()
111 n->n_child = NULL; in Ta27Node_AddChild()
145 if (n->n_child != NULL) in freechildren()
146 PyObject_FREE(n->n_child); in freechildren()
158 if (n->n_child != NULL) in sizeofchildren()
/dports/sysutils/uefi-edk2-bhyve-csm/uefi-edk2-aa8d718/AppPkg/Applications/Python/Python-2.7.2/Parser/
H A Dnode.c17 n->n_child = NULL; in PyNode_New()
97 n = n1->n_child; in PyNode_AddChild()
102 n1->n_child = n; in PyNode_AddChild()
105 n = &n1->n_child[n1->n_nchildren++]; in PyNode_AddChild()
111 n->n_child = NULL; in PyNode_AddChild()
134 if (n->n_child != NULL) in freechildren()
135 PyObject_FREE(n->n_child); in freechildren()
/dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/libpijul-1.0.0-alpha.49/src/alive/
H A Dtarjan.rs26 let &(_, n_child) = self.child(n_l, i); in tarjan()
27 self[n_l].lowlink = self[n_l].lowlink.min(self[n_child].lowlink); in tarjan()
31 let n_child = if j < self[n_l].n_children { in tarjan() localVariable
36 if !self[n_child].flags.contains(Flags::VISITED) { in tarjan()
38 call_stack.push((n_child, 0, true)); in tarjan()
40 } else if self[n_child].flags.contains(Flags::ONSTACK) { in tarjan()
41 self[n_l].lowlink = min(self[n_l].lowlink, self[n_child].index) in tarjan()
/dports/databases/py-sqlite3/Python-3.8.12/Parser/
H A Dnode.c19 n->n_child = NULL; in PyNode_New()
119 n = n1->n_child; in PyNode_AddChild()
124 n1->n_child = n; in PyNode_AddChild()
127 n = &n1->n_child[n1->n_nchildren++]; in PyNode_AddChild()
135 n->n_child = NULL; in PyNode_AddChild()
169 if (n->n_child != NULL) in freechildren()
170 PyObject_FREE(n->n_child); in freechildren()
182 if (n->n_child != NULL) in sizeofchildren()
/dports/databases/py-gdbm/Python-3.8.12/Parser/
H A Dnode.c19 n->n_child = NULL; in PyNode_New()
119 n = n1->n_child; in PyNode_AddChild()
124 n1->n_child = n; in PyNode_AddChild()
127 n = &n1->n_child[n1->n_nchildren++]; in PyNode_AddChild()
135 n->n_child = NULL; in PyNode_AddChild()
169 if (n->n_child != NULL) in freechildren()
170 PyObject_FREE(n->n_child); in freechildren()
182 if (n->n_child != NULL) in sizeofchildren()
/dports/lang/python-tools/Python-3.8.12/Parser/
H A Dnode.c19 n->n_child = NULL; in PyNode_New()
119 n = n1->n_child; in PyNode_AddChild()
124 n1->n_child = n; in PyNode_AddChild()
127 n = &n1->n_child[n1->n_nchildren++]; in PyNode_AddChild()
135 n->n_child = NULL; in PyNode_AddChild()
169 if (n->n_child != NULL) in freechildren()
170 PyObject_FREE(n->n_child); in freechildren()
182 if (n->n_child != NULL) in sizeofchildren()
/dports/lang/python39/Python-3.9.9/Parser/
H A Dnode.c20 n->n_child = NULL; in PyNode_New()
120 n = n1->n_child; in PyNode_AddChild()
125 n1->n_child = n; in PyNode_AddChild()
128 n = &n1->n_child[n1->n_nchildren++]; in PyNode_AddChild()
136 n->n_child = NULL; in PyNode_AddChild()
170 if (n->n_child != NULL) in freechildren()
171 PyObject_FREE(n->n_child); in freechildren()
183 if (n->n_child != NULL) in sizeofchildren()
/dports/lang/python38/Python-3.8.12/Parser/
H A Dnode.c19 n->n_child = NULL; in PyNode_New()
119 n = n1->n_child; in PyNode_AddChild()
124 n1->n_child = n; in PyNode_AddChild()
127 n = &n1->n_child[n1->n_nchildren++]; in PyNode_AddChild()
135 n->n_child = NULL; in PyNode_AddChild()
169 if (n->n_child != NULL) in freechildren()
170 PyObject_FREE(n->n_child); in freechildren()
182 if (n->n_child != NULL) in sizeofchildren()
/dports/x11-toolkits/py-tkinter/Python-3.8.12/Parser/
H A Dnode.c19 n->n_child = NULL; in PyNode_New()
119 n = n1->n_child; in PyNode_AddChild()
124 n1->n_child = n; in PyNode_AddChild()
127 n = &n1->n_child[n1->n_nchildren++]; in PyNode_AddChild()
135 n->n_child = NULL; in PyNode_AddChild()
169 if (n->n_child != NULL) in freechildren()
170 PyObject_FREE(n->n_child); in freechildren()
182 if (n->n_child != NULL) in sizeofchildren()
/dports/x11/menulibre/menulibre-menulibre-2.2.3/menulibre/
H A DXmlMenuElementTree.py202 for n_child in range(model.iter_n_children(model_parent)):
203 treeiter = model.iter_nth_child(model_parent, n_child)
249 for n_child in range(model.iter_n_children(model_parent)):
250 treeiter = model.iter_nth_child(model_parent, n_child)
287 for n_child in range(model.iter_n_children(model_parent)):
288 treeiter = model.iter_nth_child(model_parent, n_child)
/dports/mail/rspamd/rspamd-3.1/contrib/kann/
H A Dkautodiff.c28 s->n_d = n_d, s->op = op, s->n_child = n_child; in kad_new_core()
29 if (s->n_child) s->child = (kad_node_t**)calloc(s->n_child, sizeof(kad_node_t*)); in kad_new_core()
508 if (p->n_child) { in kad_delete()
602 if (p->n_child) { in kad_save1()
625 if (p->n_child) { in kad_load1()
666 if (p->n_child) { in kad_load()
694 if (q->n_child) { in kad_dup1()
711 if (p->n_child) { in kad_clone()
772 if (v[i]->n_child) in kad_unroll_helper()
817 if (v[i]->n_child) in kad_unroll()
[all …]
/dports/mail/rspamd-devel/rspamd-93430bb/contrib/kann/
H A Dkautodiff.c28 s->n_d = n_d, s->op = op, s->n_child = n_child; in kad_new_core()
29 if (s->n_child) s->child = (kad_node_t**)calloc(s->n_child, sizeof(kad_node_t*)); in kad_new_core()
508 if (p->n_child) { in kad_delete()
602 if (p->n_child) { in kad_save1()
625 if (p->n_child) { in kad_load1()
666 if (p->n_child) { in kad_load()
694 if (q->n_child) { in kad_dup1()
711 if (p->n_child) { in kad_clone()
772 if (v[i]->n_child) in kad_unroll_helper()
817 if (v[i]->n_child) in kad_unroll()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/api-doc-tools/monodoc/Monodoc/providers/
H A Decmaspec-provider.cs177 foreach (XmlNode n_child in n.ChildNodes) in GetTextNode()
178 GetTextNode (n_child, s); in GetTextNode()
188 foreach (XmlNode n_child in n.ChildNodes) in GetExamples()
189 GetExamples (n_child, s); in GetExamples()
/dports/devel/py-typed-ast/typed_ast-1.5.0/ast27/Include/
H A Dnode.h16 struct _node *n_child; member
28 #define CHILD(n, i) (&(n)->n_child[i])
/dports/sysutils/uefi-edk2-bhyve-csm/uefi-edk2-aa8d718/AppPkg/Applications/Python/Python-2.7.2/Include/
H A Dnode.h16 struct _node *n_child; member
27 #define CHILD(n, i) (&(n)->n_child[i])
/dports/lang/python27/Python-2.7.18/Include/
H A Dnode.h16 struct _node *n_child; member
28 #define CHILD(n, i) (&(n)->n_child[i])
/dports/lang/python-legacy/Python-2.7.18/Include/
H A Dnode.h16 struct _node *n_child; member
28 #define CHILD(n, i) (&(n)->n_child[i])
/dports/devel/py-typed-ast/typed_ast-1.5.0/ast3/Include/
H A Dnode.h16 struct _node *n_child; member
30 #define CHILD(n, i) (&(n)->n_child[i])
/dports/lang/python37/Python-3.7.12/Include/
H A Dnode.h16 struct _node *n_child; member
30 #define CHILD(n, i) (&(n)->n_child[i])
/dports/lang/python39/Python-3.9.9/Include/
H A Dnode.h16 struct _node *n_child; member
33 #define CHILD(n, i) (&(n)->n_child[i])
/dports/www/domoticz/domoticz-2020.2/hardware/plugins/Include/
H A Dnode.h16 struct _node *n_child; member
30 #define CHILD(n, i) (&(n)->n_child[i])

12345