Home
last modified time | relevance | path

Searched refs:next_free (Results 1 – 20 of 20) sorted by relevance

/external/libdrm/intel/
Dmm.c48 for (p = heap->next_free; p != heap; p = p->next_free) { in mmDumpMemInfo()
77 heap->next_free = block; in mmInit()
83 block->next_free = heap; in mmInit()
115 newblock->next_free = p->next_free; in SliceBlock()
117 p->next_free->prev_free = newblock; in SliceBlock()
118 p->next_free = newblock; in SliceBlock()
140 newblock->next_free = p->next_free; in SliceBlock()
142 p->next_free->prev_free = newblock; in SliceBlock()
143 p->next_free = newblock; in SliceBlock()
153 p->next_free->prev_free = p->prev_free; in SliceBlock()
[all …]
Dmm.h36 struct mem_block *next_free, *prev_free; member
/external/mesa3d/src/util/
Du_mm.c58 for (p = heap->next_free; p != heap; p = p->next_free) { in u_mmDumpMemInfo()
89 heap->next_free = block; in u_mmInit()
95 block->next_free = heap; in u_mmInit()
128 newblock->next_free = p->next_free; in SliceBlock()
130 p->next_free->prev_free = newblock; in SliceBlock()
131 p->next_free = newblock; in SliceBlock()
152 newblock->next_free = p->next_free; in SliceBlock()
154 p->next_free->prev_free = newblock; in SliceBlock()
155 p->next_free = newblock; in SliceBlock()
165 p->next_free->prev_free = p->prev_free; in SliceBlock()
[all …]
Du_mm.h39 struct mem_block *next_free, *prev_free; member
/external/tensorflow/tensorflow/lite/micro/memory_planner/
Dgreedy_memory_planner.cc47 unsigned char* next_free = scratch_buffer; in GreedyMemoryPlanner() local
48 requirements_ = reinterpret_cast<BufferRequirements*>(next_free); in GreedyMemoryPlanner()
49 next_free += sizeof(BufferRequirements) * max_buffer_count_; in GreedyMemoryPlanner()
51 buffer_sizes_sorted_ = reinterpret_cast<int*>(next_free); in GreedyMemoryPlanner()
52 next_free += sizeof(int) * max_buffer_count_; in GreedyMemoryPlanner()
54 buffer_ids_sorted_ = reinterpret_cast<int*>(next_free); in GreedyMemoryPlanner()
55 next_free += sizeof(int) * max_buffer_count_; in GreedyMemoryPlanner()
57 buffers_sorted_by_offset_ = reinterpret_cast<ListEntry*>(next_free); in GreedyMemoryPlanner()
58 next_free += sizeof(ListEntry) * max_buffer_count_; in GreedyMemoryPlanner()
60 buffer_offsets_ = reinterpret_cast<int*>(next_free); in GreedyMemoryPlanner()
/external/grpc-grpc/src/core/lib/iomgr/
Dwakeup_fd_cv.cc53 g_cvfds.cvfds[i].next_free = g_cvfds.free_fds; in cv_fd_init()
60 g_cvfds.free_fds = g_cvfds.free_fds->next_free; in cv_fd_init()
96 g_cvfds.cvfds[GRPC_FD_TO_IDX(fd_info->read_fd)].next_free = g_cvfds.free_fds; in cv_fd_destroy()
Dwakeup_fd_cv.h54 struct grpc_fd_node* next_free; member
Dev_poll_posix.cc1739 g_cvfds.cvfds[i].next_free = g_cvfds.free_fds;
/external/llvm-project/llvm/test/CodeGen/Thumb2/
D2009-08-04-ScavengerAssert.ll29 @next_free.4772 = external global i8** ; <i8***> [#uses=3]
259 store i8** %58, i8*** @next_free.4772, align 4
384 store i8** %78, i8*** @next_free.4772, align 4
402 store i8** %83, i8*** @next_free.4772, align 4
/external/llvm/test/CodeGen/Thumb2/
D2009-08-04-ScavengerAssert.ll29 @next_free.4772 = external global i8** ; <i8***> [#uses=3]
259 store i8** %58, i8*** @next_free.4772, align 4
384 store i8** %78, i8*** @next_free.4772, align 4
402 store i8** %83, i8*** @next_free.4772, align 4
/external/rust/crates/linked-hash-map/src/
Dlib.rs167 let next_free = (*free).next; in clear_free_list() localVariable
169 free = next_free; in clear_free_list()
/external/llvm-project/compiler-rt/lib/sanitizer_common/
Dsanitizer_platform_limits_posix.h871 char *next_free; member
Dsanitizer_platform_limits_posix.cpp1263 CHECK_SIZE_AND_OFFSET(obstack, next_free);
Dsanitizer_common_interceptors.inc6196 obstack->chunk, obstack->next_free - (char *)obstack->chunk);
/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_platform_limits_posix.h821 char *next_free; member
Dsanitizer_platform_limits_posix.cc1267 CHECK_SIZE_AND_OFFSET(obstack, next_free);
Dsanitizer_common_interceptors.inc5227 obstack->chunk, obstack->next_free - (char *)obstack->chunk);
/external/rust/crates/hashlink/src/
Dlinked_hash_map.rs2028 let next_free = some_free.as_ref().links.free.next; in drop_free_nodes() localVariable
2030 free = next_free; in drop_free_nodes()
/external/libabigail/tests/data/test-annotate/
Dtest21-pr19092.so.abi1299 <!-- char* obstack::next_free -->
1300 …<var-decl name='next_free' type-id='type-id-51' visibility='default' filepath='../.././gcc/../incl…
/external/libabigail/tests/data/test-read-dwarf/
Dtest21-pr19092.so.abi743 …<var-decl name='next_free' type-id='type-id-51' visibility='default' filepath='../.././gcc/../incl…