basavesh

Mike's x86-64 Assembly (ASM) Notes

Assembling Binary Machine Code

Operating Modes:

These determine the assumed/default size of instruction operands, and restricts which opcodes are available, and how they are used.

Modern operating systems, booted inside Real mode,

basavesh

Understanding the Memory Layout of Linux Executables

Required tools for playing around with memory:

• hexdump
• objdump
• readelf
• xxd
• gcore

basavesh

==7307== Memcheck, a memory error detector
==7307== Copyright (C) 2002-2013, and GNU GPL'd, by Julian Seward et al.
==7307== Using Valgrind-3.10.1 and LibVEX; rerun with -h for copyright info
==7307== Command: ./a.out
==7307==
Starting Libevent 2.0.20-stable.
Available methods are:
        epoll
        poll
        select

basavesh

#include <stdio.h>
#include <string.h>
#include <netinet/in.h>
#include <event2/event.h>
#include <sys/socket.h>
#include <stdlib.h>

int main(int argc, char **argv)
{
        int i;

basavesh

#include <unistd.h>
#include <stdlib.h>
#include <string.h>

int main(int argc, char *argv[])
{
int i =0;
char *memPtr=NULL;
char *memPtr2G=NULL;
int j=0;

basavesh

## {{{ http://code.activestate.com/recipes/366178/ (r5)
def primes(n): 
	if n==2: return [2]
	elif n<2: return []
	s=range(3,n+1,2)
	mroot = n ** 0.5
	half=(n+1)/2-1
	i=0
	m=3
	while m <= mroot:

basavesh

package edu.cmu.cs771.hw1;

import java.nio.charset.Charset;
import java.util.*;
import java.math.BigInteger;

public class MerkleHellmanKnapsackTest {

        public MerkleHellmanKnapsackTest() {
                // TODO Auto-generated constructor stub

basavesh

package edu.cmu.cs771.hw1;

import java.nio.charset.Charset;
import java.util.*;
import java.math.BigInteger;

/**
 * @author songluo
 *
 */

basavesh

package edu.cmu.cs771.hw1;

/**
 * Class EmptyListException definition. 
 * @author songluo
 *
 */
public class EmptyListException extends RuntimeException{
        
        /**

basavesh

package edu.cmu.cs771.hw1;

/**
 * This class implements a doubly linked list of characters in Java. 
 * The instance variables head and tail are initially null. 
 * As elements are added head points to the first element on the list and tail points to the last element. Each node on the list is of type DoubleNode. 
 * Each DoubleNode holds a pointer to the previous node and a pointer to the next node in the list. 
 * @author songluo
 *
 */