Linux kernel mirror (for testing) git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel os linux

Replace mentions of "list_struct" to "list_head"

There's no such thing as "list_struct".

Signed-off-by: Andrey Utkin <andrey.krieger.utkin@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Acked-by: Mauro Carvalho Chehab <mchehab@osg.samsung.com>
Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Acked-by: Alex Deucher <alexander.deucher@amd.com>
Signed-off-by: Jiri Kosina <jkosina@suse.cz>

authored by

Andrey Utkin and committed by
Jiri Kosina
3943f42c a0200108

+43 -43
+12 -12
drivers/gpu/drm/radeon/mkregtable.c
··· 347 347 * list_entry - get the struct for this entry 348 348 * @ptr: the &struct list_head pointer. 349 349 * @type: the type of the struct this is embedded in. 350 - * @member: the name of the list_struct within the struct. 350 + * @member: the name of the list_head within the struct. 351 351 */ 352 352 #define list_entry(ptr, type, member) \ 353 353 container_of(ptr, type, member) ··· 356 356 * list_first_entry - get the first element from a list 357 357 * @ptr: the list head to take the element from. 358 358 * @type: the type of the struct this is embedded in. 359 - * @member: the name of the list_struct within the struct. 359 + * @member: the name of the list_head within the struct. 360 360 * 361 361 * Note, that list is expected to be not empty. 362 362 */ ··· 406 406 * list_for_each_entry - iterate over list of given type 407 407 * @pos: the type * to use as a loop cursor. 408 408 * @head: the head for your list. 409 - * @member: the name of the list_struct within the struct. 409 + * @member: the name of the list_head within the struct. 410 410 */ 411 411 #define list_for_each_entry(pos, head, member) \ 412 412 for (pos = list_entry((head)->next, typeof(*pos), member); \ ··· 417 417 * list_for_each_entry_reverse - iterate backwards over list of given type. 418 418 * @pos: the type * to use as a loop cursor. 419 419 * @head: the head for your list. 420 - * @member: the name of the list_struct within the struct. 420 + * @member: the name of the list_head within the struct. 421 421 */ 422 422 #define list_for_each_entry_reverse(pos, head, member) \ 423 423 for (pos = list_entry((head)->prev, typeof(*pos), member); \ ··· 428 428 * list_prepare_entry - prepare a pos entry for use in list_for_each_entry_continue() 429 429 * @pos: the type * to use as a start point 430 430 * @head: the head of the list 431 - * @member: the name of the list_struct within the struct. 431 + * @member: the name of the list_head within the struct. 432 432 * 433 433 * Prepares a pos entry for use as a start point in list_for_each_entry_continue(). 434 434 */ ··· 439 439 * list_for_each_entry_continue - continue iteration over list of given type 440 440 * @pos: the type * to use as a loop cursor. 441 441 * @head: the head for your list. 442 - * @member: the name of the list_struct within the struct. 442 + * @member: the name of the list_head within the struct. 443 443 * 444 444 * Continue to iterate over list of given type, continuing after 445 445 * the current position. ··· 453 453 * list_for_each_entry_continue_reverse - iterate backwards from the given point 454 454 * @pos: the type * to use as a loop cursor. 455 455 * @head: the head for your list. 456 - * @member: the name of the list_struct within the struct. 456 + * @member: the name of the list_head within the struct. 457 457 * 458 458 * Start to iterate over list of given type backwards, continuing after 459 459 * the current position. ··· 467 467 * list_for_each_entry_from - iterate over list of given type from the current point 468 468 * @pos: the type * to use as a loop cursor. 469 469 * @head: the head for your list. 470 - * @member: the name of the list_struct within the struct. 470 + * @member: the name of the list_head within the struct. 471 471 * 472 472 * Iterate over list of given type, continuing from current position. 473 473 */ ··· 480 480 * @pos: the type * to use as a loop cursor. 481 481 * @n: another type * to use as temporary storage 482 482 * @head: the head for your list. 483 - * @member: the name of the list_struct within the struct. 483 + * @member: the name of the list_head within the struct. 484 484 */ 485 485 #define list_for_each_entry_safe(pos, n, head, member) \ 486 486 for (pos = list_entry((head)->next, typeof(*pos), member), \ ··· 493 493 * @pos: the type * to use as a loop cursor. 494 494 * @n: another type * to use as temporary storage 495 495 * @head: the head for your list. 496 - * @member: the name of the list_struct within the struct. 496 + * @member: the name of the list_head within the struct. 497 497 * 498 498 * Iterate over list of given type, continuing after current point, 499 499 * safe against removal of list entry. ··· 509 509 * @pos: the type * to use as a loop cursor. 510 510 * @n: another type * to use as temporary storage 511 511 * @head: the head for your list. 512 - * @member: the name of the list_struct within the struct. 512 + * @member: the name of the list_head within the struct. 513 513 * 514 514 * Iterate over list of given type from current point, safe against 515 515 * removal of list entry. ··· 524 524 * @pos: the type * to use as a loop cursor. 525 525 * @n: another type * to use as temporary storage 526 526 * @head: the head for your list. 527 - * @member: the name of the list_struct within the struct. 527 + * @member: the name of the list_head within the struct. 528 528 * 529 529 * Iterate backwards over list of given type, safe against removal 530 530 * of list entry.
+1 -1
drivers/media/pci/cx18/cx18-driver.h
··· 290 290 * list_entry_is_past_end - check if a previous loop cursor is off list end 291 291 * @pos: the type * previously used as a loop cursor. 292 292 * @head: the head for your list. 293 - * @member: the name of the list_struct within the struct. 293 + * @member: the name of the list_head within the struct. 294 294 * 295 295 * Check if the entry's list_head is the head of the list, thus it's not a 296 296 * real entry but was the loop cursor that walked past the end
+17 -17
include/linux/list.h
··· 346 346 * list_entry - get the struct for this entry 347 347 * @ptr: the &struct list_head pointer. 348 348 * @type: the type of the struct this is embedded in. 349 - * @member: the name of the list_struct within the struct. 349 + * @member: the name of the list_head within the struct. 350 350 */ 351 351 #define list_entry(ptr, type, member) \ 352 352 container_of(ptr, type, member) ··· 355 355 * list_first_entry - get the first element from a list 356 356 * @ptr: the list head to take the element from. 357 357 * @type: the type of the struct this is embedded in. 358 - * @member: the name of the list_struct within the struct. 358 + * @member: the name of the list_head within the struct. 359 359 * 360 360 * Note, that list is expected to be not empty. 361 361 */ ··· 366 366 * list_last_entry - get the last element from a list 367 367 * @ptr: the list head to take the element from. 368 368 * @type: the type of the struct this is embedded in. 369 - * @member: the name of the list_struct within the struct. 369 + * @member: the name of the list_head within the struct. 370 370 * 371 371 * Note, that list is expected to be not empty. 372 372 */ ··· 377 377 * list_first_entry_or_null - get the first element from a list 378 378 * @ptr: the list head to take the element from. 379 379 * @type: the type of the struct this is embedded in. 380 - * @member: the name of the list_struct within the struct. 380 + * @member: the name of the list_head within the struct. 381 381 * 382 382 * Note that if the list is empty, it returns NULL. 383 383 */ ··· 387 387 /** 388 388 * list_next_entry - get the next element in list 389 389 * @pos: the type * to cursor 390 - * @member: the name of the list_struct within the struct. 390 + * @member: the name of the list_head within the struct. 391 391 */ 392 392 #define list_next_entry(pos, member) \ 393 393 list_entry((pos)->member.next, typeof(*(pos)), member) ··· 395 395 /** 396 396 * list_prev_entry - get the prev element in list 397 397 * @pos: the type * to cursor 398 - * @member: the name of the list_struct within the struct. 398 + * @member: the name of the list_head within the struct. 399 399 */ 400 400 #define list_prev_entry(pos, member) \ 401 401 list_entry((pos)->member.prev, typeof(*(pos)), member) ··· 441 441 * list_for_each_entry - iterate over list of given type 442 442 * @pos: the type * to use as a loop cursor. 443 443 * @head: the head for your list. 444 - * @member: the name of the list_struct within the struct. 444 + * @member: the name of the list_head within the struct. 445 445 */ 446 446 #define list_for_each_entry(pos, head, member) \ 447 447 for (pos = list_first_entry(head, typeof(*pos), member); \ ··· 452 452 * list_for_each_entry_reverse - iterate backwards over list of given type. 453 453 * @pos: the type * to use as a loop cursor. 454 454 * @head: the head for your list. 455 - * @member: the name of the list_struct within the struct. 455 + * @member: the name of the list_head within the struct. 456 456 */ 457 457 #define list_for_each_entry_reverse(pos, head, member) \ 458 458 for (pos = list_last_entry(head, typeof(*pos), member); \ ··· 463 463 * list_prepare_entry - prepare a pos entry for use in list_for_each_entry_continue() 464 464 * @pos: the type * to use as a start point 465 465 * @head: the head of the list 466 - * @member: the name of the list_struct within the struct. 466 + * @member: the name of the list_head within the struct. 467 467 * 468 468 * Prepares a pos entry for use as a start point in list_for_each_entry_continue(). 469 469 */ ··· 474 474 * list_for_each_entry_continue - continue iteration over list of given type 475 475 * @pos: the type * to use as a loop cursor. 476 476 * @head: the head for your list. 477 - * @member: the name of the list_struct within the struct. 477 + * @member: the name of the list_head within the struct. 478 478 * 479 479 * Continue to iterate over list of given type, continuing after 480 480 * the current position. ··· 488 488 * list_for_each_entry_continue_reverse - iterate backwards from the given point 489 489 * @pos: the type * to use as a loop cursor. 490 490 * @head: the head for your list. 491 - * @member: the name of the list_struct within the struct. 491 + * @member: the name of the list_head within the struct. 492 492 * 493 493 * Start to iterate over list of given type backwards, continuing after 494 494 * the current position. ··· 502 502 * list_for_each_entry_from - iterate over list of given type from the current point 503 503 * @pos: the type * to use as a loop cursor. 504 504 * @head: the head for your list. 505 - * @member: the name of the list_struct within the struct. 505 + * @member: the name of the list_head within the struct. 506 506 * 507 507 * Iterate over list of given type, continuing from current position. 508 508 */ ··· 515 515 * @pos: the type * to use as a loop cursor. 516 516 * @n: another type * to use as temporary storage 517 517 * @head: the head for your list. 518 - * @member: the name of the list_struct within the struct. 518 + * @member: the name of the list_head within the struct. 519 519 */ 520 520 #define list_for_each_entry_safe(pos, n, head, member) \ 521 521 for (pos = list_first_entry(head, typeof(*pos), member), \ ··· 528 528 * @pos: the type * to use as a loop cursor. 529 529 * @n: another type * to use as temporary storage 530 530 * @head: the head for your list. 531 - * @member: the name of the list_struct within the struct. 531 + * @member: the name of the list_head within the struct. 532 532 * 533 533 * Iterate over list of given type, continuing after current point, 534 534 * safe against removal of list entry. ··· 544 544 * @pos: the type * to use as a loop cursor. 545 545 * @n: another type * to use as temporary storage 546 546 * @head: the head for your list. 547 - * @member: the name of the list_struct within the struct. 547 + * @member: the name of the list_head within the struct. 548 548 * 549 549 * Iterate over list of given type from current point, safe against 550 550 * removal of list entry. ··· 559 559 * @pos: the type * to use as a loop cursor. 560 560 * @n: another type * to use as temporary storage 561 561 * @head: the head for your list. 562 - * @member: the name of the list_struct within the struct. 562 + * @member: the name of the list_head within the struct. 563 563 * 564 564 * Iterate backwards over list of given type, safe against removal 565 565 * of list entry. ··· 574 574 * list_safe_reset_next - reset a stale list_for_each_entry_safe loop 575 575 * @pos: the loop cursor used in the list_for_each_entry_safe loop 576 576 * @n: temporary storage used in list_for_each_entry_safe 577 - * @member: the name of the list_struct within the struct. 577 + * @member: the name of the list_head within the struct. 578 578 * 579 579 * list_safe_reset_next is not safe to use in general if the list may be 580 580 * modified concurrently (eg. the lock is dropped in the loop body). An
+5 -5
include/linux/plist.h
··· 176 176 * plist_for_each_entry - iterate over list of given type 177 177 * @pos: the type * to use as a loop counter 178 178 * @head: the head for your list 179 - * @mem: the name of the list_struct within the struct 179 + * @mem: the name of the list_head within the struct 180 180 */ 181 181 #define plist_for_each_entry(pos, head, mem) \ 182 182 list_for_each_entry(pos, &(head)->node_list, mem.node_list) ··· 185 185 * plist_for_each_entry_continue - continue iteration over list of given type 186 186 * @pos: the type * to use as a loop cursor 187 187 * @head: the head for your list 188 - * @m: the name of the list_struct within the struct 188 + * @m: the name of the list_head within the struct 189 189 * 190 190 * Continue to iterate over list of given type, continuing after 191 191 * the current position. ··· 198 198 * @pos: the type * to use as a loop counter 199 199 * @n: another type * to use as temporary storage 200 200 * @head: the head for your list 201 - * @m: the name of the list_struct within the struct 201 + * @m: the name of the list_head within the struct 202 202 * 203 203 * Iterate over list of given type, safe against removal of list entry. 204 204 */ ··· 229 229 * plist_first_entry - get the struct for the first entry 230 230 * @head: the &struct plist_head pointer 231 231 * @type: the type of the struct this is embedded in 232 - * @member: the name of the list_struct within the struct 232 + * @member: the name of the list_head within the struct 233 233 */ 234 234 #ifdef CONFIG_DEBUG_PI_LIST 235 235 # define plist_first_entry(head, type, member) \ ··· 246 246 * plist_last_entry - get the struct for the last entry 247 247 * @head: the &struct plist_head pointer 248 248 * @type: the type of the struct this is embedded in 249 - * @member: the name of the list_struct within the struct 249 + * @member: the name of the list_head within the struct 250 250 */ 251 251 #ifdef CONFIG_DEBUG_PI_LIST 252 252 # define plist_last_entry(head, type, member) \
+4 -4
include/linux/rculist.h
··· 241 241 * list_entry_rcu - get the struct for this entry 242 242 * @ptr: the &struct list_head pointer. 243 243 * @type: the type of the struct this is embedded in. 244 - * @member: the name of the list_struct within the struct. 244 + * @member: the name of the list_head within the struct. 245 245 * 246 246 * This primitive may safely run concurrently with the _rcu list-mutation 247 247 * primitives such as list_add_rcu() as long as it's guarded by rcu_read_lock(). ··· 278 278 * list_first_or_null_rcu - get the first element from a list 279 279 * @ptr: the list head to take the element from. 280 280 * @type: the type of the struct this is embedded in. 281 - * @member: the name of the list_struct within the struct. 281 + * @member: the name of the list_head within the struct. 282 282 * 283 283 * Note that if the list is empty, it returns NULL. 284 284 * ··· 296 296 * list_for_each_entry_rcu - iterate over rcu list of given type 297 297 * @pos: the type * to use as a loop cursor. 298 298 * @head: the head for your list. 299 - * @member: the name of the list_struct within the struct. 299 + * @member: the name of the list_head within the struct. 300 300 * 301 301 * This list-traversal primitive may safely run concurrently with 302 302 * the _rcu list-mutation primitives such as list_add_rcu() ··· 311 311 * list_for_each_entry_continue_rcu - continue iteration over list of given type 312 312 * @pos: the type * to use as a loop cursor. 313 313 * @head: the head for your list. 314 - * @member: the name of the list_struct within the struct. 314 + * @member: the name of the list_head within the struct. 315 315 * 316 316 * Continue to iterate over list of given type, continuing after 317 317 * the current position.
+3 -3
scripts/kconfig/list.h
··· 34 34 * list_entry - get the struct for this entry 35 35 * @ptr: the &struct list_head pointer. 36 36 * @type: the type of the struct this is embedded in. 37 - * @member: the name of the list_struct within the struct. 37 + * @member: the name of the list_head within the struct. 38 38 */ 39 39 #define list_entry(ptr, type, member) \ 40 40 container_of(ptr, type, member) ··· 43 43 * list_for_each_entry - iterate over list of given type 44 44 * @pos: the type * to use as a loop cursor. 45 45 * @head: the head for your list. 46 - * @member: the name of the list_struct within the struct. 46 + * @member: the name of the list_head within the struct. 47 47 */ 48 48 #define list_for_each_entry(pos, head, member) \ 49 49 for (pos = list_entry((head)->next, typeof(*pos), member); \ ··· 55 55 * @pos: the type * to use as a loop cursor. 56 56 * @n: another type * to use as temporary storage 57 57 * @head: the head for your list. 58 - * @member: the name of the list_struct within the struct. 58 + * @member: the name of the list_head within the struct. 59 59 */ 60 60 #define list_for_each_entry_safe(pos, n, head, member) \ 61 61 for (pos = list_entry((head)->next, typeof(*pos), member), \
+1 -1
tools/usb/usbip/libsrc/list.h
··· 98 98 * list_entry - get the struct for this entry 99 99 * @ptr: the &struct list_head pointer. 100 100 * @type: the type of the struct this is embedded in. 101 - * @member: the name of the list_struct within the struct. 101 + * @member: the name of the list_head within the struct. 102 102 */ 103 103 #define list_entry(ptr, type, member) \ 104 104 container_of(ptr, type, member)