kernel/locking/lockdep.c

64 #include <trace/events/lock.h>
547  * Stack-trace: sequence of lock_trace structures. Protected by the graph_lock.
561 	struct lock_trace *trace, *t2;
569 	trace = (struct lock_trace *)(stack_trace + nr_stack_trace_entries);
582 	trace->nr_entries = stack_trace_save(trace->entries, max_entries, 3);
584 	hash = jhash(trace->entries, trace->nr_entries *
585 		     sizeof(trace->entries[0]), 0);
586 	trace->hash = hash;
589 		if (traces_identical(trace, t2))
592 	nr_stack_trace_entries += LOCK_TRACE_SIZE_IN_LONGS + trace->nr_entries;
593 	hlist_add_head(&trace->hash_entry, hash_head);
595 	return trace;
601 	struct lock_trace *trace;
606 		hlist_for_each_entry(trace, &stack_trace_hash[i], hash_entry) {
614 /* Return the number of stack hash chains that have at least one stack trace. */
1411 			    const struct lock_trace *trace)
1426 	entry->trace = trace;
1849 static void print_lock_trace(const struct lock_trace *trace,
1852 	stack_trace_print(trace->entries, trace->nr_entries, spaces);
1867 	print_lock_trace(target->trace, 6);
2037 	this->trace = save_trace();
2038 	if (!this->trace)
2162 		  struct lock_trace **const trace)
2175 		if (!*trace) {
2181 			*trace = save_trace();
2388  * 	The ->trace of both a) and b) point to the call trace where B was
2419  * ->trace until we reach the @root.
2434 		print_lock_trace(entry->trace, 2);
2463  * ->trace of L2 <- L1 is the call trace of L2, in fact we don't have the call
2464  * trace of L1 in the dependency path, which is alright, because most of the
2465  * time we can figure out where L1 is held from the call trace of L2.
2472 	const struct lock_trace *trace = NULL;
2480 		if (trace) {
2482 			print_lock_trace(trace, 2);
2487 		 * Record the pointer to the trace for the next lock_list
2490 		trace = entry->trace;
2620 	next_root->trace = save_trace();
2621 	if (!next_root->trace)
3093 	       struct lock_trace **const trace)
3134 	ret = check_noncircular(next, prev, trace);
3194 	if (!*trace) {
3195 		*trace = save_trace();
3196 		if (!*trace)
3206 			       calc_dep(prev, next), *trace);
3213 			       calc_depb(prev, next), *trace);
3229 	struct lock_trace *trace = NULL;
3253 			int ret = check_prev_add(curr, hlock, next, distance, &trace);
4074 	root->trace = save_trace();
4075 	if (!root->trace)
4155 	const struct irqtrace_events *trace = &curr->irqtrace;
4157 	printk("irq event stamp: %u\n", trace->irq_events);
4159 		trace->hardirq_enable_event, (void *)trace->hardirq_enable_ip,
4160 		(void *)trace->hardirq_enable_ip);
4162 		trace->hardirq_disable_event, (void *)trace->hardirq_disable_ip,
4163 		(void *)trace->hardirq_disable_ip);
4165 		trace->softirq_enable_event, (void *)trace->softirq_enable_ip,
4166 		(void *)trace->softirq_enable_ip);
4168 		trace->softirq_disable_event, (void *)trace->softirq_disable_ip,
4169 		(void *)trace->softirq_disable_ip);
4366 	struct irqtrace_events *trace = &current->irqtrace;
4422 	trace->hardirq_enable_ip = ip;
4423 	trace->hardirq_enable_event = ++trace->irq_events;
4455 		struct irqtrace_events *trace = &current->irqtrace;
4461 		trace->hardirq_disable_ip = ip;
4462 		trace->hardirq_disable_event = ++trace->irq_events;
4475 	struct irqtrace_events *trace = &current->irqtrace;
4497 	trace->softirq_enable_ip = ip;
4498 	trace->softirq_enable_event = ++trace->irq_events;
4525 		struct irqtrace_events *trace = &current->irqtrace;
4531 		trace->softirq_disable_ip = ip;
4532 		trace->softirq_disable_event = ++trace->irq_events;