mirror of
https://github.com/MariaDB/server.git
synced 2025-01-16 20:12:31 +01:00
4a3a46af13
innobase/btr/btr0btr.c: Eliminate some buf_frame_align() calls. Make use of the page_rec_is_infimum(), page_rec_is_supremum() and page_rec_is_user_rec() functions. Replace some index->table->comp with page_is_comp(). Eliminate some variables to reduce register spilling on x86. Note that page_is_comp() may return nonzero instead of TRUE. Note that rec_offs_comp() may return nonzero instead of TRUE. innobase/btr/btr0cur.c: Eliminate some buf_frame_align() calls. Replace some index->table->comp with page_is_comp() or rec_offs_comp(). Eliminate some variables to reduce register spilling on x86. Note that page_is_comp() may return nonzero instead of TRUE. Note that rec_offs_comp() may return nonzero instead of TRUE. Remove an extra mem_heap_create() call from btr_cur_update_in_place(). Add "page" parameter to lock_rec_store_on_page_infimum(). Add some UNIV_LIKELY() and UNIV_UNLIKELY() hints. btr_estimate_number_of_different_key_vals(): Rename the offsets_* variables to be more descriptive and eliminate one rec_get_offsets() and one page_rec_get_next() call in the loop. innobase/btr/btr0pcur.c: Eliminate some buf_frame_align() calls. Make use of the page_rec_is_infimum(), page_rec_is_supremum() and page_rec_is_user_rec() functions. Replace some index->table->comp with page_is_comp(). Eliminate some variables to reduce register spilling on x86. Note that page_is_comp() may return nonzero instead of TRUE. Make some ut_a() assertions ut_ad() ones to improve performance. Add some UNIV_LIKELY() and UNIV_UNLIKELY() hints. innobase/btr/btr0sea.c: Make use of page_rec_is_infimum() and page_rec_is_supremum(). Eliminate some buf_frame_align() calls. Add some UNIV_UNLIKELY and UNIV_LIKELY hints. Turn some assertions into debug assertions. innobase/dict/dict0crea.c: Replace FALSE/TRUE ibool comp with zero/nonzero ulint comp innobase/ibuf/ibuf0ibuf.c: Make use of page_rec_is_infimum() and page_rec_is_supremum(). Add some UNIV_UNLIKELY and UNIV_LIKELY hints. ibuf_get_merge_page_nos(): Rename parameter "first_rec" to "rec" and eliminate local variable "rec". innobase/include/btr0btr.h: Replace FALSE/TRUE ibool comp with zero/nonzero ulint comp innobase/include/buf0buf.h: Rename buf_frame_get_modify_clock() to buf_block_get_modify_clock(). innobase/include/buf0buf.ic: Rename buf_frame_get_modify_clock() to buf_block_get_modify_clock() and remove the buf_block_align() call. innobase/include/lock0lock.h: lock_rec_store_on_page_infimum(): Add parameter "page" innobase/include/mach0data.h: Add mach_encode_2() and mach_decode_2(). innobase/include/mach0data.ic: Add mach_encode_2() and mach_decode_2(). innobase/include/page0cur.h: Add const qualifier to page_cur_is_before_first() and page_cur_is_after_last(). innobase/include/page0cur.ic: Make use of page_rec_is_infimum() and page_rec_is_supremum(). innobase/include/page0page.h: Remove page_rec_is_first_user_rec() and page_rec_is_last_user_rec(). Add page_rec_is_infimum() and page_rec_is_supremum(). Replace FALSE/TRUE ibool comp with zero/nonzero ulint comp. innobase/include/page0page.ic: Remove page_rec_is_first_user_rec() and page_rec_is_last_user_rec(). Add page_rec_is_infimum() and page_rec_is_supremum(). Replace FALSE/TRUE ibool comp with zero/nonzero ulint comp. Add UNIV_UNLIKELY, UNIV_LIKELY and UNIV_EXPECT hints. Reduce the number of buf_frame_align() calls. innobase/include/rem0rec.ic: rec_offs_comp(): Return zero or nonzero instead of FALSE or TRUE. innobase/include/row0mysql.h: Replace FALSE/TRUE ibool comp with zero/nonzero ulint comp. innobase/lock/lock0lock.c: Replace FALSE/TRUE ibool comp with zero/nonzero ulint comp. Remove parameter "comp" from lock_rec_get_next(), lock_rec_has_expl() and lock_rec_other_has_expl_req(). Add parameter "page" to lock_rec_store_on_page_infimum(). Add UNIV_UNLIKELY hints. Reduce the number of buf_frame_align() calls. Make use of page_rec_is_infimum(), page_rec_is_supremum() and page_rec_is_user_rec(). Move the "comp" flag outside some loops. innobase/mtr/mtr0log.c: Replace index->table->comp with page_rec_is_comp(). innobase/page/page0cur.c: Replace index->table->comp with page_is_comp() or page_rec_is_comp(). Eliminate some buf_frame_align() calls. Add some debug assertions. innobase/page/page0page.c: Optimize page_dir_find_owner_slot(). Compare the record offset 16 bits at a time, because that seems to be the only way to avoid register spilling on x86. Replace FALSE/TRUE ibool comp with zero/nonzero ulint comp. Remove parameter "page" of page_delete_rec_list_write_log(). Make use of page_rec_is_infimum(). innobase/rem/rem0cmp.c: Replace FALSE/TRUE ibool comp with zero/nonzero ulint comp. innobase/row/row0ins.c: Make use of page_rec_is_infimum() and page_rec_is_supremum(). Reduce the amount of buf_frame_align() calls. row_ins_index_entry_low(): Disable assertion about column count unless #ifdef UNIV_DEBUG. innobase/row/row0mysql.c: Replace FALSE/TRUE ibool comp with zero/nonzero ulint comp. innobase/row/row0row.c: Eliminate some buf_frame_align() calls. Make use of page_rec_is_infimum(). innobase/row/row0sel.c: Make use of page_rec_is_supremum() and page_rec_is_infimum(). Turn some assertions into debug assertions. Add UNIV_LIKELY and UNIV_UNLIKELY hints. row_search_for_mysql(): Eliminate local variables "moved", "cons_read_requires_clust_rec", "was_lock_wait", "shortcut", "success" and "comp". Replace some of them with goto's. Disable variable "cnt" unless #ifdef UNIV_SEARCH_DEBUG. innobase/row/row0vers.c: Replace FALSE/TRUE ibool comp with zero/nonzero ulint comp. Replace index->table->comp with page_rec_is_comp(). Eliminate some buf_frame_align() calls.
719 lines
16 KiB
Text
719 lines
16 KiB
Text
/**********************************************************************
|
|
Utilities for converting data from the database file
|
|
to the machine format.
|
|
|
|
(c) 1995 Innobase Oy
|
|
|
|
Created 11/28/1995 Heikki Tuuri
|
|
***********************************************************************/
|
|
|
|
/***********************************************************
|
|
The following function is used to store data in one byte. */
|
|
UNIV_INLINE
|
|
void
|
|
mach_write_to_1(
|
|
/*============*/
|
|
byte* b, /* in: pointer to byte where to store */
|
|
ulint n) /* in: ulint integer to be stored, >= 0, < 256 */
|
|
{
|
|
ut_ad(b);
|
|
ut_ad(n <= 0xFFUL);
|
|
|
|
b[0] = (byte)n;
|
|
}
|
|
|
|
/************************************************************
|
|
The following function is used to fetch data from one byte. */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_read_from_1(
|
|
/*=============*/
|
|
/* out: ulint integer, >= 0, < 256 */
|
|
byte* b) /* in: pointer to byte */
|
|
{
|
|
ut_ad(b);
|
|
return((ulint)(b[0]));
|
|
}
|
|
|
|
/***********************************************************
|
|
The following function is used to store data in two consecutive
|
|
bytes. We store the most significant byte to the lowest address. */
|
|
UNIV_INLINE
|
|
void
|
|
mach_write_to_2(
|
|
/*============*/
|
|
byte* b, /* in: pointer to two bytes where to store */
|
|
ulint n) /* in: ulint integer to be stored */
|
|
{
|
|
ut_ad(b);
|
|
ut_ad(n <= 0xFFFFUL);
|
|
|
|
b[0] = (byte)(n >> 8);
|
|
b[1] = (byte)(n);
|
|
}
|
|
|
|
/************************************************************
|
|
The following function is used to fetch data from 2 consecutive
|
|
bytes. The most significant byte is at the lowest address. */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_read_from_2(
|
|
/*=============*/
|
|
/* out: ulint integer */
|
|
byte* b) /* in: pointer to 2 bytes */
|
|
{
|
|
ut_ad(b);
|
|
return( ((ulint)(b[0]) << 8)
|
|
+ (ulint)(b[1])
|
|
);
|
|
}
|
|
|
|
/************************************************************
|
|
The following function is used to convert a 16-bit data item
|
|
to the canonical format, for fast bytewise equality test
|
|
against memory. */
|
|
UNIV_INLINE
|
|
uint16
|
|
mach_encode_2(
|
|
/*==========*/
|
|
/* out: 16-bit integer in canonical format */
|
|
ulint n) /* in: integer in machine-dependent format */
|
|
{
|
|
uint16 ret;
|
|
ut_ad(2 == sizeof ret);
|
|
mach_write_to_2((byte*) &ret, n);
|
|
return(ret);
|
|
}
|
|
/************************************************************
|
|
The following function is used to convert a 16-bit data item
|
|
from the canonical format, for fast bytewise equality test
|
|
against memory. */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_decode_2(
|
|
/*==========*/
|
|
/* out: integer in machine-dependent format */
|
|
uint16 n) /* in: 16-bit integer in canonical format */
|
|
{
|
|
ut_ad(2 == sizeof n);
|
|
return(mach_read_from_2((byte*) &n));
|
|
}
|
|
|
|
/***********************************************************
|
|
The following function is used to store data in 3 consecutive
|
|
bytes. We store the most significant byte to the lowest address. */
|
|
UNIV_INLINE
|
|
void
|
|
mach_write_to_3(
|
|
/*============*/
|
|
byte* b, /* in: pointer to 3 bytes where to store */
|
|
ulint n) /* in: ulint integer to be stored */
|
|
{
|
|
ut_ad(b);
|
|
ut_ad(n <= 0xFFFFFFUL);
|
|
|
|
b[0] = (byte)(n >> 16);
|
|
b[1] = (byte)(n >> 8);
|
|
b[2] = (byte)(n);
|
|
}
|
|
|
|
/************************************************************
|
|
The following function is used to fetch data from 3 consecutive
|
|
bytes. The most significant byte is at the lowest address. */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_read_from_3(
|
|
/*=============*/
|
|
/* out: ulint integer */
|
|
byte* b) /* in: pointer to 3 bytes */
|
|
{
|
|
ut_ad(b);
|
|
return( ((ulint)(b[0]) << 16)
|
|
+ ((ulint)(b[1]) << 8)
|
|
+ (ulint)(b[2])
|
|
);
|
|
}
|
|
|
|
/***********************************************************
|
|
The following function is used to store data in four consecutive
|
|
bytes. We store the most significant byte to the lowest address. */
|
|
UNIV_INLINE
|
|
void
|
|
mach_write_to_4(
|
|
/*============*/
|
|
byte* b, /* in: pointer to four bytes where to store */
|
|
ulint n) /* in: ulint integer to be stored */
|
|
{
|
|
ut_ad(b);
|
|
|
|
#if (0 == 1) && !defined(__STDC__) && defined(UNIV_INTEL) && (UNIV_WORD_SIZE == 4) && defined(UNIV_VISUALC)
|
|
|
|
/* We do not use this even on Intel, because unaligned accesses may
|
|
be slow */
|
|
|
|
__asm MOV EAX, n
|
|
__asm BSWAP EAX /* Intel is little-endian, must swap bytes */
|
|
__asm MOV n, EAX
|
|
|
|
*((ulint*)b) = n;
|
|
#else
|
|
b[0] = (byte)(n >> 24);
|
|
b[1] = (byte)(n >> 16);
|
|
b[2] = (byte)(n >> 8);
|
|
b[3] = (byte)n;
|
|
#endif
|
|
}
|
|
|
|
/************************************************************
|
|
The following function is used to fetch data from 4 consecutive
|
|
bytes. The most significant byte is at the lowest address. */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_read_from_4(
|
|
/*=============*/
|
|
/* out: ulint integer */
|
|
byte* b) /* in: pointer to four bytes */
|
|
{
|
|
#if (0 == 1) && !defined(__STDC__) && defined(UNIV_INTEL) && (UNIV_WORD_SIZE == 4) && defined(UNIV_VISUALC)
|
|
/* We do not use this even on Intel, because unaligned accesses may
|
|
be slow */
|
|
|
|
ulint res;
|
|
|
|
ut_ad(b);
|
|
|
|
__asm MOV EDX, b
|
|
__asm MOV ECX, DWORD PTR [EDX]
|
|
__asm BSWAP ECX /* Intel is little-endian, must swap bytes */
|
|
__asm MOV res, ECX
|
|
|
|
return(res);
|
|
#else
|
|
ut_ad(b);
|
|
return( ((ulint)(b[0]) << 24)
|
|
+ ((ulint)(b[1]) << 16)
|
|
+ ((ulint)(b[2]) << 8)
|
|
+ (ulint)(b[3])
|
|
);
|
|
#endif
|
|
}
|
|
|
|
/*************************************************************
|
|
Writes a ulint in a compressed form where the first byte codes the
|
|
length of the stored ulint. We look at the most significant bits of
|
|
the byte. If the most significant bit is zero, it means 1-byte storage,
|
|
else if the 2nd bit is 0, it means 2-byte storage, else if 3rd is 0,
|
|
it means 3-byte storage, else if 4th is 0, it means 4-byte storage,
|
|
else the storage is 5-byte. */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_write_compressed(
|
|
/*==================*/
|
|
/* out: compressed size in bytes */
|
|
byte* b, /* in: pointer to memory where to store */
|
|
ulint n) /* in: ulint integer (< 2^32) to be stored */
|
|
{
|
|
ut_ad(b);
|
|
|
|
if (n < 0x80UL) {
|
|
mach_write_to_1(b, n);
|
|
return(1);
|
|
} else if (n < 0x4000UL) {
|
|
mach_write_to_2(b, n | 0x8000UL);
|
|
return(2);
|
|
} else if (n < 0x200000UL) {
|
|
mach_write_to_3(b, n | 0xC00000UL);
|
|
return(3);
|
|
} else if (n < 0x10000000UL) {
|
|
mach_write_to_4(b, n | 0xE0000000UL);
|
|
return(4);
|
|
} else {
|
|
mach_write_to_1(b, 0xF0UL);
|
|
mach_write_to_4(b + 1, n);
|
|
return(5);
|
|
}
|
|
}
|
|
|
|
/*************************************************************
|
|
Returns the size of a ulint when written in the compressed form. */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_get_compressed_size(
|
|
/*=====================*/
|
|
/* out: compressed size in bytes */
|
|
ulint n) /* in: ulint integer (< 2^32) to be stored */
|
|
{
|
|
if (n < 0x80UL) {
|
|
return(1);
|
|
} else if (n < 0x4000UL) {
|
|
return(2);
|
|
} else if (n < 0x200000UL) {
|
|
return(3);
|
|
} else if (n < 0x10000000UL) {
|
|
return(4);
|
|
} else {
|
|
return(5);
|
|
}
|
|
}
|
|
|
|
/*************************************************************
|
|
Reads a ulint in a compressed form. */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_read_compressed(
|
|
/*=================*/
|
|
/* out: read integer (< 2^32) */
|
|
byte* b) /* in: pointer to memory from where to read */
|
|
{
|
|
ulint flag;
|
|
|
|
ut_ad(b);
|
|
|
|
flag = mach_read_from_1(b);
|
|
|
|
if (flag < 0x80UL) {
|
|
return(flag);
|
|
} else if (flag < 0xC0UL) {
|
|
return(mach_read_from_2(b) & 0x7FFFUL);
|
|
} else if (flag < 0xE0UL) {
|
|
return(mach_read_from_3(b) & 0x3FFFFFUL);
|
|
} else if (flag < 0xF0UL) {
|
|
return(mach_read_from_4(b) & 0x1FFFFFFFUL);
|
|
} else {
|
|
ut_ad(flag == 0xF0UL);
|
|
return(mach_read_from_4(b + 1));
|
|
}
|
|
}
|
|
|
|
/***********************************************************
|
|
The following function is used to store data in 8 consecutive
|
|
bytes. We store the most significant byte to the lowest address. */
|
|
UNIV_INLINE
|
|
void
|
|
mach_write_to_8(
|
|
/*============*/
|
|
byte* b, /* in: pointer to 8 bytes where to store */
|
|
dulint n) /* in: dulint integer to be stored */
|
|
{
|
|
ut_ad(b);
|
|
|
|
mach_write_to_4(b, ut_dulint_get_high(n));
|
|
mach_write_to_4(b + 4, ut_dulint_get_low(n));
|
|
}
|
|
|
|
/************************************************************
|
|
The following function is used to fetch data from 8 consecutive
|
|
bytes. The most significant byte is at the lowest address. */
|
|
UNIV_INLINE
|
|
dulint
|
|
mach_read_from_8(
|
|
/*=============*/
|
|
/* out: dulint integer */
|
|
byte* b) /* in: pointer to 8 bytes */
|
|
{
|
|
ulint high;
|
|
ulint low;
|
|
|
|
ut_ad(b);
|
|
|
|
high = mach_read_from_4(b);
|
|
low = mach_read_from_4(b + 4);
|
|
|
|
return(ut_dulint_create(high, low));
|
|
}
|
|
|
|
/***********************************************************
|
|
The following function is used to store data in 7 consecutive
|
|
bytes. We store the most significant byte to the lowest address. */
|
|
UNIV_INLINE
|
|
void
|
|
mach_write_to_7(
|
|
/*============*/
|
|
byte* b, /* in: pointer to 7 bytes where to store */
|
|
dulint n) /* in: dulint integer to be stored */
|
|
{
|
|
ut_ad(b);
|
|
|
|
mach_write_to_3(b, ut_dulint_get_high(n));
|
|
mach_write_to_4(b + 3, ut_dulint_get_low(n));
|
|
}
|
|
|
|
/************************************************************
|
|
The following function is used to fetch data from 7 consecutive
|
|
bytes. The most significant byte is at the lowest address. */
|
|
UNIV_INLINE
|
|
dulint
|
|
mach_read_from_7(
|
|
/*=============*/
|
|
/* out: dulint integer */
|
|
byte* b) /* in: pointer to 7 bytes */
|
|
{
|
|
ulint high;
|
|
ulint low;
|
|
|
|
ut_ad(b);
|
|
|
|
high = mach_read_from_3(b);
|
|
low = mach_read_from_4(b + 3);
|
|
|
|
return(ut_dulint_create(high, low));
|
|
}
|
|
|
|
/***********************************************************
|
|
The following function is used to store data in 6 consecutive
|
|
bytes. We store the most significant byte to the lowest address. */
|
|
UNIV_INLINE
|
|
void
|
|
mach_write_to_6(
|
|
/*============*/
|
|
byte* b, /* in: pointer to 6 bytes where to store */
|
|
dulint n) /* in: dulint integer to be stored */
|
|
{
|
|
ut_ad(b);
|
|
|
|
mach_write_to_2(b, ut_dulint_get_high(n));
|
|
mach_write_to_4(b + 2, ut_dulint_get_low(n));
|
|
}
|
|
|
|
/************************************************************
|
|
The following function is used to fetch data from 6 consecutive
|
|
bytes. The most significant byte is at the lowest address. */
|
|
UNIV_INLINE
|
|
dulint
|
|
mach_read_from_6(
|
|
/*=============*/
|
|
/* out: dulint integer */
|
|
byte* b) /* in: pointer to 7 bytes */
|
|
{
|
|
ulint high;
|
|
ulint low;
|
|
|
|
ut_ad(b);
|
|
|
|
high = mach_read_from_2(b);
|
|
low = mach_read_from_4(b + 2);
|
|
|
|
return(ut_dulint_create(high, low));
|
|
}
|
|
|
|
/*************************************************************
|
|
Writes a dulint in a compressed form (5..9 bytes). */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_dulint_write_compressed(
|
|
/*=========================*/
|
|
/* out: size in bytes */
|
|
byte* b, /* in: pointer to memory where to store */
|
|
dulint n) /* in: dulint integer to be stored */
|
|
{
|
|
ulint size;
|
|
|
|
ut_ad(b);
|
|
|
|
size = mach_write_compressed(b, ut_dulint_get_high(n));
|
|
mach_write_to_4(b + size, ut_dulint_get_low(n));
|
|
|
|
return(size + 4);
|
|
}
|
|
|
|
/*************************************************************
|
|
Returns the size of a dulint when written in the compressed form. */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_dulint_get_compressed_size(
|
|
/*============================*/
|
|
/* out: compressed size in bytes */
|
|
dulint n) /* in: dulint integer to be stored */
|
|
{
|
|
return(4 + mach_get_compressed_size(ut_dulint_get_high(n)));
|
|
}
|
|
|
|
/*************************************************************
|
|
Reads a dulint in a compressed form. */
|
|
UNIV_INLINE
|
|
dulint
|
|
mach_dulint_read_compressed(
|
|
/*========================*/
|
|
/* out: read dulint */
|
|
byte* b) /* in: pointer to memory from where to read */
|
|
{
|
|
ulint high;
|
|
ulint low;
|
|
ulint size;
|
|
|
|
ut_ad(b);
|
|
|
|
high = mach_read_compressed(b);
|
|
|
|
size = mach_get_compressed_size(high);
|
|
|
|
low = mach_read_from_4(b + size);
|
|
|
|
return(ut_dulint_create(high, low));
|
|
}
|
|
|
|
/*************************************************************
|
|
Writes a dulint in a compressed form (1..11 bytes). */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_dulint_write_much_compressed(
|
|
/*==============================*/
|
|
/* out: size in bytes */
|
|
byte* b, /* in: pointer to memory where to store */
|
|
dulint n) /* in: dulint integer to be stored */
|
|
{
|
|
ulint size;
|
|
|
|
ut_ad(b);
|
|
|
|
if (ut_dulint_get_high(n) == 0) {
|
|
return(mach_write_compressed(b, ut_dulint_get_low(n)));
|
|
}
|
|
|
|
*b = (byte)0xFF;
|
|
size = 1 + mach_write_compressed(b + 1, ut_dulint_get_high(n));
|
|
|
|
size += mach_write_compressed(b + size, ut_dulint_get_low(n));
|
|
|
|
return(size);
|
|
}
|
|
|
|
/*************************************************************
|
|
Returns the size of a dulint when written in the compressed form. */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_dulint_get_much_compressed_size(
|
|
/*=================================*/
|
|
/* out: compressed size in bytes */
|
|
dulint n) /* in: dulint integer to be stored */
|
|
{
|
|
if (0 == ut_dulint_get_high(n)) {
|
|
return(mach_get_compressed_size(ut_dulint_get_low(n)));
|
|
}
|
|
|
|
return(1 + mach_get_compressed_size(ut_dulint_get_high(n))
|
|
+ mach_get_compressed_size(ut_dulint_get_low(n)));
|
|
}
|
|
|
|
/*************************************************************
|
|
Reads a dulint in a compressed form. */
|
|
UNIV_INLINE
|
|
dulint
|
|
mach_dulint_read_much_compressed(
|
|
/*=============================*/
|
|
/* out: read dulint */
|
|
byte* b) /* in: pointer to memory from where to read */
|
|
{
|
|
ulint high;
|
|
ulint low;
|
|
ulint size;
|
|
|
|
ut_ad(b);
|
|
|
|
if (*b != (byte)0xFF) {
|
|
high = 0;
|
|
size = 0;
|
|
} else {
|
|
high = mach_read_compressed(b + 1);
|
|
|
|
size = 1 + mach_get_compressed_size(high);
|
|
}
|
|
|
|
low = mach_read_compressed(b + size);
|
|
|
|
return(ut_dulint_create(high, low));
|
|
}
|
|
|
|
/*************************************************************
|
|
Reads a double. It is stored in a little-endian format. */
|
|
UNIV_INLINE
|
|
double
|
|
mach_double_read(
|
|
/*=============*/
|
|
/* out: double read */
|
|
byte* b) /* in: pointer to memory from where to read */
|
|
{
|
|
double d;
|
|
ulint i;
|
|
byte* ptr;
|
|
|
|
ptr = (byte*)&d;
|
|
|
|
for (i = 0; i < sizeof(double); i++) {
|
|
#ifdef WORDS_BIGENDIAN
|
|
ptr[sizeof(double) - i - 1] = b[i];
|
|
#else
|
|
ptr[i] = b[i];
|
|
#endif
|
|
}
|
|
|
|
return(d);
|
|
}
|
|
|
|
/*************************************************************
|
|
Writes a double. It is stored in a little-endian format. */
|
|
UNIV_INLINE
|
|
void
|
|
mach_double_write(
|
|
/*==============*/
|
|
byte* b, /* in: pointer to memory where to write */
|
|
double d) /* in: double */
|
|
{
|
|
ulint i;
|
|
byte* ptr;
|
|
|
|
ptr = (byte*)&d;
|
|
|
|
for (i = 0; i < sizeof(double); i++) {
|
|
#ifdef WORDS_BIGENDIAN
|
|
b[i] = ptr[sizeof(double) - i - 1];
|
|
#else
|
|
b[i] = ptr[i];
|
|
#endif
|
|
}
|
|
}
|
|
|
|
/*************************************************************
|
|
Reads a float. It is stored in a little-endian format. */
|
|
UNIV_INLINE
|
|
float
|
|
mach_float_read(
|
|
/*=============*/
|
|
/* out: float read */
|
|
byte* b) /* in: pointer to memory from where to read */
|
|
{
|
|
float d;
|
|
ulint i;
|
|
byte* ptr;
|
|
|
|
ptr = (byte*)&d;
|
|
|
|
for (i = 0; i < sizeof(float); i++) {
|
|
#ifdef WORDS_BIGENDIAN
|
|
ptr[sizeof(float) - i - 1] = b[i];
|
|
#else
|
|
ptr[i] = b[i];
|
|
#endif
|
|
}
|
|
|
|
return(d);
|
|
}
|
|
|
|
/*************************************************************
|
|
Writes a float. It is stored in a little-endian format. */
|
|
UNIV_INLINE
|
|
void
|
|
mach_float_write(
|
|
/*==============*/
|
|
byte* b, /* in: pointer to memory where to write */
|
|
float d) /* in: float */
|
|
{
|
|
ulint i;
|
|
byte* ptr;
|
|
|
|
ptr = (byte*)&d;
|
|
|
|
for (i = 0; i < sizeof(float); i++) {
|
|
#ifdef WORDS_BIGENDIAN
|
|
b[i] = ptr[sizeof(float) - i - 1];
|
|
#else
|
|
b[i] = ptr[i];
|
|
#endif
|
|
}
|
|
}
|
|
|
|
/*************************************************************
|
|
Reads a ulint stored in the little-endian format. */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_read_from_n_little_endian(
|
|
/*===========================*/
|
|
/* out: unsigned long int */
|
|
byte* buf, /* in: from where to read */
|
|
ulint buf_size) /* in: from how many bytes to read */
|
|
{
|
|
ulint n = 0;
|
|
byte* ptr;
|
|
|
|
ut_ad(buf_size <= sizeof(ulint));
|
|
ut_ad(buf_size > 0);
|
|
|
|
ptr = buf + buf_size;
|
|
|
|
for (;;) {
|
|
ptr--;
|
|
|
|
n = n << 8;
|
|
|
|
n += (ulint)(*ptr);
|
|
|
|
if (ptr == buf) {
|
|
break;
|
|
}
|
|
}
|
|
|
|
return(n);
|
|
}
|
|
|
|
/*************************************************************
|
|
Writes a ulint in the little-endian format. */
|
|
UNIV_INLINE
|
|
void
|
|
mach_write_to_n_little_endian(
|
|
/*==========================*/
|
|
byte* dest, /* in: where to write */
|
|
ulint dest_size, /* in: into how many bytes to write */
|
|
ulint n) /* in: unsigned long int to write */
|
|
{
|
|
byte* end;
|
|
|
|
ut_ad(dest_size <= sizeof(ulint));
|
|
ut_ad(dest_size > 0);
|
|
|
|
end = dest + dest_size;
|
|
|
|
for (;;) {
|
|
*dest = (byte)(n & 0xFF);
|
|
|
|
n = n >> 8;
|
|
|
|
dest++;
|
|
|
|
if (dest == end) {
|
|
break;
|
|
}
|
|
}
|
|
|
|
ut_ad(n == 0);
|
|
}
|
|
|
|
/*************************************************************
|
|
Reads a ulint stored in the little-endian format. */
|
|
UNIV_INLINE
|
|
ulint
|
|
mach_read_from_2_little_endian(
|
|
/*===========================*/
|
|
/* out: unsigned long int */
|
|
byte* buf) /* in: from where to read */
|
|
{
|
|
return((ulint)(*buf) + ((ulint)(*(buf + 1))) * 256);
|
|
}
|
|
|
|
/*************************************************************
|
|
Writes a ulint in the little-endian format. */
|
|
UNIV_INLINE
|
|
void
|
|
mach_write_to_2_little_endian(
|
|
/*==========================*/
|
|
byte* dest, /* in: where to write */
|
|
ulint n) /* in: unsigned long int to write */
|
|
{
|
|
ut_ad(n < 256 * 256);
|
|
|
|
*dest = (byte)(n & 0xFFUL);
|
|
|
|
n = n >> 8;
|
|
dest++;
|
|
|
|
*dest = (byte)(n & 0xFFUL);
|
|
}
|