| .. | .. |
|---|
| 432 | 432 | |
|---|
| 433 | 433 | void workingset_update_node(struct xa_node *node) |
|---|
| 434 | 434 | { |
|---|
| 435 | | - struct address_space *mapping; |
|---|
| 436 | | - |
|---|
| 437 | 435 | /* |
|---|
| 438 | 436 | * Track non-empty nodes that contain only shadow entries; |
|---|
| 439 | 437 | * unlink those that contain pages or are being freed. |
|---|
| .. | .. |
|---|
| 442 | 440 | * already where they should be. The list_empty() test is safe |
|---|
| 443 | 441 | * as node->private_list is protected by the i_pages lock. |
|---|
| 444 | 442 | */ |
|---|
| 445 | | - mapping = container_of(node->array, struct address_space, i_pages); |
|---|
| 446 | | - lockdep_assert_held(&mapping->i_pages.xa_lock); |
|---|
| 443 | + VM_WARN_ON_ONCE(!irqs_disabled()); /* For __inc_lruvec_page_state */ |
|---|
| 447 | 444 | |
|---|
| 448 | 445 | if (node->count && node->count == node->nr_values) { |
|---|
| 449 | 446 | if (list_empty(&node->private_list)) { |
|---|