|
@@ -318,17 +318,24 @@ int release_resource(struct resource *old)
|
|
|
|
|
|
EXPORT_SYMBOL(release_resource);
|
|
|
|
|
|
-/*
|
|
|
- * Finds the lowest iomem resource that covers part of [start..end]. The
|
|
|
- * caller must specify start, end, flags, and desc (which may be
|
|
|
+/**
|
|
|
+ * Finds the lowest iomem resource that covers part of [@start..@end]. The
|
|
|
+ * caller must specify @start, @end, @flags, and @desc (which may be
|
|
|
* IORES_DESC_NONE).
|
|
|
*
|
|
|
- * If a resource is found, returns 0 and *res is overwritten with the part
|
|
|
- * of the resource that's within [start..end]; if none is found, returns
|
|
|
- * -1. Returns -EINVAL for other invalid parameters.
|
|
|
+ * If a resource is found, returns 0 and @*res is overwritten with the part
|
|
|
+ * of the resource that's within [@start..@end]; if none is found, returns
|
|
|
+ * -1 or -EINVAL for other invalid parameters.
|
|
|
*
|
|
|
* This function walks the whole tree and not just first level children
|
|
|
* unless @first_lvl is true.
|
|
|
+ *
|
|
|
+ * @start: start address of the resource searched for
|
|
|
+ * @end: end address of same resource
|
|
|
+ * @flags: flags which the resource must have
|
|
|
+ * @desc: descriptor the resource must have
|
|
|
+ * @first_lvl: walk only the first level children, if set
|
|
|
+ * @res: return ptr, if resource found
|
|
|
*/
|
|
|
static int find_next_iomem_res(resource_size_t start, resource_size_t end,
|
|
|
unsigned long flags, unsigned long desc,
|
|
@@ -390,9 +397,7 @@ static int __walk_iomem_res_desc(resource_size_t start, resource_size_t end,
|
|
|
}
|
|
|
|
|
|
/**
|
|
|
- * walk_iomem_res_desc - walk through iomem resources
|
|
|
- *
|
|
|
- * Walks through iomem resources and calls @func() with matching resource
|
|
|
+ * Walks through iomem resources and calls func() with matching resource
|
|
|
* ranges. This walks through whole tree and not just first level children.
|
|
|
* All the memory ranges which overlap start,end and also match flags and
|
|
|
* desc are valid candidates.
|