aerosayan

{
   "nthreads": 4,
   "notify_init": false,
   "incremental_sync": false,
   "recursion_limit": 1000,
   "sort_keywords": false,
   "disable_autoupdate": false,
   "debug_log": false,

   "source_dirs": ["./src/**", "./lib/ext/fmetis/src/lib/**"],

aerosayan

// The Most Memory Safe Buffer Overflow in Rust!
//
// Consider all the code below under Public Domain
//
// How to build:
// $ rustc main.rs
//
// Wrong password:
// $ printf "hello\n" | ./main
//

aerosayan

//
//               L2-->
//       P5                 P4
//       +------------------+
//   ^   |                  |    L3
//   |   |                  |    |
//   L1  |                  +    v
//       |          L4   .  P3
//       |            .
//       +----------+

aerosayan

program myalltoall
   !Program to show a simple implementation of a deadlock avoiding mpi loop among all processes which,
   !in principle, is similar to an alltoall loop. However, the main purpose of the technique shown here is to
   !properly reorder shortest (i.e., each process with just few others) non-blocking communication loops,
   !in order to alleviate the burden on the communication side (as each exchange is matched, everything
   !is exchanged very quickly). Here, it is tested against the the mpi_allreduce intrinsic with MPI_SUM
   !on a single real variable, but IT IS NOT a replacement for allreduce (nor alltoall or any other intrinsic).
   use, intrinsic :: iso_fortran_env, only : int32, real64
   use mpi
   implicit none

aerosayan

#include <stdio.h>
#include <errno.h>
#include <stdlib.h>
#include <stdint.h>
#include <assert.h>
#include <string.h>
#define streq(a, b) (!strcmp((a), (b)))

#ifndef __USE_GNU
#define __USE_GNU

aerosayan

/* 
https://en.wikipedia.org/wiki/Time_Stamp_Counter
https://ru.wikipedia.org/wiki/Rdtsc
*/

#include <stdio.h>

typedef unsigned long long uint64;

int main() {

aerosayan

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

aerosayan

#!/usr/bin/python
#
# Pickle deserialization RCE payload.
# To be invoked with command to execute at it's first parameter.
# Otherwise, the default one will be used.
#

import cPickle
import sys
import base64

aerosayan

import re
import sys


urls=[]
try:
	file_name=sys.argv[1]
	replacement=sys.argv[2]
except:
	print("[!] Enter urls file name")

aerosayan

// A simple quickref for Eigen. Add anything that's missing.
// Main author: Keir Mierle

#include <Eigen/Dense>

Matrix<double, 3, 3> A;               // Fixed rows and cols. Same as Matrix3d.
Matrix<double, 3, Dynamic> B;         // Fixed rows, dynamic cols.
Matrix<double, Dynamic, Dynamic> C;   // Full dynamic. Same as MatrixXd.
Matrix<double, 3, 3, RowMajor> E;     // Row major; default is column-major.
Matrix3f P, Q, R;                     // 3x3 float matrix.