Assembly Language & x86 Low-Level Systems Programming · レッスン

算術演算と論理演算

レジスターやメモリ上のデータに対して、基本的な算術演算(ADD、SUB、MUL、DIV)と論理演算(AND、OR、XOR、NOT)を実行する方法を学びます。

レッスン 2/412 ステップ

「算術演算と論理演算」はCoddyKit上の無料Assembly Language & x86 Low-Level Systems Programmingレッスンです。 これはレッスン2/4です。 下記で完全なレッスンを無料で読むことができます。その後、ブラウザ内の組み込みコードエディタと24時間対応のAIチューターでハンズオン演習できます。 これはAssembly Language & x86 Low-Level Systems Programming学習パスの一部であり、ウェブとCoddyKitアプリ全体で進捗が同期されます。 Assembly Language & x86 Low-Level Systems Programmingコースには全4レッスンが含まれています。

このレッスンの一部はまだ翻訳されておらず、英語で表示されています。

Intro to Assembly Ops

Welcome to the world of x86 Assembly's core operations! Today, we'll learn how CPUs perform basic math and logic.

These instructions are fundamental. They allow your programs to calculate values, make decisions, and manipulate data at the lowest level.

Addition: The ADD Instruction

The ADD instruction is used to add two numbers. It takes two operands: a destination and a source.

  • Syntax: ADD destination, source
  • The source value is added to the destination value.
  • The result is stored back in the destination operand.
  • Operands can be registers, memory locations, or immediate values (constants).

For example, ADD EAX, EBX adds the value in EBX to EAX, storing the sum in EAX.

ADD in Action

Let's see ADD in a simple program. We'll add 3 to 5, storing the result in the EAX register.

Try running this example:

section .text
  global _start

_start:
  mov eax, 5   ; Load 5 into EAX
  add eax, 3   ; Add 3 to EAX (EAX becomes 8)

  ; Exit the program (Linux 32-bit syscall)
  mov eax, 1   ; sys_exit syscall number
  xor ebx, ebx ; Exit code 0
  int 0x80     ; Call kernel

Subtraction: The SUB Instruction

The SUB instruction is the opposite of ADD. It subtracts the source operand from the destination operand.

  • Syntax: SUB destination, source
  • The source value is subtracted from the destination value.
  • The result is stored back in the destination operand.

Like ADD, SUB can use registers, memory, or immediate values as operands. It's essential for basic arithmetic and comparisons.

SUB in Action

Here's SUB at work. We'll load 10 into EAX and then subtract 4 from it.

Run this code to see the subtraction:

section .text
  global _start

_start:
  mov eax, 10  ; Load 10 into EAX
  sub eax, 4   ; Subtract 4 from EAX (EAX becomes 6)

  ; Exit the program (Linux 32-bit syscall)
  mov eax, 1   ; sys_exit syscall number
  xor ebx, ebx ; Exit code 0
  int 0x80     ; Call kernel

Multiplication: MUL & IMUL

Multiplication in x86 Assembly uses MUL for unsigned numbers and IMUL for signed numbers.

  • MUL and IMUL often use the AX, EAX, or RAX register implicitly as one operand.
  • For 32-bit multiplication, if you multiply a value in EAX by another register (e.g., EBX), the 64-bit result is stored across two registers: the lower 32 bits in EAX and the higher 32 bits in EDX.

Always remember to consider the size of your operands and the potential size of the result!

Multiplication Example

Let's multiply 5 by 6 using MUL. The result will be 30.

After execution, EAX will hold the lower part of the result, and EDX will hold the higher part (which will be 0 in this case).

section .text
  global _start

_start:
  mov eax, 5   ; Load 5 into EAX
  mov ebx, 6   ; Load 6 into EBX
  mul ebx      ; Multiply EAX by EBX. Result in EDX:EAX
               ; EAX will be 30, EDX will be 0

  ; Exit the program (Linux 32-bit syscall)
  mov eax, 1   ; sys_exit syscall number
  xor ebx, ebx ; Exit code 0
  int 0x80     ; Call kernel

Division: DIV & IDIV

Division is handled by DIV (unsigned) and IDIV (signed). These instructions are a bit more complex.

  • For 32-bit division, the dividend (number to be divided) is expected to be in EDX:EAX (EDX holds the high 32 bits, EAX holds the low 32 bits).
  • The divisor is specified as an operand (e.g., a register or memory location).
  • After division, the quotient (result) is stored in EAX, and the remainder is stored in EDX.

Always ensure EDX is correctly set (often cleared to 0) before an unsigned division if your dividend fits in EAX.

Division Example

Let's divide 10 by 3. We expect a quotient of 3 and a remainder of 1.

Observe how EDX is cleared before the division, as our dividend (10) fits entirely within EAX.

section .text
  global _start

_start:
  mov eax, 10  ; Load 10 into EAX (low part of dividend)
  mov edx, 0   ; Clear EDX (high part of dividend for 32-bit)
  mov ebx, 3   ; Load 3 into EBX (divisor)
  div ebx      ; Divide EDX:EAX by EBX.
               ; Quotient in EAX (3), Remainder in EDX (1)

  ; Exit the program (Linux 32-bit syscall)
  mov eax, 1   ; sys_exit syscall number
  xor ebx, ebx ; Exit code 0
  int 0x80     ; Call kernel

Bitwise Logic: AND, OR, XOR, NOT

Beyond arithmetic, assembly excels at bitwise operations. These instructions manipulate individual bits within a number.

  • AND: Sets a bit if both corresponding bits are 1. Useful for masking bits.
  • OR: Sets a bit if at least one corresponding bit is 1. Useful for setting specific bits.
  • XOR: Sets a bit if corresponding bits are different. Useful for toggling bits or quickly clearing a register (e.g., XOR EAX, EAX).
  • NOT: Inverts all bits (flips 0s to 1s, and 1s to 0s). This is a unary operation (takes one operand).

These are crucial for low-level control, flags, and data manipulation.

Quick Check: Bitwise Ops

Consider the following assembly snippet:

mov al, 0b11001010
and al, 0b00001111

What will be the final value stored in the AL register after these instructions execute?

Recap: Fundamental Operations

Great job! You've learned the essential arithmetic and bitwise logic operations in x86 Assembly.

  • Arithmetic: ADD, SUB, MUL/IMUL, DIV/IDIV perform calculations.
  • Logic: AND, OR, XOR, NOT manipulate individual bits for masking, setting, toggling, and inverting.

These instructions are the building blocks for complex programs, enabling your CPU to process data and make decisions effectively. Keep practicing!

無料で開始

AI チューターと学ぶ Assembly — 無料

ブラウザでリアルコードを書いて実行し、24/7 の AI チューターから瞬時にサポートを受け、ウェブまたはアプリで続きから学習できます。

コース
12
レッスン
48

よくある質問

「算術演算と論理演算」レッスンは無料ですか?

はい。「算術演算と論理演算」の完全なテキストはこのウェブで無料で読めます。インタラクティブに演習し(組み込みコードエディタと24時間対応のAIチューター)、Assembly Language & x86 Low-Level Systems Programmingコースの残りをアンロックするには、CoddyKit PROにアップグレードしてください。 Assembly Language & x86 Low-Level Systems Programmingコースには全4レッスンが含まれています。

「算術演算と論理演算」で何を学びますか?

レジスターやメモリ上のデータに対して、基本的な算術演算(ADD、SUB、MUL、DIV)と論理演算(AND、OR、XOR、NOT)を実行する方法を学びます。 ブラウザで直接実行するハンズオンコードでAssembly Language & x86 Low-Level Systems Programmingを演習し、24時間対応のAIチューターがレッスンを進める中での質問に答えます。

Assembly Language & x86 Low-Level Systems Programmingを始めるのに経験は必要ですか?

事前経験は必要ありません。CoddyKitのAssembly Language & x86 Low-Level Systems Programmingは初級者から上級者向けに構成されているため、ここから始めるか最初から始めて、自分のペースで進むことができます。 これはレッスン2/4です。

「算術演算と論理演算」レッスンにはどのくらい時間がかかりますか?

ほとんどのCoddyKitレッスンは約5~10分かかります。各レッスンはコンパクトでインタラクティブなので、着実に進歩し、ウェブとアプリ全体で正確に前回の場所から再開できます。

このAssembly Language & x86 Low-Level Systems Programmingレッスンでコードを書いて実行できますか?

はい。すべてのAssembly Language & x86 Low-Level Systems Programmingレッスンに組み込みコードエディタが含まれているため、ブラウザでリアルコードを書いて実行し、即座のAIフィードバックを取得できます。ローカル設定は不要です。

このコースのすべてのレッスン

  1. データ移動命令(MOV、PUSH、POP)
  2. 算術演算と論理演算
  3. 条件分岐とループ
  4. ビット演算とシフト命令
← Assembly Language & x86 Low-Level Systems Programmingに戻る