aboutsummaryrefslogtreecommitdiffstats
path: root/tools/perf/scripts/python/Perf-Trace-Util
ModeNameSize
-rw-r--r--Context.c2630logstatsplainblame
d---------lib / Perf / Trace31logstatsplain
Torvalds <torvalds@linux-foundation.org> 2009-07-29 22:10:36 -0400 lib: flexible array implementation' href='/cgit/cgit.cgi/litmus-rt-pandaboard.git/commit/lib/flex_array.c?id=534acc057b5a08ec33fa57cdd2f5a09ef124e7f2'>534acc057b5
45b588d6e5c
534acc057b5








b62e408c052

534acc057b5
b62e408c052
534acc057b5
45b588d6e5c

534acc057b5







19da3dd157f
534acc057b5

19da3dd157f


534acc057b5






fc0d8d944df
534acc057b5

fc0d8d944df


534acc057b5






b62e408c052

534acc057b5








a30b595d2ca
534acc057b5
a30b595d2ca


534acc057b5





e6de3988aa5
fc0d8d944df
e6de3988aa5



















19da3dd157f
e6de3988aa5



534acc057b5
fc0d8d944df
534acc057b5

fc0d8d944df
534acc057b5







b62e408c052

534acc057b5





















fc0d8d944df
534acc057b5







b62e408c052
534acc057b5


534acc057b5


534acc057b5

a30b595d2ca
534acc057b5
a30b595d2ca


534acc057b5

4af5a2f770c












fc0d8d944df
4af5a2f770c








4af5a2f770c




45b588d6e5c
4af5a2f770c










1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327





























                                                                             








                                                                 
                                                    







                                                                      
                                                                   



































                                                                    

                                                                         

                               

                                                                           








                                                                
                                                               
                                                       
                                                                            


                   

                                                                
 
                                                                           



                                                           
                                                       






                                                                 


                                     
                                                                       








                                           

                                                                
 
                                 
 

                                                                               







                                                              
                                                                      

                                    


                                                                






                                                           
                                                

                                                        


                                                                






                                                      

                                                                             








                                                               
              
                                                         


                                       





                                                                 
                                                           
                                              



















                                                                    
                                                       



                 
                                                          
                                                             

                                                                              
                                     







                                                                

                                                                  





















                                                                           
                                                         







                                                              
                                                                    


                                                            


                                                

                                                               
              
                                          


                                    

                                                                  












                                                            
                                        








                                                             




                                     
                                                                         










                                                  
/*
 * Flexible array managed in PAGE_SIZE parts
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 *
 * Copyright IBM Corporation, 2009
 *
 * Author: Dave Hansen <dave@linux.vnet.ibm.com>
 */

#include <linux/flex_array.h>
#include <linux/slab.h>
#include <linux/stddef.h>

struct flex_array_part {
	char elements[FLEX_ARRAY_PART_SIZE];
};

/*
 * If a user requests an allocation which is small
 * enough, we may simply use the space in the
 * flex_array->parts[] array to store the user
 * data.
 */
static inline int elements_fit_in_base(struct flex_array *fa)
{
	int data_size = fa->element_size * fa->total_nr_elements;
	if (data_size <= FLEX_ARRAY_BASE_BYTES_LEFT)
		return 1;
	return 0;
}

/**
 * flex_array_alloc - allocate a new flexible array
 * @element_size:	the size of individual elements in the array
 * @total:		total number of elements that this should hold
 * @flags:		page allocation flags to use for base array
 *
 * Note: all locking must be provided by the caller.
 *
 * @total is used to size internal structures.  If the user ever
 * accesses any array indexes >=@total, it will produce errors.
 *
 * The maximum number of elements is defined as: the number of
 * elements that can be stored in a page times the number of
 * page pointers that we can fit in the base structure or (using
 * integer math):
 *
 * 	(PAGE_SIZE/element_size) * (PAGE_SIZE-8)/sizeof(void *)
 *
 * Here's a table showing example capacities.  Note that the maximum
 * index that the get/put() functions is just nr_objects-1.   This
 * basically means that you get 4MB of storage on 32-bit and 2MB on
 * 64-bit.
 *
 *
 * Element size | Objects | Objects |
 * PAGE_SIZE=4k |  32-bit |  64-bit |