diff options
author | Eric Paris <eparis@redhat.com> | 2011-04-28 15:55:52 -0400 |
---|---|---|
committer | Eric Paris <eparis@redhat.com> | 2011-04-28 15:56:06 -0400 |
commit | 5a3ea8782c63d3501cb764c176f153c0d9a400e1 (patch) | |
tree | 3ff57105c8c3f3ad696b29511d1cf69f434caeab | |
parent | 562abf624175e3f8487b7f064e516805e437e597 (diff) |
flex_array: flex_array_prealloc takes a number of elements, not an end
Change flex_array_prealloc to take the number of elements for which space
should be allocated instead of the last (inclusive) element. Users
and documentation are updated accordingly. flex_arrays got introduced before
they had users. When folks started using it, they ended up needing a
different API than was coded up originally. This swaps over to the API that
folks apparently need.
Based-on-patch-by: Steffen Klassert <steffen.klassert@secunet.com>
Signed-off-by: Eric Paris <eparis@redhat.com>
Tested-by: Chris Richards <gizmo@giz-works.com>
Acked-by: Dave Hansen <dave@linux.vnet.ibm.com>
Cc: stable@kernel.org [2.6.38+]
-rw-r--r-- | Documentation/flexible-arrays.txt | 4 | ||||
-rw-r--r-- | include/linux/flex_array.h | 2 | ||||
-rw-r--r-- | lib/flex_array.c | 13 | ||||
-rw-r--r-- | security/selinux/ss/policydb.c | 6 |
4 files changed, 14 insertions, 11 deletions
diff --git a/Documentation/flexible-arrays.txt b/Documentation/flexible-arrays.txt index cb8a3a00cc92..df904aec9904 100644 --- a/Documentation/flexible-arrays.txt +++ b/Documentation/flexible-arrays.txt | |||
@@ -66,10 +66,10 @@ trick is to ensure that any needed memory allocations are done before | |||
66 | entering atomic context, using: | 66 | entering atomic context, using: |
67 | 67 | ||
68 | int flex_array_prealloc(struct flex_array *array, unsigned int start, | 68 | int flex_array_prealloc(struct flex_array *array, unsigned int start, |
69 | unsigned int end, gfp_t flags); | 69 | unsigned int nr_elements, gfp_t flags); |
70 | 70 | ||
71 | This function will ensure that memory for the elements indexed in the range | 71 | This function will ensure that memory for the elements indexed in the range |
72 | defined by start and end has been allocated. Thereafter, a | 72 | defined by start and nr_elements has been allocated. Thereafter, a |
73 | flex_array_put() call on an element in that range is guaranteed not to | 73 | flex_array_put() call on an element in that range is guaranteed not to |
74 | block. | 74 | block. |
75 | 75 | ||
diff --git a/include/linux/flex_array.h b/include/linux/flex_array.h index 70e4efabe0fb..ebeb2f3ad068 100644 --- a/include/linux/flex_array.h +++ b/include/linux/flex_array.h | |||
@@ -61,7 +61,7 @@ struct flex_array { | |||
61 | struct flex_array *flex_array_alloc(int element_size, unsigned int total, | 61 | struct flex_array *flex_array_alloc(int element_size, unsigned int total, |
62 | gfp_t flags); | 62 | gfp_t flags); |
63 | int flex_array_prealloc(struct flex_array *fa, unsigned int start, | 63 | int flex_array_prealloc(struct flex_array *fa, unsigned int start, |
64 | unsigned int end, gfp_t flags); | 64 | unsigned int nr_elements, gfp_t flags); |
65 | void flex_array_free(struct flex_array *fa); | 65 | void flex_array_free(struct flex_array *fa); |
66 | void flex_array_free_parts(struct flex_array *fa); | 66 | void flex_array_free_parts(struct flex_array *fa); |
67 | int flex_array_put(struct flex_array *fa, unsigned int element_nr, void *src, | 67 | int flex_array_put(struct flex_array *fa, unsigned int element_nr, void *src, |
diff --git a/lib/flex_array.c b/lib/flex_array.c index c0ea40ba2082..0c33b24498ba 100644 --- a/lib/flex_array.c +++ b/lib/flex_array.c | |||
@@ -232,10 +232,10 @@ EXPORT_SYMBOL(flex_array_clear); | |||
232 | 232 | ||
233 | /** | 233 | /** |
234 | * flex_array_prealloc - guarantee that array space exists | 234 | * flex_array_prealloc - guarantee that array space exists |
235 | * @fa: the flex array for which to preallocate parts | 235 | * @fa: the flex array for which to preallocate parts |
236 | * @start: index of first array element for which space is allocated | 236 | * @start: index of first array element for which space is allocated |
237 | * @end: index of last (inclusive) element for which space is allocated | 237 | * @nr_elements: number of elements for which space is allocated |
238 | * @flags: page allocation flags | 238 | * @flags: page allocation flags |
239 | * | 239 | * |
240 | * This will guarantee that no future calls to flex_array_put() | 240 | * This will guarantee that no future calls to flex_array_put() |
241 | * will allocate memory. It can be used if you are expecting to | 241 | * will allocate memory. It can be used if you are expecting to |
@@ -245,13 +245,16 @@ EXPORT_SYMBOL(flex_array_clear); | |||
245 | * Locking must be provided by the caller. | 245 | * Locking must be provided by the caller. |
246 | */ | 246 | */ |
247 | int flex_array_prealloc(struct flex_array *fa, unsigned int start, | 247 | int flex_array_prealloc(struct flex_array *fa, unsigned int start, |
248 | unsigned int end, gfp_t flags) | 248 | unsigned int nr_elements, gfp_t flags) |
249 | { | 249 | { |
250 | int start_part; | 250 | int start_part; |
251 | int end_part; | 251 | int end_part; |
252 | int part_nr; | 252 | int part_nr; |
253 | unsigned int end; | ||
253 | struct flex_array_part *part; | 254 | struct flex_array_part *part; |
254 | 255 | ||
256 | end = start + nr_elements - 1; | ||
257 | |||
255 | if (start >= fa->total_nr_elements || end >= fa->total_nr_elements) | 258 | if (start >= fa->total_nr_elements || end >= fa->total_nr_elements) |
256 | return -ENOSPC; | 259 | return -ENOSPC; |
257 | if (elements_fit_in_base(fa)) | 260 | if (elements_fit_in_base(fa)) |
diff --git a/security/selinux/ss/policydb.c b/security/selinux/ss/policydb.c index 549120c56edd..102e9ec1b77a 100644 --- a/security/selinux/ss/policydb.c +++ b/security/selinux/ss/policydb.c | |||
@@ -545,7 +545,7 @@ static int policydb_index(struct policydb *p) | |||
545 | goto out; | 545 | goto out; |
546 | 546 | ||
547 | rc = flex_array_prealloc(p->type_val_to_struct_array, 0, | 547 | rc = flex_array_prealloc(p->type_val_to_struct_array, 0, |
548 | p->p_types.nprim - 1, GFP_KERNEL | __GFP_ZERO); | 548 | p->p_types.nprim, GFP_KERNEL | __GFP_ZERO); |
549 | if (rc) | 549 | if (rc) |
550 | goto out; | 550 | goto out; |
551 | 551 | ||
@@ -562,7 +562,7 @@ static int policydb_index(struct policydb *p) | |||
562 | goto out; | 562 | goto out; |
563 | 563 | ||
564 | rc = flex_array_prealloc(p->sym_val_to_name[i], | 564 | rc = flex_array_prealloc(p->sym_val_to_name[i], |
565 | 0, p->symtab[i].nprim - 1, | 565 | 0, p->symtab[i].nprim, |
566 | GFP_KERNEL | __GFP_ZERO); | 566 | GFP_KERNEL | __GFP_ZERO); |
567 | if (rc) | 567 | if (rc) |
568 | goto out; | 568 | goto out; |
@@ -2439,7 +2439,7 @@ int policydb_read(struct policydb *p, void *fp) | |||
2439 | goto bad; | 2439 | goto bad; |
2440 | 2440 | ||
2441 | /* preallocate so we don't have to worry about the put ever failing */ | 2441 | /* preallocate so we don't have to worry about the put ever failing */ |
2442 | rc = flex_array_prealloc(p->type_attr_map_array, 0, p->p_types.nprim - 1, | 2442 | rc = flex_array_prealloc(p->type_attr_map_array, 0, p->p_types.nprim, |
2443 | GFP_KERNEL | __GFP_ZERO); | 2443 | GFP_KERNEL | __GFP_ZERO); |
2444 | if (rc) | 2444 | if (rc) |
2445 | goto bad; | 2445 | goto bad; |