Searched refs:BFS_ENDIAN_TO_HOST_INT64 (Results 1 - 5 of 5) sorted by relevance

/haiku/src/add-ons/kernel/file_systems/bfs/
H A Dbfs_endian.h27 # define BFS_ENDIAN_TO_HOST_INT64(value) value macro
36 # define BFS_ENDIAN_TO_HOST_INT64(value) __swap_int64(value) macro
H A Dbfs.h89 off_t NumBlocks() const { return BFS_ENDIAN_TO_HOST_INT64(num_blocks); }
90 off_t UsedBlocks() const { return BFS_ENDIAN_TO_HOST_INT64(used_blocks); }
98 off_t LogStart() const { return BFS_ENDIAN_TO_HOST_INT64(log_start); }
99 off_t LogEnd() const { return BFS_ENDIAN_TO_HOST_INT64(log_end); }
129 { return BFS_ENDIAN_TO_HOST_INT64(max_direct_range); }
131 { return BFS_ENDIAN_TO_HOST_INT64(max_indirect_range); }
133 { return BFS_ENDIAN_TO_HOST_INT64(max_double_indirect_range); }
135 { return BFS_ENDIAN_TO_HOST_INT64(size); }
229 { return BFS_ENDIAN_TO_HOST_INT64(last_modified_time); }
231 { return BFS_ENDIAN_TO_HOST_INT64(create_tim
[all...]
H A DBPlusTree.h46 { return BFS_ENDIAN_TO_HOST_INT64(root_node_pointer); }
48 { return BFS_ENDIAN_TO_HOST_INT64(free_node_pointer); }
49 off_t MaximumSize() const { return BFS_ENDIAN_TO_HOST_INT64(maximum_size); }
97 { return BFS_ENDIAN_TO_HOST_INT64(
100 { return BFS_ENDIAN_TO_HOST_INT64(
103 { return BFS_ENDIAN_TO_HOST_INT64(
H A DBPlusTree.cpp48 return (int32)BFS_ENDIAN_TO_HOST_INT64(count);
53 return BFS_ENDIAN_TO_HOST_INT64(values[index]);
1086 *_next = BFS_ENDIAN_TO_HOST_INT64(values[i]);
1097 *_next = BFS_ENDIAN_TO_HOST_INT64(values[saveIndex]);
1162 off_t value = BFS_ENDIAN_TO_HOST_INT64(values[i]);
1203 off_t oldValue = BFS_ENDIAN_TO_HOST_INT64(values[index]);
1833 off_t oldValue = BFS_ENDIAN_TO_HOST_INT64(values[index]);
2128 if (bplustree_node::IsDuplicate(BFS_ENDIAN_TO_HOST_INT64(
2311 *_value = BFS_ENDIAN_TO_HOST_INT64(node->Values()[keyIndex]);
2378 off_t childOffset = BFS_ENDIAN_TO_HOST_INT64(value
[all...]
H A DInode.cpp2194 if ((off_t)BFS_ENDIAN_TO_HOST_INT64(max) > offset)

Completed in 51 milliseconds