├── linux_src_bin ├── asm.o ├── phenom2_benchmark ├── asm.asm ├── makefile ├── AVXChecker.asm ├── ADD_REG_1.asm ├── SHR_REG_CL.asm ├── PADDB_MMX.asm ├── AND_REG_REG.asm ├── CMOVcc_REG_REG.asm ├── IMUL_REG_REG.asm ├── FLOPS.asm └── main.cpp ├── x64 └── Release │ └── Phenom2_Benchmark.exe ├── Phenom2_Benchmark ├── Phenom2_Benchmark.vcxproj.user ├── AVXChecker.asm ├── ADD_REG_1.asm ├── PADDB_MMX.asm ├── SHR_REG_CL.asm ├── AND_REG_REG.asm ├── CMOVcc_REG_REG.asm ├── IMUL_REG_REG.asm ├── Phenom2_Benchmark.vcxproj.filters ├── FLOPS.asm ├── Phenom2_Benchmark.vcxproj └── main.cpp ├── Phenom2_Benchmark.sln ├── README.md └── LICENSE /linux_src_bin/asm.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/TheRainDoodle/Phenom-II-Benchmark/HEAD/linux_src_bin/asm.o -------------------------------------------------------------------------------- /linux_src_bin/phenom2_benchmark: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/TheRainDoodle/Phenom-II-Benchmark/HEAD/linux_src_bin/phenom2_benchmark -------------------------------------------------------------------------------- /x64/Release/Phenom2_Benchmark.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/TheRainDoodle/Phenom-II-Benchmark/HEAD/x64/Release/Phenom2_Benchmark.exe -------------------------------------------------------------------------------- /Phenom2_Benchmark/Phenom2_Benchmark.vcxproj.user: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | -------------------------------------------------------------------------------- /linux_src_bin/asm.asm: -------------------------------------------------------------------------------- 1 | %include "AND_REG_REG.asm" 2 | %include "CMOVcc_REG_REG.asm" 3 | %include "PADDB_MMX.asm" 4 | %include "ADD_REG_1.asm" 5 | %include "SHR_REG_CL.asm" 6 | %include "AVXChecker.asm" 7 | %include "FLOPS.asm" 8 | %include "IMUL_REG_REG.asm" 9 | -------------------------------------------------------------------------------- /linux_src_bin/makefile: -------------------------------------------------------------------------------- 1 | phenom2_benchmark: main.cpp asm.o 2 | g++ main.cpp asm.o -lpthread -ffast-math -msse3 -O3 -o phenom2_benchmark 3 | 4 | asm.o: asm.asm AND_REG_REG.asm CMOVcc_REG_REG.asm PADDB_MMX.asm ADD_REG_1.asm SHR_REG_CL.asm AVXChecker.asm FLOPS.asm IMUL_REG_REG.asm 5 | nasm asm.asm -felf64 -o asm.o 6 | -------------------------------------------------------------------------------- /linux_src_bin/AVXChecker.asm: -------------------------------------------------------------------------------- 1 | global GetAVXCapability 2 | global GetSSECapability 3 | 4 | section .text 5 | 6 | ; Checks CPUID for AVX capability 7 | GetAVXCapability: 8 | push rbx 9 | 10 | mov eax, 1 11 | cpuid 12 | 13 | mov eax, ecx 14 | shr eax, 28 ; Read bit 28 15 | and eax, 1 16 | 17 | pop rbx 18 | ret 19 | 20 | 21 | ; Checks CPUID for SSE capability 22 | GetSSECapability: 23 | push rbx 24 | 25 | mov eax, 1 26 | cpuid 27 | 28 | mov eax, edx 29 | shr eax, 25 ; Read bit 25 30 | and eax, 1 31 | 32 | pop rbx 33 | ret 34 | 35 | -------------------------------------------------------------------------------- /Phenom2_Benchmark/AVXChecker.asm: -------------------------------------------------------------------------------- 1 | .code 2 | ; Checks CPUID for AVX capability 3 | GetAVXCapability proc 4 | push rbx 5 | 6 | mov eax, 1 7 | cpuid 8 | 9 | mov eax, ecx 10 | shr eax, 28 ; Read bit 28 11 | and eax, 1 12 | 13 | pop rbx 14 | ret 15 | GetAVXCapability endp 16 | 17 | ; Checks CPUID for SSE capability 18 | GetSSECapability proc 19 | push rbx 20 | 21 | mov eax, 1 22 | cpuid 23 | 24 | mov eax, edx 25 | shr eax, 25 ; Read bit 25 26 | and eax, 1 27 | 28 | pop rbx 29 | ret 30 | GetSSECapability endp 31 | end -------------------------------------------------------------------------------- /linux_src_bin/ADD_REG_1.asm: -------------------------------------------------------------------------------- 1 | global ADD_REG_1 2 | 3 | section .text 4 | 5 | %macro ADD_MACRO 0 6 | add rax, 1 7 | add rdx, 1 8 | add rdi, 1 9 | add rsi, 1 10 | add r11, 1 11 | add r8, 1 12 | add r9, 1 13 | add r10, 1 14 | %endmacro 15 | 16 | ADD_REG_1: 17 | push rbx 18 | push rdi 19 | push rsi 20 | push rbp 21 | push r11 22 | push r8 23 | push r9 24 | push r10 25 | push rdx 26 | 27 | mov rcx, (1024*1024*1024)/128 28 | 29 | .LoopHead: 30 | ADD_MACRO 31 | ADD_MACRO 32 | ADD_MACRO 33 | ADD_MACRO 34 | ADD_MACRO 35 | ADD_MACRO 36 | ADD_MACRO 37 | ADD_MACRO 38 | ADD_MACRO 39 | ADD_MACRO 40 | ADD_MACRO 41 | ADD_MACRO 42 | ADD_MACRO 43 | ADD_MACRO 44 | ADD_MACRO 45 | ADD_MACRO 46 | 47 | dec rcx 48 | jnz .LoopHead 49 | 50 | pop rdx 51 | pop r10 52 | pop r9 53 | pop r8 54 | pop r11 55 | pop rbp 56 | pop rsi 57 | pop rdi 58 | pop rbx 59 | ret 60 | -------------------------------------------------------------------------------- /Phenom2_Benchmark/ADD_REG_1.asm: -------------------------------------------------------------------------------- 1 | .code 2 | 3 | ADD_MACRO macro 4 | add rax, 1 5 | add rdx, 1 6 | add rdi, 1 7 | add rsi, 1 8 | add r11, 1 9 | add r8, 1 10 | add r9, 1 11 | add r10, 1 12 | endm 13 | 14 | ADD_REG_1 proc 15 | push rbx 16 | push rdi 17 | push rsi 18 | push rbp 19 | push r11 20 | push r8 21 | push r9 22 | push r10 23 | 24 | mov rcx, (1024*1024*1024)/128 25 | 26 | LoopHead: 27 | ADD_MACRO 28 | ADD_MACRO 29 | ADD_MACRO 30 | ADD_MACRO 31 | ADD_MACRO 32 | ADD_MACRO 33 | ADD_MACRO 34 | ADD_MACRO 35 | ADD_MACRO 36 | ADD_MACRO 37 | ADD_MACRO 38 | ADD_MACRO 39 | ADD_MACRO 40 | ADD_MACRO 41 | ADD_MACRO 42 | ADD_MACRO 43 | 44 | dec rcx 45 | jnz LoopHead 46 | 47 | pop r10 48 | pop r9 49 | pop r8 50 | pop r11 51 | pop rbp 52 | pop rsi 53 | pop rdi 54 | pop rbx 55 | ret 56 | ADD_REG_1 endp 57 | end -------------------------------------------------------------------------------- /linux_src_bin/SHR_REG_CL.asm: -------------------------------------------------------------------------------- 1 | global SHR_REG_CL 2 | 3 | section .text 4 | 5 | %macro SHR_MACRO 0 6 | shr rax, cl 7 | shr rdx, cl 8 | shr rdi, cl 9 | shr rsi, cl 10 | shr r11, cl 11 | shr r8, cl 12 | shr r9, cl 13 | shr r10, cl 14 | %endmacro 15 | 16 | SHR_REG_CL: 17 | push rbx 18 | push rdi 19 | push rsi 20 | push rbp 21 | push r11 22 | push r8 23 | push r9 24 | push r10 25 | 26 | push r12 27 | 28 | mov r12, (1024*1024*1024)/128 29 | 30 | .LoopHead: 31 | SHR_MACRO 32 | SHR_MACRO 33 | SHR_MACRO 34 | SHR_MACRO 35 | SHR_MACRO 36 | SHR_MACRO 37 | SHR_MACRO 38 | SHR_MACRO 39 | SHR_MACRO 40 | SHR_MACRO 41 | SHR_MACRO 42 | SHR_MACRO 43 | SHR_MACRO 44 | SHR_MACRO 45 | SHR_MACRO 46 | SHR_MACRO 47 | 48 | dec r12 49 | jnz .LoopHead 50 | 51 | pop r12 52 | pop r10 53 | pop r9 54 | pop r8 55 | pop r11 56 | pop rbp 57 | pop rsi 58 | pop rdi 59 | pop rbx 60 | ret 61 | -------------------------------------------------------------------------------- /linux_src_bin/PADDB_MMX.asm: -------------------------------------------------------------------------------- 1 | global PADDB_MMX 2 | 3 | section .text 4 | 5 | %macro PADD_MACRO 0 6 | paddb mm1, mm0 7 | paddb mm2, mm0 8 | paddb mm3, mm0 9 | paddb mm4, mm0 10 | %endmacro 11 | 12 | PADDB_MMX: 13 | push rbx 14 | push rdi 15 | push rsi 16 | push rbp 17 | push r11 18 | push r8 19 | push r9 20 | push r10 21 | 22 | mov rcx, (1024*1024*1024)/(32 * 8) ; 8 for 8 bytes in MMX 23 | 24 | .LoopHead: 25 | PADD_MACRO 26 | PADD_MACRO 27 | PADD_MACRO 28 | PADD_MACRO 29 | PADD_MACRO 30 | PADD_MACRO 31 | PADD_MACRO 32 | PADD_MACRO 33 | PADD_MACRO 34 | PADD_MACRO 35 | PADD_MACRO 36 | PADD_MACRO 37 | PADD_MACRO 38 | PADD_MACRO 39 | PADD_MACRO 40 | PADD_MACRO 41 | 42 | dec rcx 43 | jnz .LoopHead 44 | 45 | pop r10 46 | pop r9 47 | pop r8 48 | pop r11 49 | pop rbp 50 | pop rsi 51 | pop rdi 52 | pop rbx 53 | 54 | emms ; Exit multimedia state, return to x87 55 | ret 56 | -------------------------------------------------------------------------------- /linux_src_bin/AND_REG_REG.asm: -------------------------------------------------------------------------------- 1 | global AND_REG_REG 2 | 3 | section .text 4 | 5 | %macro AND_MACRO 0 6 | and rax, r12 7 | and rdx, r12 8 | and rdi, r12 9 | and rsi, r12 10 | and r11, r12 11 | and r8, r12 12 | and r9, r12 13 | and r10, r12 14 | %endmacro 15 | 16 | 17 | 18 | AND_REG_REG: 19 | push rbx 20 | push rdi 21 | push rsi 22 | push rbp 23 | push r11 24 | push r8 25 | push r9 26 | push r10 27 | push r12 28 | 29 | mov rcx, (1024*1024*1024)/128 30 | 31 | .LoopHead: 32 | AND_MACRO 33 | AND_MACRO 34 | AND_MACRO 35 | AND_MACRO 36 | AND_MACRO 37 | AND_MACRO 38 | AND_MACRO 39 | AND_MACRO 40 | AND_MACRO 41 | AND_MACRO 42 | AND_MACRO 43 | AND_MACRO 44 | AND_MACRO 45 | AND_MACRO 46 | AND_MACRO 47 | AND_MACRO 48 | 49 | dec rcx 50 | jnz .LoopHead 51 | 52 | pop r12 53 | pop r10 54 | pop r9 55 | pop r8 56 | pop r11 57 | pop rbp 58 | pop rsi 59 | pop rdi 60 | pop rbx 61 | ret 62 | -------------------------------------------------------------------------------- /linux_src_bin/CMOVcc_REG_REG.asm: -------------------------------------------------------------------------------- 1 | global CMOVcc_REG_REG 2 | 3 | section .text 4 | 5 | %macro CMOV_MACRO 0 6 | cmove rdx, rax 7 | cmove rbx, rax 8 | cmove rsi, rax 9 | cmove rdi, rax 10 | cmove r8, rax 11 | cmove r9, rax 12 | cmove r10, rax 13 | cmove r11, rax 14 | %endmacro 15 | 16 | CMOVcc_REG_REG: 17 | push rbx 18 | push rdi 19 | push rsi 20 | push rbp 21 | push r11 22 | push r8 23 | push r9 24 | push r10 25 | 26 | mov rcx, (1024*1024*1024)/128 27 | 28 | .LoopHead: 29 | CMOV_MACRO 30 | CMOV_MACRO 31 | CMOV_MACRO 32 | CMOV_MACRO 33 | CMOV_MACRO 34 | CMOV_MACRO 35 | CMOV_MACRO 36 | CMOV_MACRO 37 | CMOV_MACRO 38 | CMOV_MACRO 39 | CMOV_MACRO 40 | CMOV_MACRO 41 | CMOV_MACRO 42 | CMOV_MACRO 43 | CMOV_MACRO 44 | CMOV_MACRO 45 | 46 | dec rcx 47 | jnz .LoopHead 48 | 49 | pop r10 50 | pop r9 51 | pop r8 52 | pop r11 53 | pop rbp 54 | pop rsi 55 | pop rdi 56 | pop rbx 57 | 58 | ret 59 | -------------------------------------------------------------------------------- /Phenom2_Benchmark/PADDB_MMX.asm: -------------------------------------------------------------------------------- 1 | .code 2 | 3 | PADD_MACRO macro 4 | paddb mm1, mm0 5 | paddb mm2, mm0 6 | paddb mm3, mm0 7 | paddb mm4, mm0 8 | endm 9 | 10 | PADDB_MMX proc 11 | push rbx 12 | push rdi 13 | push rsi 14 | push rbp 15 | push r11 16 | push r8 17 | push r9 18 | push r10 19 | 20 | mov rcx, (1024*1024*1024)/(32 * 8) ; 8 for 8 bytes in MMX 21 | 22 | LoopHead: 23 | PADD_MACRO 24 | PADD_MACRO 25 | PADD_MACRO 26 | PADD_MACRO 27 | PADD_MACRO 28 | PADD_MACRO 29 | PADD_MACRO 30 | PADD_MACRO 31 | PADD_MACRO 32 | PADD_MACRO 33 | PADD_MACRO 34 | PADD_MACRO 35 | PADD_MACRO 36 | PADD_MACRO 37 | PADD_MACRO 38 | PADD_MACRO 39 | 40 | dec rcx 41 | jnz LoopHead 42 | 43 | pop r10 44 | pop r9 45 | pop r8 46 | pop r11 47 | pop rbp 48 | pop rsi 49 | pop rdi 50 | pop rbx 51 | 52 | emms ; Exit multimedia state, return to x87 53 | ret 54 | PADDB_MMX endp 55 | end -------------------------------------------------------------------------------- /Phenom2_Benchmark/SHR_REG_CL.asm: -------------------------------------------------------------------------------- 1 | .code 2 | 3 | SHR_MACRO macro 4 | shr rax, cl 5 | shr rdx, cl 6 | shr rdi, cl 7 | shr rsi, cl 8 | shr r11, cl 9 | shr r8, cl 10 | shr r9, cl 11 | shr r10, cl 12 | endm 13 | 14 | SHR_REG_CL proc 15 | push rbx 16 | push rdi 17 | push rsi 18 | push rbp 19 | push r11 20 | push r8 21 | push r9 22 | push r10 23 | 24 | push r12 25 | 26 | mov r12, (1024*1024*1024)/128 27 | 28 | LoopHead: 29 | SHR_MACRO 30 | SHR_MACRO 31 | SHR_MACRO 32 | SHR_MACRO 33 | SHR_MACRO 34 | SHR_MACRO 35 | SHR_MACRO 36 | SHR_MACRO 37 | SHR_MACRO 38 | SHR_MACRO 39 | SHR_MACRO 40 | SHR_MACRO 41 | SHR_MACRO 42 | SHR_MACRO 43 | SHR_MACRO 44 | SHR_MACRO 45 | 46 | dec r12 47 | jnz LoopHead 48 | 49 | pop r12 50 | pop r10 51 | pop r9 52 | pop r8 53 | pop r11 54 | pop rbp 55 | pop rsi 56 | pop rdi 57 | pop rbx 58 | ret 59 | SHR_REG_CL endp 60 | end -------------------------------------------------------------------------------- /Phenom2_Benchmark/AND_REG_REG.asm: -------------------------------------------------------------------------------- 1 | .code 2 | 3 | AND_MACRO macro 4 | and rax, r12 5 | and rdx, r12 6 | and rdi, r12 7 | and rsi, r12 8 | and r11, r12 9 | and r8, r12 10 | and r9, r12 11 | and r10, r12 12 | endm 13 | 14 | AND_REG_REG proc 15 | push rbx 16 | push rdi 17 | push rsi 18 | push rbp 19 | push r11 20 | push r8 21 | push r9 22 | push r10 23 | push r12 24 | 25 | mov rcx, (1024*1024*1024)/128 26 | 27 | LoopHead: 28 | AND_MACRO 29 | AND_MACRO 30 | AND_MACRO 31 | AND_MACRO 32 | AND_MACRO 33 | AND_MACRO 34 | AND_MACRO 35 | AND_MACRO 36 | AND_MACRO 37 | AND_MACRO 38 | AND_MACRO 39 | AND_MACRO 40 | AND_MACRO 41 | AND_MACRO 42 | AND_MACRO 43 | AND_MACRO 44 | 45 | dec rcx 46 | jnz LoopHead 47 | 48 | pop r12 49 | pop r10 50 | pop r9 51 | pop r8 52 | pop r11 53 | pop rbp 54 | pop rsi 55 | pop rdi 56 | pop rbx 57 | ret 58 | AND_REG_REG endp 59 | end -------------------------------------------------------------------------------- /Phenom2_Benchmark/CMOVcc_REG_REG.asm: -------------------------------------------------------------------------------- 1 | .code 2 | 3 | CMOV_MACRO macro 4 | cmove rdx, rax 5 | cmove rbx, rax 6 | cmove rsi, rax 7 | cmove rdi, rax 8 | cmove r8, rax 9 | cmove r9, rax 10 | cmove r10, rax 11 | cmove r11, rax 12 | endm 13 | 14 | CMOVcc_REG_REG proc 15 | push rbx 16 | push rdi 17 | push rsi 18 | push rbp 19 | push r11 20 | push r8 21 | push r9 22 | push r10 23 | 24 | mov rcx, (1024*1024*1024)/128 25 | 26 | LoopHead: 27 | CMOV_MACRO 28 | CMOV_MACRO 29 | CMOV_MACRO 30 | CMOV_MACRO 31 | CMOV_MACRO 32 | CMOV_MACRO 33 | CMOV_MACRO 34 | CMOV_MACRO 35 | CMOV_MACRO 36 | CMOV_MACRO 37 | CMOV_MACRO 38 | CMOV_MACRO 39 | CMOV_MACRO 40 | CMOV_MACRO 41 | CMOV_MACRO 42 | CMOV_MACRO 43 | 44 | dec rcx 45 | jnz LoopHead 46 | 47 | pop r10 48 | pop r9 49 | pop r8 50 | pop r11 51 | pop rbp 52 | pop rsi 53 | pop rdi 54 | pop rbx 55 | ret 56 | CMOVcc_REG_REG endp 57 | end -------------------------------------------------------------------------------- /Phenom2_Benchmark/IMUL_REG_REG.asm: -------------------------------------------------------------------------------- 1 | .code 2 | 3 | IMUL_MACRO macro 4 | imul rax, rbx 5 | imul rdx, rbx 6 | imul rdi, rbx 7 | imul rsi, rbx 8 | imul r11, rbx 9 | imul r8, rbx 10 | imul r9, rbx 11 | imul r10, rbx 12 | endm 13 | 14 | IMUL_REG_REG proc 15 | push rbx 16 | push rdi 17 | push rsi 18 | push rbp 19 | push r11 20 | push r8 21 | push r9 22 | push r10 23 | 24 | mov rcx, (1024*1024*1024)/128 25 | 26 | ; Set all the accumulators to 1 27 | mov rbx, 1 28 | mov rax, 1 29 | mov rdx, 1 30 | mov rdi, 1 31 | mov rsi, 1 32 | mov r11, 1 33 | mov r8, 1 34 | mov r9, 1 35 | mov r10, 1 36 | 37 | LoopHead: 38 | IMUL_MACRO 39 | IMUL_MACRO 40 | IMUL_MACRO 41 | IMUL_MACRO 42 | IMUL_MACRO 43 | IMUL_MACRO 44 | IMUL_MACRO 45 | IMUL_MACRO 46 | IMUL_MACRO 47 | IMUL_MACRO 48 | IMUL_MACRO 49 | IMUL_MACRO 50 | IMUL_MACRO 51 | IMUL_MACRO 52 | IMUL_MACRO 53 | IMUL_MACRO 54 | 55 | dec rcx 56 | jnz LoopHead 57 | 58 | pop r10 59 | pop r9 60 | pop r8 61 | pop r11 62 | pop rbp 63 | pop rsi 64 | pop rdi 65 | pop rbx 66 | ret 67 | IMUL_REG_REG endp 68 | end -------------------------------------------------------------------------------- /linux_src_bin/IMUL_REG_REG.asm: -------------------------------------------------------------------------------- 1 | global IMUL_REG_REG 2 | 3 | section .text 4 | 5 | %macro IMUL_MACRO 0 6 | imul rax, rbx 7 | imul rdx, rbx 8 | imul rdi, rbx 9 | imul rsi, rbx 10 | imul r11, rbx 11 | imul r8, rbx 12 | imul r9, rbx 13 | imul r10, rbx 14 | %endmacro 15 | 16 | IMUL_REG_REG: 17 | push rbx 18 | push rdi 19 | push rsi 20 | push rbp 21 | push r11 22 | push r8 23 | push r9 24 | push r10 25 | 26 | mov rcx, (1024*1024*1024)/128 27 | 28 | ; Set all the accumulators to 1 29 | mov rbx, 1 30 | mov rax, 1 31 | mov rdx, 1 32 | mov rdi, 1 33 | mov rsi, 1 34 | mov r11, 1 35 | mov r8, 1 36 | mov r9, 1 37 | mov r10, 1 38 | 39 | .LoopHead: 40 | IMUL_MACRO 41 | IMUL_MACRO 42 | IMUL_MACRO 43 | IMUL_MACRO 44 | IMUL_MACRO 45 | IMUL_MACRO 46 | IMUL_MACRO 47 | IMUL_MACRO 48 | IMUL_MACRO 49 | IMUL_MACRO 50 | IMUL_MACRO 51 | IMUL_MACRO 52 | IMUL_MACRO 53 | IMUL_MACRO 54 | IMUL_MACRO 55 | IMUL_MACRO 56 | 57 | dec rcx 58 | jnz .LoopHead 59 | 60 | pop r10 61 | pop r9 62 | pop r8 63 | pop r11 64 | pop rbp 65 | pop rsi 66 | pop rdi 67 | pop rbx 68 | ret 69 | 70 | -------------------------------------------------------------------------------- /Phenom2_Benchmark.sln: -------------------------------------------------------------------------------- 1 | 2 | Microsoft Visual Studio Solution File, Format Version 12.00 3 | # Visual Studio Version 16 4 | VisualStudioVersion = 16.0.29306.81 5 | MinimumVisualStudioVersion = 10.0.40219.1 6 | Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "Phenom2_Benchmark", "Phenom2_Benchmark\Phenom2_Benchmark.vcxproj", "{1070F381-432B-460F-82B1-240BB75B819A}" 7 | EndProject 8 | Global 9 | GlobalSection(SolutionConfigurationPlatforms) = preSolution 10 | Debug|x64 = Debug|x64 11 | Debug|x86 = Debug|x86 12 | Release|x64 = Release|x64 13 | Release|x86 = Release|x86 14 | EndGlobalSection 15 | GlobalSection(ProjectConfigurationPlatforms) = postSolution 16 | {1070F381-432B-460F-82B1-240BB75B819A}.Debug|x64.ActiveCfg = Debug|x64 17 | {1070F381-432B-460F-82B1-240BB75B819A}.Debug|x64.Build.0 = Debug|x64 18 | {1070F381-432B-460F-82B1-240BB75B819A}.Debug|x86.ActiveCfg = Debug|Win32 19 | {1070F381-432B-460F-82B1-240BB75B819A}.Debug|x86.Build.0 = Debug|Win32 20 | {1070F381-432B-460F-82B1-240BB75B819A}.Release|x64.ActiveCfg = Release|x64 21 | {1070F381-432B-460F-82B1-240BB75B819A}.Release|x64.Build.0 = Release|x64 22 | {1070F381-432B-460F-82B1-240BB75B819A}.Release|x86.ActiveCfg = Release|Win32 23 | {1070F381-432B-460F-82B1-240BB75B819A}.Release|x86.Build.0 = Release|Win32 24 | EndGlobalSection 25 | GlobalSection(SolutionProperties) = preSolution 26 | HideSolutionNode = FALSE 27 | EndGlobalSection 28 | GlobalSection(ExtensibilityGlobals) = postSolution 29 | SolutionGuid = {E4CF0596-E5BD-490F-89BB-ACFBA475D672} 30 | EndGlobalSection 31 | EndGlobal 32 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Phenom-II-Benchmark 2 | 3 | The Phenom II Benchmark is a small set of low level benchmarks for testing hardware speed against a Phenom II 810 Quad Core from 2009. I hope to add more tests as time goes on, depending on whether the topic is found to be interesting for people (specifically single threaded performance, and L1 cache tests). 4 | 5 | The benchmarks use all threads and cores of a CPU, and execute 100 billion iterations of some specific instruction using heavily unrolled loops for pipelining. The program has the timings which my old Phenom II 810 scores for each of the benchmarks, and prints out how many Phenom II's your CPU is, i.e. how much faster than a Phenom II the hardware is. A score of 2 Phenom II's means your hardware executed the instructions twice as fast. 6 | 7 | The aim of this project is to highlight some of the nuances in the speed of hardware. And show, while hardware is generally improving in speed, there are some things old hardware does as fast or faster. I happen to own two Phenom II 810 CPU's from a long time ago, and I decided it would be fun to race them against my laptop, which has an i7 8750H; a mobile CPU, fer sure, but a decent peice of hardware nonetheless. 8 | 9 | I was surprised and fascinated by the results. There are many things the old Phenom does much faster than my modern CPU, although they are generally single threaded, and these tests do not currently appear in the benchmark. Modern CPU's have larger SIMD registers and more cores, but are otherwise not much faster. 10 | 11 | There are other things the Phenom II does very well, and I'd love to explore further if there is interest in improving this tool. 12 | 13 | Anywho, have a good one all, DL and run the app yourself, find today: How Many Phenom II's is my CPU! :) 14 | -------------------------------------------------------------------------------- /Phenom2_Benchmark/Phenom2_Benchmark.vcxproj.filters: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | {4FC737F1-C7A5-4376-A066-2A32D752A2FF} 6 | cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx 7 | 8 | 9 | {93995380-89BD-4b04-88EB-625FBE52EBFB} 10 | h;hh;hpp;hxx;hm;inl;inc;ipp;xsd 11 | 12 | 13 | {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} 14 | rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms 15 | 16 | 17 | 18 | 19 | Source Files 20 | 21 | 22 | 23 | 24 | Source Files 25 | 26 | 27 | Source Files 28 | 29 | 30 | Source Files 31 | 32 | 33 | Source Files 34 | 35 | 36 | Source Files 37 | 38 | 39 | Source Files 40 | 41 | 42 | Source Files 43 | 44 | 45 | Source Files 46 | 47 | 48 | -------------------------------------------------------------------------------- /linux_src_bin/FLOPS.asm: -------------------------------------------------------------------------------- 1 | global FLOPS_SSE 2 | global FLOPS_AVX 3 | 4 | section .text 5 | 6 | ; 8x phenom II 7 | %macro ADD_SSE 0 8 | addps xmm1, xmm0 9 | addps xmm2, xmm0 10 | addps xmm3, xmm0 11 | addps xmm4, xmm0 12 | addps xmm5, xmm0 13 | addps xmm6, xmm0 14 | addps xmm7, xmm0 15 | addps xmm8, xmm0 16 | %endmacro 17 | 18 | ; For AVX capable CPU's 19 | %macro ADD_AVX 0 20 | vaddps ymm1, ymm1, ymm0 21 | vaddps ymm2, ymm2, ymm0 22 | vaddps ymm3, ymm3, ymm0 23 | vaddps ymm4, ymm4, ymm0 24 | vaddps ymm5, ymm5, ymm0 25 | vaddps ymm6, ymm6, ymm0 26 | vaddps ymm7, ymm7, ymm0 27 | vaddps ymm8, ymm8, ymm0 28 | %endmacro 29 | 30 | FLOPS_SSE: 31 | push rbx 32 | push rdi 33 | push rsi 34 | push rbp 35 | push r11 36 | push r8 37 | push r9 38 | push r10 39 | 40 | push r12 41 | 42 | mov r12, (1024*1024*1024)/(128 * 4) ; x4 for SSE 43 | 44 | .LoopHead: 45 | ADD_SSE 46 | ADD_SSE 47 | ADD_SSE 48 | ADD_SSE 49 | ADD_SSE 50 | ADD_SSE 51 | ADD_SSE 52 | ADD_SSE 53 | ADD_SSE 54 | ADD_SSE 55 | ADD_SSE 56 | ADD_SSE 57 | ADD_SSE 58 | ADD_SSE 59 | ADD_SSE 60 | ADD_SSE 61 | 62 | dec r12 63 | jnz .LoopHead 64 | 65 | pop r12 66 | pop r10 67 | pop r9 68 | pop r8 69 | pop r11 70 | pop rbp 71 | pop rsi 72 | pop rdi 73 | pop rbx 74 | ret 75 | 76 | FLOPS_AVX: 77 | push rbx 78 | push rdi 79 | push rsi 80 | push rbp 81 | push r11 82 | push r8 83 | push r9 84 | push r10 85 | push r12 86 | 87 | mov r12, (1024*1024*1024)/(128 * 8) ; x8 for AVX 88 | 89 | ; Set all the AVX regs to 0.0 90 | vxorps ymm0, ymm0, ymm0 91 | vxorps ymm1, ymm1, ymm1 92 | vxorps ymm2, ymm2, ymm2 93 | vxorps ymm3, ymm3, ymm3 94 | vxorps ymm4, ymm4, ymm4 95 | vxorps ymm5, ymm5, ymm5 96 | vxorps ymm6, ymm6, ymm6 97 | vxorps ymm7, ymm7, ymm7 98 | vxorps ymm8, ymm8, ymm8 99 | 100 | .LoopHead: 101 | ADD_AVX 102 | ADD_AVX 103 | ADD_AVX 104 | ADD_AVX 105 | ADD_AVX 106 | ADD_AVX 107 | ADD_AVX 108 | ADD_AVX 109 | ADD_AVX 110 | ADD_AVX 111 | ADD_AVX 112 | ADD_AVX 113 | ADD_AVX 114 | ADD_AVX 115 | ADD_AVX 116 | ADD_AVX 117 | 118 | dec r12 119 | jnz .LoopHead 120 | 121 | pop r12 122 | pop r10 123 | pop r9 124 | pop r8 125 | pop r11 126 | pop rbp 127 | pop rsi 128 | pop rdi 129 | pop rbx 130 | ret 131 | -------------------------------------------------------------------------------- /Phenom2_Benchmark/FLOPS.asm: -------------------------------------------------------------------------------- 1 | .code 2 | 3 | ; 8x phenom II 4 | ADD_SSE macro 5 | addps xmm1, xmm0 6 | addps xmm2, xmm0 7 | addps xmm3, xmm0 8 | addps xmm4, xmm0 9 | addps xmm5, xmm0 10 | addps xmm6, xmm0 11 | addps xmm7, xmm0 12 | addps xmm8, xmm0 13 | endm 14 | 15 | ADD_AVX macro 16 | vaddps ymm1, ymm1, ymm0 17 | vaddps ymm2, ymm2, ymm0 18 | vaddps ymm3, ymm3, ymm0 19 | vaddps ymm4, ymm4, ymm0 20 | vaddps ymm5, ymm5, ymm0 21 | vaddps ymm6, ymm6, ymm0 22 | vaddps ymm7, ymm7, ymm0 23 | vaddps ymm8, ymm8, ymm0 24 | endm 25 | 26 | FLOPS_SSE proc 27 | push rbx 28 | push rdi 29 | push rsi 30 | push rbp 31 | push r11 32 | push r8 33 | push r9 34 | push r10 35 | 36 | push r12 37 | 38 | mov r12, (1024*1024*1024)/(128 * 4) ; x4 for SSE 39 | 40 | LoopHead: 41 | ADD_SSE 42 | ADD_SSE 43 | ADD_SSE 44 | ADD_SSE 45 | ADD_SSE 46 | ADD_SSE 47 | ADD_SSE 48 | ADD_SSE 49 | ADD_SSE 50 | ADD_SSE 51 | ADD_SSE 52 | ADD_SSE 53 | ADD_SSE 54 | ADD_SSE 55 | ADD_SSE 56 | ADD_SSE 57 | 58 | dec r12 59 | jnz LoopHead 60 | 61 | pop r12 62 | pop r10 63 | pop r9 64 | pop r8 65 | pop r11 66 | pop rbp 67 | pop rsi 68 | pop rsi 69 | pop rbx 70 | ret 71 | FLOPS_SSE endp 72 | 73 | FLOPS_AVX proc 74 | push rbx 75 | push rdi 76 | push rsi 77 | push rbp 78 | push r11 79 | push r8 80 | push r9 81 | push r10 82 | push r12 83 | 84 | mov r12, (1024*1024*1024)/(128 * 8) ; x8 for AVX 85 | 86 | ; Set all the AVX regs to 0.0 87 | vxorps ymm0, ymm0, ymm0 88 | vxorps ymm1, ymm1, ymm1 89 | vxorps ymm2, ymm2, ymm2 90 | vxorps ymm3, ymm3, ymm3 91 | vxorps ymm4, ymm4, ymm4 92 | vxorps ymm5, ymm5, ymm5 93 | vxorps ymm6, ymm6, ymm6 94 | vxorps ymm7, ymm7, ymm7 95 | vxorps ymm8, ymm8, ymm8 96 | 97 | LoopHead: 98 | ADD_AVX 99 | ADD_AVX 100 | ADD_AVX 101 | ADD_AVX 102 | ADD_AVX 103 | ADD_AVX 104 | ADD_AVX 105 | ADD_AVX 106 | ADD_AVX 107 | ADD_AVX 108 | ADD_AVX 109 | ADD_AVX 110 | ADD_AVX 111 | ADD_AVX 112 | ADD_AVX 113 | ADD_AVX 114 | 115 | dec r12 116 | jnz LoopHead 117 | 118 | pop r12 119 | pop r10 120 | pop r9 121 | pop r8 122 | pop r11 123 | pop rbp 124 | pop rsi 125 | pop rdi 126 | pop rbx 127 | ret 128 | FLOPS_AVX endp 129 | 130 | end -------------------------------------------------------------------------------- /Phenom2_Benchmark/Phenom2_Benchmark.vcxproj: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | Debug 6 | Win32 7 | 8 | 9 | Release 10 | Win32 11 | 12 | 13 | Debug 14 | x64 15 | 16 | 17 | Release 18 | x64 19 | 20 | 21 | 22 | 16.0 23 | {1070F381-432B-460F-82B1-240BB75B819A} 24 | Phenom2Benchmark 25 | 10.0 26 | 27 | 28 | 29 | Application 30 | true 31 | v142 32 | MultiByte 33 | 34 | 35 | Application 36 | false 37 | v142 38 | true 39 | MultiByte 40 | 41 | 42 | Application 43 | true 44 | v142 45 | MultiByte 46 | 47 | 48 | Application 49 | false 50 | v142 51 | true 52 | MultiByte 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 70 | 71 | 72 | 73 | 74 | 75 | 76 | Level3 77 | Disabled 78 | true 79 | true 80 | 81 | 82 | Console 83 | 84 | 85 | 86 | 87 | Level3 88 | Disabled 89 | true 90 | true 91 | 92 | 93 | Console 94 | 95 | 96 | 97 | 98 | Level3 99 | MaxSpeed 100 | true 101 | true 102 | true 103 | true 104 | 105 | 106 | Console 107 | true 108 | true 109 | 110 | 111 | 112 | 113 | Level3 114 | MaxSpeed 115 | true 116 | true 117 | true 118 | true 119 | AdvancedVectorExtensions2 120 | Fast 121 | 122 | 123 | Console 124 | true 125 | true 126 | 127 | 128 | 129 | 130 | 131 | 132 | 133 | 134 | 135 | 136 | 137 | 138 | 139 | 140 | 141 | 142 | 143 | 144 | 145 | -------------------------------------------------------------------------------- /linux_src_bin/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | // Checker function for AVX and SSE 8 | extern "C" bool GetAVXCapability(); 9 | extern "C" bool GetSSECapability(); 10 | 11 | // Job functions (Note: ThreadID is included for future versions) 12 | // Each executes 1024^3 times, 1 gig, or around 1 billion operations. 13 | extern "C" void ADD_REG_1(int threadID); 14 | extern "C" void AND_REG_REG(int threadID); 15 | extern "C" void SHR_REG_CL(int threadID); 16 | extern "C" void PADDB_MMX(int threadID); 17 | extern "C" void CMOVcc_REG_REG(int threadID); 18 | extern "C" void FLOPS_SSE(int threadID); 19 | extern "C" void FLOPS_AVX(int threadID); 20 | 21 | // MUL added for Reirei 22 | extern "C" void IMUL_REG_REG(int threadID); 23 | 24 | // Lock for the jobs vector 25 | std::mutex workMutex; 26 | 27 | // Jobs vector 28 | std::vector< void(*)(int) > work; 29 | 30 | void Execute(int threadID) 31 | { 32 | // The following is not necessary nor cross-platform 33 | //SetThreadPriority(GetCurrentThread(), 2); 34 | //SetThreadAffinityMask(GetCurrentThread(), 1 << threadID); 35 | 36 | // Whilte there's jobs to be done 37 | while (true) 38 | { 39 | // Thread's job (if it has one, NULL if it doesn't) 40 | void (*func)(int); 41 | 42 | // Lock mutex 43 | workMutex.lock(); 44 | 45 | // Assume there's no more work 46 | func = NULL; 47 | 48 | // If there's more work, grab a job 49 | if (work.size() != 0) 50 | { 51 | func = work.back(); 52 | work.pop_back(); 53 | } 54 | // Unlock mutex 55 | workMutex.unlock(); 56 | 57 | // If there's a job, execute it 58 | if (func != NULL) 59 | func(threadID); 60 | // Otherwise, return 61 | else 62 | return; 63 | } 64 | } 65 | 66 | int main() 67 | { 68 | double phenom2_performance[] = { 69 | // Multithreaded 70 | 30.099969, // Add 71 | 30.564951, // Bool 72 | 30.106989, // Shift CL 73 | 82.588283, // MMX 74 | 30.091751, // CMOVcc 75 | 41.371507, // Flops 76 | 1.0, // IMUL 77 | // Single threaded 78 | 7.5403567, // Add 79 | 7.6557838, // Bool 80 | 7.5400756, // Shift CL 81 | 20.704509, // MMX 82 | 7.5366694, // CMOVcc 83 | 10.36873, // Flops 84 | 1.0 // IMUL 85 | }; 86 | 87 | // Check for AVX capability 88 | bool AVX_CAPABLE = GetAVXCapability(); 89 | bool SSE_CAPABLE = GetSSECapability(); 90 | 91 | // Limit output digits to 4 92 | std::cout.precision(4); 93 | 94 | const int RUNS = 10; // Repeitions, so we can find a fast time 95 | const int MAX_THREADS = 64; // Maximum number of threads 96 | const int JOB_COUNT = 100; // Jobs to perform (threads keep checking until all jobs are done) 97 | int threadCount = std::thread::hardware_concurrency(); // Actual thread count of this CPU 98 | std::thread* t[MAX_THREADS]; // 16 is the maximum number of threads 99 | int option = -1; // Option variable for use input 100 | double fastest = 0.0; // Record of the fastest time recorded 101 | void(*currentFunction)(int); // Pointer to the currently selected function 102 | 103 | // Output some info 104 | std::cout<<"* * * Welcome to How Many Phenom II's is My CPU! * * *"<< std::endl; 105 | std::cout<< std::endl; 106 | std::cout<<"This benchmark will time your CPU performance against an"<< std::endl; 107 | std::cout<<"AMD Quad Core Phenom II 810 from the year 2009."<< std::endl; 108 | std::cout<>option; 144 | 145 | // Reset to -1 if the input is invalid 146 | option = (option * (option >= 0 && option <= 8)) 147 | + (-1 * !(option >= 0 && option <= 8)); 148 | } 149 | 150 | switch (option) 151 | { 152 | case 0: break; 153 | case 1: currentFunction = ADD_REG_1; break; 154 | case 2: currentFunction = AND_REG_REG; break; 155 | case 3: currentFunction = SHR_REG_CL; break; 156 | case 4: currentFunction = PADDB_MMX; break; 157 | case 5: currentFunction = CMOVcc_REG_REG; break; 158 | case 6: currentFunction = (void (*)(int)) // Select SSE or AVX 159 | ((unsigned long long)FLOPS_SSE * !AVX_CAPABLE + 160 | (unsigned long long)FLOPS_AVX * AVX_CAPABLE); break; 161 | case 7: currentFunction = IMUL_REG_REG; break; 162 | case 8: threadCount = (1 * (threadCount != 1)) + // Toggle threaded or single thread 163 | (std::thread::hardware_concurrency() * (threadCount == 1)); break; 164 | } 165 | 166 | if (option == 0) // Allow quit 167 | break; 168 | if (option == 8) // Continue if the thread count has been changed 169 | continue; 170 | 171 | // Loop RUNS times through the benchmark 172 | for (int r = 0; r < RUNS; r++) 173 | { 174 | // Add jobs to the Jobs vector 175 | for (int i = 0; i < JOB_COUNT; i++) 176 | work.push_back(currentFunction); 177 | 178 | // Start the clock 179 | long startTime = clock(); 180 | 181 | // Start the threads 182 | for (int i = 0; i < threadCount; i++) 183 | t[i] = new std::thread(Execute, i); 184 | 185 | // Wait for them to finish 186 | for (int i = 0; i < threadCount; i++) 187 | t[i]->join(); 188 | 189 | // Stop the clock 190 | long finishTime = clock(); 191 | 192 | // Compute the time taken for this run 193 | double thisTime = (double)(finishTime - startTime) / CLOCKS_PER_SEC; 194 | thisTime /= (double)threadCount; // ctime's clock seems to sum times of each thread 195 | 196 | // Update fastest if this time beat it 197 | if (thisTime < fastest || fastest == 0.0) 198 | fastest = thisTime; 199 | 200 | // Output time for this run 201 | std::cout<<"Run "<< (r+1) << "/" << RUNS <<" Time: "<< thisTime << std::endl; 202 | 203 | // Delete the threads 204 | for (int i = 0; i < threadCount; i++) 205 | delete t[i]; 206 | } 207 | 208 | double gops = ((((1024*1024*1024)/1000000000.0) 209 | / fastest) * (double)JOB_COUNT); 210 | 211 | double phenom2 = phenom2_performance[(option-1) 212 | + (7 * (threadCount == 1))]; 213 | 214 | std::cout<<"Executed "<< gops << " billion instructions/second" < 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | // Checker function for AVX and SSE 8 | extern "C" bool GetAVXCapability(); 9 | extern "C" bool GetSSECapability(); 10 | 11 | // Job functions (Note: ThreadID is included for future versions) 12 | // Each executes 1024^3 times, 1 gig, or around 1 billion operations. 13 | extern "C" void ADD_REG_1(int threadID); 14 | extern "C" void AND_REG_REG(int threadID); 15 | extern "C" void SHR_REG_CL(int threadID); 16 | extern "C" void PADDB_MMX(int threadID); 17 | extern "C" void CMOVcc_REG_REG(int threadID); 18 | extern "C" void FLOPS_SSE(int threadID); 19 | extern "C" void FLOPS_AVX(int threadID); 20 | 21 | // MUL added for Reirei 22 | extern "C" void IMUL_REG_REG(int threadID); 23 | 24 | // Lock for the jobs vector 25 | std::mutex workMutex; 26 | 27 | // Jobs vector 28 | std::vector< void(*)(int) > work; 29 | 30 | void Execute(int threadID) 31 | { 32 | // The following is not necessary nor cross-platform 33 | //SetThreadPriority(GetCurrentThread(), 2); 34 | //SetThreadAffinityMask(GetCurrentThread(), 1 << threadID); 35 | 36 | // Whilte there's jobs to be done 37 | while (true) 38 | { 39 | // Thread's job (if it has one, NULL if it doesn't) 40 | void (*func)(int); 41 | 42 | // Lock mutex 43 | workMutex.lock(); 44 | 45 | // Assume there's no more work 46 | func = NULL; 47 | 48 | // If there's more work, grab a job 49 | if (work.size() != 0) 50 | { 51 | func = work.back(); 52 | work.pop_back(); 53 | } 54 | // Unlock mutex 55 | workMutex.unlock(); 56 | 57 | // If there's a job, execute it 58 | if (func != NULL) 59 | func(threadID); 60 | // Otherwise, return 61 | else 62 | return; 63 | } 64 | } 65 | 66 | int main() 67 | { 68 | double phenom2_performance[] = { 69 | // Multithreaded 70 | 30.099969, // Add 71 | 30.564951, // Bool 72 | 30.106989, // Shift CL 73 | 82.588283, // MMX 74 | 30.091751, // CMOVcc 75 | 41.371507, // Flops 76 | 5.181, // IMUL 77 | // Single threaded 78 | 7.5403567, // Add 79 | 7.6557838, // Bool 80 | 7.5400756, // Shift CL 81 | 20.704509, // MMX 82 | 7.5366694, // CMOVcc 83 | 10.36873, // Flops 84 | 1.296 // IMUL 85 | }; 86 | 87 | // Check for AVX and SSE capability 88 | bool AVX_CAPABLE = GetAVXCapability(); 89 | bool SSE_CAPABLE = GetSSECapability(); 90 | 91 | // Limit output digits to 4 92 | std::cout.precision(4); 93 | 94 | const int RUNS = 10; // Repeitions, so we can find a fast time 95 | const int MAX_THREADS = 64; // Maximum number of threads 96 | const int JOB_COUNT = 100; // Jobs to perform (threads keep checking until all jobs are done) 97 | int threadCount = std::thread::hardware_concurrency(); // Actual thread count of this CPU 98 | std::thread* t[MAX_THREADS]; // 16 is the maximum number of threads 99 | int option = -1; // Option variable for use input 100 | double fastest = 0.0; // Record of the fastest time recorded 101 | void(*currentFunction)(int); // Pointer to the currently selected function 102 | 103 | // Output some info 104 | std::cout<<"* * * Welcome to How Many Phenom II's is My CPU! * * *"<< std::endl; 105 | std::cout<< std::endl; 106 | std::cout<<"This benchmark will time your CPU performance against an"<< std::endl; 107 | std::cout<<"AMD Quad Core Phenom II 810 from the year 2009."<< std::endl; 108 | std::cout<>option; 144 | 145 | // Reset to -1 if the input is invalid 146 | option = (option * (option >= 0 && option <= 8)) 147 | + (-1 * !(option >= 0 && option <= 8)); 148 | } 149 | 150 | switch (option) 151 | { 152 | case 0: break; 153 | case 1: currentFunction = ADD_REG_1; break; 154 | case 2: currentFunction = AND_REG_REG; break; 155 | case 3: currentFunction = SHR_REG_CL; break; 156 | case 4: currentFunction = PADDB_MMX; break; 157 | case 5: currentFunction = CMOVcc_REG_REG; break; 158 | case 6: currentFunction = (void (*)(int)) // Select SSE or AVX 159 | ((unsigned long long)FLOPS_SSE * !AVX_CAPABLE + 160 | (unsigned long long)FLOPS_AVX * AVX_CAPABLE); break; 161 | case 7: currentFunction = IMUL_REG_REG; break; 162 | case 8: threadCount = (1 * (threadCount != 1)) + // Toggle threaded or single thread 163 | (std::thread::hardware_concurrency() * (threadCount == 1)); break; 164 | } 165 | 166 | if (option == 0) // Allow quit 167 | break; 168 | if (option == 8) // Continue if the thread count has been changed 169 | continue; 170 | 171 | // Loop RUNS times through the benchmark 172 | for (int r = 0; r < RUNS; r++) 173 | { 174 | // Add jobs to the Jobs vector 175 | for (int i = 0; i < JOB_COUNT; i++) 176 | work.push_back(currentFunction); 177 | 178 | // Start the clock 179 | long startTime = clock(); 180 | 181 | // Start the threads 182 | for (int i = 0; i < threadCount; i++) 183 | t[i] = new std::thread(Execute, i); 184 | 185 | // Wait for them to finish 186 | for (int i = 0; i < threadCount; i++) 187 | t[i]->join(); 188 | 189 | // Stop the clock 190 | long finishTime = clock(); 191 | 192 | // Compute the time taken for this run 193 | double thisTime = (finishTime - startTime) / (double)CLOCKS_PER_SEC; 194 | 195 | // Update fastest if this time beat it 196 | if (thisTime < fastest || fastest == 0.0) 197 | fastest = thisTime; 198 | 199 | // Output time for this run 200 | std::cout<<"Run "<< (r+1) << "/" << RUNS <<" Time: "<< thisTime << std::endl; 201 | 202 | // Delete the threads 203 | for (int i = 0; i < threadCount; i++) 204 | delete t[i]; 205 | } 206 | 207 | double gops = ((((1024*1024*1024)/1000000000.0) 208 | / fastest) * (double)JOB_COUNT); 209 | 210 | double phenom2 = phenom2_performance[(option-1) 211 | + (7 * (threadCount == 1))]; 212 | 213 | std::cout<<"Executed "<< gops << " billion instructions/second" < 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | --------------------------------------------------------------------------------