remove unused code
This commit is contained in:
parent
5556785804
commit
1d25f41122
@ -1,57 +0,0 @@
|
|||||||
/*
|
|
||||||
|
|
||||||
Copyright (c) 2013, Project OSRM, Dennis Luxen, others
|
|
||||||
All rights reserved.
|
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without modification,
|
|
||||||
are permitted provided that the following conditions are met:
|
|
||||||
|
|
||||||
Redistributions of source code must retain the above copyright notice, this list
|
|
||||||
of conditions and the following disclaimer.
|
|
||||||
Redistributions in binary form must reproduce the above copyright notice, this
|
|
||||||
list of conditions and the following disclaimer in the documentation and/or
|
|
||||||
other materials provided with the distribution.
|
|
||||||
|
|
||||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
||||||
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
||||||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
||||||
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
|
|
||||||
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
||||||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
||||||
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
||||||
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
||||||
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
||||||
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
||||||
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef MACHINE_INFO_H
|
|
||||||
#define MACHINE_INFO_H
|
|
||||||
|
|
||||||
enum Endianness
|
|
||||||
{ LittleEndian = 1,
|
|
||||||
BigEndian = 2 };
|
|
||||||
|
|
||||||
// Function is optimized to a single 'mov eax,1' on GCC, clang and icc using -O3
|
|
||||||
Endianness GetMachineEndianness()
|
|
||||||
{
|
|
||||||
int i(1);
|
|
||||||
char *p = (char *)&i;
|
|
||||||
if (1 == p[0])
|
|
||||||
{
|
|
||||||
return LittleEndian;
|
|
||||||
}
|
|
||||||
return BigEndian;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Reverses Network Byte Order into something usable, compiles down to a bswap-mov combination
|
|
||||||
unsigned SwapEndian(unsigned x)
|
|
||||||
{
|
|
||||||
if (GetMachineEndianness() == LittleEndian)
|
|
||||||
{
|
|
||||||
return ((x >> 24) | ((x << 8) & 0x00FF0000) | ((x >> 8) & 0x0000FF00) | (x << 24));
|
|
||||||
}
|
|
||||||
return x;
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif // MACHINE_INFO_H
|
|
Loading…
Reference in New Issue
Block a user