|
@@ -540,9 +540,9 @@ int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
|
|
|
* __next_free_mem_range - next function for for_each_free_mem_range()
|
|
|
* @idx: pointer to u64 loop variable
|
|
|
* @nid: nid: node selector, %MAX_NUMNODES for all nodes
|
|
|
- * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL
|
|
|
- * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL
|
|
|
- * @p_nid: ptr to int for nid of the range, can be %NULL
|
|
|
+ * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
|
|
|
+ * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
|
|
|
+ * @out_nid: ptr to int for nid of the range, can be %NULL
|
|
|
*
|
|
|
* Find the first free area from *@idx which matches @nid, fill the out
|
|
|
* parameters, and update *@idx for the next iteration. The lower 32bit of
|
|
@@ -616,9 +616,9 @@ void __init_memblock __next_free_mem_range(u64 *idx, int nid,
|
|
|
* __next_free_mem_range_rev - next function for for_each_free_mem_range_reverse()
|
|
|
* @idx: pointer to u64 loop variable
|
|
|
* @nid: nid: node selector, %MAX_NUMNODES for all nodes
|
|
|
- * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL
|
|
|
- * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL
|
|
|
- * @p_nid: ptr to int for nid of the range, can be %NULL
|
|
|
+ * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
|
|
|
+ * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
|
|
|
+ * @out_nid: ptr to int for nid of the range, can be %NULL
|
|
|
*
|
|
|
* Reverse of __next_free_mem_range().
|
|
|
*/
|