This document discusses a lecture on machine-level programming basics for an introduction to computer systems course. It begins with announcements about upcoming labs and assignments. It then provides an overview of the history of Intel processors and x86 architectures. The rest of the lecture covers basic concepts of machine-level programming including registers, data types, operations, and moving data between registers and memory. It emphasizes that the computer understands code as sequences of bits and uses a pipeline of loading data into registers, performing operations, and storing results.
(See: http://youtu.be/9rP-5TSk_dA)
Electronic Systems support every aspect of our lives today, both Visibly and Invisibly. Numbered in their tens of billions these are the dominant form of computing we now experience. And whilst many dissipate just milliwatts, their shear volume makes them a significant consumer of energy in their own right. Energy Efficiency in Computing has moved from the mainframe to become a consumer issue.
## By Ian Phillips http://ianp24.blogspot.co.uk/
## Opinions expressed are my own
Moved from SlideShare 10mar14 with 1064 views)
(See: http://youtu.be/9rP-5TSk_dA)
Electronic Systems support every aspect of our lives today, both Visibly and Invisibly. Numbered in their tens of billions these are the dominant form of computing we now experience. And whilst many dissipate just milliwatts, their shear volume makes them a significant consumer of energy in their own right. Energy Efficiency in Computing has moved from the mainframe to become a consumer issue.
## By Ian Phillips http://ianp24.blogspot.co.uk/
## Opinions expressed are my own
Moved from SlideShare 10mar14 with 1064 views)
this presentation is a great to deliver in classrooms, stage or also can be used to deliver lecture on "Evolution of processor".
it is also very helpful to learn about microprocessor, directly we can say its a self pack containing all about microprocessor.
this ppt contains evolution not only on the basis of generations but also on the basis of their invention.
must gothrough it
Computer Architecture – An IntroductionDilum Bandara
Overview on high-level design of internal components of a computer. Cover step-by-step execution of a program through ALU while accessing & updating registers
INTRODUCTION TO COMPUTER SYSTEMS ARCHITECTURE1_17 December 2023.pptMozammelHaque53
This is a lecture PowerPoint slide for the students of universities worldwide who desire to learn and advance his or her knowledge and expertise on Computer systems architecture.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
this presentation is a great to deliver in classrooms, stage or also can be used to deliver lecture on "Evolution of processor".
it is also very helpful to learn about microprocessor, directly we can say its a self pack containing all about microprocessor.
this ppt contains evolution not only on the basis of generations but also on the basis of their invention.
must gothrough it
Computer Architecture – An IntroductionDilum Bandara
Overview on high-level design of internal components of a computer. Cover step-by-step execution of a program through ALU while accessing & updating registers
INTRODUCTION TO COMPUTER SYSTEMS ARCHITECTURE1_17 December 2023.pptMozammelHaque53
This is a lecture PowerPoint slide for the students of universities worldwide who desire to learn and advance his or her knowledge and expertise on Computer systems architecture.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
"Impact of front-end architecture on development cost", Viktor TurskyiFwdays
I have heard many times that architecture is not important for the front-end. Also, many times I have seen how developers implement features on the front-end just following the standard rules for a framework and think that this is enough to successfully launch the project, and then the project fails. How to prevent this and what approach to choose? I have launched dozens of complex projects and during the talk we will analyze which approaches have worked for me and which have not.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
UiPath Test Automation using UiPath Test Suite series, part 3
05-machine-basics.pptx
1. Carnegie Mellon
1
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Machine-Level Programming I: Basics
15-213/18-213: Introduction to Computer Systems
5th Lecture, May 25, 2022
Instructor:
Kyle Liang
2. Carnegie Mellon
2
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Announcements
Lab 2 (bomb lab) will be available via Autolab on May 27
Due Friday June 3
Lab 1 is due Friday June 3 (handin via Autolab)
Written Assignment 1 is due Wednesday June 1
GDB bootcamp will be this Friday, May 27
Exceptionally useful for labs–you’ll really want it for Lab 2.
3. Carnegie Mellon
3
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Today: Machine Programming I: Basics
History of Intel processors and architectures
Assembly Basics: Registers, operands, move
Arithmetic & logical operations
C, assembly, machine code
4. Carnegie Mellon
4
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Intel x86 Processors
Dominate laptop/desktop/server market
ARM architecture is a promising newcomer
Evolutionary design
Backwards compatible up until 8086, introduced in 1978
Added more features as time goes on
Now 3 volumes, about 5,000 pages of documentation
Complex instruction set computer (CISC)
Many different instructions with many different formats
But, only small subset encountered with Linux programs
Hard to match performance of Reduced Instruction Set Computers
(RISC)
But, Intel has done just that!
In terms of speed. Less so for low power.
5. Carnegie Mellon
5
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Intel x86 Evolution: Milestones
Name Date Transistors MHz
8086 1978 29K 5-10
First 16-bit Intel processor. Basis for IBM PC & DOS
1MB address space
386 1985 275K 16-33
First 32 bit Intel processor , referred to as IA32
Added “flat addressing”, capable of running Unix
Pentium 4E 2004 125M 2800-3800
First 64-bit Intel x86 processor, referred to as x86-64
Core 2 2006 291M 1060-3333
First multi-core Intel processor
Core i7 2008 731M 1600-4400
Four cores (our shark machines)
6. Carnegie Mellon
6
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Intel x86 Processors, cont.
Machine Evolution
386 1985 0.3M
Pentium 1993 3.1M
Pentium/MMX 1997 4.5M
PentiumPro 1995 6.5M
Pentium III 1999 8.2M
Pentium 4 2000 42M
Core 2 Duo 2006 291M
Core i7 2008 731M
Core i7 Skylake 2015 1.9B
Added Features
Instructions to support multimedia operations
Instructions to enable more efficient conditional operations
Transition from 32 bits to 64 bits
More cores
7. Carnegie Mellon
7
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Intel x86 Processors, cont.
Past Generations
1st Pentium Pro 1995 600 nm
1st Pentium III 1999 250 nm
1st Pentium 4 2000 180 nm
1st Core 2 Duo 2006 65 nm
Recent & Upcoming Generations
1. Nehalem 2008 45 nm
2. Sandy Bridge 2011 32 nm
3. Ivy Bridge 2012 22 nm
4. Haswell 2013 22 nm
5. Broadwell 2014 14 nm
6. Skylake 2015 14 nm
7. Kaby Lake 2016 14 nm
8. Coffee Lake 2017 14 nm
9. Cannon Lake 2018 10 nm
10. Ice Lake 2019 10 nm
11. Tiger Lake 2020 10 nm
12. Alder Lake 2022 “intel 7” (10nm+++)
Process technology
Process technology dimension
= width of narrowest wires
(10 nm ≈ 100 atoms wide)
(But this is changing now.)
8. Carnegie Mellon
8
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
2018 State of the Art: Coffee Lake
Mobile Model: Core i7
2.2-3.2 GHz
45 W
Server Model: Xeon E
Integrated graphics
Multi-socket enabled
3.3-3.8 GHz
80-95 W
Desktop Model: Core i7
Integrated graphics
2.4-4.0 GHz
35-95 W
9. Carnegie Mellon
9
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
x86 Clones: Advanced Micro Devices (AMD)
Historically
AMD has followed just behind Intel
A little bit slower, a lot cheaper
Then
Recruited top circuit designers from Digital Equipment Corp. and
other downward trending companies
Built Opteron: tough competitor to Pentium 4
Developed x86-64, their own extension to 64 bits
Recent Years
Intel got its act together
1995-2011: Lead semiconductor “fab” in world
2018: #2 largest by $$ (#1 is Samsung)
2019: reclaimed #1
AMD fell behind: Spun off GlobalFoundaries
2019-20: Pulled ahead! Used TSMC for part of fab
2022: Intel re-took the lead
10. Carnegie Mellon
10
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Intel’s 64-Bit History
2001: Intel Attempts Radical Shift from IA32 to IA64
Totally different architecture (Itanium)
Executes IA32 code only as legacy
Performance disappointing
2003: AMD Steps in with Evolutionary Solution
x86-64 (now called “AMD64”)
Intel Felt Obligated to Focus on IA64
Hard to admit mistake or that AMD is better
2004: Intel Announces EM64T extension to IA32
Extended Memory 64-bit Technology
Almost identical to x86-64!
All but low-end x86 processors support x86-64
But, lots of code still runs in 32-bit mode
11. Carnegie Mellon
11
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Our Coverage
IA32
The traditional x86
For 15/18-213: RIP, Summer 2015
x86-64
The standard
shark> gcc hello.c
shark> gcc –m64 hello.c
Presentation
Book covers x86-64
Web aside on IA32
We will only cover x86-64
12. Carnegie Mellon
12
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Today: Machine Programming I: Basics
History of Intel processors and architectures
Assembly Basics: Registers, operands, move
Arithmetic & logical operations
C, assembly, machine code
13. Carnegie Mellon
13
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
How Does a Computer Understand Code?
Short answer: Bits!
Not the complete picture, let’s take it bit by bit
14. Carnegie Mellon
14
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
How Does a Person Understand English?
Let’s see how humans understand English
English uses an alphabet
A, B, C …
Examine a sentence:
Subject: (I) core noun of the sentence
Object: (15213) supporting noun
Verbs: (love) actions associating subject and object
I love 15213!
15. Carnegie Mellon
15
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
How Does a CPU Understand Code (cont)?
What’s the language of the CPU?
Basic building block is bits
A sentence in English is like a program
Subject and Object?
Data Types: Integers, Floats, …
Verb?
Arithmetic Operations: +, -, /, *, <<, >>, …
CPU: Take data, apply action, use result
Let’s encode: 1 + 2
(+, 1, 2)
1 + 2
16. Carnegie Mellon
16
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Generalize Our Encoding
1 + 2 -> (+, 1, 2)
3 + 4 -> (+, 3, 4)
Let’s make specialized hardware in our CPU for +, -, …
Separate operations from data
p = 1
q = 2
(+, p, q)
1 + 2
p
q
+
17. Carnegie Mellon
17
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Generalize Our Data Pipeline
CPU needs to supply p, q to our arithmetic unit
CPU uses registers to store information for the ALU
(+, %p, %q)
But where do the registers get information?
From the program, and in memory
(Load, 0x1, %p)
(Load, &0x7FFFF7AFCBA0, %q)
p
q
+
18. Carnegie Mellon
18
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Levels of Abstraction
C programmer
Assembly programmer
Computer Designer
#include <stdio.h>
int main(){
int i, n = 10, t1 = 0, t2 = 1, nxt;
for (i = 1; i <= n; ++i){
printf("%d, ", t1);
nxt = t1 + t2;
t1 = t2;
t2 = nxt; }
return 0; }
Gates, clocks, circuit layout, …
19. Carnegie Mellon
19
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Definitions
Architecture: (also ISA: instruction set architecture) The
parts of a processor design that one needs to understand
for writing assembly/machine code.
Examples: instruction set specification, registers
Microarchitecture: Implementation of the architecture
Examples: cache sizes and core frequency
Code Forms:
Machine Code: The byte-level programs that a processor executes
Assembly Code: A text representation of machine code
Example ISAs:
Intel: x86, IA32, Itanium, x86-64
ARM: Used in almost all mobile phones
RISC V: New open-source ISA
20. Carnegie Mellon
20
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Programmer-Visible State
PC: Program counter
Address of next instruction
Called “RIP” (x86-64)
Register file
Heavily used program data
Condition codes
Store status information about most
recent arithmetic or logical operation
Used for conditional branching
CPU
Assembly/Machine Code View
PC
Registers
Memory
Code
Data
Stack
Addresses
Data
Instructions
Condition
Codes
Memory
Byte addressable array
Code and user data
Stack to support procedures
Rest in
Instruction
Pointer
21. Carnegie Mellon
21
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Assembly Characteristics: Data Types
“Integer” data of 1, 2, 4, or 8 bytes
Data values
Addresses (untyped pointers)
Floating point data of 4, 8, or 10 bytes
Code: Byte sequences encoding series of instructions
No aggregate types such as arrays or structures
Just contiguously allocated bytes in memory
22. Carnegie Mellon
22
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Class Activity
Form teams of 2
One person should take notes / advise / etc
One person should ssh to a shark machine
wget http://www.cs.cmu.edu/~213/activities/lec5.tar
tar xf lec5.tar
cd lec5
./act1
23. Carnegie Mellon
23
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
%rsp
x86-64 Integer Registers
Can reference low-order 4 bytes (also low-order 1 & 2 bytes)
Not part of memory (or cache)
%eax
%ebx
%ecx
%edx
%esi
%edi
%esp
%ebp
%r8d
%r9d
%r10d
%r11d
%r12d
%r13d
%r14d
%r15d
%r8
%r9
%r10
%r11
%r12
%r13
%r14
%r15
%rax
%rbx
%rcx
%rdx
%rsi
%rdi
%rbp
24. Carnegie Mellon
24
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Some History: IA32 Registers
%eax
%ecx
%edx
%ebx
%esi
%edi
%esp
%ebp
%ax
%cx
%dx
%bx
%si
%di
%sp
%bp
%ah
%ch
%dh
%bh
%al
%cl
%dl
%bl
16-bit virtual registers
(backwards compatibility)
general
purpose
accumulate
counter
data
base
source
index
destination
index
stack
pointer
base
pointer
Origin
(mostly obsolete)
25. Carnegie Mellon
25
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Assembly Characteristics: Operations
Transfer data between memory and register
Load data from memory into register
Store register data into memory
Perform arithmetic function on register or memory data
Transfer control
Unconditional jumps to/from procedures
Conditional branches
Indirect branches
26. Carnegie Mellon
26
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Moving Data
Moving Data
movq Source, Dest
Operand Types
Immediate: Constant integer data
Example: $0x400, $-533
Like C constant, but prefixed with ‘$’
Encoded with 1, 2, or 4 bytes
Register: One of 16 integer registers
Example: %rax, %r13
But %rsp reserved for special use
Others have special uses for particular instructions
Memory: 8 consecutive bytes of memory at address given by register
Simplest example: (%rax)
Various other “addressing modes”
%rax
%rcx
%rdx
%rbx
%rsi
%rdi
%rsp
%rbp
%rN
Warning: Intel docs use
mov Dest, Source
27. Carnegie Mellon
27
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
movq Operand Combinations
Cannot do memory-memory transfer with a single instruction
movq
Imm
Reg
Mem
Reg
Mem
Reg
Mem
Reg
Source Dest C Analog
movq $0x4,%rax temp = 0x4;
movq $-147,(%rax) *p = -147;
movq %rax,%rdx temp2 = temp1;
movq %rax,(%rdx) *p = temp;
movq (%rax),%rdx temp = *p;
Src,Dest
28. Carnegie Mellon
28
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Simple Memory Addressing Modes
Normal (R) Mem[Reg[R]]
Register R specifies memory address
Aha! Pointer dereferencing in C
movq (%rcx),%rax
Displacement D(R) Mem[Reg[R]+D]
Register R specifies start of memory region
Constant displacement D specifies offset
movq 8(%rbp),%rdx
29. Carnegie Mellon
29
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Example of Simple Addressing Modes
whatAmI:
movq (%rdi), %rax
movq (%rsi), %rdx
movq %rdx, (%rdi)
movq %rax, (%rsi)
ret
void
whatAmI(<type> a, <type> b)
{
????
}
%rdi
%rsi
30. Carnegie Mellon
30
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Example of Simple Addressing Modes
void swap
(long *xp, long *yp)
{
long t0 = *xp;
long t1 = *yp;
*xp = t1;
*yp = t0;
}
swap:
movq (%rdi), %rax
movq (%rsi), %rdx
movq %rdx, (%rdi)
movq %rax, (%rsi)
ret
31. Carnegie Mellon
31
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
%rdi
%rsi
%rax
%rdx
Understanding Swap()
void swap
(long *xp, long *yp)
{
long t0 = *xp;
long t1 = *yp;
*xp = t1;
*yp = t0;
}
Memory
Register Value
%rdi xp
%rsi yp
%rax t0
%rdx t1
swap:
movq (%rdi), %rax # t0 = *xp
movq (%rsi), %rdx # t1 = *yp
movq %rdx, (%rdi) # *xp = t1
movq %rax, (%rsi) # *yp = t0
ret
Registers
37. Carnegie Mellon
37
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Simple Memory Addressing Modes
Normal (R) Mem[Reg[R]]
Register R specifies memory address
Aha! Pointer dereferencing in C
movq (%rcx),%rax
Displacement D(R) Mem[Reg[R]+D]
Register R specifies start of memory region
Constant displacement D specifies offset
movq 8(%rbp),%rdx
38. Carnegie Mellon
38
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Complete Memory Addressing Modes
Most General Form
D(Rb,Ri,S) Mem[Reg[Rb]+S*Reg[Ri]+ D]
D: Constant “displacement” 1, 2, or 4 bytes
Rb: Base register: Any of 16 integer registers
Ri: Index register: Any, except for %rsp
S: Scale: 1, 2, 4, or 8 (why these numbers?)
Special Cases
(Rb,Ri) Mem[Reg[Rb]+Reg[Ri]]
D(Rb,Ri) Mem[Reg[Rb]+Reg[Ri]+D]
(Rb,Ri,S) Mem[Reg[Rb]+S*Reg[Ri]]
41. Carnegie Mellon
41
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Today: Machine Programming I: Basics
History of Intel processors and architectures
Assembly Basics: Registers, operands, move
Arithmetic & logical operations
C, assembly, machine code
42. Carnegie Mellon
42
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Address Computation Instruction
leaq Src, Dst
Src is address mode expression
Set Dst to address denoted by expression
Uses
Computing addresses without a memory reference
E.g., translation of p = &x[i];
Computing arithmetic expressions of the form x + k*y
k = 1, 2, 4, or 8
Example
long m12(long x)
{
return x*12;
}
leaq (%rdi,%rdi,2), %rax # t = x+2*x
salq $2, %rax # return t<<2
Converted to ASM by compiler:
43. Carnegie Mellon
43
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Some Arithmetic Operations
Two Operand Instructions:
Format Computation
addq Src,Dest Dest = Dest + Src
subq Src,Dest Dest = Dest Src
imulq Src,Dest Dest = Dest * Src
salq Src,Dest Dest = Dest << Src Also called shlq
sarq Src,Dest Dest = Dest >> Src Arithmetic
shrq Src,Dest Dest = Dest >> Src Logical
xorq Src,Dest Dest = Dest ^ Src
andq Src,Dest Dest = Dest & Src
orq Src,Dest Dest = Dest | Src
Watch out for argument order! Src,Dest
(Warning: Intel docs use “op Dest,Src”)
No distinction between signed and unsigned int (why?)
44. Carnegie Mellon
44
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Some Arithmetic Operations
One Operand Instructions
incq Dest Dest = Dest + 1
decq Dest Dest = Dest 1
negq Dest Dest = Dest
notq Dest Dest = ~Dest
See book for more instructions
45. Carnegie Mellon
45
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Arithmetic Expression Example
Interesting Instructions
leaq: address computation
salq: shift
imulq: multiplication
But, only used once
long arith
(long x, long y, long z)
{
long t1 = x+y;
long t2 = z+t1;
long t3 = x+4;
long t4 = y * 48;
long t5 = t3 + t4;
long rval = t2 * t5;
return rval;
}
arith:
leaq (%rdi,%rsi), %rax
addq %rdx, %rax
leaq (%rsi,%rsi,2), %rdx
salq $4, %rdx
leaq 4(%rdi,%rdx), %rcx
imulq %rcx, %rax
ret
46. Carnegie Mellon
46
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Understanding Arithmetic Expression
Example
long arith
(long x, long y, long z)
{
long t1 = x+y;
long t2 = z+t1;
long t3 = x+4;
long t4 = y * 48;
long t5 = t3 + t4;
long rval = t2 * t5;
return rval;
}
arith:
leaq (%rdi,%rsi), %rax # t1
addq %rdx, %rax # t2
leaq (%rsi,%rsi,2), %rdx
salq $4, %rdx # t4
leaq 4(%rdi,%rdx), %rcx # t5
imulq %rcx, %rax # rval
ret
Register Use(s)
%rdi Argument x
%rsi Argument y
%rdx Argument z,
t4
%rax t1, t2, rval
%rcx t5
47. Carnegie Mellon
47
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Recap: Floating Point
⬛ Background: Fractional binary numbers
⬛ IEEE floating point standard: Definition
Rounding, addition, multiplication
⬛ Example and properties
⬛ Floating point in C
⬛ Summary
48. Carnegie Mellon
48
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
⬛ Numerical Form:
(–1)s M 2E
▪ Sign bit s determines whether number is negative or positive
▪ Significand M normally a fractional value in range [1.0,2.0).
▪ Exponent E weights value by power of two
⬛ Encoding
▪ MSB s is sign bit s
▪ exp field encodes E (but is not equal to E)
▪ frac field encodes M (but is not equal to M)
Recap: Floating Point Representation
s exp frac
Example:
1521310 = (-1)0 x 1.11011011011012 x 213
49. Carnegie Mellon
49
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Floating Point Operations: Basic Idea
⬛ x +f y = Round(x + y)
⬛ x ×f y = Round(x × y)
⬛ Basic idea
▪ First compute exact result
▪ Make it fit into desired precision
▪ Possibly overflow if exponent too large
▪ Possibly round to fit into frac
50. Carnegie Mellon
50
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Rounding
⬛ Rounding Modes (illustrate with $ rounding)
⬛ $1.40 $1.60 $1.50 $2.50 –$1.50
▪ Towards zero $1 $1 $1 $2 –$1
▪ Round down (−∞) $1 $1 $1 $2 –$2
▪ Round up (+∞) $2 $2 $2 $3 –$1
▪ Nearest Even (default) $1 $2 $2 $2 –$2
51. Carnegie Mellon
51
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Closer Look at Round-To-Even
⬛ Default Rounding Mode
▪ Hard to get any other kind without dropping into assembly
▪ C99 has support for rounding mode management
▪ All others are statistically biased
▪ Sum of set of positive numbers will consistently be over- or under-
estimated
⬛ Applying to Other Decimal Places / Bit Positions
▪ When exactly halfway between two possible values
▪ Round so that least significant digit is even
▪ E.g., round to nearest hundredth
7.8949999 7.89 (Less than half way)
7.8950001 7.90 (Greater than half way)
7.8950000 7.90 (Half way—round up)
7.8850000 7.88 (Half way—round down)
52. Carnegie Mellon
52
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Rounding Binary Numbers
⬛ Binary Fractional Numbers
▪ “Even” when least significant bit is 0
▪ “Half way” when bits to right of rounding position = 100…2
⬛ Examples
▪ Round to nearest 1/4 (2 bits right of binary point)
ValueBinary Rounded Action Rounded Value
2 3/32 10.000112 10.002 (<1/2—down) 2
2 3/16 10.001102 10.012 (>1/2—up) 2 1/4
2 7/8 10.111002 11.002 ( 1/2—up) 3
2 5/8 10.101002 10.102 ( 1/2—down) 2 1/2
53. Carnegie Mellon
53
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
FP Multiplication
⬛ (–1)s1 M1 2E1 x (–1)s2 M2 2E2
⬛ Exact Result: (–1)s M 2E
▪ Sign s: s1 ^ s2
▪ Significand M: M1 x M2
▪ Exponent E: E1 + E2
⬛ Fixing
▪ If M ≥ 2, shift M right, increment E
▪ If E out of range, overflow
▪ Round M to fit frac precision
⬛ Implementation
▪ Biggest chore is multiplying significands
4 bit mantissa: 1.010*22 x 1.110*23 = 10.0011*25
= 1.00011*26 = 1.001*26
54. Carnegie Mellon
54
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Floating Point Addition
⬛ (–1)s1 M1 2E1 + (-1)s2 M2 2E2
▪Assume E1 > E2
⬛ Exact Result: (–1)s M 2E
▪Sign s, significand M:
▪ Result of signed align & add
▪Exponent E: E1
⬛ Fixing
▪If M ≥ 2, shift M right, increment E
▪if M < 1, shift M left k positions, decrement E by k
▪Overflow if E out of range
▪Round M to fit frac precision
(–1)s1 M1
(–1)s2 M2
E1–E2
+
(–1)s M
Get binary points
lined up
1.010*22 + 1.110*23 = (1.010 + 11.100)*22
= 100.110 * 22 = 1.0011 * 24 = 1.010 * 24
55. Carnegie Mellon
55
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Mathematical Properties of FP Add
⬛ Compare to those of Abelian Group
▪ Closed under addition?
▪ But may generate infinity or NaN
▪ Commutative?
▪ Associative?
▪ Overflow and inexactness of rounding
▪ (3.14+1e10)-1e10 = 0, 3.14+(1e10-1e10) = 3.14
▪ 0 is additive identity?
▪ Every element has additive inverse?
▪ Yes, except for infinities & NaNs
⬛ Monotonicity
▪ a ≥ b ⇒ a+c ≥ b+c?
▪ Except for infinities & NaNs
Yes
Yes
Yes
No
Almost
Almost
56. Carnegie Mellon
56
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Mathematical Properties of FP Mult
⬛ Compare to Commutative Ring
▪ Closed under multiplication?
▪ But may generate infinity or NaN
▪ Multiplication Commutative?
▪ Multiplication is Associative?
▪ Possibility of overflow, inexactness of rounding
▪ Ex: (1e20*1e20)*1e-20= inf, 1e20*(1e20*1e-20)= 1e20
▪ 1 is multiplicative identity?
▪ Multiplication distributes over addition?
▪ Possibility of overflow, inexactness of rounding
▪ 1e20*(1e20-1e20)= 0.0, 1e20*1e20 – 1e20*1e20 = NaN
⬛ Monotonicity
▪ a ≥ b & c ≥ 0 ⇒ a * c ≥ b *c?
▪ Except for infinities & NaNs
Yes
Yes
No
Yes
No
Almost
57. Carnegie Mellon
57
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Recap: Floating Point
⬛ Background: Fractional binary numbers
⬛ IEEE floating point standard: Definition
Rounding, addition, multiplication
⬛ Example and properties
⬛ Floating point in C
⬛ Summary
58. Carnegie Mellon
58
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Tiny Floating Point Example
⬛ 8-bit Floating Point Representation
▪ the sign bit is in the most significant bit
▪ the next four bits are the exponent, with a bias of 7
▪ the last three bits are the frac
⬛ Same general form as IEEE Format
▪ normalized, denormalized
▪ representation of 0, NaN, infinity
s exp frac
1 4-bits 3-bits
59. Carnegie Mellon
59
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
s exp frac E Value
0 0000 000 -6 0
0 0000 001 -6 1/8*1/64 = 1/512
0 0000 010 -6 2/8*1/64 = 2/512
…
0 0000 110 -6 6/8*1/64 = 6/512
0 0000 111 -6 7/8*1/64 = 7/512
0 0001 000 -6 8/8*1/64 = 8/512
0 0001 001 -6 9/8*1/64 = 9/512
…
0 0110 110 -1 14/8*1/2 = 14/16
0 0110 111 -1 15/8*1/2 = 15/16
0 0111 000 0 8/8*1 = 1
0 0111 001 0 9/8*1 = 9/8
0 0111 010 0 10/8*1 = 10/8
…
0 1110 110 7 14/8*128 = 224
0 1110 111 7 15/8*128 = 240
0 1111 000 n/a inf
Dynamic Range (Positive Only)
closest to zero
largest denorm
smallest norm
closest to 1 below
closest to 1 above
largest norm
Denormalized
numbers
Normalized
numbers
v = (–1)s M 2E
n: E = Exp – Bias
d: E = 1 – Bias
(-1)0(0+1/4)*2-6
(-1)0(1+1/8)*2-6
60. Carnegie Mellon
60
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Distribution of Values
⬛ 6-bit IEEE-like format
▪ e = 3 exponent bits
▪ f = 2 fraction bits
▪ Bias is 23-1-1 = 3
⬛ Notice how the distribution gets denser toward zero.
8
values
s exp frac
1 3-bits 2-bits
61. Carnegie Mellon
61
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Distribution of Values (close-up view)
⬛ 6-bit IEEE-like format
▪ e = 3 exponent bits
▪ f = 2 fraction bits
▪ Bias is 3
s exp frac
1 3-bits 2-bits
62. Carnegie Mellon
62
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Special Properties of the IEEE Encoding
⬛ FP Zero Same as Integer Zero
▪ All bits = 0
⬛ Can (Almost) Use Unsigned Integer Comparison
▪ Must first compare sign bits
▪ Must consider −0 = 0
▪ NaNs problematic
▪ Will be greater than any other values
▪ What should comparison yield? The answer is complicated.
▪ Otherwise OK
▪ Denorm vs. normalized
▪ Normalized vs. infinity
63. Carnegie Mellon
63
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Today: Floating Point
⬛ Background: Fractional binary numbers
⬛ IEEE floating point standard: Definition
Rounding, addition, multiplication
⬛ Example and properties
⬛ Floating point in C
⬛ Summary
64. Carnegie Mellon
64
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Floating Point in C
⬛ C Guarantees Two Levels
▪ float single precision
▪ double double precision
⬛ Conversions/Casting
▪ Casting between int, float, and double changes bit representation
▪ double/float → int
▪ Truncates fractional part
▪ Like rounding toward zero
▪ Not defined when out of range or NaN: Generally sets to TMin
▪ int → double
▪ Exact conversion, as long as int has ≤ 53 bit word size
▪ int → float
▪ Will round according to rounding mode
65. Carnegie Mellon
65
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Floating Point Puzzles
⬛ For each of the following C expressions, either:
▪ Argue that it is true for all argument values
▪ Explain why not true
• x == (int)(float) x
• x == (int)(double) x
• f == (float)(double) f
• d == (double)(float) d
• f == -(-f);
• 2/3 == 2/3.0
• d < 0.0 ⇒ ((d*2) < 0.0)
• d > f ⇒ -f > -d
• d * d >= 0.0
• (d+f)-d == f
int x = …;
float f = …;
double d = …;
Assume
neither
d nor f is NaN
66. Carnegie Mellon
66
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Summary
⬛ IEEE Floating Point has clear mathematical properties
⬛ Represents numbers of form M x 2E
⬛ One can reason about operations independent of
implementation
▪ As if computed with perfect precision and then rounded
⬛ Not the same as real arithmetic
▪ Violates associativity/distributivity
▪ Makes life difficult for compilers & serious numerical applications
programmers
67. Carnegie Mellon
67
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Today: Machine Programming I: Basics
History of Intel processors and architectures
Assembly Basics: Registers, operands, move
Arithmetic & logical operations
C, assembly, machine code
68. Carnegie Mellon
68
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
text
text
binary
binary
Compiler (gcc –Og -S)
Assembler (gcc –c or as)
Linker (gcc or ld)
C program (p1.c p2.c)
Asm program (p1.s p2.s)
Object program (p1.o p2.o)
Executable program (p)
Static libraries
(.a)
Turning C into Object Code
Code in files p1.c p2.c
Compile with command: gcc –Og p1.c p2.c -o p
Use debugging-friendly optimizations (-Og)
Put resulting binary in file p
69. Carnegie Mellon
69
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Compiling Into Assembly
C Code (sum.c)
long plus(long x, long y);
void sumstore(long x, long y,
long *dest)
{
long t = plus(x, y);
*dest = t;
}
Generated x86-64 Assembly
sumstore:
pushq %rbx
movq %rdx, %rbx
call plus
movq %rax, (%rbx)
popq %rbx
ret
Obtain (on shark machine) with command
gcc –Og –S sum.c
Produces file sum.s
Warning: Will get very different results on non-Shark
machines (Andrew Linux, Mac OS-X, …) due to different
versions of gcc and different compiler settings.
70. Carnegie Mellon
70
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
What it really looks like
.globl sumstore
.type sumstore, @function
sumstore:
.LFB35:
.cfi_startproc
pushq %rbx
.cfi_def_cfa_offset 16
.cfi_offset 3, -16
movq %rdx, %rbx
call plus
movq %rax, (%rbx)
popq %rbx
.cfi_def_cfa_offset 8
ret
.cfi_endproc
.LFE35:
.size sumstore, .-sumstore
71. Carnegie Mellon
71
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
What it really looks like
.globl sumstore
.type sumstore, @function
sumstore:
.LFB35:
.cfi_startproc
pushq %rbx
.cfi_def_cfa_offset 16
.cfi_offset 3, -16
movq %rdx, %rbx
call plus
movq %rax, (%rbx)
popq %rbx
.cfi_def_cfa_offset 8
ret
.cfi_endproc
.LFE35:
.size sumstore, .-sumstore
Things that look weird
and are preceded by a ‘.’
are generally directives.
sumstore:
pushq %rbx
movq %rdx, %rbx
call plus
movq %rax, (%rbx)
popq %rbx
ret
72. Carnegie Mellon
72
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Code for sumstore
0x0400595:
0x53
0x48
0x89
0xd3
0xe8
0xf2
0xff
0xff
0xff
0x48
0x89
0x03
0x5b
0xc3
Object Code
Assembler
Translates .s into .o
Binary encoding of each instruction
Nearly-complete image of executable code
Missing linkages between code in different
files
Linker
Resolves references between files
Combines with static run-time libraries
E.g., code for malloc, printf
Some libraries are dynamically linked
Linking occurs when program begins
execution
• Total of 14 bytes
• Each instruction
1, 3, or 5 bytes
• Starts at address
0x0400595
73. Carnegie Mellon
73
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Machine Instruction Example
C Code
Store value t where designated by
dest
Assembly
Move 8-byte value to memory
Quad words in x86-64 parlance
Operands:
t: Register %rax
dest: Register %rbx
*dest: MemoryM[%rbx]
Object Code
3-byte instruction
Stored at address 0x40059e
*dest = t;
movq %rax, (%rbx)
0x40059e: 48 89 03
74. Carnegie Mellon
74
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Disassembled
Disassembling Object Code
Disassembler
objdump –d sum
Useful tool for examining object code
Analyzes bit pattern of series of instructions
Produces approximate rendition of assembly code
Can be run on either a.out (complete executable) or .o file
0000000000400595 <sumstore>:
400595: 53 push %rbx
400596: 48 89 d3 mov %rdx,%rbx
400599: e8 f2 ff ff ff callq 400590 <plus>
40059e: 48 89 03 mov %rax,(%rbx)
4005a1: 5b pop %rbx
4005a2: c3 retq
75. Carnegie Mellon
75
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Disassembled
Dump of assembler code for function sumstore:
0x0000000000400595 <+0>: push %rbx
0x0000000000400596 <+1>: mov %rdx,%rbx
0x0000000000400599 <+4>: callq 0x400590 <plus>
0x000000000040059e <+9>: mov %rax,(%rbx)
0x00000000004005a1 <+12>:pop %rbx
0x00000000004005a2 <+13>:retq
Alternate Disassembly
Within gdb Debugger
Disassemble procedure
gdb sum
disassemble sumstore
76. Carnegie Mellon
76
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Disassembled
Dump of assembler code for function sumstore:
0x0000000000400595 <+0>: push %rbx
0x0000000000400596 <+1>: mov %rdx,%rbx
0x0000000000400599 <+4>: callq 0x400590 <plus>
0x000000000040059e <+9>: mov %rax,(%rbx)
0x00000000004005a1 <+12>:pop %rbx
0x00000000004005a2 <+13>:retq
Alternate Disassembly
Within gdb Debugger
Disassemble procedure
gdb sum
disassemble sumstore
Examine the 14 bytes starting at sumstore
x/14xb sumstore
Object
Code
0x0400595:
0x53
0x48
0x89
0xd3
0xe8
0xf2
0xff
0xff
0xff
0x48
0x89
0x03
0x5b
0xc3
77. Carnegie Mellon
77
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
What Can be Disassembled?
Anything that can be interpreted as executable code
Disassembler examines bytes and reconstructs assembly source
% objdump -d WINWORD.EXE
WINWORD.EXE: file format pei-i386
No symbols in "WINWORD.EXE".
Disassembly of section .text:
30001000 <.text>:
30001000: 55 push %ebp
30001001: 8b ec mov %esp,%ebp
30001003: 6a ff push $0xffffffff
30001005: 68 90 10 00 30 push $0x30001090
3000100a: 68 91 dc 4c 30 push $0x304cdc91
Reverse engineering forbidden by
Microsoft End User License Agreement
78. Carnegie Mellon
78
Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition
Machine Programming I: Summary
History of Intel processors and architectures
Evolutionary design leads to many quirks and artifacts
C, assembly, machine code
New forms of visible state: program counter, registers, ...
Compiler must transform statements, expressions, procedures into
low-level instruction sequences
Assembly Basics: Registers, operands, move
The x86-64 move instructions cover wide range of data movement
forms
Arithmetic
C compiler will figure out different instruction combinations to
carry out computation