61 	struct mt_status_entry *entry;  in mt_start_element()  local
86 	entry = malloc(sizeof(*entry));  in mt_start_element()
87 	if (entry == NULL) {  in mt_start_element()
91 		    sizeof(*entry));  in mt_start_element()
94 	bzero(entry, sizeof(*entry));   in mt_start_element()
95 	STAILQ_INIT(&entry->nv_list);  in mt_start_element()
96 	STAILQ_INIT(&entry->child_entries);  in mt_start_element()
97 	entry->entry_name = strdup(name);  in mt_start_element()
98 	mtinfo->cur_entry[mtinfo->level] = entry;  in mt_start_element()
100 		STAILQ_INSERT_TAIL(&mtinfo->entries, entry, links);  in mt_start_element()
104 		    entry, links);  in mt_start_element()
105 		entry->parent = mtinfo->cur_entry[mtinfo->level - 1];  in mt_start_element()
114 			entry->size = strtoull(attr[i+1], NULL, 0);  in mt_start_element()
117 				entry->var_type = MT_TYPE_INT;  in mt_start_element()
119 				entry->var_type = MT_TYPE_UINT;  in mt_start_element()
121 				entry->var_type = MT_TYPE_STRING;  in mt_start_element()
123 				entry->var_type = MT_TYPE_NODE;  in mt_start_element()
128 			entry->fmt = strdup(attr[i+1]);  in mt_start_element()
130 			entry->desc = strdup(attr[i+1]);  in mt_start_element()
146 			STAILQ_INSERT_TAIL(&entry->nv_list, nv, links);  in mt_start_element()
187 		struct mt_status_entry *entry;  in mt_end_element()  local
189 		entry = mtinfo->cur_entry[mtinfo->level];  in mt_end_element()
190 		switch(entry->var_type) {  in mt_end_element()
192 			entry->value_signed = strtoll(str, NULL, 0);  in mt_end_element()
195 			entry->value_unsigned = strtoull(str, NULL, 0);  in mt_end_element()
226 mt_status_tree_sbuf(struct sbuf *sb, struct mt_status_entry *entry, int indent,  in mt_status_tree_sbuf()  argument
227     void (*sbuf_func)(struct sbuf *sb, struct mt_status_entry *entry,  in mt_status_tree_sbuf()
234 		sbuf_func(sb, entry, arg);  in mt_status_tree_sbuf()
237 		    "type: %d, desc: %s\n", indent, "", entry->entry_name,  in mt_status_tree_sbuf()
238 		    entry->value, entry->fmt, entry->size, entry->var_type,  in mt_status_tree_sbuf()
239 		    entry->desc);  in mt_status_tree_sbuf()
240 		STAILQ_FOREACH(nv, &entry->nv_list, links) {  in mt_status_tree_sbuf()
246 	STAILQ_FOREACH(entry2, &entry->child_entries, links)  in mt_status_tree_sbuf()
251 mt_status_tree_print(struct mt_status_entry *entry, int indent,  in mt_status_tree_print()  argument
252     void (*print_func)(struct mt_status_entry *entry, void *arg), void *arg)  in mt_status_tree_print()  argument
258 		print_func(entry, arg);  in mt_status_tree_print()
259 		STAILQ_FOREACH(entry2, &entry->child_entries, links)  in mt_status_tree_print()
268 		mt_status_tree_sbuf(sb, entry, indent, NULL, NULL);  in mt_status_tree_print()
282 mt_entry_find(struct mt_status_entry *entry, char *name)  in mt_entry_find()  argument
300 	if (strcmp(entry->entry_name, tmpstr) == 0) {  in mt_entry_find()
307 			return (entry);  in mt_entry_find()
322 	STAILQ_FOREACH(entry2, &entry->child_entries, links) {  in mt_entry_find()
341 	struct mt_status_entry *entry, *entry2;  in mt_status_entry_find()  local
343 	STAILQ_FOREACH(entry, &status_data->entries, links) {  in mt_status_entry_find()
344 		entry2 = mt_entry_find(entry, name);  in mt_status_entry_find()
353 mt_status_entry_free(struct mt_status_entry *entry)  in mt_status_entry_free()  argument
358 	STAILQ_FOREACH_SAFE(entry2, &entry->child_entries, links, entry3) {  in mt_status_entry_free()
359 		STAILQ_REMOVE(&entry->child_entries, entry2, mt_status_entry,  in mt_status_entry_free()
364 	free(entry->entry_name);  in mt_status_entry_free()
365 	free(entry->value);  in mt_status_entry_free()
366 	free(entry->fmt);  in mt_status_entry_free()
367 	free(entry->desc);  in mt_status_entry_free()
369 	STAILQ_FOREACH_SAFE(nv, &entry->nv_list, links, nv2) {  in mt_status_entry_free()
370 		STAILQ_REMOVE(&entry->nv_list, nv, mt_status_nv, links);  in mt_status_entry_free()
375 	free(entry);  in mt_status_entry_free()
381 	struct mt_status_entry *entry, *entry2;  in mt_status_free()  local
383 	STAILQ_FOREACH_SAFE(entry, &status_data->entries, links, entry2) {  in mt_status_free()
384 		STAILQ_REMOVE(&status_data->entries, entry, mt_status_entry,  in mt_status_free()
386 		mt_status_entry_free(entry);  in mt_status_free()
391 mt_entry_sbuf(struct sbuf *sb, struct mt_status_entry *entry, char *fmt)  in mt_entry_sbuf()  argument
393 	switch(entry->var_type) {  in mt_entry_sbuf()
396 			sbuf_printf(sb, fmt, (intmax_t)entry->value_signed);  in mt_entry_sbuf()
399 				    (intmax_t)entry->value_signed);  in mt_entry_sbuf()
403 			sbuf_printf(sb, fmt, (uintmax_t)entry->value_unsigned);  in mt_entry_sbuf()
406 				    (uintmax_t)entry->value_unsigned);  in mt_entry_sbuf()
410 			sbuf_printf(sb, fmt, entry->value);  in mt_entry_sbuf()
412 			sbuf_printf(sb, "%s", entry->value);  in mt_entry_sbuf()
418 mt_param_parent_print(struct mt_status_entry *entry,  in mt_param_parent_print()  argument
421 	if (entry->parent != NULL)  in mt_param_parent_print()
422 		mt_param_parent_print(entry->parent, print_params);  in mt_param_parent_print()
425 	 && (strcmp(entry->entry_name, print_params->root_name) == 0))  in mt_param_parent_print()
428 	printf("%s.", entry->entry_name);  in mt_param_parent_print()
432 mt_param_parent_sbuf(struct sbuf *sb, struct mt_status_entry *entry,  in mt_param_parent_sbuf()  argument
435 	if (entry->parent != NULL)  in mt_param_parent_sbuf()
436 		mt_param_parent_sbuf(sb, entry->parent, print_params);  in mt_param_parent_sbuf()
439 	 && (strcmp(entry->entry_name, print_params->root_name) == 0))  in mt_param_parent_sbuf()
442 	sbuf_printf(sb, "%s.", entry->entry_name);  in mt_param_parent_sbuf()
446 mt_param_entry_sbuf(struct sbuf *sb, struct mt_status_entry *entry, void *arg)  in mt_param_entry_sbuf()  argument
455 	if (entry->var_type == MT_TYPE_NODE)  in mt_param_entry_sbuf()
459 	 && (entry->parent != NULL))  in mt_param_entry_sbuf()
460 		mt_param_parent_sbuf(sb, entry->parent, print_params);  in mt_param_entry_sbuf()
462 	sbuf_printf(sb, "%s: %s", entry->entry_name, entry->value);  in mt_param_entry_sbuf()
464 	 && (entry->desc != NULL)  in mt_param_entry_sbuf()
465 	 && (strlen(entry->desc) > 0))  in mt_param_entry_sbuf()
466 		sbuf_printf(sb, " (%s)", entry->desc);  in mt_param_entry_sbuf()
472 mt_param_entry_print(struct mt_status_entry *entry, void *arg)  in mt_param_entry_print()  argument
481 	if (entry->var_type == MT_TYPE_NODE)  in mt_param_entry_print()
485 	 && (entry->parent != NULL))  in mt_param_entry_print()
486 		mt_param_parent_print(entry->parent, print_params);  in mt_param_entry_print()
488 	printf("%s: %s", entry->entry_name, entry->value);  in mt_param_entry_print()
490 	 && (entry->desc != NULL)  in mt_param_entry_print()
491 	 && (strlen(entry->desc) > 0))  in mt_param_entry_print()
492 		printf(" (%s)", entry->desc);  in mt_param_entry_print()
499 	struct mt_status_entry *entry;  in mt_protect_print()  local
509 	entry = mt_status_entry_find(status_data, __DECONST(char *,prot_name));  in mt_protect_print()
510 	if (entry == NULL)  in mt_protect_print()
512 	mt_status_tree_print(entry, 0, mt_param_entry_print, &print_params);  in mt_protect_print()
520 	struct mt_status_entry *entry;  in mt_param_list()  local
533 		entry = mt_status_entry_find(status_data, param_name);  in mt_param_list()
534 		if (entry == NULL)  in mt_param_list()
537 		mt_param_entry_print(entry, &print_params);  in mt_param_list()
541 		entry = mt_status_entry_find(status_data, root_name);  in mt_param_list()
543 		STAILQ_FOREACH(entry, &status_data->entries, links)  in mt_param_list()
544 			mt_status_tree_print(entry, 0, mt_param_entry_print,  in mt_param_list()