Searched refs:heaps (Results 1 - 18 of 18) sorted by relevance

/linux-4.1.27/drivers/staging/android/ion/tegra/
H A Dtegra_ion.c25 static struct ion_heap **heaps; variable in typeref:struct:ion_heap
35 heaps = devm_kzalloc(&pdev->dev, tegra_ion_probe()
43 /* create the heaps as specified in the board file */ tegra_ion_probe()
45 struct ion_platform_heap *heap_data = &pdata->heaps[i]; tegra_ion_probe()
47 heaps[i] = ion_heap_create(heap_data); tegra_ion_probe()
48 if (IS_ERR_OR_NULL(heaps[i])) { tegra_ion_probe()
49 err = PTR_ERR(heaps[i]); tegra_ion_probe()
52 ion_device_add_heap(idev, heaps[i]); tegra_ion_probe()
58 ion_heap_destroy(heaps[i]); tegra_ion_probe()
69 ion_heap_destroy(heaps[i]); tegra_ion_remove()
/linux-4.1.27/drivers/staging/android/ion/
H A Dion_dummy_driver.c29 static struct ion_heap **heaps; variable in typeref:struct:ion_heap
63 .heaps = dummy_heaps,
71 heaps = kcalloc(dummy_ion_pdata.nr, sizeof(struct ion_heap *), ion_dummy_init()
73 if (!heaps) ion_dummy_init()
97 struct ion_platform_heap *heap_data = &dummy_ion_pdata.heaps[i]; ion_dummy_init()
106 heaps[i] = ion_heap_create(heap_data); ion_dummy_init()
107 if (IS_ERR_OR_NULL(heaps[i])) { ion_dummy_init()
108 err = PTR_ERR(heaps[i]); ion_dummy_init()
111 ion_device_add_heap(idev, heaps[i]); ion_dummy_init()
116 ion_heap_destroy(heaps[i]); ion_dummy_init()
117 kfree(heaps); ion_dummy_init()
140 ion_heap_destroy(heaps[i]); ion_dummy_exit()
141 kfree(heaps); ion_dummy_exit()
H A Dion.h62 * struct ion_platform_data - array of platform heaps passed from board file
64 * @heaps: array of platform_heap structions
70 struct ion_platform_heap *heaps; member in struct:ion_platform_data
74 * ion_reserve() - reserve memory for ion heaps if applicable
78 * Calls memblock reserve to set aside memory for heaps that are
107 * @heap_id_mask: mask of heaps to allocate from, if multiple bits are set
108 * heaps will be tried in order from highest to lowest
114 * Allocate memory in one of the heaps provided in heap mask and return
H A Dion.c49 * @lock: rwsem protecting the tree of heaps and clients
50 * @heaps: list of all the heaps in the system
58 struct plist_head heaps; member in struct:ion_device
253 memory coming from the heaps is ready for dma, ie if it has a ion_buffer_create()
485 * traverse the list of heaps available in this system in priority ion_alloc()
488 * succeeded or all heaps have been tried ion_alloc()
496 plist_for_each_entry(heap, &dev->heaps, node) { ion_alloc()
1530 plist_add(&heap->node, &dev->heaps); ion_device_add_heap()
1590 idev->heaps_debug_root = debugfs_create_dir("heaps", idev->debug_root); ion_device_create()
1592 pr_err("ion: failed to create debugfs heaps directory.\n"); ion_device_create()
1606 plist_head_init(&idev->heaps); ion_device_create()
1615 /* XXX need to free the heaps and clients ? */ ion_device_destroy()
1624 if (data->heaps[i].size == 0) ion_reserve()
1627 if (data->heaps[i].base == 0) { ion_reserve()
1630 paddr = memblock_alloc_base(data->heaps[i].size, ion_reserve()
1631 data->heaps[i].align, ion_reserve()
1638 data->heaps[i].base = paddr; ion_reserve()
1640 int ret = memblock_reserve(data->heaps[i].base, ion_reserve()
1641 data->heaps[i].size); ion_reserve()
1644 data->heaps[i].size, ion_reserve()
1645 data->heaps[i].base); ion_reserve()
1648 data->heaps[i].name, ion_reserve()
1649 data->heaps[i].base, ion_reserve()
1650 data->heaps[i].size); ion_reserve()
H A Dion_priv.h95 * physically contiguous heaps)
127 * heap flags - flags between the heaps and core ion code
144 * @node: rb node to put the heap on the device's tree of heaps
309 * functions for creating and destroying the built in ion heaps.
311 * heaps as appropriate.
H A Dion_cma_heap.c183 /* get device from private heaps data, later it will be ion_cma_heap_create()
/linux-4.1.27/drivers/staging/android/uapi/
H A Dion.h26 * enum ion_heap_types - list of all possible types of heaps
33 * @ION_NUM_HEAPS: helper for iterating over heaps, a bit mask
34 * is used to identify the heaps, so only 32
43 ION_HEAP_TYPE_CUSTOM, /* must be last so device specific heaps always
57 * bits are reserved for use by the heaps themselves.
/linux-4.1.27/arch/arc/include/asm/
H A Dpage.h99 /* Default Permissions for stack/heaps pages (Non Executable) */
/linux-4.1.27/fs/ubifs/
H A Dfind.c25 * garbage collection. In general, lprops category heaps and lists are used
160 * finite-sized heaps. scan_for_dirty()
211 * dirty index heap, and it falls-back to LPT scanning if the heaps are empty
283 /* Look on the dirty and dirty index heaps */ ubifs_find_dirty_leb()
322 /* Did not find a dirty LEB on the dirty heaps, have to scan */ ubifs_find_dirty_leb()
443 * finite-sized heaps. do_find_free_space()
H A Dlprops.c26 * categories are stored as either heaps or lists to provide a fast way of
58 * parent's value is greater. In the case of LPT's category heaps, the value
96 * greater. In the case of LPT's category heaps, the value is either the amount
253 * the category heaps to those lprops must be updated to point to the new
353 * category lists and heaps must be replaced. This function does that.
860 * dbg_check_cats - check category heaps and lists.
H A Dlpt.c862 * update_cats - add LEB properties of a pnode to LEB category lists and heaps.
867 * by this function, to the LEB category lists and heaps.
884 * replace_cats - add LEB properties of a pnode to LEB category lists and heaps.
891 * category lists and heaps must be replaced. This function does that.
H A Dubifs.h450 * LPROPS_HEAP_CNT: number of heaps used for storing categorized LEBs
627 * There are %LPROPS_HEAP_CNT heaps.
1193 * @lpt_heap: array of heaps of categorized lprops
/linux-4.1.27/include/uapi/drm/
H A Dr128_drm.h83 /* There are 2 heaps (local/AGP). Each region within a heap is a
H A Dsavage_drm.h32 /* 2 heaps (1 for card, 1 for agp), each divided into up to 128
H A Dmga_drm.h110 /* 2 heaps (1 for card, 1 for agp), each divided into up to 128
H A Dradeon_drm.h313 /* There are 2 heaps (local/GART). Each region within a heap is a
/linux-4.1.27/arch/mips/include/asm/sn/
H A Dklconfig.h854 * Do we need to Mark off sepatate heaps for lboard_t, rboard_t, component,
/linux-4.1.27/lib/zlib_deflate/
H A Ddeftree.c580 * establish sub-heaps of increasing lengths: build_tree()

Completed in 394 milliseconds