martinkunev

// WARNING: Requires C99 compatible compiler

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

#include "heap.h"

#define CMP(a, b) ((a) >= (b))

static const unsigned int base_size = 4;

yoggy

std::string get_exe_filename()
{
	char full_path[MAX_PATH];
	char drive[MAX_PATH];
	char dir[MAX_PATH];
	char filename[MAX_PATH];
	char ext[MAX_PATH];

	char exe_filename[MAX_PATH];

igorzi

Kernel Flags: 
       PROC_THREAD    : Process and Thread create/delete
       LOADER         : Kernel and user mode Image Load/Unload events
       PROFILE        : CPU Sample profile
       CSWITCH        : Context Switch
       COMPACT_CSWITCH: Compact Context Switch
       DISPATCHER     : CPU Scheduler
       DPC            : DPC Events
       INTERRUPT      : Interrupt events
       SYSCALL        : System calls

CocoaBeans

# INSTALL INSTRUCTIONS: save as ~/.gdbinit
#
# DESCRIPTION: A user-friendly gdb configuration file.
#
# REVISION : 7.3 (16/04/2010)
#
# CONTRIBUTORS: mammon_, elaine, pusillus, mong, zhang le, l0kit,
#               truthix the cyberpunk, fG!, gln
#
# FEEDBACK: https://www.reverse-engineering.net

aozturk

// Hash map class template
template <typename K, typename V, typename F = KeyHash<K>>
class HashMap {
public:
    HashMap() {
        // construct zero initialized hash table of size
        table = new HashNode<K, V> *[TABLE_SIZE]();
    }

    ~HashMap() {

jboner

Latency Comparison Numbers (~2012)
----------------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD

marianposaceanu

CPU

• L1 cache reference 0.5 ns
• Branch mispredict 5 ns (on a bad CPU architecture you're pretty much screwed)
• L2 cache reference 7 ns
• Mutex lock/unlock 25 ns
• Main memory reference 100 ns
• Compress 1K bytes with Zippy 3,000 ns
• Send 2K bytes over 1 Gbps network 20,000 ns
• Read 1 MB sequentially from memory 250,000 ns

hellerbarde

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs

mikea

L1 cache reference                  0.5 ns
Branch mispredict                   5 ns
L2 cache reference                  7 ns                      14x L1 cache
Mutex lock/unlock                   25 ns                     
Main memory reference               100 ns                    4x mutex op, 20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy        3,000 ns
Send 2K bytes over 1 Gbps network   20,000 ns
Read 1 MB sequentially from memory  250,000 ns

jhclark

L1 cache reference                          0.5 ns
Branch mispredict                             5 ns
L2 cache reference                            7 ns             14x L1 cache
Mutex lock/unlock                            25 ns
Main memory reference                       100 ns             20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy              3,000 ns
Send 1K bytes over 1 Gbps network        10,000 ns    0.01 ms
Read 1 MB sequentially from memory      250,000 ns    0.25 ms
Round trip within same datacenter       500,000 ns    0.5  ms
Read 1 MB sequentially from SSD       1,000,000 ns    1    ms  4X memory