Home
last modified time | relevance | path

Searched refs:dup_node (Results 1 – 25 of 95) sorted by relevance

1234

/dports/net/libyang/libyang-1.0.240/swig/cpp/src/
H A DTree_Data.cpp298 struct lyd_node *dup_node; in insert_sibling() local
305 dup_node = lyd_dup(new_node->node, 1); in insert_sibling()
306 if (!dup_node) { in insert_sibling()
317 struct lyd_node *dup_node; in insert_before() local
324 dup_node = lyd_dup(new_node->node, 1); in insert_before()
325 if (!dup_node) { in insert_before()
329 int ret = lyd_insert_before(node, dup_node); in insert_before()
336 struct lyd_node *dup_node; in insert_after() local
343 dup_node = lyd_dup(new_node->node, 1); in insert_after()
344 if (!dup_node) { in insert_after()
[all …]
/dports/security/clamav-lts/clamav-0.103.5/libclamav/
H A Dregex_suffix.c96 static struct node *dup_node(struct node *p) in dup_node() function
124 node_left = dup_node(p->u.children.left); in dup_node()
125 node_right = dup_node(p->u.children.right); in dup_node()
269 right = dup_node(v); in parse_regex()
/dports/security/clamav/clamav-0.104.2/libclamav/
H A Dregex_suffix.c96 static struct node *dup_node(struct node *p) in dup_node() function
124 node_left = dup_node(p->u.children.left); in dup_node()
125 node_right = dup_node(p->u.children.right); in dup_node()
269 right = dup_node(v); in parse_regex()
/dports/net/libyang/libyang-1.0.240/swig/cpp/tests/
H A Dtest_tree_data.cpp695 auto dup_node = new_node->dup(0); in TEST() local
696 ASSERT_NOTNULL(dup_node); in TEST()
721 auto dup_node = data1->dup_to_ctx(1, ctx2); in TEST() local
722 ASSERT_NULL(dup_node); in TEST()
726 dup_node = data1->dup_to_ctx(0, ctx2); in TEST()
727 ASSERT_NOTNULL(dup_node); in TEST()
/dports/math/unuran/unuran-1.8.1/src/parser/
H A Dfunctparser_deriv.ch289 struct ftreenode *dup_node, *tmp1, *tmp2;
335 dup_node = _unur_fstr_dup_tree(node);
338 br_right = _unur_fstr_create_node("*",0.,s_mul,tmp1,dup_node);
551 struct ftreenode *br_right, *sub_right, *dup_node;
566 dup_node = _unur_fstr_dup_tree(node);
570 br_right = _unur_fstr_create_node("*",0.,s_mul,sub_right,dup_node);
/dports/net/libyang/libyang-1.0.240/swig/python/tests/
H A Dtest_tree_data.py668 dup_node = new_node.dup(0);
669 self.assertIsNotNone(dup_node)
692 dup_node = data1.dup_to_ctx(1, ctx2)
693 self.assertIsNone(dup_node)
697 dup_node = data1.dup_to_ctx(1, ctx2)
698 self.assertIsNotNone(dup_node)
/dports/multimedia/v4l_compat/linux-5.13-rc2/fs/
H A Dmbcache.c78 struct hlist_bl_node *dup_node; in mb_cache_entry_create() local
101 hlist_bl_for_each_entry(dup, dup_node, head, e_hash_list) { in mb_cache_entry_create()
/dports/multimedia/libv4l/linux-5.13-rc2/fs/
H A Dmbcache.c78 struct hlist_bl_node *dup_node; in mb_cache_entry_create() local
101 hlist_bl_for_each_entry(dup, dup_node, head, e_hash_list) { in mb_cache_entry_create()
/dports/multimedia/v4l-utils/linux-5.13-rc2/fs/
H A Dmbcache.c78 struct hlist_bl_node *dup_node; in mb_cache_entry_create() local
101 hlist_bl_for_each_entry(dup, dup_node, head, e_hash_list) { in mb_cache_entry_create()
/dports/mail/dovecot/dovecot-2.3.17/src/lib-storage/list/
H A Dmailbox-list-index.c379 struct mailbox_list_index_node *dup_node; in mailbox_list_index_parse_records() local
382 if ((dup_node = hash_table_lookup(duplicate_guid, guid_p)) != NULL) { in mailbox_list_index_parse_records()
387 dup_node->raw_name); in mailbox_list_index_parse_records()
/dports/net/libyang/libyang-1.0.240/swig/java/tests/
H A DTreeDataTest.java221 Data_Node dup_node = new_node.dup(0); in test_ly_data_node() local
222 assertNotNull(dup_node); in test_ly_data_node()
/dports/graphics/gmt/gmt-6.3.0/src/potential/
H A Dtalwani2d.c543 unsigned int k, tbl, seg, n = 0, geometry, n_bodies, dup_node = 0, n_duplicate = 0; in GMT_talwani2d() local
639 …if (n_duplicate == 1 && dup_node == n) n_duplicate = 0; /* So it was the last == first duplicate; … in GMT_talwani2d()
685 dup_node = n; in GMT_talwani2d()
/dports/print/texlive-base/texlive-20150521-source/texk/chktex/regex/
H A Dregcomp.c3764 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3772 (*p_new)->parent = dup_node; in duplicate_tree()
3774 dup_node = *p_new; in duplicate_tree()
3780 p_new = &dup_node->left; in duplicate_tree()
3789 dup_node = dup_node->parent; in duplicate_tree()
3794 p_new = &dup_node->right; in duplicate_tree()
/dports/print/tex-xetex/texlive-20150521-source/texk/web2c/pdftexdir/regex/
H A Dregcomp.c3764 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3772 (*p_new)->parent = dup_node; in duplicate_tree()
3774 dup_node = *p_new; in duplicate_tree()
3780 p_new = &dup_node->left; in duplicate_tree()
3789 dup_node = dup_node->parent; in duplicate_tree()
3794 p_new = &dup_node->right; in duplicate_tree()
/dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/pdftexdir/regex/
H A Dregcomp.c3764 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3772 (*p_new)->parent = dup_node; in duplicate_tree()
3774 dup_node = *p_new; in duplicate_tree()
3780 p_new = &dup_node->left; in duplicate_tree()
3789 dup_node = dup_node->parent; in duplicate_tree()
3794 p_new = &dup_node->right; in duplicate_tree()
/dports/print/tex-luatex/texlive-20150521-source/texk/web2c/pdftexdir/regex/
H A Dregcomp.c3764 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3772 (*p_new)->parent = dup_node; in duplicate_tree()
3774 dup_node = *p_new; in duplicate_tree()
3780 p_new = &dup_node->left; in duplicate_tree()
3789 dup_node = dup_node->parent; in duplicate_tree()
3794 p_new = &dup_node->right; in duplicate_tree()
/dports/devel/arduino-ctags/ctags-5.8-arduino11/gnu_regex/
H A Dregcomp.c3785 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3793 (*p_new)->parent = dup_node; in duplicate_tree()
3795 dup_node = *p_new; in duplicate_tree()
3801 p_new = &dup_node->left; in duplicate_tree()
3810 dup_node = dup_node->parent; in duplicate_tree()
3815 p_new = &dup_node->right; in duplicate_tree()
/dports/devel/kBuild/kBuild-0.1.9998/src/sed/lib/
H A Dregcomp.c3773 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3781 (*p_new)->parent = dup_node; in duplicate_tree()
3783 dup_node = *p_new; in duplicate_tree()
3789 p_new = &dup_node->left; in duplicate_tree()
3798 dup_node = dup_node->parent; in duplicate_tree()
3803 p_new = &dup_node->right; in duplicate_tree()
/dports/comms/direwolf/direwolf-1.6/external/regex/
H A Dregcomp.c3770 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3778 (*p_new)->parent = dup_node; in duplicate_tree()
3780 dup_node = *p_new; in duplicate_tree()
3786 p_new = &dup_node->left; in duplicate_tree()
3795 dup_node = dup_node->parent; in duplicate_tree()
3800 p_new = &dup_node->right; in duplicate_tree()
/dports/devel/ctags/ctags-5.8/gnu_regex/
H A Dregcomp.c3785 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3793 (*p_new)->parent = dup_node; in duplicate_tree()
3795 dup_node = *p_new; in duplicate_tree()
3801 p_new = &dup_node->left; in duplicate_tree()
3810 dup_node = dup_node->parent; in duplicate_tree()
3815 p_new = &dup_node->right; in duplicate_tree()
/dports/devel/geany/geany-1.38/ctags/gnu_regex/
H A Dregcomp.c3785 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3793 (*p_new)->parent = dup_node; in duplicate_tree()
3795 dup_node = *p_new; in duplicate_tree()
3801 p_new = &dup_node->left; in duplicate_tree()
3810 dup_node = dup_node->parent; in duplicate_tree()
3815 p_new = &dup_node->right; in duplicate_tree()
/dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/pdftexdir/regex/
H A Dregcomp.c3764 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3772 (*p_new)->parent = dup_node; in duplicate_tree()
3774 dup_node = *p_new; in duplicate_tree()
3780 p_new = &dup_node->left; in duplicate_tree()
3789 dup_node = dup_node->parent; in duplicate_tree()
3794 p_new = &dup_node->right; in duplicate_tree()
/dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/pdftexdir/regex/
H A Dregcomp.c3764 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3772 (*p_new)->parent = dup_node; in duplicate_tree()
3774 dup_node = *p_new; in duplicate_tree()
3780 p_new = &dup_node->left; in duplicate_tree()
3789 dup_node = dup_node->parent; in duplicate_tree()
3794 p_new = &dup_node->right; in duplicate_tree()
/dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/pdftexdir/regex/
H A Dregcomp.c3764 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3772 (*p_new)->parent = dup_node; in duplicate_tree()
3774 dup_node = *p_new; in duplicate_tree()
3780 p_new = &dup_node->left; in duplicate_tree()
3789 dup_node = dup_node->parent; in duplicate_tree()
3794 p_new = &dup_node->right; in duplicate_tree()
/dports/japanese/ctags/ctags-5.8j2/gnu_regex/
H A Dregcomp.c3785 bin_tree_t **p_new = &dup_root, *dup_node = root->parent; in duplicate_tree() local
3793 (*p_new)->parent = dup_node; in duplicate_tree()
3795 dup_node = *p_new; in duplicate_tree()
3801 p_new = &dup_node->left; in duplicate_tree()
3810 dup_node = dup_node->parent; in duplicate_tree()
3815 p_new = &dup_node->right; in duplicate_tree()

1234