Home
last modified time | relevance | path

Searched refs:nam_len (Results 1 – 8 of 8) sorted by relevance

/dports/net/libyang/libyang-1.0.240/src/
H A Dresolve.c47 int nam_len; member
242 assert((name && nam_len) || (!name && !nam_len)); in parse_node_identifier()
250 *nam_len = 0; in parse_node_identifier()
401 if (nam_len) { in parse_path_predicate()
402 *nam_len = 0; in parse_path_predicate()
523 if (nam_len) { in parse_path_key_expr()
524 *nam_len = 0; in parse_path_key_expr()
661 if (nam_len) { in parse_path_arg()
662 *nam_len = 0; in parse_path_arg()
765 *nam_len = ret; in parse_instance_identifier()
[all …]
H A Dresolve.h151 …a_nodeid(const char *id, const char **mod_name, int *mod_name_len, const char **name, int *nam_len,
155 int *nam_len, const char **value, int *val_len, int *has_predicate);
261 const char *mod_name, int mod_name_len, const char *name, int nam_len);
H A Dtree_internal.h483 int nam_len, LYS_NODE type, const struct lys_node **ret);
498 …xt_data(const struct lys_module *mod, const struct lys_node *parent, const char *name, int nam_len,
H A Dcommon.c1203 int r, mod_name_len, nam_len, is_relative = -1; in ly_path_data2schema() local
1214 …if ((r = parse_schema_nodeid(data_path, &mod_name, &mod_name_len, &name, &nam_len, &is_relative, N… in ly_path_data2schema()
1226 --nam_len; in ly_path_data2schema()
1229 str = strndup(data_path, (name + nam_len) - data_path); in ly_path_data2schema()
1249 parent = lyp_get_yang_data_template(mod, name, nam_len); in ly_path_data2schema()
1251 str = strndup(data_path, (name + nam_len) - data_path); in ly_path_data2schema()
1257 out_used = (name + nam_len) - data_path + 1; in ly_path_data2schema()
H A Dtree_data.c1686 int r, i, mod_name_len, nam_len, val_len, has_predicate; in lyd_new_path_list_predicate() local
1694 || !strncmp(name, ".", nam_len)) { in lyd_new_path_list_predicate()
1722 || !strncmp(name, ".", nam_len)) { in lyd_new_path_list_predicate()
1734 || strncmp(key->name, name, nam_len) || key->name[nam_len]) { in lyd_new_path_list_predicate()
1885 int r, i, parsed = 0, mod_name_len, nam_len, val_name_len, val_len; in lyd_new_path() local
1959 yang_data_name_len = nam_len - 1; in lyd_new_path()
1995 str = strndup(path, (name + nam_len) - path); in lyd_new_path()
2043 if (strncmp(schild->name, name, nam_len) || schild->name[nam_len]) { in lyd_new_path()
2066 str = strndup(path, (name + nam_len) - path); in lyd_new_path()
2082 str = strndup(path, (name + nam_len) - path); in lyd_new_path()
[all …]
H A Dtree_schema.c154 int nam_len, LYS_NODE type, const struct lys_node **ret) in lys_get_sibling() argument
167 if (!nam_len) { in lys_get_sibling()
168 nam_len = strlen(name); in lys_get_sibling()
214 …y_strequal(node->name, name, 1) || (!strncmp(node->name, name, nam_len) && !node->name[nam_len])) { in lys_get_sibling()
227 …xt_data(const struct lys_module *mod, const struct lys_node *parent, const char *name, int nam_len, in lys_getnext_data() argument
249 if (!strncmp(node->name, name, nam_len) && !node->name[nam_len]) { in lys_getnext_data()
/dports/lang/gnu-apl/apl-1.8/tools/
H A Dphrase_gen.cc180 int nam_len = snprintf(nam, sizeof(nam), "%s %s %s %s", in print_entry_decl() local
182 while (nam_len && nam[nam_len - 1] == ' ') nam[--nam_len] = 0; in print_entry_decl()
/dports/biology/mapm3/mapm3-3.0_1/quant/
H A Dqraw.c35 int nam_len; variable
605 extern int nam_len;
615 itoken(&ln,iREQUIRED,&nam_len) &&
616 nam_len>0 && nam_len<=TOKLEN))
624 raw.name_len= nam_len;
629 matrix(raw.locus_name, n_loci, nam_len, char);
633 matrix(raw.trait_name,raw.max_traits,nam_len,char);
672 if (!field(&ln, nam_len, raw.locus_name[num]))
696 if (!field(&ln, nam_len, raw.trait_name[num]))