Blame view
fs/yaffs2/yaffs_allocator.c
8.15 KB
753ac6108 u-boot: Update ya... |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
/* * YAFFS: Yet Another Flash File System. A NAND-flash specific file system. * * Copyright (C) 2002-2011 Aleph One Ltd. * for Toby Churchill Ltd and Brightstar Engineering * * Created by Charles Manning <charles@aleph1.co.uk> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. */ #include "yaffs_allocator.h" #include "yaffs_guts.h" #include "yaffs_trace.h" #include "yportenv.h" |
61b29b826 dm: core: Require... |
18 |
#include <dm/devres.h> |
753ac6108 u-boot: Update ya... |
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 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 |
/* * Each entry in yaffs_tnode_list and yaffs_obj_list hold blocks * of approx 100 objects that are themn allocated singly. * This is basically a simplified slab allocator. * * We don't use the Linux slab allocator because slab does not allow * us to dump all the objects in one hit when we do a umount and tear * down all the tnodes and objects. slab requires that we first free * the individual objects. * * Once yaffs has been mainlined I shall try to motivate for a change * to slab to provide the extra features we need here. */ struct yaffs_tnode_list { struct yaffs_tnode_list *next; struct yaffs_tnode *tnodes; }; struct yaffs_obj_list { struct yaffs_obj_list *next; struct yaffs_obj *objects; }; struct yaffs_allocator { int n_tnodes_created; struct yaffs_tnode *free_tnodes; int n_free_tnodes; struct yaffs_tnode_list *alloc_tnode_list; int n_obj_created; struct list_head free_objs; int n_free_objects; struct yaffs_obj_list *allocated_obj_list; }; static void yaffs_deinit_raw_tnodes(struct yaffs_dev *dev) { struct yaffs_allocator *allocator = (struct yaffs_allocator *)dev->allocator; struct yaffs_tnode_list *tmp; if (!allocator) { BUG(); return; } while (allocator->alloc_tnode_list) { tmp = allocator->alloc_tnode_list->next; kfree(allocator->alloc_tnode_list->tnodes); kfree(allocator->alloc_tnode_list); allocator->alloc_tnode_list = tmp; } allocator->free_tnodes = NULL; allocator->n_free_tnodes = 0; allocator->n_tnodes_created = 0; } static void yaffs_init_raw_tnodes(struct yaffs_dev *dev) { struct yaffs_allocator *allocator = dev->allocator; if (!allocator) { BUG(); return; } allocator->alloc_tnode_list = NULL; allocator->free_tnodes = NULL; allocator->n_free_tnodes = 0; allocator->n_tnodes_created = 0; } static int yaffs_create_tnodes(struct yaffs_dev *dev, int n_tnodes) { struct yaffs_allocator *allocator = (struct yaffs_allocator *)dev->allocator; int i; struct yaffs_tnode *new_tnodes; u8 *mem; struct yaffs_tnode *curr; struct yaffs_tnode *next; struct yaffs_tnode_list *tnl; if (!allocator) { BUG(); return YAFFS_FAIL; } if (n_tnodes < 1) return YAFFS_OK; /* make these things */ new_tnodes = kmalloc(n_tnodes * dev->tnode_size, GFP_NOFS); mem = (u8 *) new_tnodes; if (!new_tnodes) { yaffs_trace(YAFFS_TRACE_ERROR, "yaffs: Could not allocate Tnodes"); return YAFFS_FAIL; } /* New hookup for wide tnodes */ for (i = 0; i < n_tnodes - 1; i++) { curr = (struct yaffs_tnode *)&mem[i * dev->tnode_size]; next = (struct yaffs_tnode *)&mem[(i + 1) * dev->tnode_size]; curr->internal[0] = next; } curr = (struct yaffs_tnode *)&mem[(n_tnodes - 1) * dev->tnode_size]; curr->internal[0] = allocator->free_tnodes; allocator->free_tnodes = (struct yaffs_tnode *)mem; allocator->n_free_tnodes += n_tnodes; allocator->n_tnodes_created += n_tnodes; /* Now add this bunch of tnodes to a list for freeing up. * NB If we can't add this to the management list it isn't fatal * but it just means we can't free this bunch of tnodes later. */ tnl = kmalloc(sizeof(struct yaffs_tnode_list), GFP_NOFS); if (!tnl) { yaffs_trace(YAFFS_TRACE_ERROR, "Could not add tnodes to management list"); return YAFFS_FAIL; } else { tnl->tnodes = new_tnodes; tnl->next = allocator->alloc_tnode_list; allocator->alloc_tnode_list = tnl; } yaffs_trace(YAFFS_TRACE_ALLOCATE, "Tnodes added"); return YAFFS_OK; } struct yaffs_tnode *yaffs_alloc_raw_tnode(struct yaffs_dev *dev) { struct yaffs_allocator *allocator = (struct yaffs_allocator *)dev->allocator; struct yaffs_tnode *tn = NULL; if (!allocator) { BUG(); return NULL; } /* If there are none left make more */ if (!allocator->free_tnodes) yaffs_create_tnodes(dev, YAFFS_ALLOCATION_NTNODES); if (allocator->free_tnodes) { tn = allocator->free_tnodes; allocator->free_tnodes = allocator->free_tnodes->internal[0]; allocator->n_free_tnodes--; } return tn; } /* FreeTnode frees up a tnode and puts it back on the free list */ void yaffs_free_raw_tnode(struct yaffs_dev *dev, struct yaffs_tnode *tn) { struct yaffs_allocator *allocator = dev->allocator; if (!allocator) { BUG(); return; } if (tn) { tn->internal[0] = allocator->free_tnodes; allocator->free_tnodes = tn; allocator->n_free_tnodes++; } dev->checkpoint_blocks_required = 0; /* force recalculation */ } /*--------------- yaffs_obj alloaction ------------------------ * * Free yaffs_objs are stored in a list using obj->siblings. * The blocks of allocated objects are stored in a linked list. */ static void yaffs_init_raw_objs(struct yaffs_dev *dev) { struct yaffs_allocator *allocator = dev->allocator; if (!allocator) { BUG(); return; } allocator->allocated_obj_list = NULL; INIT_LIST_HEAD(&allocator->free_objs); allocator->n_free_objects = 0; } static void yaffs_deinit_raw_objs(struct yaffs_dev *dev) { struct yaffs_allocator *allocator = dev->allocator; struct yaffs_obj_list *tmp; if (!allocator) { BUG(); return; } while (allocator->allocated_obj_list) { tmp = allocator->allocated_obj_list->next; kfree(allocator->allocated_obj_list->objects); kfree(allocator->allocated_obj_list); allocator->allocated_obj_list = tmp; } INIT_LIST_HEAD(&allocator->free_objs); allocator->n_free_objects = 0; allocator->n_obj_created = 0; } static int yaffs_create_free_objs(struct yaffs_dev *dev, int n_obj) { struct yaffs_allocator *allocator = dev->allocator; int i; struct yaffs_obj *new_objs; struct yaffs_obj_list *list; if (!allocator) { BUG(); return YAFFS_FAIL; } if (n_obj < 1) return YAFFS_OK; /* make these things */ new_objs = kmalloc(n_obj * sizeof(struct yaffs_obj), GFP_NOFS); list = kmalloc(sizeof(struct yaffs_obj_list), GFP_NOFS); if (!new_objs || !list) { kfree(new_objs); new_objs = NULL; kfree(list); list = NULL; yaffs_trace(YAFFS_TRACE_ALLOCATE, "Could not allocate more objects"); return YAFFS_FAIL; } /* Hook them into the free list */ for (i = 0; i < n_obj; i++) list_add(&new_objs[i].siblings, &allocator->free_objs); allocator->n_free_objects += n_obj; allocator->n_obj_created += n_obj; /* Now add this bunch of Objects to a list for freeing up. */ list->objects = new_objs; list->next = allocator->allocated_obj_list; allocator->allocated_obj_list = list; return YAFFS_OK; } struct yaffs_obj *yaffs_alloc_raw_obj(struct yaffs_dev *dev) { struct yaffs_obj *obj = NULL; struct list_head *lh; struct yaffs_allocator *allocator = dev->allocator; if (!allocator) { BUG(); return obj; } /* If there are none left make more */ if (list_empty(&allocator->free_objs)) yaffs_create_free_objs(dev, YAFFS_ALLOCATION_NOBJECTS); if (!list_empty(&allocator->free_objs)) { lh = allocator->free_objs.next; obj = list_entry(lh, struct yaffs_obj, siblings); list_del_init(lh); allocator->n_free_objects--; } return obj; } void yaffs_free_raw_obj(struct yaffs_dev *dev, struct yaffs_obj *obj) { struct yaffs_allocator *allocator = dev->allocator; if (!allocator) { BUG(); return; } /* Link into the free list. */ list_add(&obj->siblings, &allocator->free_objs); allocator->n_free_objects++; } void yaffs_deinit_raw_tnodes_and_objs(struct yaffs_dev *dev) { if (!dev->allocator) { BUG(); return; } yaffs_deinit_raw_tnodes(dev); yaffs_deinit_raw_objs(dev); kfree(dev->allocator); dev->allocator = NULL; } void yaffs_init_raw_tnodes_and_objs(struct yaffs_dev *dev) { struct yaffs_allocator *allocator; if (dev->allocator) { BUG(); return; } allocator = kmalloc(sizeof(struct yaffs_allocator), GFP_NOFS); if (allocator) { dev->allocator = allocator; yaffs_init_raw_tnodes(dev); yaffs_init_raw_objs(dev); } } |