davidm

--[[
 Correctness and benchmark tests of various hamming weight implementations.
 This is also called "popcount".
 See also
   http://lua-users.org/wiki/HammingWeight
   http://stackoverflow.com/questions/109023/best-algorithm-to-count-the-number-of-set-bits-in-a-32-bit-integer
   http://www.dalkescientific.com/writings/diary/archive/2008/07/03/hakmem_and_other_popcounts.html
   http://perso.citi.insa-lyon.fr/claurado/ham/overview.pdf
   http://chessprogramming.wikispaces.com/Population+Count
 David Manura, 2012-03.

remi

[alias]
  verbs = !git log --pretty=format:'%s' | cut -d \" \" -f 1 | sort | uniq -c | sort -nr

rygorous

// half->float variants.
// by Fabian "ryg" Giesen.
//
// I hereby place this code in the public domain.
// 
// half_to_float_fast: table based
// tables could be done in a more compact fashion (in particular, can store tab2 in low word of tab1!)
// but something of a dead end since not very SIMD-friendly. pretty much abandoned at this point.
//
// half_to_float_fast2: use FP adder hardware to deal with denormals.

erikh

#!/usr/bin/env sh

##
# This is script with usefull tips taken from:
#   https://github.com/mathiasbynens/dotfiles/blob/master/.osx
#
# install it:
#   curl -sL https://raw.github.com/gist/2108403/hack.sh | sh
#

perky

--[[
	ProFi v1.3, by Luke Perkin 2012. MIT Licence http://www.opensource.org/licenses/mit-license.php.
	
	Example:
		ProFi = require 'ProFi'
		ProFi:start()
		some_function()
		another_function()
		coroutine.resume( some_coroutine )
		ProFi:stop()

mridgers

//------------------------------------------------------------------------------
// pdbdump.c - dump symbols from .pdb and executable files (public domain).
//           - to compile; cl.exe /Ox /Zi pdbdump.c
//           -
//           - Martin Ridgers, pdbdump 'at' fireproofgravy.co.uk
//------------------------------------------------------------------------------

#include <stdio.h>
#include <Windows.h>
#include <DbgHelp.h>

spion

Warning

This benchmark has been misleading for a while. It was originally made to demonstrate how JIT compilers can do all sorts of crazy stuff to your code - especially LuaJIT - and was meant to be a starting point of discussion about what exactly LuaJIT does and how.

As a result, its not indicative of what its performance may be on more realistic data. Differences can be expected because

1. the text will not consist of hard-coded constants

geoffleyland

local sqrt = math.sqrt
local huge = math.huge

local delta = 1
while delta * delta + 1 ~= 1 do
  delta = delta * 0.5
end


-- vectors -------------------------------------------------------------------

geoffleyland

local sqrt = math.sqrt
local huge = math.huge

local delta = 1
while delta * delta + 1 ~= 1 do
  delta = delta * 0.5
end


-- vectors -------------------------------------------------------------------

eahydra

unsigned short ChkSum(unsigned int CheckSum, void *FileBase, int Length)  
{  

    int *Data;
    int sum;

    if ( Length && FileBase != NULL)
    {
        Data = (int *)FileBase;
        do