63 	struct mt_status_entry *entry;  in mt_start_element()  local
88 	entry = malloc(sizeof(*entry));  in mt_start_element()
89 	if (entry == NULL) {  in mt_start_element()
93 		    sizeof(*entry));  in mt_start_element()
96 	bzero(entry, sizeof(*entry));   in mt_start_element()
97 	STAILQ_INIT(&entry->nv_list);  in mt_start_element()
98 	STAILQ_INIT(&entry->child_entries);  in mt_start_element()
99 	entry->entry_name = strdup(name);  in mt_start_element()
100 	mtinfo->cur_entry[mtinfo->level] = entry;  in mt_start_element()
102 		STAILQ_INSERT_TAIL(&mtinfo->entries, entry, links);  in mt_start_element()
106 		    entry, links);  in mt_start_element()
107 		entry->parent = mtinfo->cur_entry[mtinfo->level - 1];  in mt_start_element()
116 			entry->size = strtoull(attr[i+1], NULL, 0);  in mt_start_element()
119 				entry->var_type = MT_TYPE_INT;  in mt_start_element()
121 				entry->var_type = MT_TYPE_UINT;  in mt_start_element()
123 				entry->var_type = MT_TYPE_STRING;  in mt_start_element()
125 				entry->var_type = MT_TYPE_NODE;  in mt_start_element()
130 			entry->fmt = strdup(attr[i+1]);  in mt_start_element()
132 			entry->desc = strdup(attr[i+1]);  in mt_start_element()
148 			STAILQ_INSERT_TAIL(&entry->nv_list, nv, links);  in mt_start_element()
189 		struct mt_status_entry *entry;  in mt_end_element()  local
191 		entry = mtinfo->cur_entry[mtinfo->level];  in mt_end_element()
192 		switch(entry->var_type) {  in mt_end_element()
194 			entry->value_signed = strtoll(str, NULL, 0);  in mt_end_element()
197 			entry->value_unsigned = strtoull(str, NULL, 0);  in mt_end_element()
228 mt_status_tree_sbuf(struct sbuf *sb, struct mt_status_entry *entry, int indent,  in mt_status_tree_sbuf()  argument
229     void (*sbuf_func)(struct sbuf *sb, struct mt_status_entry *entry,  in mt_status_tree_sbuf()
236 		sbuf_func(sb, entry, arg);  in mt_status_tree_sbuf()
239 		    "type: %d, desc: %s\n", indent, "", entry->entry_name,  in mt_status_tree_sbuf()
240 		    entry->value, entry->fmt, entry->size, entry->var_type,  in mt_status_tree_sbuf()
241 		    entry->desc);  in mt_status_tree_sbuf()
242 		STAILQ_FOREACH(nv, &entry->nv_list, links) {  in mt_status_tree_sbuf()
248 	STAILQ_FOREACH(entry2, &entry->child_entries, links)  in mt_status_tree_sbuf()
253 mt_status_tree_print(struct mt_status_entry *entry, int indent,  in mt_status_tree_print()  argument
254     void (*print_func)(struct mt_status_entry *entry, void *arg), void *arg)  in mt_status_tree_print()  argument
260 		print_func(entry, arg);  in mt_status_tree_print()
261 		STAILQ_FOREACH(entry2, &entry->child_entries, links)  in mt_status_tree_print()
270 		mt_status_tree_sbuf(sb, entry, indent, NULL, NULL);  in mt_status_tree_print()
284 mt_entry_find(struct mt_status_entry *entry, char *name)  in mt_entry_find()  argument
302 	if (strcmp(entry->entry_name, tmpstr) == 0) {  in mt_entry_find()
309 			return (entry);  in mt_entry_find()
324 	STAILQ_FOREACH(entry2, &entry->child_entries, links) {  in mt_entry_find()
343 	struct mt_status_entry *entry, *entry2;  in mt_status_entry_find()  local
345 	STAILQ_FOREACH(entry, &status_data->entries, links) {  in mt_status_entry_find()
346 		entry2 = mt_entry_find(entry, name);  in mt_status_entry_find()
355 mt_status_entry_free(struct mt_status_entry *entry)  in mt_status_entry_free()  argument
360 	STAILQ_FOREACH_SAFE(entry2, &entry->child_entries, links, entry3) {  in mt_status_entry_free()
361 		STAILQ_REMOVE(&entry->child_entries, entry2, mt_status_entry,  in mt_status_entry_free()
366 	free(entry->entry_name);  in mt_status_entry_free()
367 	free(entry->value);  in mt_status_entry_free()
368 	free(entry->fmt);  in mt_status_entry_free()
369 	free(entry->desc);  in mt_status_entry_free()
371 	STAILQ_FOREACH_SAFE(nv, &entry->nv_list, links, nv2) {  in mt_status_entry_free()
372 		STAILQ_REMOVE(&entry->nv_list, nv, mt_status_nv, links);  in mt_status_entry_free()
377 	free(entry);  in mt_status_entry_free()
383 	struct mt_status_entry *entry, *entry2;  in mt_status_free()  local
385 	STAILQ_FOREACH_SAFE(entry, &status_data->entries, links, entry2) {  in mt_status_free()
386 		STAILQ_REMOVE(&status_data->entries, entry, mt_status_entry,  in mt_status_free()
388 		mt_status_entry_free(entry);  in mt_status_free()
393 mt_entry_sbuf(struct sbuf *sb, struct mt_status_entry *entry, char *fmt)  in mt_entry_sbuf()  argument
395 	switch(entry->var_type) {  in mt_entry_sbuf()
398 			sbuf_printf(sb, fmt, (intmax_t)entry->value_signed);  in mt_entry_sbuf()
401 				    (intmax_t)entry->value_signed);  in mt_entry_sbuf()
405 			sbuf_printf(sb, fmt, (uintmax_t)entry->value_unsigned);  in mt_entry_sbuf()
408 				    (uintmax_t)entry->value_unsigned);  in mt_entry_sbuf()
412 			sbuf_printf(sb, fmt, entry->value);  in mt_entry_sbuf()
414 			sbuf_printf(sb, "%s", entry->value);  in mt_entry_sbuf()
420 mt_param_parent_print(struct mt_status_entry *entry,  in mt_param_parent_print()  argument
423 	if (entry->parent != NULL)  in mt_param_parent_print()
424 		mt_param_parent_print(entry->parent, print_params);  in mt_param_parent_print()
427 	 && (strcmp(entry->entry_name, print_params->root_name) == 0))  in mt_param_parent_print()
430 	printf("%s.", entry->entry_name);  in mt_param_parent_print()
434 mt_param_parent_sbuf(struct sbuf *sb, struct mt_status_entry *entry,  in mt_param_parent_sbuf()  argument
437 	if (entry->parent != NULL)  in mt_param_parent_sbuf()
438 		mt_param_parent_sbuf(sb, entry->parent, print_params);  in mt_param_parent_sbuf()
441 	 && (strcmp(entry->entry_name, print_params->root_name) == 0))  in mt_param_parent_sbuf()
444 	sbuf_printf(sb, "%s.", entry->entry_name);  in mt_param_parent_sbuf()
448 mt_param_entry_sbuf(struct sbuf *sb, struct mt_status_entry *entry, void *arg)  in mt_param_entry_sbuf()  argument
457 	if (entry->var_type == MT_TYPE_NODE)  in mt_param_entry_sbuf()
461 	 && (entry->parent != NULL))  in mt_param_entry_sbuf()
462 		mt_param_parent_sbuf(sb, entry->parent, print_params);  in mt_param_entry_sbuf()
464 	sbuf_printf(sb, "%s: %s", entry->entry_name, entry->value);  in mt_param_entry_sbuf()
466 	 && (entry->desc != NULL)  in mt_param_entry_sbuf()
467 	 && (strlen(entry->desc) > 0))  in mt_param_entry_sbuf()
468 		sbuf_printf(sb, " (%s)", entry->desc);  in mt_param_entry_sbuf()
474 mt_param_entry_print(struct mt_status_entry *entry, void *arg)  in mt_param_entry_print()  argument
483 	if (entry->var_type == MT_TYPE_NODE)  in mt_param_entry_print()
487 	 && (entry->parent != NULL))  in mt_param_entry_print()
488 		mt_param_parent_print(entry->parent, print_params);  in mt_param_entry_print()
490 	printf("%s: %s", entry->entry_name, entry->value);  in mt_param_entry_print()
492 	 && (entry->desc != NULL)  in mt_param_entry_print()
493 	 && (strlen(entry->desc) > 0))  in mt_param_entry_print()
494 		printf(" (%s)", entry->desc);  in mt_param_entry_print()
501 	struct mt_status_entry *entry;  in mt_protect_print()  local
511 	entry = mt_status_entry_find(status_data, __DECONST(char *,prot_name));  in mt_protect_print()
512 	if (entry == NULL)  in mt_protect_print()
514 	mt_status_tree_print(entry, 0, mt_param_entry_print, &print_params);  in mt_protect_print()
522 	struct mt_status_entry *entry;  in mt_param_list()  local
535 		entry = mt_status_entry_find(status_data, param_name);  in mt_param_list()
536 		if (entry == NULL)  in mt_param_list()
539 		mt_param_entry_print(entry, &print_params);  in mt_param_list()
543 		entry = mt_status_entry_find(status_data, root_name);  in mt_param_list()
545 		STAILQ_FOREACH(entry, &status_data->entries, links)  in mt_param_list()
546 			mt_status_tree_print(entry, 0, mt_param_entry_print,  in mt_param_list()