Knowledge

Endianness

Source 📝

1057:. CPUs up to ARMv5 only support BE-32 or word-invariant mode. Here any naturally aligned 32-bit access works like in little-endian mode, but access to a byte or 16-bit word is redirected to the corresponding address and unaligned access is not allowed. ARMv6 introduces BE-8 or byte-invariant mode, where access to a single byte works as in little-endian mode, but accessing a 16-bit, 32-bit or (starting with ARMv8) 64-bit word results in a byte swap of the data. This simplifies unaligned memory access as well as memory-mapped access to registers other than 32-bit. 2796: 313: 151: 54: 1369:(defined as the data written by a single Fortran statement) as data preceded and succeeded by count fields, which are integers equal to the number of bytes in the data. An attempt to read such a file using Fortran on a system of the other endianness results in a run-time error, because the count fields are incorrect. 1208:
is in principle a 16-bit little-endian system. The instructions to convert between floating-point and integer values in the optional floating-point processor of the PDP-11/45, PDP-11/70, and in some later processors, stored 32-bit "double precision integer long" values with the 16-bit halves swapped
1007:
Many of these architectures can be switched via software to default to a specific endian format (usually done when the computer starts up); however, on some systems, the default endianness is selected by hardware on the motherboard and cannot be changed via software (e.g. the Alpha, which runs only
377:
Another important attribute of a byte being part of a "field" is its "significance". These attributes of the parts of a field play an important role in the sequence the bytes are accessed by the computer hardware, more precisely: by the low-level algorithms contributing to the results of a computer
1128:
floating-point standard does not specify endianness. Theoretically, this means that even standard IEEE floating-point data written by one machine might not be readable by another. However, on modern standard computers (i.e., implementing IEEE 754), one may safely assume that the endianness is the
681:
On most systems, the address of a multi-byte value is the address of its first byte (the byte with the lowest address); little-endian systems of that type have the property that, for sufficiently low data values, the same value can be read from memory at different lengths without using different
244:
word contains four bytes. There are two possible ways a computer could number the individual bytes in a larger group, starting at either end. Both types of endianness are in widespread use in digital electronic engineering. The initial choice of endianness of a new design is often arbitrary, but
737:
to the subsequent more significant position. On most systems, the address of a multi-byte value is the address of its first byte (the byte with the lowest address). The implementation of these operations is marginally simpler using little-endian machines where this first byte contains the least
487:
where a single positional element (character) also has a positional value. Lexicographical comparison means almost everywhere: first character ranks highest – as in the telephone book. Almost all machines which can do this using a single instruction are big-endian or at least mixed-endian.
446:
have a fixed width of a low power of 2, e.g. 8 bits ≙ 1 byte, 16 bits ≙ 2 bytes, 32 bits ≙ 4 bytes, 64 bits ≙ 8 bytes, 128 bits ≙ 16 bytes. The low-level access sequence to the bytes of such a field depends on the operation to be performed. The least-significant byte is accessed first for
741:
Comparison and division start at the most significant digit and propagate a possible carry to the subsequent less significant digits. For fixed-length numerical values (typically of length 1,2,4,8,16), the implementation of these operations is marginally simpler on big-endian machines.
356:
that may consist of more data than can be stored in one byte. In the context of this article where its type cannot be arbitrarily complicated, a "field" consists of a consecutive sequence of bytes and represents a "simple data value" which – at least potentially – can be manipulated by
1019:
refers primarily to how a processor treats data accesses. Instruction accesses (fetches of instruction words) on a given processor may still assume a fixed endianness, even if data accesses are fully bi-endian, though this is not always the case, such as on Intel's
524:. On big-endian machines, the value appears left-to-right, coinciding with the correct string order for reading the result ("J O H N"). But on a little-endian machine, one would see "N H O J". Middle-endian machines complicate this even further; for example, on the 1445:. Intel CPUs are little-endian, while Motorola 680x0 CPUs are big-endian. This explicit signature allows a TIFF reader program to swap bytes if necessary when a given file was generated by a TIFF writer program running on a computer with a different endianness. 403:
of a digit which it contributes to the whole number is determined not only by its value as a single digit, but also by the position it holds in the complete number, called its significance. These positions can be mapped to memory mainly in two ways:
1031:
processors in little-endian mode act as little-endian from the point of view of the executing programs, but they require the motherboard to perform a 64-bit swap across all 8 byte lanes to ensure that the little-endian view of things will apply to
264:
at the largest. A little-endian system, in contrast, stores the least-significant byte at the smallest address. Of the two, big-endian is thus closer to the way the digits of numbers are written left-to-right in English, comparing digits to bytes.
1731: 1405:
data format, used in topography, are usually endianness-independent. This is achieved by storing the data always in one fixed endianness or carrying with the data a switch to indicate the endianness. An example of the former is the binary
373:
set at their high-order (lowest-addressed) position. When an operation such as addition is performed, the processor begins at the low-order positions at the high addresses of the two fields and works its way down to the high-order.
2437: 2073: 1149:. Frequently available operand lengths are 1, 2, 4, 8, or 16 bytes. But there are also architectures where the length of an operand may be held in a separate field of the instruction or with the operand itself, e.g. by means of a 730:. However, high-performance processors usually fetch multi-byte operands from memory in the same amount of time they would have fetched a single byte, so the complexity of the hardware is not affected by the byte ordering. 1000:) feature a setting which allows for switchable endianness in data fetches and stores, instruction fetches, or both. This feature can improve performance or simplify the logic of networking devices and software. The word 955:
and Linux run in big-endian mode on bi-endian SPARC systems, and can be considered big-endian in practice. ARM, C-Sky, and RISC-V have no relevant big-endian deployments, and can be considered little-endian in practice.
668:. Other compilers have options for generating code that globally enables the conversion for all file IO operations. This permits the reuse of code on a system with the opposite endianness without code modification. 950:
originally ran in big-endian mode, but by 2019, IBM had transitioned to little-endian mode for Linux to ease the porting of Linux software from x86 to Power. SPARC has no relevant little-endian deployment, as both
1410:
format that is portable between Windows and Mac systems and always little-endian, requiring the Mac application to swap the bytes on load and save when running on a big-endian Motorola 68K or PowerPC processor.
2617: 365:. On most systems, the address of a multi-byte simple data value is the address of its first byte (the byte with the lowest address). There are exceptions to this rule – for example, the Add instruction of the 240:, that the computer uses to access that data. On most modern computers, the smallest data group with an address is eight bits long and is called a byte. Larger groups comprise two or more bytes, for example, a 706:(0000004A), all of which retain the same numeric value. Although this little-endian property is rarely used directly by high-level programmers, it is occasionally employed by code optimizers as well as by 2256: 1036:
devices. In the absence of this unusual motherboard hardware, device driver software must write to different addresses to undo the incomplete transformation and also must perform a normal byte swap.
1116:
processors that have mixed-endian floating-point representation for double-precision numbers: each of the two 32-bit words is stored as little-endian, but the most significant word is stored first.
1727: 1452:(FAT) file system is defined with little-endian byte ordering, even on platforms using another endianness natively, necessitating byte-swap operations for maintaining the FAT on these platforms. 1334:
and compatible processors keep a 32-bit base address of the segment stored in little-endian order, but in four nonconsecutive bytes, at relative positions 2, 3, 4 and 7 of the descriptor start.
520:
or similar techniques that involve packing characters into an integer, so that it becomes a sequence of specific characters in memory. For example, take the string "JOHN", stored in hexadecimal
892:, unlike other Intel processors, expects 16-bit addresses for LJMP and LCALL in big-endian format; however, xCALL instructions store the return address onto the stack in little-endian format. 1223:
UNIX was one of the first systems to allow the same code to be compiled for platforms with different internal representations. One of the first programs converted was supposed to print out
2430: 2066: 269:
is a feature supported by numerous computer architectures that feature switchable endianness in data fetches and stores or for instruction fetches. Other orderings are generically called
1417:
image files are an example of the second strategy, whose header instructs the application about the endianness of their internal binary integers. If a file starts with the signature
513:), little-endian representation of integers has the significance increasing from left to right. In other words, it appears backwards when visualized, which can be counter-intuitive. 1654: 1120:
floating point stores little-endian 16-bit words in big-endian order. Because there have been many floating-point formats with no network standard representation for them, the
1042:
SPARC processors since the late 1990s (SPARC v9 compliant processors) allow data endianness to be chosen with each individual instruction that loads from or stores to memory.
726:
have a natural or preferred order in which the elementary steps are to be executed. This order may affect their performance on small-scale byte-addressable processors and
528:, the 32-bit value is stored as two 16-bit words "JO" "HN" in big-endian, with the characters in the 16-bit words being stored in little-endian, resulting in "O J N H". 2613: 1060:
Many processors have instructions to convert a word in a register to the opposite endianness, that is, they swap the order of the bytes in a 16-, 32- or 64-bit word.
903:
instruction set architectures use the little-endian format. Other instruction set architectures that follow this convention, allowing only little-endian mode, include
1365:
Fortran sequential unformatted files created with one endianness usually cannot be read on a system using the other endianness because Fortran usually implements a
2383: 2409: 1706: 1071:), which fetches a big-endian format word from memory or writes a word into memory in big-endian format. These processors are otherwise thoroughly little-endian. 2245: 2587: 2136: 1108:
Although many processors use little-endian storage for all types of data (integer, floating point), there are a number of hardware architectures where
745:
Some big-endian processors (e.g. the IBM System/360 and its successors) contain hardware instructions for lexicographically comparing varying length
823:
microprocessor for Datapoint, they used little-endian for compatibility. However, as Intel was unable to deliver the 8008 in time, Datapoint used a
2741: 2529: 2191: 491:
Integer numbers written as text are always represented most significant digit first in memory, which is similar to big-endian, independently of
2353: 2104: 1039:
Some CPUs, such as many PowerPC processors intended for embedded use and almost all SPARC processors, allow per-page choice of endianness.
1234:
A way to interpret this endianness is that it stores a 32-bit integer as two little-endian 16-bit words, with a big-endian word ordering:
1791: 2495: 288:, transmitting the most significant byte first. Conversely, little-endianness is the dominant ordering for processor architectures ( 304:
can use either ordering; some formats use a mixture of both or contain an indicator of which ordering is used throughout the file.
2645: 2323: 931: 2044: 1088:
historically used big-endian until version 9, which is bi-endian. Similarly early IBM POWER processors were big-endian, but the
1362:
The recognition of endianness is important when reading a file or filesystem created on a computer with different endianness.
1153:. Such an approach allows operand lengths up to 256 bytes or larger. The data types of such operands are character strings or 2292: 1965: 1687: 1027:
Some nominally bi-endian CPUs require motherboard help to fully switch endianness. For instance, the 32-bit desktop-oriented
1891: 1813: 1756: 764:
Many historical and extant processors use a big-endian memory representation, either exclusively or as a design option. The
1646: 2067:"Intel 64 and IA-32 Architectures Software Developer's Manual Volume 2 (2A, 2B & 2C): Instruction Set Reference, A-Z" 118: 2375: 2405: 1702: 369:
addresses variable-length fields at their low-order (highest-addressed) position with their lengths being defined by a
233:
from the big end or from the little end. By analogy, a CPU may read a digital word big end first, or little end first.
90: 2471: 1129:
same for floating-point numbers as for integers, making the conversion straightforward regardless of data type. Small
2161: 1350:(HDLs) used to express digital logic often support arbitrary endianness, with arbitrary granularity. For example, in 714:
code is allowed as "implementation-defined" by the C11 standard and commonly used in code interacting with hardware.
137: 2800: 2596: 1597: 208: 918:
Some instruction set architectures are "bi-endian" and allow running software of either endianness; these include
97: 35: 2222: 1004:, when said of hardware, denotes the capability of the machine to compute or pass data in either endian format. 479:
When character (text) strings are to be compared with one another, e.g. in order to support some mechanism like
389:(mostly base 2, or less often base 10) are the predominant way of representing and particularly of manipulating 236:
Computers store information in various-sized groups of binary bits. Each group is assigned a number, called its
2770: 2128: 75: 2525: 1448:
As a consequence of its original implementation on the Intel 8080 platform, the operating system-independent
1347: 1150: 1124:
standard uses big-endian IEEE 754 as its representation. It may therefore appear strange that the widespread
753: 370: 2244:
House, David; Faggin, Federico; Feeney, Hal; Gelbach, Ed; Hoff, Ted; Mazor, Stan; Smith, Hank (2006-09-21).
104: 1121: 1112:
numbers are represented in big-endian form while integers are represented in little-endian form. There are
362: 196: 2516: 71: 2735: 2183: 2823: 393:
by computers. In pure form this is valid for moderate sized non-negative integers, e.g. of C data type
390: 86: 17: 1466:, is known to provide adaptive endianness and to work with both big-endian and little-endian systems. 2722:
EPSG Working Draft Proposal 301: Ethernet POWERLINK Communication Profile Specification Version 1.1.4
2345: 229:, he portrays the conflict between sects of Lilliputians divided into those breaking the shell of a 2818: 1213: 824: 723: 353: 212: 1527:
defines a set of functions to convert 16- and 32-bit integers to and from network byte order: the
1074:
There are also devices which use different formats in different places. For instance, the BQ27421
2252: 2097: 1495: 281: 64: 1078:
battery gauge uses the little-endian format for its registers and the big-endian format for its
415:
Increasing numeric significance with increasing memory addresses (or increasing time), known as
408:
Decreasing numeric significance with increasing memory addresses (or increasing time), known as
2833: 1510: 1463: 460: 261: 246: 2491: 2282: 1782: 1449: 1157:. Machines able to manipulate such data with one instruction (e.g. compare, add) include the 856: 443: 253: 225: 155: 733:
Addition, subtraction, and multiplication start at the least significant digit position and
2698: 2431:"How to detect New Instruction support in the 4th generation Intel® Core™ processor family" 1931: 1787: 1502: 1154: 1079: 2614:"Microsoft Office Excel 97 - 2007 Binary File Format Specification (*.xls 97-2007 format)" 1535:(host-to-network-long) functions convert 16- and 32-bit values respectively from machine ( 8: 1327: 852: 800:
of processors use the big-endian format. Solely big-endian architectures include the IBM
734: 536:
Byte-swapping consists of rearranging bytes to change endianness. Many compilers provide
386: 827:
equivalent, but the little-endianness was retained in most Intel designs, including the
111: 2828: 2674: 2639: 2569: 1915: 1865: 1514: 537: 184: 2315: 2246:"Oral History Panel on the Development and Promotion of the Intel 8008 Microprocessor" 1777: 245:
later technology revisions and updates perpetuate the existing endianness to maintain
2666: 2288: 2036: 1961: 1857: 1683: 1556: 1487: 1075: 981: 816: 707: 484: 480: 464: 2573: 1869: 2688: 2559: 1921: 1849: 1627: 1521: 1425:
means little-endian. Those signatures need a single 16-bit word each, and they are
1379:(BOM) to signal the endianness of the file or stream. Its code point is U+FEFF. In 1113: 1097: 1046: 965: 912: 908: 746: 620: 395: 293: 180: 1554:
While the high-level network protocols usually consider the byte (mostly meant as
1216:
compiler used the same format for 32-bit long integers. This ordering is known as
30:"Big-endian" and "Little-endian" redirect here. For the conflicting ideologies in 1955: 1884: 1817: 1752: 1376: 1130: 727: 504: 328: 320: 192: 2701: 2678: 1934: 1491: 280:
Big-endianness is the dominant ordering in networking protocols, such as in the
1615: 1501:
However, not all protocols use big-endian byte order as the network order. The
1366: 1182: 1146: 1109: 952: 812: 801: 777: 765: 683: 492: 456: 338: 257: 220: 188: 160: 686:
restrictions are imposed). For example, a 32-bit memory location with content
2812: 1861: 1675: 1561: 1351: 789: 324: 42: 1838:
James, David V. (June 1990). "Multiplexed buses: the endian wars continue".
1631: 1601: 2463: 2243: 2132: 885:, and many other processors and processor families are also little-endian. 797: 785: 711: 2564: 2547: 2160:. ISO. Section 6.5.2.3 "Structure and Union members", §3 and footnote 95. 2157: 756:
statement is in principle independent of the endianness of the processor.
599:
instruction sets provide native support for endian byte swapping, such as
608: 509:
When memory bytes are printed sequentially from left to right (e.g. in a
452: 423:
In these expressions, the term "end" is meant as the extremity where the
301: 2795: 1141:
Most instructions considered so far contain the size (lengths) of their
1063:
Recent Intel x86 and x86-64 architecture CPUs have a MOVBE instruction (
560:
functions (from/to BE, up to 32-bit). Windows has a 64-bit extension in
2670: 2548:"Transporting a portable operating system: UNIX to an IBM minicomputer" 1840: 1547:
functions convert from network to host order. These functions may be a
1459: 1426: 1174: 1170: 1068: 1064: 985: 769: 337:. Each byte is identified and accessed in hardware and software by its 230: 2693: 2215:"[GIT PULL] Device properties framework update for v4.18-rc1" 2214: 1926: 1853: 1573: 1133:
using special floating-point formats may be another matter, however.
1093: 973: 919: 844: 840: 168: 2762: 150: 53: 2589:
AMD64 Architecture Programmer's Manual Volume 2: System Programming
2023: 1999: 1475: 1442: 1407: 1166: 1162: 1158: 1125: 1009: 805: 627: 540:
that are likely to be compiled into native processor instructions (
510: 448: 366: 312: 219:
has its origin in the writings of 18th century Anglo-Irish writer
1989: 1506: 1372: 1178: 1142: 1089: 1028: 989: 969: 939: 927: 904: 882: 773: 634: 588: 1395: 1380: 1205: 993: 935: 900: 879: 863: 828: 784:
uses big-endian addressing for byte-oriented instructions. The
781: 703: 699: 695: 525: 517: 297: 241: 2013: 815:
used simple bit-serial logic with little-endian to facilitate
2019: 1995: 1548: 1434: 1331: 1100:
was little-endian before version 3 when it became bi-endian.
1085: 1021: 997: 977: 947: 943: 923: 896: 859: 691: 631: 630:
have built-in facilities for byte swapping. For example, the
574: 521: 1421:
it means that integers are represented as big-endian, while
199:
compared to earliness. Endianness is primarily expressed as
2684: 2184:"3.10 Options That Control Optimization: -fstrict-aliasing" 1607: 1414: 1210: 889: 875: 871: 832: 820: 793: 612: 333: 176: 1524: 1455: 1117: 1033: 867: 848: 836: 604: 596: 289: 2734:
IEEE and The Open Group (2018). "3. System Interfaces".
1917:
A File Format for the Exchange of Images in the Internet
1354:, a word can be defined as little-endian or big-endian. 41:
For the specific use of endianness in date formats, see
2733: 2641:
FreeBSD Kernel Internals: An Intensive Code Walkthrough
2373: 1954:
Tanenbaum, Andrew S.; Austin, Todd M. (4 August 2012).
1578:
Pages displaying short descriptions of redirect targets
676: 2546:
Jalics, Paul J.; Heines, Thomas S. (1 December 1983).
788:
minicomputer uses big-endian byte order. The Motorola
2595:(Technical report). 2013. p. 80. Archived from 2492:"pack – convert a list into a binary representation" 442:
The integer data that are directly supported by the
1947: 316:
Diagram demonstrating big- versus little-endianness
78:. Unsourced material may be challenged and removed. 2376:"The Transition To RHEL 8 Begins On Power Systems" 459:. The most-significant byte is accessed first for 323:consists of a sequence of storage cells (smallest 2720:Ethernet POWERLINK Standardisation Group (2012), 1505:(SMB) protocol uses little-endian byte order. In 1383:for example, a big-endian file should start with 768:uses big-endian byte order, as do its successors 36:Lilliput and Blefuscu § History and politics 2810: 1883:Blanc, Bertrand; Maaraoui, Bob (December 2005). 1703:"Understanding big and little endian byte order" 1953: 1560:) as their atomic unit, the lowest layers of a 1494:defines the network order for protocols in the 946:run in big-endian mode on bi-endian Power ISA; 352:Computer programs often use data structures or 2665: 2346:"Little endian and Linux on IBM Power Systems" 1564:may deal with ordering of bits within a byte. 1482:, meaning the order of transmission for bytes 300:implementations) and their associated memory. 211:into computer science for data ordering in an 1882: 1682:(3 ed.), Pearson Education, p. 79, 1193:Numerous other orderings, generically called 2644:. OpenZFS Documentation/Read Write Lecture. 2545: 1680:Computer Systems: A Programmer's Perspective 1576: – Convention to identify bit positions 1513:first (little-endian). The same is true for 710:programmers. While not allowed by C++, such 571:functions (from/to BE and LE, up to 64-bit). 552:. Software interfaces for swapping include: 341:. If the total number of bytes in memory is 2637: 2343: 1674: 1209:from the expected little-endian order. The 2737:The Open Group Base Specifications Issue 7 2406:"Differences between BE-32 and BE-8 buses" 690:can be read at the same address as either 345:, then addresses are enumerated from 0 to 163:, the novel from which the term was coined 2692: 2563: 2274: 1925: 1394:Application binary data formats, such as 580:macros (from/to BE and LE, up to 64-bit). 138:Learn how and when to remove this message 2374:Timothy Prickett Morgan (10 June 2019). 2212: 1509:, multi-byte parameters are always sent 1357: 311: 149: 2098:"i960® VH Processor Developer's Manual" 1136: 1024:-based Itanium CPU, which allows both. 183:of digital data are transmitted over a 14: 2811: 2461: 1753:"Writing endian-independent code in C" 1490:. Among others, the historic RFC  1429:, so they are endianness independent. 1049:supports two big-endian modes, called 516:This behavior arises, for example, in 468: 2316:"Cx51 User's Guide: E. Byte Ordering" 2280: 2047:from the original on 20 November 2023 1837: 1644: 1613: 1596: 641:specifier when opening a file, e.g.: 2386:from the original on 24 January 2022 1387:; a little-endian should start with 717: 677:Simplified access to part of a field 76:adding citations to reliable sources 47: 2287:. O'Reilly Media, Inc. p. 29. 2225:from the original on 15 August 2018 2072:. Intel. September 2016. p. 3–112. 1616:"On Holy Wars and a Plea for Peace" 1590: 1096:descendants are now bi-endian. The 637:compiler supports the non-standard 24: 2443:from the original on 20 March 2016 2164:from the original on 28 March 2020 1647:"A Voyage to Lilliput, Chapter IV" 1185:, all of them of type big-endian. 498: 307: 25: 2845: 2788: 1603:On Holy Wars and a Plea for Peace 1375:text can optionally start with a 1227:, but on the Series/1 it printed 1103: 671: 327:units); in machines that support 215:published in 1980. The adjective 27:Order of bytes in a computer word 2794: 2535:from the original on 2022-10-09. 2194:from the original on 1 July 2023 1957:Structured Computer Organization 1885:"Endianness or Where is Byte 0?" 1811: 1188: 959: 752:The normal data transport by an 531: 52: 2773:from the original on 2021-04-18 2755: 2744:from the original on 2021-04-18 2727: 2714: 2659: 2648:from the original on 2016-04-14 2631: 2620:from the original on 2008-12-22 2616:. Microsoft Corporation. 2007. 2606: 2580: 2539: 2509: 2498:from the original on 2009-02-18 2484: 2474:from the original on 2018-07-03 2455: 2423: 2412:from the original on 2019-02-12 2398: 2367: 2356:from the original on 2022-03-27 2337: 2326:from the original on 2015-04-02 2308: 2262:from the original on 2014-06-29 2237: 2206: 2176: 2150: 2139:from the original on 2019-01-19 2121: 2110:from the original on 2024-04-02 2090: 2079:from the original on 2022-10-09 2059: 2029: 2005: 1981: 1908: 1897:from the original on 2007-12-03 1876: 1794:from the original on 2021-07-21 1778:"Internet Hall of Fame Pioneer" 1759:from the original on 2019-06-10 1734:from the original on 2019-05-09 1709:from the original on 2019-05-24 1657:from the original on 2022-09-20 1342: 557: 483:, this is very frequently done 399:. In such a number system, the 252:A big-endian system stores the 63:needs additional citations for 2281:Lunde, Ken (13 January 2009). 2213:Torvalds, Linus (5 Jun 2018). 1831: 1805: 1770: 1745: 1720: 1695: 1668: 1638: 1348:Hardware description languages 964:Some architectures (including 13: 1: 2799:The dictionary definition of 2740:. Vol. 2. p. 1120. 2526:Digital Equipment Corporation 2188:GNU Compiler Collection (GCC) 1614:Cohen, Danny (October 1981). 1583: 1469: 1238:Storage of a 32-bit integer, 284:, where it is referred to as 2518:PDP-11/45 Processor Handbook 2462:Savard, John J. G. (2018) , 2190:. Free Software Foundation. 1678:; David, O'Hallaron (2016), 1531:(host-to-network-short) and 7: 2763:"htonl(3) - Linux man page" 2284:CJKV Information Processing 1567: 1337: 1253:16-bit little-endian value 819:. When Intel developed the 759: 10: 2850: 2344:Jeff Scheel (2016-06-16). 2129:"ARMv8-A Reference Manual" 1067:since generation 4, after 1008:in big-endian mode on the 502: 381: 256:of a word at the smallest 207:(LE), terms introduced by 40: 29: 2552:Communications of the ACM 1920:. April 1992. p. 7. 1544: 1540: 1532: 1528: 1438: 1430: 1422: 1418: 1388: 1384: 1312: 1302: 1291: 1278: 1268: 1257: 1249: 1246: 1228: 1224: 724:positional number systems 687: 642: 638: 616: 615:— i960Jx and later), and 600: 584: 577: 568: 561: 549: 545: 541: 435:, namely where the field 387:Positional number systems 331:, those units are called 191:(by rising addresses) in 2464:"Floating-Point Formats" 1645:Swift, Jonathan (1726). 1551:on a big-endian system. 1539:) to network order; the 825:medium-scale integration 469:§ Calculation order 431:significance is written 213:Internet Experiment Note 2253:Computer History Museum 2103:. Intel. October 1998. 1632:10.1109/C-M.1981.220208 1496:Internet protocol suite 474: 282:Internet protocol suite 1511:least significant byte 1464:logical volume manager 968:versions 3 and above, 317: 296:implementations, base 262:least significant byte 247:backward compatibility 175:is the order in which 164: 2565:10.1145/358476.358504 2528:. 1973. p. 165. 1960:. Prentice Hall PTR. 1783:Internet Hall of Fame 1450:File Allocation Table 1358:Files and filesystems 857:Western Design Center 682:addresses (even when 315: 254:most significant byte 195:, counting only byte 153: 2638:Matt Ahrens (2016). 1788:The Internet Society 1503:Server Message Block 1137:Variable-length data 1080:random-access memory 662:'BIG_ENDIAN' 363:hardware instruction 223:. In the 1726 novel 72:improve this article 2041:en.cppreference.com 2026:– Library Functions 2002:– Library Functions 1728:"Byte Ordering PPC" 1458:, which combines a 1328:Segment descriptors 1243: 853:MOS Technology 6502 738:significant digit. 735:propagate the carry 722:Some operations in 1651:Gulliver's Travels 1612:Also published at 1515:Ethernet Powerlink 1498:to be big-endian. 1237: 855:family (including 558:network endianness 318: 226:Gulliver's Travels 185:data communication 165: 156:Gulliver's Travels 32:Gulliver's Travels 2824:Data transmission 2558:(12): 1066–1072. 2294:978-0-596-51447-1 1967:978-0-13-291652-3 1689:978-1-488-67207-1 1676:Bryant, Randal E. 1488:network protocols 1325: 1324: 1076:Texas Instruments 817:carry propagation 747:character strings 718:Calculation order 708:assembly language 550:__builtin_bswap32 485:lexicographically 444:computer hardware 148: 147: 140: 122: 16:(Redirected from 2841: 2798: 2782: 2781: 2779: 2778: 2759: 2753: 2752: 2750: 2749: 2731: 2725: 2724:, chapter 6.1.1. 2718: 2712: 2711: 2709: 2708: 2696: 2694:10.17487/RFC1700 2680:Assigned Numbers 2675:"Data Notations" 2673:(October 1994). 2663: 2657: 2656: 2654: 2653: 2635: 2629: 2628: 2626: 2625: 2610: 2604: 2603: 2601: 2594: 2584: 2578: 2577: 2567: 2543: 2537: 2536: 2534: 2523: 2513: 2507: 2506: 2504: 2503: 2488: 2482: 2481: 2480: 2479: 2459: 2453: 2452: 2450: 2448: 2442: 2435: 2427: 2421: 2420: 2418: 2417: 2402: 2396: 2395: 2393: 2391: 2371: 2365: 2364: 2362: 2361: 2341: 2335: 2334: 2332: 2331: 2312: 2306: 2305: 2303: 2301: 2278: 2272: 2271: 2269: 2267: 2261: 2250: 2241: 2235: 2234: 2232: 2230: 2221:(Mailing list). 2210: 2204: 2203: 2201: 2199: 2180: 2174: 2173: 2171: 2169: 2154: 2148: 2147: 2145: 2144: 2125: 2119: 2118: 2116: 2115: 2109: 2102: 2094: 2088: 2087: 2085: 2084: 2078: 2071: 2063: 2057: 2056: 2054: 2052: 2033: 2027: 2017: 2016: 2009: 2003: 1993: 1992: 1985: 1979: 1978: 1976: 1974: 1951: 1945: 1944: 1942: 1941: 1929: 1927:10.17487/RFC1314 1912: 1906: 1905: 1903: 1902: 1896: 1889: 1880: 1874: 1873: 1854:10.1109/40.56322 1835: 1829: 1828: 1826: 1825: 1816:. Archived from 1809: 1803: 1802: 1800: 1799: 1774: 1768: 1767: 1765: 1764: 1749: 1743: 1742: 1740: 1739: 1724: 1718: 1717: 1715: 1714: 1699: 1693: 1692: 1672: 1666: 1665: 1663: 1662: 1642: 1636: 1635: 1611: 1594: 1579: 1546: 1542: 1534: 1530: 1522:Berkeley sockets 1440: 1432: 1424: 1420: 1390: 1386: 1244: 1236: 1230: 1226: 1201:, are possible. 1131:embedded systems 1098:ARM architecture 1047:ARM architecture 913:Qualcomm Hexagon 909:Andes Technology 839:successors. The 728:microcontrollers 689: 667: 666: 663: 660: 657: 654: 651: 648: 645: 640: 618: 602: 586: 579: 570: 563: 551: 547: 543: 398: 349: − 1. 143: 136: 132: 129: 123: 121: 80: 56: 48: 21: 2849: 2848: 2844: 2843: 2842: 2840: 2839: 2838: 2819:Computer memory 2809: 2808: 2791: 2786: 2785: 2776: 2774: 2761: 2760: 2756: 2747: 2745: 2732: 2728: 2719: 2715: 2706: 2704: 2664: 2660: 2651: 2649: 2636: 2632: 2623: 2621: 2612: 2611: 2607: 2599: 2592: 2586: 2585: 2581: 2544: 2540: 2532: 2521: 2515: 2514: 2510: 2501: 2499: 2490: 2489: 2485: 2477: 2475: 2460: 2456: 2446: 2444: 2440: 2433: 2429: 2428: 2424: 2415: 2413: 2404: 2403: 2399: 2389: 2387: 2372: 2368: 2359: 2357: 2342: 2338: 2329: 2327: 2314: 2313: 2309: 2299: 2297: 2295: 2279: 2275: 2265: 2263: 2259: 2248: 2242: 2238: 2228: 2226: 2211: 2207: 2197: 2195: 2182: 2181: 2177: 2167: 2165: 2156: 2155: 2151: 2142: 2140: 2127: 2126: 2122: 2113: 2111: 2107: 2100: 2096: 2095: 2091: 2082: 2080: 2076: 2069: 2065: 2064: 2060: 2050: 2048: 2037:"std::byteswap" 2035: 2034: 2030: 2012: 2011: 2010: 2006: 1988: 1987: 1986: 1982: 1972: 1970: 1968: 1952: 1948: 1939: 1937: 1914: 1913: 1909: 1900: 1898: 1894: 1887: 1881: 1877: 1836: 1832: 1823: 1821: 1810: 1806: 1797: 1795: 1776: 1775: 1771: 1762: 1760: 1751: 1750: 1746: 1737: 1735: 1726: 1725: 1721: 1712: 1710: 1701: 1700: 1696: 1690: 1673: 1669: 1660: 1658: 1643: 1639: 1595: 1591: 1586: 1577: 1570: 1472: 1377:byte order mark 1360: 1345: 1340: 1321: 1320: 1308: 1307: 1300: 1299: 1287: 1286: 1274: 1273: 1266: 1265: 1241: 1191: 1139: 1106: 962: 762: 720: 679: 674: 664: 661: 658: 655: 652: 649: 646: 643: 534: 507: 505:Byte addressing 501: 499:Byte addressing 477: 394: 384: 329:byte addressing 321:Computer memory 310: 308:Characteristics 193:computer memory 144: 133: 127: 124: 81: 79: 69: 57: 46: 39: 28: 23: 22: 15: 12: 11: 5: 2847: 2837: 2836: 2831: 2826: 2821: 2807: 2806: 2790: 2789:External links 2787: 2784: 2783: 2754: 2726: 2713: 2658: 2630: 2605: 2602:on 2018-02-18. 2579: 2538: 2508: 2483: 2454: 2422: 2397: 2366: 2336: 2307: 2293: 2273: 2255:. p. b5. 2236: 2205: 2175: 2158:"C11 standard" 2149: 2120: 2089: 2058: 2028: 2004: 1980: 1966: 1946: 1907: 1875: 1830: 1804: 1769: 1744: 1719: 1694: 1688: 1667: 1637: 1600:(1980-04-01). 1588: 1587: 1585: 1582: 1581: 1580: 1569: 1566: 1471: 1468: 1401:files, or the 1359: 1356: 1344: 1341: 1339: 1336: 1323: 1322: 1318: 1316: 1314: 1310: 1309: 1305: 1303: 1301: 1297: 1295: 1293: 1289: 1288: 1284: 1282: 1280: 1276: 1275: 1271: 1269: 1267: 1263: 1261: 1259: 1255: 1254: 1251: 1248: 1242:, on a PDP-11 1239: 1190: 1187: 1183:z/Architecture 1147:operation code 1138: 1135: 1110:floating-point 1105: 1104:Floating point 1102: 961: 958: 953:Oracle Solaris 813:Datapoint 2200 802:z/Architecture 778:z/Architecture 766:IBM System/360 761: 758: 719: 716: 694:(value = 4A), 678: 675: 673: 672:Considerations 670: 593: 592: 581: 572: 567:BSD and Glibc 565: 533: 530: 500: 497: 493:text direction 476: 473: 457:multiplication 421: 420: 413: 383: 380: 339:memory address 309: 306: 258:memory address 221:Jonathan Swift 161:Jonathan Swift 146: 145: 60: 58: 51: 26: 9: 6: 4: 3: 2: 2846: 2835: 2834:Software wars 2832: 2830: 2827: 2825: 2822: 2820: 2817: 2816: 2814: 2805:at Wiktionary 2804: 2803: 2797: 2793: 2792: 2772: 2768: 2767:linux.die.net 2764: 2758: 2743: 2739: 2738: 2730: 2723: 2717: 2703: 2700: 2697:. STD 2. 2695: 2690: 2687:. p. 3. 2686: 2682: 2681: 2676: 2672: 2668: 2662: 2647: 2643: 2642: 2634: 2619: 2615: 2609: 2598: 2591: 2590: 2583: 2575: 2571: 2566: 2561: 2557: 2553: 2549: 2542: 2531: 2527: 2520: 2519: 2512: 2497: 2493: 2487: 2473: 2469: 2465: 2458: 2439: 2432: 2426: 2411: 2407: 2401: 2385: 2381: 2377: 2370: 2355: 2351: 2347: 2340: 2325: 2321: 2317: 2311: 2296: 2290: 2286: 2285: 2277: 2258: 2254: 2247: 2240: 2224: 2220: 2216: 2209: 2193: 2189: 2185: 2179: 2163: 2159: 2153: 2138: 2134: 2130: 2124: 2106: 2099: 2093: 2075: 2068: 2062: 2046: 2042: 2038: 2032: 2025: 2022:Programmer's 2021: 2018: –  2015: 2008: 2001: 1998:Programmer's 1997: 1994: –  1991: 1984: 1969: 1963: 1959: 1958: 1950: 1936: 1933: 1928: 1923: 1919: 1918: 1911: 1893: 1886: 1879: 1871: 1867: 1863: 1859: 1855: 1851: 1847: 1843: 1842: 1834: 1820:on 2017-11-09 1819: 1815: 1812:Cary, David. 1808: 1793: 1789: 1785: 1784: 1779: 1773: 1758: 1754: 1748: 1733: 1729: 1723: 1708: 1704: 1698: 1691: 1685: 1681: 1677: 1671: 1656: 1652: 1648: 1641: 1633: 1629: 1626:(10): 48–54. 1625: 1621: 1620:IEEE Computer 1617: 1609: 1605: 1604: 1599: 1593: 1589: 1575: 1572: 1571: 1565: 1563: 1562:network stack 1559: 1558: 1552: 1550: 1538: 1526: 1523: 1518: 1516: 1512: 1508: 1504: 1499: 1497: 1493: 1489: 1485: 1484:over the wire 1481: 1480:network order 1478:use the term 1477: 1467: 1465: 1461: 1457: 1453: 1451: 1446: 1444: 1436: 1428: 1416: 1412: 1409: 1404: 1400: 1397: 1392: 1382: 1378: 1374: 1370: 1368: 1363: 1355: 1353: 1352:SystemVerilog 1349: 1335: 1333: 1329: 1315: 1311: 1294: 1290: 1281: 1277: 1260: 1256: 1252: 1245: 1235: 1232: 1221: 1219: 1215: 1212: 1207: 1202: 1200: 1196: 1195:middle-endian 1189:Middle-endian 1186: 1184: 1180: 1176: 1172: 1168: 1164: 1160: 1156: 1152: 1148: 1144: 1134: 1132: 1127: 1123: 1119: 1115: 1111: 1101: 1099: 1095: 1091: 1087: 1083: 1081: 1077: 1072: 1070: 1066: 1061: 1058: 1056: 1052: 1048: 1043: 1040: 1037: 1035: 1030: 1025: 1023: 1018: 1013: 1011: 1005: 1003: 999: 995: 991: 987: 983: 979: 975: 971: 967: 960:Bi-endianness 957: 954: 949: 945: 941: 937: 933: 929: 925: 921: 916: 914: 910: 906: 902: 898: 893: 891: 886: 884: 881: 877: 873: 869: 866:), the Zilog 865: 861: 858: 854: 850: 846: 842: 838: 834: 830: 826: 822: 818: 814: 809: 807: 803: 799: 795: 791: 787: 783: 779: 775: 771: 767: 757: 755: 750: 748: 743: 739: 736: 731: 729: 725: 715: 713: 709: 705: 702:(00004A), or 701: 697: 693: 685: 669: 636: 633: 629: 624: 622: 614: 610: 606: 598: 590: 585:std::byteswap 582: 578:OSByteOrder.h 576: 573: 566: 559: 555: 554: 553: 539: 532:Byte swapping 529: 527: 523: 519: 514: 512: 506: 496: 494: 489: 486: 482: 472: 470: 466: 462: 458: 454: 450: 445: 440: 438: 434: 430: 426: 418: 417:little-endian 414: 411: 407: 406: 405: 402: 397: 392: 388: 379: 378:instruction. 375: 372: 368: 364: 360: 355: 350: 348: 344: 340: 336: 335: 330: 326: 322: 314: 305: 303: 299: 295: 291: 287: 286:network order 283: 278: 276: 272: 271:middle-endian 268: 267:Bi-endianness 263: 259: 255: 250: 248: 243: 239: 234: 232: 228: 227: 222: 218: 214: 210: 206: 205:little-endian 202: 198: 194: 190: 186: 182: 178: 174: 170: 162: 158: 157: 152: 142: 139: 131: 120: 117: 113: 110: 106: 103: 99: 96: 92: 89: –  88: 84: 83:Find sources: 77: 73: 67: 66: 61:This article 59: 55: 50: 49: 44: 43:Calendar date 37: 33: 19: 2801: 2775:. Retrieved 2766: 2757: 2746:. Retrieved 2736: 2729: 2721: 2716: 2705:. Retrieved 2679: 2667:Reynolds, J. 2661: 2650:. Retrieved 2640: 2633: 2622:. Retrieved 2608: 2597:the original 2588: 2582: 2555: 2551: 2541: 2517: 2511: 2500:. Retrieved 2486: 2476:, retrieved 2467: 2457: 2445:. Retrieved 2425: 2414:. Retrieved 2400: 2388:. Retrieved 2379: 2369: 2358:. Retrieved 2349: 2339: 2328:. Retrieved 2319: 2310: 2298:. Retrieved 2283: 2276: 2264:. Retrieved 2239: 2227:. Retrieved 2219:Linux Kernel 2218: 2208: 2196:. Retrieved 2187: 2178: 2166:. Retrieved 2152: 2141:. Retrieved 2133:ARM Holdings 2123: 2112:. Retrieved 2092: 2081:. Retrieved 2061: 2049:. Retrieved 2040: 2031: 2007: 1990:byteorder(3) 1983: 1971:. Retrieved 1956: 1949: 1938:. Retrieved 1916: 1910: 1899:. Retrieved 1878: 1845: 1839: 1833: 1822:. Retrieved 1818:the original 1814:"Endian FAQ" 1807: 1796:. Retrieved 1781: 1772: 1761:. Retrieved 1747: 1736:. Retrieved 1722: 1711:. Retrieved 1697: 1679: 1670: 1659:. Retrieved 1650: 1640: 1623: 1619: 1602: 1598:Cohen, Danny 1592: 1555: 1553: 1536: 1519: 1500: 1483: 1479: 1473: 1454: 1447: 1413: 1402: 1398: 1393: 1371: 1364: 1361: 1346: 1343:Logic design 1326: 1250:8-bit value 1247:byte offset 1233: 1222: 1217: 1203: 1199:mixed-endian 1198: 1194: 1192: 1140: 1107: 1084: 1073: 1062: 1059: 1054: 1050: 1044: 1041: 1038: 1026: 1016: 1014: 1006: 1001: 963: 917: 894: 887: 810: 798:68000 series 792:/ 6801, the 786:IBM Series/1 763: 751: 744: 740: 732: 721: 712:type punning 680: 625: 623:and later). 594: 587:function in 535: 515: 508: 490: 478: 441: 436: 432: 428: 424: 422: 416: 409: 400: 391:integer data 385: 376: 358: 351: 346: 342: 332: 319: 302:File formats 285: 279: 275:mixed-endian 274: 270: 266: 251: 237: 235: 224: 216: 204: 200: 197:significance 172: 166: 154: 134: 125: 115: 108: 101: 94: 87:"Endianness" 82: 70:Please help 65:verification 62: 31: 1848:(3): 9–21. 1441:stands for 1433:stands for 1427:palindromes 1389:FF FE 00 00 1385:00 00 FE FF 1145:within the 994:SuperH SH-4 911:NDS32, and 870:(including 688:4A 00 00 00 611:and later, 548:), such as 453:subtraction 325:addressable 209:Danny Cohen 2813:Categories 2802:endianness 2777:2021-04-09 2748:2021-04-09 2707:2012-03-02 2671:Postel, J. 2652:2016-03-30 2624:2014-08-18 2502:2009-02-04 2478:2018-07-16 2416:2019-02-10 2360:2022-03-27 2330:2015-03-28 2143:2017-02-05 2114:2024-04-02 2083:2017-02-05 1940:2021-08-16 1901:2008-12-21 1841:IEEE Micro 1824:2010-10-11 1798:2015-10-07 1763:2019-05-20 1738:2019-05-20 1713:2019-05-20 1661:2022-09-20 1610:. IEN 137. 1584:References 1470:Networking 1460:filesystem 1240:0x0A0B0C0D 1218:PDP-endian 1175:System/370 1171:System/360 1065:Intel Core 986:Intel i860 888:The Intel 770:System/370 754:assignment 562:winsock2.h 503:See also: 465:comparison 410:big-endian 231:boiled egg 201:big-endian 187:medium or 173:endianness 98:newspapers 18:Big-endian 2829:Metaphors 2468:quadibloc 2229:15 August 2198:15 August 2168:15 August 2051:3 October 2014:endian(3) 1862:0272-1732 1574:Bit order 1476:IETF RFCs 1231:instead. 1151:word mark 1094:Power ISA 1017:bi-endian 1015:The term 1002:bi-endian 920:Power ISA 845:Atmel AVR 841:DEC Alpha 684:alignment 628:compilers 556:Standard 538:built-ins 371:word mark 189:addressed 179:within a 169:computing 128:July 2020 2771:Archived 2742:Archived 2646:Archived 2618:Archived 2574:15558835 2530:Archived 2496:Archived 2472:archived 2438:Archived 2410:Archived 2390:26 March 2384:Archived 2380:ITJungle 2354:Archived 2324:Archived 2320:keil.com 2266:23 April 2257:Archived 2223:Archived 2192:Archived 2162:Archived 2137:Archived 2105:Archived 2074:Archived 2045:Archived 1892:Archived 1870:24291134 1792:Archived 1757:Archived 1732:Archived 1707:Archived 1655:Archived 1568:See also 1443:Motorola 1408:XLS file 1338:Software 1159:IBM 1401 1143:operands 1126:IEEE 754 1010:Cray T3E 835:and its 831:and the 806:OpenRISC 796:and the 760:Hardware 698:(004A), 569:endian.h 511:hex dump 461:division 449:addition 396:unsigned 367:IBM 1401 260:and the 203:(BE) or 1507:CANopen 1373:Unicode 1179:ESA/390 1090:PowerPC 1029:PowerPC 990:PA-RISC 970:PowerPC 940:IBM AIX 928:AArch64 905:Nios II 883:Nios II 878:), the 774:ESA/390 656:CONVERT 639:CONVERT 635:Fortran 481:sorting 382:Numbers 361:single 292:, most 238:address 112:scholar 2572:  2300:21 May 2291:  2024:Manual 2000:Manual 1973:18 May 1964:  1868:  1860:  1686:  1462:and a 1396:MATLAB 1381:UTF-32 1367:record 1206:PDP-11 1181:, and 936:RISC-V 934:, and 926:, ARM 901:x86-64 880:Altera 864:65C816 851:, the 829:MCS-48 782:PDP-10 780:. The 776:, and 704:32-bit 700:24-bit 696:16-bit 526:PDP-11 518:FourCC 467:. See 437:starts 429:little 427:resp. 354:fields 298:RISC-V 242:32-bit 217:endian 114:  107:  100:  93:  85:  34:, see 2600:(PDF) 2593:(PDF) 2570:S2CID 2533:(PDF) 2522:(PDF) 2447:2 May 2441:(PDF) 2434:(PDF) 2260:(PDF) 2249:(PDF) 2108:(PDF) 2101:(PDF) 2077:(PDF) 2070:(PDF) 2020:Linux 1996:Linux 1895:(PDF) 1888:(PDF) 1866:S2CID 1557:octet 1549:no-op 1545:ntohl 1541:ntohs 1533:htonl 1529:htons 1474:Many 1435:Intel 1332:IA-32 1086:SPARC 1055:BE-32 1022:IA-64 998:IA-64 978:SPARC 974:Alpha 948:Linux 944:IBM i 932:C-Sky 924:SPARC 897:IA-32 860:65802 692:8-bit 665:,...) 632:Intel 626:Some 621:ARMv6 601:bswap 595:Some 589:C++23 575:macOS 546:movbe 542:bswap 522:ASCII 433:first 401:value 334:bytes 177:bytes 119:JSTOR 105:books 2702:1700 2685:IETF 2449:2017 2392:2022 2302:2013 2289:ISBN 2268:2014 2231:2018 2200:2018 2170:2018 2053:2023 1975:2013 1962:ISBN 1935:1314 1858:ISSN 1684:ISBN 1608:IETF 1543:and 1537:host 1520:The 1492:1700 1437:and 1415:TIFF 1403:.bil 1399:.mat 1304:0C0D 1270:0A0B 1229:nUxi 1225:Unix 1211:UNIX 1204:The 1167:1620 1163:1410 1092:and 1069:Atom 1053:and 1051:BE-8 1045:The 996:and 982:MIPS 980:V9, 942:and 899:and 895:The 890:8051 876:eZ80 874:and 872:Z180 862:and 833:8086 821:8008 811:The 804:and 794:6809 790:6800 650:unit 644:OPEN 613:i960 583:The 475:Text 463:and 455:and 181:word 91:news 2699:RFC 2689:doi 2560:doi 2350:IBM 1932:RFC 1922:doi 1850:doi 1628:doi 1525:API 1486:in 1456:ZFS 1330:of 1197:or 1155:BCD 1122:XDR 1118:VAX 1114:ARM 1034:I/O 1012:). 966:ARM 868:Z80 849:VAX 837:x86 617:rev 609:486 605:x86 597:CPU 425:big 412:and 359:one 294:ARM 290:x86 273:or 167:In 159:by 74:by 2815:: 2769:. 2765:. 2683:. 2677:. 2669:; 2568:. 2556:26 2554:. 2550:. 2524:. 2494:. 2470:, 2466:, 2436:. 2408:. 2382:. 2378:. 2352:. 2348:. 2322:. 2318:. 2251:. 2217:. 2186:. 2135:. 2131:. 2043:. 2039:. 1930:. 1890:. 1864:. 1856:. 1846:10 1844:. 1790:. 1786:. 1780:. 1755:. 1730:. 1705:. 1653:. 1649:. 1624:14 1622:. 1618:. 1606:. 1517:. 1423:II 1419:MM 1391:. 1317:0C 1313:3 1296:0D 1292:2 1283:0A 1279:1 1262:0B 1258:0 1220:. 1177:, 1173:, 1169:, 1165:, 1161:, 1082:. 992:, 988:, 984:, 976:, 972:, 938:. 930:, 922:, 915:. 907:, 847:, 843:, 808:. 772:, 749:. 607:— 495:. 471:. 451:, 439:. 277:. 249:. 171:, 2780:. 2751:. 2710:. 2691:: 2655:. 2627:. 2576:. 2562:: 2505:. 2451:. 2419:. 2394:. 2363:. 2333:. 2304:. 2270:. 2233:. 2202:. 2172:. 2146:. 2117:. 2086:. 2055:. 1977:. 1943:. 1924:: 1904:. 1872:. 1852:: 1827:. 1801:. 1766:. 1741:. 1716:. 1664:. 1634:. 1630:: 1439:M 1431:I 1319:h 1306:h 1298:h 1285:h 1272:h 1264:h 1214:C 659:= 653:, 647:( 619:( 603:( 591:. 564:. 544:/ 419:. 347:n 343:n 141:) 135:( 130:) 126:( 116:· 109:· 102:· 95:· 68:. 45:. 38:. 20:)

Index

Big-endian
Lilliput and Blefuscu § History and politics
Calendar date

verification
improve this article
adding citations to reliable sources
"Endianness"
news
newspapers
books
scholar
JSTOR
Learn how and when to remove this message

Gulliver's Travels
Jonathan Swift
computing
bytes
word
data communication
addressed
computer memory
significance
Danny Cohen
Internet Experiment Note
Jonathan Swift
Gulliver's Travels
boiled egg
32-bit

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.