Assembly Language & x86 Low-Level Systems Programming · درس

أنماط عنونة الذاكرة

استكشف الطرق المختلفة للوصول إلى مواقع الذاكرة باستخدام أنماط عنونة متعددة مثل المباشر وغير المباشر والأساسي والفهرسي والفهرسي المُقاس

أنماط عنونة الذاكرة درس مجاني في Assembly Language & x86 Low-Level Systems Programming على CoddyKit. هذا هو الدرس 2 من أصل 4. يمكنك قراءة الدرس كاملاً أدناه مجاناً — ثم تمرن عليه مباشرة في المتصفح باستخدام محرر أكواد مدمج ومدرس ذكاء اصطناعي متاح 24/7. هذا الدرس جزء من مسار التعلم في Assembly Language & x86 Low-Level Systems Programming، وتقدمك يتزامن عبر الويب وتطبيق CoddyKit. تتضمن دورة Assembly Language & x86 Low-Level Systems Programming 4 دروس في المجموع.

بعض أجزاء هذا الدرس لم تُترجم بعد وتظهر باللغة الإنجليزية.

Memory's Many Paths

Welcome! Today, we'll learn how your CPU finds data in memory. This is crucial for understanding how programs work at a low level.

Memory addressing modes are the different ways a CPU can calculate the effective memory address of an operand.

They allow flexible access to data.
They're key for arrays, structures, and dynamic data.

Direct Addressing: Fixed Spots

Direct addressing is the simplest way to access memory. You provide the exact, fixed address of the data you want.

Think of it like going to a specific house number on a street. It's straightforward but not very flexible if you need to access different houses dynamically.

Try running this example:

section .data
  ; Define a word (2-byte) variable at a specific label
  my_data dw 0x1234

section .text
  global _start

_start:
  ; Move the content of 'my_data' into the AX register
  ; The CPU directly accesses the address associated with 'my_data'
  mov ax, [my_data]

  ; Exit program (Linux specific syscall)
  mov eax, 1    ; syscall number for exit
  xor ebx, ebx  ; exit code 0
  int 0x80      ; call kernel

Register Indirect: Flexible Pointers

Register indirect addressing uses a general-purpose register (like EBX, ESI, or EDI) to hold the memory address.

Instead of a fixed address, the register acts as a 'pointer' to the data. This is much more flexible, as you can change the register's value to point to different memory locations.

Here's an example:

section .data
  ; Define some data in memory
  value1 dw 0xAABB
  value2 dw 0xCCDD

section .text
  global _start

_start:
  ; Load the address of 'value1' into EBX
  mov ebx, value1
  ; Move the content pointed to by EBX into AX
  mov ax, [ebx] ; AX now holds 0xAABB

  ; Change EBX to point to 'value2'
  mov ebx, value2
  ; Move the content pointed to by EBX into DX
  mov dx, [ebx] ; DX now holds 0xCCDD

  ; Exit program
  mov eax, 1
  xor ebx, ebx
  int 0x80

Base Addressing: Structured Access

Base addressing combines a base register (often EBX or EBP) with a fixed numerical displacement (offset).

This is extremely useful for accessing fields within a data structure or elements of an array when the base address of the structure/array is in the register.

Example:

section .data
  ; A 'structure' with two word members
  my_struct:
    member1 dw 0x1111
    member2 dw 0x2222

section .text
  global _start

_start:
  ; Load the base address of 'my_struct' into EBX
  mov ebx, my_struct

  ; Access 'member1' (offset 0 from base)
  mov ax, [ebx + 0] ; AX now holds 0x1111

  ; Access 'member2' (offset 2 bytes from base, as words are 2 bytes)
  mov dx, [ebx + 2] ; DX now holds 0x2222

  ; Exit program
  mov eax, 1
  xor ebx, ebx
  int 0x80

Index Addressing: Array Iteration

Index addressing uses an index register (like ESI or EDI) plus a displacement.

This mode is perfect for iterating through array elements, where the displacement can be the starting address of the array and the index register holds the current element's offset.

Consider this:

section .data
  ; An array of words
  my_array dw 10h, 20h, 30h, 40h

section .text
  global _start

_start:
  ; Set ESI to 0 (first element offset)
  mov esi, 0
  ; Access first element: my_array[0]
  mov ax, [my_array + esi] ; AX = 10h

  ; Increment ESI to point to the next word (2 bytes)
  add esi, 2
  ; Access second element: my_array[1]
  mov bx, [my_array + esi] ; BX = 20h

  ; Exit program
  mov eax, 1
  xor ebx, ebx
  int 0x80

Base-Index: 2D Arrays & More

Base-index addressing combines a base register and an index register (with an optional displacement).

This is powerful for accessing elements in two-dimensional arrays, or arrays of structures. The base register might hold the start of a row, and the index register the column offset.

It looks like [base + index] or [displacement + base + index].

section .data
  ; A 2x2 array of words (each row is 4 bytes: 2 words * 2 bytes/word)
  matrix dw 1, 2   ; Row 0
         dw 3, 4   ; Row 1

section .text
  global _start

_start:
  ; EBX holds the base address of the matrix
  mov ebx, matrix

  ; Access element [0][0]: (EBX + ESI)
  mov esi, 0 ; Index for column 0
  mov ax, [ebx + esi] ; AX = 1

  ; Access element [0][1]: (EBX + ESI)
  mov esi, 2 ; Index for column 1 (1 word * 2 bytes/word)
  mov bx, [ebx + esi] ; BX = 2

  ; Access element [1][0]: (EBX + displacement for row 1 + ESI)
  ; Row 1 starts 4 bytes after row 0
  mov esi, 0
  mov cx, [ebx + 4 + esi] ; CX = 3

  ; Exit program
  mov eax, 1
  xor ebx, ebx
  int 0x80

Scaled-Index: Data Type Friendly

Scaled-index addressing is an extension of base-index, allowing you to multiply the index register by a scale factor (1, 2, 4, or 8).

This is incredibly useful when working with arrays of different data sizes (bytes, words, double words, quad words) because the CPU automatically calculates the correct offset.

Format: [base + index*scale + displacement]

section .data
  ; An array of double words (4 bytes each)
  d_array dd 100h, 200h, 300h

section .text
  global _start

_start:
  ; EBX holds the base address of the array
  mov ebx, d_array

  ; Access d_array[0] (index 0, scale 4 for dword)
  mov esi, 0
  mov eax, [ebx + esi*4] ; EAX = 100h

  ; Access d_array[1] (index 1, scale 4 for dword)
  mov esi, 1
  mov ebx, [ebx + esi*4] ; EBX = 200h

  ; Access d_array[2] (index 2, scale 4 for dword)
  mov esi, 2
  mov ecx, [ebx + esi*4] ; ECX = 300h

  ; Exit program
  mov eax, 1
  xor ebx, ebx
  int 0x80

The Constant: Displacement

You've seen the term 'displacement' pop up in several modes. A displacement is a constant, signed 8-bit, 16-bit, or 32-bit value that's added to the calculated address.

It provides a fixed offset from a base or index.
It's often used to access specific members within a structure or to jump to a certain point in an array.
It can be positive or negative.

It acts like a fixed street number offset from a known starting point.

Choosing Your Addressing Mode

Which mode should you use?

Direct: For fixed, known memory locations (e.g., global variables).
Register Indirect: For pointers, dynamic memory access.
Base/Index: For array iteration, accessing structure members.
Scaled-Index: Best for arrays of different-sized data types, letting the CPU handle scaling.

Understanding these modes gives you powerful control over memory!

Addressing Mode Challenge

Test your knowledge on memory addressing modes!

Memory Paths Mastered

Great job! You've explored the fundamental x86 memory addressing modes:

Direct: Fixed addresses.
Register Indirect: Register as a pointer.
Base: Base register + displacement.
Index: Index register + displacement.
Base-Index: Base + Index + optional displacement.
Scaled-Index: Base + Index * Scale + optional displacement.

These modes are the building blocks for how your programs interact with data in memory. Keep practicing!

الأسئلة الشائعة

هل درس «أنماط عنونة الذاكرة» مجاني؟

نعم — نص درس «أنماط عنونة الذاكرة» كامل متاح مجاناً هنا على الويب. لتمرينه بشكل تفاعلي (محرر أكواد مدمج ومدرس ذكاء اصطناعي متاح 24/7) وفتح باقي دورة Assembly Language & x86 Low-Level Systems Programming، انتقل إلى CoddyKit PRO. تتضمن دورة Assembly Language & x86 Low-Level Systems Programming 4 دروس في المجموع.

ماذا ستتعلم في «أنماط عنونة الذاكرة»؟

استكشف الطرق المختلفة للوصول إلى مواقع الذاكرة باستخدام أنماط عنونة متعددة مثل المباشر وغير المباشر والأساسي والفهرسي والفهرسي المُقاس تتمرن على Assembly Language & x86 Low-Level Systems Programming مع أكواد عملية تشغلها مباشرة في المتصفح، ومدرس ذكاء اصطناعي متاح 24/7 يجيب على أسئلتك أثناء عملك.

هل أحتاج إلى خبرة سابقة لأبدأ Assembly Language & x86 Low-Level Systems Programming؟

لا تُشترط خبرة سابقة. Assembly Language & x86 Low-Level Systems Programming على CoddyKit منظم للمبتدئين حتى المتقدمين، لذا يمكنك البدء من هنا أو من البداية والتقدم بسرعتك الخاصة. هذا هو الدرس 2 من أصل 4.

كم من الوقت يستغرق درس «أنماط عنونة الذاكرة»؟

معظم دروس CoddyKit تستغرق حوالي 5–10 دقائق. كل منها موجز وتفاعلي، لذا تحرز تقدماً مستمراً وتستأنف من حيث توقفت عبر الويب والتطبيق.

هل يمكنني كتابة وتشغيل أكواد في درس Assembly Language & x86 Low-Level Systems Programming هذا؟

نعم. كل درس في Assembly Language & x86 Low-Level Systems Programming يتضمن محرر أكواد مدمج، لذا تكتب وتشغل أكواداً حقيقية مباشرة في متصفحك وتحصل على تعليقات فورية من الذكاء الاصطناعي — بدون إعداد محلي.

جميع الدروس في هذه الدورة

← العودة إلى Assembly Language & x86 Low-Level Systems Programming