Home
last modified time | relevance | path

Searched refs:first_entry (Results 1 – 12 of 12) sorted by relevance

/external/e2fsprogs/ext2ed/
Dinode_com.c29 long group_num,group_offset,entry_num,block_num,first_entry,last_entry; in type_ext2_inode___prev() local
49 first_entry=0;last_entry=file_system_info.super_block.s_inodes_per_group-1; in type_ext2_inode___prev()
76 long group_num,group_offset,entry_num,block_num,first_entry,last_entry; in type_ext2_inode___next() local
97 first_entry=0;last_entry=file_system_info.super_block.s_inodes_per_group-1; in type_ext2_inode___next()
127 long group_num,group_offset,entry_num,block_num,first_entry,last_entry,inode_num; in type_ext2_inode___show() local
138 first_entry=0;last_entry=file_system_info.super_block.s_inodes_per_group-1; in type_ext2_inode___show()
276 if (entry_num==first_entry) { in type_ext2_inode___show()
403 long group_num,group_offset,entry_num,block_num,first_entry,last_entry,inode_num; in inode_offset_to_inode_num() local
414 first_entry=0;last_entry=file_system_info.super_block.s_inodes_per_group-1; in inode_offset_to_inode_num()
/external/kmod/libkmod/
Dlibkmod.h92 #define kmod_list_foreach(list_entry, first_entry) \ argument
93 for (list_entry = first_entry; \
95 list_entry = kmod_list_next(first_entry, list_entry))
97 #define kmod_list_foreach_reverse(list_entry, first_entry) \ argument
98 for (list_entry = kmod_list_last(first_entry); \
100 list_entry = kmod_list_prev(first_entry, list_entry))
Dlibkmod-internal.h74 #define kmod_list_foreach(list_entry, first_entry) \ argument
75 for (list_entry = ((first_entry) == NULL) ? NULL : (first_entry); \
77 list_entry = (list_entry->node.next == &((first_entry)->node)) ? NULL : \
81 #define kmod_list_foreach_reverse(list_entry, first_entry) \ argument
82 …for (list_entry = (((first_entry) == NULL) ? NULL : container_of(first_entry->node.prev, struct km…
84 list_entry = ((list_entry == first_entry) ? NULL : \
/external/llvm-project/llvm/lib/ExecutionEngine/
DGDBRegistrationListener.cpp44 struct jit_code_entry *first_entry; member
126 jit_code_entry* NextEntry = __jit_debug_descriptor.first_entry; in NotifyDebugger()
131 __jit_debug_descriptor.first_entry = JITCodeEntry; in NotifyDebugger()
210 assert(__jit_debug_descriptor.first_entry == JITCodeEntry); in deregisterObjectInternal()
211 __jit_debug_descriptor.first_entry = NextEntry; in deregisterObjectInternal()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/ExecutionEngine/
DGDBRegistrationListener.cpp44 struct jit_code_entry *first_entry; member
126 jit_code_entry* NextEntry = __jit_debug_descriptor.first_entry; in NotifyDebugger()
131 __jit_debug_descriptor.first_entry = JITCodeEntry; in NotifyDebugger()
210 assert(__jit_debug_descriptor.first_entry == JITCodeEntry); in deregisterObjectInternal()
211 __jit_debug_descriptor.first_entry = NextEntry; in deregisterObjectInternal()
/external/llvm/lib/ExecutionEngine/
DGDBRegistrationListener.cpp44 struct jit_code_entry *first_entry; member
136 jit_code_entry* NextEntry = __jit_debug_descriptor.first_entry; in NotifyDebugger()
141 __jit_debug_descriptor.first_entry = JITCodeEntry; in NotifyDebugger()
224 assert(__jit_debug_descriptor.first_entry == JITCodeEntry); in deregisterObjectInternal()
225 __jit_debug_descriptor.first_entry = NextEntry; in deregisterObjectInternal()
/external/tensorflow/tensorflow/lite/micro/memory_planner/
Dgreedy_memory_planner.cc182 ListEntry* first_entry = &buffers_sorted_by_offset_[first_entry_index_]; in CalculateOffsetsIfNeeded() local
183 first_entry->next_entry_index = -1; // to mark the entry as end of list in CalculateOffsetsIfNeeded()
185 first_entry->requirements_index = buffer_id; in CalculateOffsetsIfNeeded()
189 first_entry->offset = buffer_offsets_[buffer_id]; in CalculateOffsetsIfNeeded()
257 if (first_entry->offset > candidate_offset) { in CalculateOffsetsIfNeeded()
260 first_entry = new_entry; in CalculateOffsetsIfNeeded()
261 first_entry->next_entry_index = first_entry_index_; in CalculateOffsetsIfNeeded()
264 ListEntry* current_entry = first_entry; in CalculateOffsetsIfNeeded()
/external/llvm-project/lldb/test/API/functionalities/jitloader_gdb/
Dmain.c19 struct JITCodeEntry* first_entry; member
38 __jit_debug_descriptor.relevant_entry = __jit_debug_descriptor.first_entry = &entry; in main()
Dsimple.c9 void* first_entry; member
/external/llvm-project/lldb/include/lldb/Core/
DUniqueCStringMap.h113 const Entry *first_entry = &m_map[0]; in FindNextValueForName() local
114 const Entry *after_last_entry = first_entry + m_map.size(); in FindNextValueForName()
116 if (first_entry <= next_entry && next_entry < after_last_entry) { in FindNextValueForName()
/external/llvm-project/lldb/source/Symbol/
DCompactUnwindInfo.cpp390 offset_t first_entry = lsda_offset; in GetLSDAForFunctionOffset() local
395 offset_t offset = first_entry + (mid * 8); in GetLSDAForFunctionOffset()
419 offset_t first_entry = entry_page_offset; in BinarySearchRegularSecondPage() local
426 offset_t offset = first_entry + (mid * 8); in BinarySearchRegularSecondPage()
431 offset = first_entry + ((mid + 1) * 8); in BinarySearchRegularSecondPage()
440 return first_entry + (mid * 8); in BinarySearchRegularSecondPage()
455 offset_t first_entry = entry_page_offset; in BinarySearchCompressedSecondPage() local
462 offset_t offset = first_entry + (mid * 4); in BinarySearchCompressedSecondPage()
468 offset = first_entry + ((mid + 1) * 4); in BinarySearchCompressedSecondPage()
/external/llvm-project/lldb/source/Plugins/JITLoader/GDB/
DJITLoaderGDB.cpp51 ptr_t first_entry; // pointer member
306 jit_relevant_entry = (addr_t)jit_desc.first_entry; in ReadJITDescriptorImpl()