Lines Matching defs:n

164 	pr_err("callchain: Incorrect stack dump size (max %ld): %s\n",
236 		pr_err("Can't register callchain params\n");
306 					"needed for --call-graph lbr\n");
310 			       "value: %s\n", arg);
343 			pr_err("Invalid callchain mode: %s\n", value);
350 			pr_err("Invalid callchain order: %s\n", value);
357 			pr_err("Invalid callchain sort key: %s\n", value);
363 			pr_err("Invalid callchain threshold: %s\n", value);
370 			pr_err("Invalid callchain print limit: %s\n", value);
423 	struct rb_node *n;
426 	n = rb_first(&node->rb_root_in);
427 	while (n) {
428 		child = rb_entry(n, struct callchain_node, rb_node_in);
429 		n = rb_next(n);
453 	struct rb_node *n;
457 	n = rb_first(&node->rb_root_in);
459 	while (n) {
460 		child = rb_entry(n, struct callchain_node, rb_node_in);
461 		n = rb_next(n);
481 	struct rb_node *n;
488 	n = rb_first(&node->rb_root_in);
489 	while (n) {
490 		child = rb_entry(n, struct callchain_node, rb_node_in);
491 		n = rb_next(n);
547 		struct rb_node *n;
553 		n = rb_first(&new->rb_root_in);
554 		while (n) {
555 			child = rb_entry(n, struct callchain_node, rb_node_in);
557 			n = rb_next(n);
579 		pr_warning("Warning: empty node in callchain tree\n");
972 		WARN_ONCE(cmp == MATCH_ERROR, "Chain comparison error\n");
1029 	struct rb_node *n;
1052 	n = rb_first(&src->rb_root_in);
1053 	while (n) {
1054 		child = container_of(n, struct callchain_node, rb_node_in);
1055 		n = rb_next(n);
1293 	struct rb_node *n;
1295 	n = rb_first(&node->rb_root_in);
1296 	while (n) {
1297 		child = rb_entry(n, struct callchain_node, rb_node_in);
1298 		n = rb_next(n);
1487 	struct rb_node *n;
1503 	n = rb_first(&node->rb_root_in);
1504 	while (n) {
1505 		child = container_of(n, struct callchain_node, rb_node_in);
1506 		n = rb_next(n);
1525 	struct rb_node *n;
1528 	n = rb_first(&node->rb_root_in);
1529 	while (n) {
1530 		child = container_of(n, struct callchain_node, rb_node_in);
1533 		n = rb_next(n);
1622 			pr_debug3("%s: not enough memory\n", __func__);