File:32bit-Endianess.svg

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search

Original file (SVG file, nominally 1,000 × 500 pixels, file size: 5 KB)

Captions

Captions

32-Bit Integer arraged in memory in big- and little-endian byte order

Summary

[edit]
Description

endianness (Q339338):

Deutsch: Ein 32-Bit Integer (0A0B0C0D16, 16849614110, 0000 1010 0000 1011 0000 1100 0000 11012) als vier Bytes im Speicher abgebildet in Big- und Little-endian Byte-Reihenfolge.

Diese beiden Diagramme zeigen, wie zwei Computer mit unterschiedlicher Endianness eine 32-Bit-Ganzzahl (vier Byte) mit dem Wert 0x0A0B0C0D speichern. In beiden Fällen ist die ganze Zahl in vier Bytes unterteilt, 0x0A, 0x0B, 0x0C und 0x0D, und die Bytes werden in vier aufeinanderfolgenden Byte-Speicherplätzen gespeichert, beginnend mit dem Speicherplatz mit der Adresse a, dann a + 1, a + 2 und a + 3. Der Unterschied zwischen Big- und Little-Endian ist die Reihenfolge der vier Bytes der gespeicherten Ganzzahl.

Das erste Diagramm zeigt einen Computer, der Little-Endian verwendet. Er beginnt die Speicherung der ganzen Zahl mit dem niedrigstwertigen Byte, 0x0D, an der Adresse a und endet mit dem höchstwertigen Byte, 0x0A, an der Adresse a + 3.

Das zweite Diagramm zeigt einen Computer, der Big-Endian verwendet. Hier beginnt die Speicherung der Ganzzahl mit dem höchstwertigen Byte, 0x0A, an der Adresse a und endet mit dem niedrigstwertigen Byte, 0x0D, an der Adresse a + 3.

Da jeder Computer die gleiche Endianness zum Speichern und Abrufen der Ganzzahl verwendet, sind die Ergebnisse für beide Computer gleich. Probleme können auftreten, wenn der Speicher durch Bytes statt durch ganze Zahlen adressiert wird oder wenn Speicherinhalte zwischen Computern mit unterschiedlicher Endianness übertragen werden.
English: 32-bit integer (0A0B0C0D16, 16849614110, 0000 1010 0000 1011 0000 1100 0000 11012) arranged in memory in big- and little-endian byte order.

These two diagrams show how two computers using different endianness store a 32-bit (four byte) integer with the value of 0x0A0B0C0D. In both cases, the integer is broken into four bytes, 0x0A, 0x0B, 0x0C, and 0x0D, and the bytes are stored in four sequential byte locations in memory, starting with the memory location with address a, then a + 1, a + 2, and a + 3. The difference between big- and little-endian is the order of the four bytes of the integer being stored.

The first diagram shows a computer using little-endian. This starts the storing of the integer with the least-significant byte, 0x0D, at address a, and ends with the most-significant byte, 0x0A, at address a + 3.

The second diagram shows a computer using big-endian. This starts the storing of the integer with the most-significant byte, 0x0A, at address a, and ends with the least-significant byte, 0x0D, at address a + 3.

Since each computer uses its same endianness to both store and retrieve the integer, the results will be the same for both computers. Issues may arise when memory is addressed by bytes instead of integers, or when memory contents are transmitted between computers with different endianness.
Magyar: Hogyan tárolódik egy 32-bites integer, miután a regiszterekből a memóriába kerül egy little/big-endian típusú számítógépes rendszeren.
Date
Source Own work
Author Aeroid
Other versions

This file was derived from:

SVG development
InfoField
 
The SVG code is valid.
 
This diagram was created with a text editor.
 
 This diagram is translated using SVG switch elements: all translations are stored in the same file.

Licensing

[edit]
I, the copyright holder of this work, hereby publish it under the following license:
w:en:Creative Commons
attribution share alike
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current12:30, 19 September 2023Thumbnail for version as of 12:30, 19 September 20231,000 × 500 (5 KB)Aeroid (talk | contribs)+pt
12:29, 19 September 2023Thumbnail for version as of 12:29, 19 September 20231,000 × 500 (5 KB)Aeroid (talk | contribs)+pt
09:21, 19 September 2023Thumbnail for version as of 09:21, 19 September 20231,000 × 500 (5 KB)Aeroid (talk | contribs)Multi-lang switch en, de, fr, hu, ja
08:35, 19 September 2023Thumbnail for version as of 08:35, 19 September 20231,000 × 500 (4 KB)Aeroid (talk | contribs)Arrows, de-duplication
16:34, 18 September 2023Thumbnail for version as of 16:34, 18 September 20231,000 × 500 (5 KB)Aeroid (talk | contribs)text-anchor=end workaround
16:33, 18 September 2023Thumbnail for version as of 16:33, 18 September 20231,000 × 500 (5 KB)Aeroid (talk | contribs)text-anchor=end workaround
16:32, 18 September 2023Thumbnail for version as of 16:32, 18 September 20231,000 × 500 (5 KB)Aeroid (talk | contribs)text-anchor=end workaround
16:30, 18 September 2023Thumbnail for version as of 16:30, 18 September 20231,000 × 500 (5 KB)Aeroid (talk | contribs)tspan workaround
16:24, 18 September 2023Thumbnail for version as of 16:24, 18 September 20231,000 × 500 (5 KB)Aeroid (talk | contribs)Uploaded own work with UploadWizard

File usage on other wikis

The following other wikis use this file:

Metadata