Home
last modified time | relevance | path

Searched refs:sparent (Results 1 – 25 of 190) sorted by relevance

12345678

/dports/net/libyang/libyang-1.0.240/src/
H A Dvalidation.c55 struct lys_node *sparent, *op; in lyv_data_context() local
122 sparent && (sparent->nodetype & (LYS_USES | LYS_CHOICE | LYS_CASE)); in lyv_data_context()
123 sparent = lys_parent(sparent)); in lyv_data_context()
906 …for (sparent = lys_parent(schemanode); sparent && (sparent->nodetype == LYS_USES); sparent = lys_p… in lyv_multicases()
907 if (!sparent || !(sparent->nodetype & (LYS_CHOICE | LYS_CASE))) { in lyv_multicases()
917 schoice = sparent; in lyv_multicases()
920 schoice = lys_parent(sparent); in lyv_multicases()
921 scase = sparent; in lyv_multicases()
931 …for (sparent = lys_parent(iter->schema); sparent && (sparent->nodetype == LYS_USES); sparent = lys… in lyv_multicases()
932 …if (sparent && ((sparent->nodetype == LYS_CHOICE && sparent == schoice) /* another implicit case */ in lyv_multicases()
[all …]
H A Dprinter.c957 struct lys_node *scase, *sparent; in lyd_node_should_print() local
962 …for (sparent = lys_parent(node->schema); sparent && (sparent->nodetype == LYS_USES); sparent = lys… in lyd_node_should_print()
963 if (!sparent || (sparent->nodetype != LYS_CASE)) { in lyd_node_should_print()
967 scase = sparent; in lyd_node_should_print()
969 …for (sparent = lys_parent(scase); sparent && (sparent->nodetype == LYS_USES); sparent = lys_parent… in lyd_node_should_print()
970 if (!sparent || (sparent->nodetype != LYS_CHOICE)) { in lyd_node_should_print()
975 if (((struct lys_node_choice *)sparent)->dflt == scase) { in lyd_node_should_print()
989 …for (sparent = lys_parent(first->schema); sparent && (sparent->nodetype == LYS_USES); sparent = ly… in lyd_node_should_print()
990 if ((sparent == scase) && lyd_wd_toprint(first, options)) { in lyd_node_should_print()
H A Dlog.c592 struct lys_node *sparent = NULL; in ly_vlog_build_path() local
615 … for (sparent = (struct lys_node *)elem; lys_parent(sparent); sparent = lys_parent(sparent)); in ly_vlog_build_path()
616 top_smodule = lys_node_module(sparent); in ly_vlog_build_path()
620 sparent = lys_parent((struct lys_node *)elem); in ly_vlog_build_path()
621 while (sparent && (sparent->nodetype == LYS_USES)) { in ly_vlog_build_path()
622 sparent = lys_parent(sparent); in ly_vlog_build_path()
624 …if (!sparent || (lys_node_module((struct lys_node *)elem) != top_smodule) || schema_all_prefixes) { in ly_vlog_build_path()
660 sparent = NULL; in ly_vlog_build_path()
668 sparent = ((struct lys_node *)elem)->parent; in ly_vlog_build_path()
834 if ((elem_type == LY_VLOG_LYS) && !elem && sparent && (sparent->nodetype == LYS_AUGMENT)) { in ly_vlog_build_path()
[all …]
/dports/games/naev/naev-0.7.0/lib/csparse/
H A Dcs_leaf.c6 int q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/casadi/casadi-3.5.5/external_packages/CSparse/Source/
H A Dcs_leaf.c6 int q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/igraph/igraph-0.9.5/vendor/cs/
H A Dcs_leaf.c6 CS_INT q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/CSparse/Source/
H A Dcs_leaf.c6 csi q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/CXSparse/Source/
H A Dcs_leaf.c6 CS_INT q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/R-cran-igraph/igraph/src/cs/
H A Dcs_leaf.c26 CS_INT q, s, sparent, jprev ; in cs_leaf() local
36 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
38 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-btf/SuiteSparse-5.10.1/CXSparse/Source/
H A Dcs_leaf.c6 CS_INT q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-btf/SuiteSparse-5.10.1/CSparse/Source/
H A Dcs_leaf.c6 csi q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-amd/SuiteSparse-5.10.1/CXSparse/Source/
H A Dcs_leaf.c6 CS_INT q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-amd/SuiteSparse-5.10.1/CSparse/Source/
H A Dcs_leaf.c6 csi q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/CSparse/Source/
H A Dcs_leaf.c6 csi q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/CXSparse/Source/
H A Dcs_leaf.c6 CS_INT q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/CXSparse/Source/
H A Dcs_leaf.c6 CS_INT q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/CSparse/Source/
H A Dcs_leaf.c6 csi q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-rbio/SuiteSparse-5.10.1/CSparse/Source/
H A Dcs_leaf.c6 csi q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/CSparse/Source/
H A Dcs_leaf.c6 csi q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/CXSparse/Source/
H A Dcs_leaf.c6 CS_INT q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-rbio/SuiteSparse-5.10.1/CXSparse/Source/
H A Dcs_leaf.c6 CS_INT q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-colamd/SuiteSparse-5.10.1/CSparse/Source/
H A Dcs_leaf.c6 csi q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-config/SuiteSparse-5.10.1/CSparse/Source/
H A Dcs_leaf.c6 csi q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-config/SuiteSparse-5.10.1/CXSparse/Source/
H A Dcs_leaf.c6 CS_INT q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
/dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/CXSparse/Source/
H A Dcs_leaf.c6 CS_INT q, s, sparent, jprev ; in cs_leaf() local
16 for (s = jprev ; s != q ; s = sparent) in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()

12345678