- char str[128], c1, c2, c3, c4;
+ char str[KSYM_NAME_LEN + 1], c1, c2, c3, c4;
const char *name;
get_usage_chars(class, &c1, &c2, &c3, &c4);
const char *name;
get_usage_chars(class, &c1, &c2, &c3, &c4);
print_lock_class_header(class, depth);
list_for_each_entry(entry, &class->locks_after, entry) {
print_lock_class_header(class, depth);
list_for_each_entry(entry, &class->locks_after, entry) {
print_lock_dependencies(entry->class, depth + 1);
printk("%*s ... acquired at:\n",depth,"");
print_lock_dependencies(entry->class, depth + 1);
printk("%*s ... acquired at:\n",depth,"");
print_circular_bug_entry(&this, 0);
printk("\nother info that might help us debug this:\n\n");
print_circular_bug_entry(&this, 0);
printk("\nother info that might help us debug this:\n\n");
ret = add_lock_to_list(next->class, prev->class,
&next->class->locks_before, next->acquire_ip);
ret = add_lock_to_list(next->class, prev->class,
&next->class->locks_before, next->acquire_ip);
/*
* Stop after the first non-trylock entry,
* as non-trylock entries have added their
/*
* Stop after the first non-trylock entry,
* as non-trylock entries have added their
struct lockdep_subclass_key *key;
struct list_head *hash_head;
struct lock_class *class;
struct lockdep_subclass_key *key;
struct list_head *hash_head;
struct lock_class *class;
__raw_spin_lock(&hash_lock);
/*
* We have to do the hash-walk again, to avoid races
__raw_spin_lock(&hash_lock);
/*
* We have to do the hash-walk again, to avoid races
debug_locks_off();
printk("BUG: MAX_LOCKDEP_KEYS too low!\n");
printk("turning off the locking correctness validator.\n");
debug_locks_off();
printk("BUG: MAX_LOCKDEP_KEYS too low!\n");
printk("turning off the locking correctness validator.\n");
printk("\nnew class %p: %s", class->key, class->name);
if (class->name_version > 1)
printk("#%d", class->name_version);
printk("\n");
dump_stack();
printk("\nnew class %p: %s", class->key, class->name);
if (class->name_version > 1)
printk("#%d", class->name_version);
printk("\n");
dump_stack();