LSST Applications  21.0.0-147-g0e635eb1+1acddb5be5,22.0.0+052faf71bd,22.0.0+1ea9a8b2b2,22.0.0+6312710a6c,22.0.0+729191ecac,22.0.0+7589c3a021,22.0.0+9f079a9461,22.0.1-1-g7d6de66+b8044ec9de,22.0.1-1-g87000a6+536b1ee016,22.0.1-1-g8e32f31+6312710a6c,22.0.1-10-gd060f87+016f7cdc03,22.0.1-12-g9c3108e+df145f6f68,22.0.1-16-g314fa6d+c825727ab8,22.0.1-19-g93a5c75+d23f2fb6d8,22.0.1-19-gb93eaa13+aab3ef7709,22.0.1-2-g8ef0a89+b8044ec9de,22.0.1-2-g92698f7+9f079a9461,22.0.1-2-ga9b0f51+052faf71bd,22.0.1-2-gac51dbf+052faf71bd,22.0.1-2-gb66926d+6312710a6c,22.0.1-2-gcb770ba+09e3807989,22.0.1-20-g32debb5+b8044ec9de,22.0.1-23-gc2439a9a+fb0756638e,22.0.1-3-g496fd5d+09117f784f,22.0.1-3-g59f966b+1e6ba2c031,22.0.1-3-g849a1b8+f8b568069f,22.0.1-3-gaaec9c0+c5c846a8b1,22.0.1-32-g5ddfab5d3+60ce4897b0,22.0.1-4-g037fbe1+64e601228d,22.0.1-4-g8623105+b8044ec9de,22.0.1-5-g096abc9+d18c45d440,22.0.1-5-g15c806e+57f5c03693,22.0.1-7-gba73697+57f5c03693,master-g6e05de7fdc+c1283a92b8,master-g72cdda8301+729191ecac,w.2021.39
LSST Data Management Base Package
codec.h
Go to the documentation of this file.
1 /*
2  * LSST Data Management System
3  * Copyright 2016 AURA/LSST.
4  *
5  * This product includes software developed by the
6  * LSST Project (http://www.lsst.org/).
7  *
8  * This program is free software: you can redistribute it and/or modify
9  * it under the terms of the GNU General Public License as published by
10  * the Free Software Foundation, either version 3 of the License, or
11  * (at your option) any later version.
12  *
13  * This program is distributed in the hope that it will be useful,
14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16  * GNU General Public License for more details.
17  *
18  * You should have received a copy of the LSST License Statement and
19  * the GNU General Public License along with this program. If not,
20  * see <https://www.lsstcorp.org/LegalNotices/>.
21  */
22 
23 #ifndef LSST_SPHGEOM_CODEC_H_
24 #define LSST_SPHGEOM_CODEC_H_
25 
26 // Optimized path requires little endian arch and support for unaligned loads.
27 #if defined(__x86_64__) or (defined(__aarch64__) and defined(__LITTLE_ENDIAN__))
28 #define OPTIMIZED_LITTLE_ENDIAN
29 #endif
30 
31 #ifdef NO_OPTIMIZED_PATHS
32 #undef OPTIMIZED_LITTLE_ENDIAN
33 #endif
34 
38 
39 #include <vector>
40 
41 namespace lsst {
42 namespace sphgeom {
43 
46 inline void encodeDouble(double item, std::vector<uint8_t> & buffer) {
47 #ifdef OPTIMIZED_LITTLE_ENDIAN
48  auto ptr = reinterpret_cast<uint8_t const *>(&item);
49  buffer.insert(buffer.end(), ptr, ptr + 8);
50 #else
51  union { uint64_t u; double d; };
52  d = item;
53  buffer.push_back(static_cast<uint8_t>(u));
54  buffer.push_back(static_cast<uint8_t>(u >> 8));
55  buffer.push_back(static_cast<uint8_t>(u >> 16));
56  buffer.push_back(static_cast<uint8_t>(u >> 24));
57  buffer.push_back(static_cast<uint8_t>(u >> 32));
58  buffer.push_back(static_cast<uint8_t>(u >> 40));
59  buffer.push_back(static_cast<uint8_t>(u >> 48));
60  buffer.push_back(static_cast<uint8_t>(u >> 56));
61 #endif
62 }
63 
66 inline double decodeDouble(uint8_t const * buffer) {
67 #ifdef OPTIMIZED_LITTLE_ENDIAN
68  return *reinterpret_cast<double const *>(buffer);
69 #else
70  union { uint64_t u; double d; };
71  u = static_cast<uint64_t>(buffer[0]) +
72  (static_cast<uint64_t>(buffer[1]) << 8) +
73  (static_cast<uint64_t>(buffer[2]) << 16) +
74  (static_cast<uint64_t>(buffer[3]) << 24) +
75  (static_cast<uint64_t>(buffer[4]) << 32) +
76  (static_cast<uint64_t>(buffer[5]) << 40) +
77  (static_cast<uint64_t>(buffer[6]) << 48) +
78  (static_cast<uint64_t>(buffer[7]) << 56);
79  return d;
80 #endif
81 }
82 
83 }} // namespace lsst::sphgeom
84 
85 #endif // LSST_SPHGEOM_CODEC_H_
uint64_t * ptr
Definition: RangeSet.cc:88
T end(T... args)
T insert(T... args)
void encodeDouble(double item, std::vector< uint8_t > &buffer)
encode appends an IEEE double in little-endian byte order to the end of buffer.
Definition: codec.h:46
double decodeDouble(uint8_t const *buffer)
decode extracts an IEEE double from the 8 byte little-endian byte sequence in buffer.
Definition: codec.h:66
A base class for image defects.
T push_back(T... args)