Lines Matching refs:entry
116 struct dma_mem_node *entry)
120 entry->next = NULL;
121 entry->prev = NULL;
122 tree->root = entry;
127 struct dma_mem_node *node = mem_tree_find_nearest(tree, entry->paddr);
131 entry->prev = NULL;
132 entry->next = tree->root;
133 tree->root->prev = entry;
137 if (node->paddr <= entry->paddr) {
139 if ((node->paddr + node->size) >= (entry->paddr + entry->size)) {
146 node->next->prev = entry;
148 entry->prev = node;
149 entry->next = node->next;
150 node->next = entry;
268 struct dma_mem_node *entry = calloc(1, sizeof(*entry));
269 if (entry == NULL) {
273 entry->cap = cap;
274 entry->paddr = frame_id.base;
275 entry->size = frame_id.bytes;
278 entry->paddr = mem_mgr->convert(mem_mgr->convert_arg, frame_id.base,
279 entry->size);
281 frame_id.base, entry->paddr);
284 if ((entry->paddr == 0) || (entry->paddr < mem_mgr->range_min)
285 || ((entry->paddr + entry->size) > mem_mgr->range_max)) {
286 free(entry);
290 err = mem_tree_insert(&mem_mgr->regions, entry);
292 free(entry);
336 struct dma_mem_node *entry = mem_tree_remove(&mem_mgr->regions, addr);
337 if (entry) {
338 free(entry);
379 struct dma_mem_node *entry = mem_tree_lookup(&mem_mgr->regions, daddr, bytes);
380 if (entry) {