├── README.md ├── .github └── FUNDING.yml ├── .gitignore ├── DoDSamples ├── DoDSamples.csproj ├── Samples │ ├── Benchmarks │ │ ├── InstructionAndDataDependency.cs │ │ ├── RefListvsList.cs │ │ ├── RowsVsCols.cs │ │ └── OOPvsDoDParsers.cs │ ├── CacheSize.cs │ ├── Utils.cs │ ├── ArrayEnumerableByRef.cs │ ├── POParser │ │ ├── OOPParser_Slow.cs │ │ ├── DoDPOParser_v1a.cs │ │ ├── DoDPOParser_v3a.cs │ │ ├── POGenerator.cs │ │ ├── DoDPOParser_v2a.cs │ │ ├── DoDPOParser_v1.cs │ │ ├── OOPParser_Fast.cs │ │ ├── DoDPOParser_v3.cs │ │ ├── DoDPOParser_v2.cs │ │ ├── DoDPOParser_v5.cs │ │ ├── DoDPOParser_v4.cs │ │ └── Sample.po │ ├── Tests │ │ ├── RowsVsColsTests.cs │ │ └── PoParserTests.cs │ ├── SIMD.cs │ ├── MemoryModelDeadlock.cs │ ├── BlockList.cs │ ├── RefList.cs │ ├── ReferenceHelpers.cs │ ├── SOAwithSIMD.cs │ ├── AOSvsSOA.cs │ ├── InstructionLevelDependency.cs │ └── BitOperations.cs └── Program.cs ├── LICENSE └── DoDSamples.sln /README.md: -------------------------------------------------------------------------------- 1 | # DataOrientedDesign 2 | Sample codes from my Lectures and Trainings on DoD 3 | -------------------------------------------------------------------------------- /.github/FUNDING.yml: -------------------------------------------------------------------------------- 1 | # These are supported funding model platforms 2 | custom: ['https://www.buymeacoffee.com/LevelUp'] 3 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | ################################################################################ 2 | # This .gitignore file was automatically created by Microsoft(R) Visual Studio. 3 | ################################################################################ 4 | 5 | /DoDSamples/bin 6 | /DoDSamples/obj 7 | -------------------------------------------------------------------------------- /DoDSamples/DoDSamples.csproj: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | Exe 5 | netcoreapp3.1 6 | 7 | 8 | 9 | false 10 | true 11 | x64 12 | 13 | 14 | 15 | true 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | Always 27 | 28 | 29 | 30 | 31 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | MIT License 2 | 3 | Copyright (c) 2020 Bartosz 4 | 5 | Permission is hereby granted, free of charge, to any person obtaining a copy 6 | of this software and associated documentation files (the "Software"), to deal 7 | in the Software without restriction, including without limitation the rights 8 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 9 | copies of the Software, and to permit persons to whom the Software is 10 | furnished to do so, subject to the following conditions: 11 | 12 | The above copyright notice and this permission notice shall be included in all 13 | copies or substantial portions of the Software. 14 | 15 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 16 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 17 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 18 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 19 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 20 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 21 | SOFTWARE. 22 | -------------------------------------------------------------------------------- /DoDSamples.sln: -------------------------------------------------------------------------------- 1 | 2 | Microsoft Visual Studio Solution File, Format Version 12.00 3 | # Visual Studio Version 16 4 | VisualStudioVersion = 16.0.29613.14 5 | MinimumVisualStudioVersion = 10.0.40219.1 6 | Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "DoDSamples", "DoDSamples\DoDSamples.csproj", "{3EA7FF30-3668-40EE-98A3-AF97EBBAF2EE}" 7 | EndProject 8 | Global 9 | GlobalSection(SolutionConfigurationPlatforms) = preSolution 10 | Debug|Any CPU = Debug|Any CPU 11 | Release|Any CPU = Release|Any CPU 12 | EndGlobalSection 13 | GlobalSection(ProjectConfigurationPlatforms) = postSolution 14 | {3EA7FF30-3668-40EE-98A3-AF97EBBAF2EE}.Debug|Any CPU.ActiveCfg = Debug|Any CPU 15 | {3EA7FF30-3668-40EE-98A3-AF97EBBAF2EE}.Debug|Any CPU.Build.0 = Debug|Any CPU 16 | {3EA7FF30-3668-40EE-98A3-AF97EBBAF2EE}.Release|Any CPU.ActiveCfg = Release|Any CPU 17 | {3EA7FF30-3668-40EE-98A3-AF97EBBAF2EE}.Release|Any CPU.Build.0 = Release|Any CPU 18 | EndGlobalSection 19 | GlobalSection(SolutionProperties) = preSolution 20 | HideSolutionNode = FALSE 21 | EndGlobalSection 22 | GlobalSection(ExtensibilityGlobals) = postSolution 23 | SolutionGuid = {C2EF3999-A95E-4F75-93AA-E9BC82B5785F} 24 | EndGlobalSection 25 | EndGlobal 26 | -------------------------------------------------------------------------------- /DoDSamples/Samples/Benchmarks/InstructionAndDataDependency.cs: -------------------------------------------------------------------------------- 1 | using BenchmarkDotNet.Attributes; 2 | using BenchmarkDotNet.Order; 3 | using System; 4 | using System.Collections.Generic; 5 | using System.Text; 6 | 7 | namespace DoDSamples 8 | { 9 | [Orderer(SummaryOrderPolicy.SlowestToFastest, MethodOrderPolicy.Declared)] 10 | public class InstructionAndDataDependency 11 | { 12 | 13 | //[Benchmark] 14 | //public void InsDependency() 15 | //{ 16 | // InstructionLevelDependency.TestDependency(); 17 | //} 18 | 19 | //[Benchmark] 20 | //public void InsIndependency() 21 | //{ 22 | // InstructionLevelDependency.TestIndependency(); 23 | //} 24 | 25 | [Benchmark] 26 | public void InsIndependencySumUnroll() 27 | { 28 | InstructionLevelDependency.TestIndependencyUnrolledSum(); 29 | } 30 | 31 | [Benchmark] 32 | public void InsDependencySumUnroll() 33 | { 34 | InstructionLevelDependency.TestDependencyUnrolledSum(); 35 | } 36 | 37 | [Benchmark] 38 | public void InsDependencySum() 39 | { 40 | InstructionLevelDependency.TestSum(); 41 | } 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /DoDSamples/Samples/CacheSize.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.Text; 4 | 5 | namespace DoDSamples 6 | { 7 | public class CacheSize 8 | { 9 | // 10 | // This class will test the cache line sizes for various levels 11 | // The idea is simple: Move through the array loading a new cache line on every step 12 | // if we exceed the size of the array we start from the begining and continue. 13 | // We do this for a set amount of steps and mesure the assigment time, if we move to the 14 | // next cache level there will be a significant slowdown. 15 | // 16 | // How to Perform the test: 17 | // 18 | // int steps = 65536 * 1024; 19 | // int[] array = new int[1024 * 1024 * 1]; 20 | // 21 | // var e = Utils.Measure(() => c.TestK(steps, array)); 22 | // e = e* 1000; //Scale the time 23 | // Console.WriteLine((double) e / (double) steps); 24 | // 25 | public static void TestK(int steps, int[] array) 26 | { 27 | int lengthMod = array.Length - 1; 28 | 29 | for (int i = 0; i < steps; i++) 30 | { 31 | array[(i * 16) & lengthMod]++; 32 | } 33 | } 34 | } 35 | } 36 | -------------------------------------------------------------------------------- /DoDSamples/Samples/Utils.cs: -------------------------------------------------------------------------------- 1 | using BenchmarkDotNet.Jobs; 2 | using System; 3 | using System.Collections; 4 | using System.Collections.Generic; 5 | using System.Diagnostics; 6 | using System.Linq.Expressions; 7 | using System.Text; 8 | 9 | namespace DoDSamples 10 | { 11 | public static class Utils 12 | { 13 | public static long Measure(Action a) 14 | { 15 | // 16 | // Quick Wormup. 17 | // 18 | 19 | Console.WriteLine(" [1] WormUp ... "); 20 | 21 | for (int i = 0; i < 2; i++) 22 | { 23 | a(); 24 | } 25 | 26 | Console.WriteLine(" [2] Running ... "); 27 | 28 | Stopwatch w = new Stopwatch(); 29 | w.Start(); 30 | { 31 | a(); 32 | } 33 | w.Stop(); 34 | 35 | Console.Write($" [3] Took: {w.ElapsedMilliseconds}"); 36 | return w.ElapsedMilliseconds; 37 | } 38 | 39 | public static long MeasureSimple(Action a) 40 | { 41 | Stopwatch w = new Stopwatch(); 42 | w.Start(); 43 | { 44 | a(); 45 | } 46 | w.Stop(); 47 | 48 | return w.ElapsedMilliseconds; 49 | } 50 | } 51 | } 52 | -------------------------------------------------------------------------------- /DoDSamples/Samples/ArrayEnumerableByRef.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.Text; 4 | 5 | namespace DoDSamples 6 | { 7 | public readonly struct ArrayEnumerableByRef 8 | { 9 | private readonly T[] _target; 10 | 11 | public ArrayEnumerableByRef(T[] target) => _target = target; 12 | 13 | public Enumerator GetEnumerator() => new Enumerator(_target); 14 | 15 | public struct Enumerator 16 | { 17 | private readonly T[] _target; 18 | 19 | private int _index; 20 | 21 | public Enumerator(T[] target) 22 | { 23 | _target = target; 24 | _index = -1; 25 | } 26 | 27 | public readonly ref T Current 28 | { 29 | get 30 | { 31 | if (_target is null || _index < 0 || _index > _target.Length) 32 | { 33 | throw new InvalidOperationException(); 34 | } 35 | return ref _target[_index]; 36 | } 37 | } 38 | 39 | public bool MoveNext() => ++_index < _target.Length; 40 | 41 | public void Reset() => _index = -1; 42 | } 43 | } 44 | 45 | public static class ArrayExtensions 46 | { 47 | public static ArrayEnumerableByRef ToEnumerableByRef(this T[] array) => new ArrayEnumerableByRef(array); 48 | public static ArrayEnumerableByRef ToEnumerableByRef(this List list) => new ArrayEnumerableByRef(list.ToArray()); 49 | } 50 | } 51 | -------------------------------------------------------------------------------- /DoDSamples/Samples/Benchmarks/RefListvsList.cs: -------------------------------------------------------------------------------- 1 | using BenchmarkDotNet.Attributes; 2 | using System; 3 | using System.Collections.Generic; 4 | using System.Text; 5 | 6 | namespace DoDSamples.Samples.Benchmarks 7 | { 8 | 9 | //public class RefListVSList 10 | //{ 11 | // private List list; 12 | // private RefList refList; 13 | // private const int size = 1_000_000; 14 | 15 | // [IterationSetup(Target = nameof(List))] 16 | // public void SetUpList() 17 | // { 18 | // list = new List(size); 19 | // for (int i = 0; i < size; i++) 20 | // { 21 | // list.Add(new POLine_v1() { ID = i }); 22 | // } 23 | // } 24 | 25 | // [IterationSetup(Target = nameof(RefList))] 26 | // public void SetUpRefList() 27 | // { 28 | // refList = new RefList(size); 29 | // for (int i = 0; i < size; i++) 30 | // { 31 | // refList.Add(new POLine_v1() { ID = i }); 32 | // } 33 | // } 34 | 35 | // [Benchmark] 36 | // public void List() 37 | // { 38 | // double sum = 0; 39 | 40 | // foreach(var item in list) 41 | // { 42 | // sum += item.Amount; 43 | // } 44 | // } 45 | 46 | // [Benchmark] 47 | // public void RefList() 48 | // { 49 | // double sum = 0; 50 | 51 | // foreach (var item in refList) 52 | // { 53 | // sum += item.Amount; 54 | // } 55 | // } 56 | //} 57 | } 58 | -------------------------------------------------------------------------------- /DoDSamples/Samples/POParser/OOPParser_Slow.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.IO; 4 | using System.Text; 5 | using System.Text.RegularExpressions; 6 | 7 | namespace DoDSamples.Samples 8 | { 9 | public class POParser 10 | { 11 | private static Regex matchPOLine = 12 | new Regex( 13 | @"(?\d)\r\n(?[0-9]{4}-[0-9]{2}-[0-9]{2})T(?[0-9]{2}:[0-9]{2}:[0-9]{2})\r\n(?\d+)\r\n(?[a-zA-Z0-9 ;,-.]+(\r\n([a-zA-Z0-9]+)){0,1})", 14 | RegexOptions.Compiled | RegexOptions.Multiline); 15 | 16 | 17 | public List ParseFromPath(string path) 18 | { 19 | var text = File.ReadAllText(path); 20 | return Parse(text); 21 | } 22 | 23 | public List Parse(string text) 24 | { 25 | List transactionLines = new List(); 26 | 27 | var groups = matchPOLine.GetGroupNames(); 28 | 29 | foreach (Match m in matchPOLine.Matches(text)) 30 | { 31 | POLine line = new POLine(); 32 | 33 | var id = m.Groups["id"].Value; 34 | var date = m.Groups["date"].Value; 35 | var time = m.Groups["time"].Value; 36 | var amount = m.Groups["amount"].Value; 37 | var note = m.Groups["note"].Value; 38 | 39 | line.ID = int.Parse(id); 40 | line.Date = date; 41 | line.Time = time; 42 | line.Amount = double.Parse(amount); 43 | line.Note = note; 44 | 45 | transactionLines.Add(line); 46 | } 47 | 48 | return transactionLines; 49 | } 50 | } 51 | } 52 | -------------------------------------------------------------------------------- /DoDSamples/Samples/Tests/RowsVsColsTests.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.Text; 4 | 5 | namespace DoDSamples.Samples 6 | { 7 | public class RowsVsColsTests 8 | { 9 | private const int rows = 10_000; 10 | private const int cols = 10_000; 11 | 12 | public static void Rows() 13 | { 14 | var array = new int[rows * cols]; 15 | 16 | Utils.Measure(() => 17 | { 18 | for (int i = 0; i < cols; i++) 19 | { 20 | for (int j = 0; j < rows; j++) 21 | { 22 | array[(i * cols) + j]++; 23 | } 24 | } 25 | }); 26 | } 27 | 28 | public static void Cols() 29 | { 30 | var array = new int[rows * cols]; 31 | 32 | Utils.Measure(() => 33 | { 34 | for (int i = 0; i < rows; i++) 35 | { 36 | for (int j = 0; j < cols; j++) 37 | { 38 | array[(j * cols) + i]++; 39 | } 40 | } 41 | }); 42 | } 43 | 44 | public static void ColsStride() 45 | { 46 | var array = new int[rows * cols]; 47 | 48 | Utils.Measure(() => 49 | { 50 | for (int i = 0; i < rows; i += 8) 51 | { 52 | for (int j = 0; j < cols; j++) 53 | { 54 | array[(j * cols) + i + 0]++; 55 | array[(j * cols) + i + 1]++; 56 | array[(j * cols) + i + 2]++; 57 | array[(j * cols) + i + 3]++; 58 | array[(j * cols) + i + 4]++; 59 | array[(j * cols) + i + 5]++; 60 | array[(j * cols) + i + 6]++; 61 | array[(j * cols) + i + 7]++; 62 | } 63 | } 64 | }); 65 | } 66 | 67 | } 68 | 69 | } 70 | -------------------------------------------------------------------------------- /DoDSamples/Samples/SIMD.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.Runtime.Intrinsics; 4 | using System.Runtime.Intrinsics.X86; 5 | using System.Text; 6 | 7 | namespace DoDSamples 8 | { 9 | public class SIMDSum 10 | { 11 | public int[] GetArray() 12 | { 13 | var array = new int[128 * 1024 * 1024]; 14 | for (int i = 0; i < array.Length; i++) 15 | { 16 | array[i] = i; 17 | } 18 | 19 | return array; 20 | } 21 | 22 | public int Sum(ReadOnlySpan source) 23 | { 24 | int result = 0; 25 | for(int i = 0; i < source.Length; i++) 26 | { 27 | result += source[i]; 28 | } 29 | 30 | return result; 31 | } 32 | 33 | public unsafe int SumVectorizedSse2(ReadOnlySpan source) 34 | { 35 | int result; 36 | 37 | fixed (int* pSource = source) 38 | { 39 | Vector128 vresult = Vector128.Zero; 40 | 41 | int i = 0; 42 | int lastBlockIndex = source.Length - (source.Length % 4); 43 | 44 | while (i < lastBlockIndex) 45 | { 46 | vresult = Sse2.Add(vresult, Sse2.LoadVector128(pSource + i)); 47 | i += 4; 48 | } 49 | 50 | if (Ssse3.IsSupported) 51 | { 52 | vresult = Ssse3.HorizontalAdd(vresult, vresult); 53 | vresult = Ssse3.HorizontalAdd(vresult, vresult); 54 | } 55 | else 56 | { 57 | vresult = Sse2.Add(vresult, Sse2.Shuffle(vresult, 0x4E)); 58 | vresult = Sse2.Add(vresult, Sse2.Shuffle(vresult, 0xB1)); 59 | } 60 | result = vresult.ToScalar(); 61 | 62 | while (i < source.Length) 63 | { 64 | result += pSource[i]; 65 | i += 1; 66 | } 67 | } 68 | 69 | return result; 70 | } 71 | } 72 | } 73 | -------------------------------------------------------------------------------- /DoDSamples/Samples/Benchmarks/RowsVsCols.cs: -------------------------------------------------------------------------------- 1 | using BenchmarkDotNet.Attributes; 2 | using System; 3 | using System.Collections.Generic; 4 | using System.Text; 5 | 6 | namespace DoDSamples 7 | { 8 | 9 | // 10 | // This example demonstrates the performance 11 | // of Row vs Col access using a flat array. 12 | // It also shows how much performance can improve if we simply 13 | // use our cache line to the full extent. 14 | // 15 | // It shows how proper datta access patterns are important, 16 | // even in a single threaded enviroment. 17 | // 18 | public class RowsVsCols 19 | { 20 | private const int rows = 10_000; 21 | private const int cols = 10_000; 22 | private int[] array = new int[rows * cols]; 23 | 24 | [IterationSetup] 25 | public void SetUp() 26 | { 27 | array = new int[rows * cols]; 28 | } 29 | 30 | [Benchmark] 31 | public void Rows() 32 | { 33 | for(int i = 0; i < cols; i++) 34 | { 35 | for(int j = 0; j < rows; j++) 36 | { 37 | array[(i * cols) + j]++; 38 | } 39 | } 40 | } 41 | 42 | [Benchmark] 43 | public void Cols() 44 | { 45 | for (int i = 0; i < rows; i++) 46 | { 47 | for (int j = 0; j < cols; j++) 48 | { 49 | array[(j * cols) + i]++; 50 | } 51 | } 52 | } 53 | 54 | [Benchmark] 55 | public void ColsStride() 56 | { 57 | for (int i = 0; i < rows; i += 8) 58 | { 59 | for (int j = 0; j < cols; j++) 60 | { 61 | array[(j * cols) + i + 0]++; 62 | array[(j * cols) + i + 1]++; 63 | array[(j * cols) + i + 2]++; 64 | array[(j * cols) + i + 3]++; 65 | array[(j * cols) + i + 4]++; 66 | array[(j * cols) + i + 5]++; 67 | array[(j * cols) + i + 6]++; 68 | array[(j * cols) + i + 7]++; 69 | //Console.WriteLine((j * cols) + i); 70 | } 71 | } 72 | } 73 | } 74 | } 75 | -------------------------------------------------------------------------------- /DoDSamples/Samples/MemoryModelDeadlock.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.Text; 4 | using System.Threading; 5 | 6 | namespace DoDSamples 7 | { 8 | public class MemoryModelDeadlock 9 | { 10 | public void Test() 11 | { 12 | bool isSignaled = false; 13 | 14 | Thread master = new Thread(() => 15 | { 16 | Console.WriteLine($"{DateTime.UtcNow} [Thread:{Thread.CurrentThread.ManagedThreadId}] Waiting 1000ms and setting the Signal Variable"); 17 | Thread.Sleep(1000); 18 | 19 | Console.WriteLine($"{DateTime.UtcNow} [Thread:{Thread.CurrentThread.ManagedThreadId}] Signal!"); 20 | isSignaled = true; 21 | }); 22 | 23 | master.Start(); 24 | 25 | Thread slave = new Thread(() => 26 | { 27 | while (isSignaled == false) { } 28 | Console.WriteLine($"{DateTime.UtcNow} [Thread:{Thread.CurrentThread.ManagedThreadId}] I Was Signaled"); 29 | 30 | }); 31 | 32 | slave.Start(); 33 | 34 | //slave.Join(); 35 | //master.Join(); 36 | } 37 | 38 | SpinLock spinLock = new SpinLock(); 39 | 40 | public void Spin() 41 | { 42 | bool taken = false; 43 | for (int i = 0; i < 1000; i++) 44 | { 45 | taken = false; 46 | 47 | spinLock.Enter(ref taken); 48 | { 49 | int d = 0; 50 | for (int k = 0; k < 1000000; k++) 51 | d++; 52 | } 53 | spinLock.Exit(true); 54 | 55 | if (taken == false) 56 | Console.WriteLine(taken); 57 | } 58 | } 59 | 60 | public void SpinLockTest() 61 | { 62 | Thread[] threads = new Thread[32]; 63 | for(int i = 0; i < threads.Length; i++) 64 | { 65 | threads[i] = new Thread(() => Spin()); 66 | } 67 | 68 | for (int i = 0; i < threads.Length; i++) 69 | { 70 | threads[i].Start(); 71 | } 72 | 73 | for (int i = 0; i < threads.Length; i++) 74 | { 75 | threads[i].Join(); 76 | } 77 | 78 | Console.WriteLine("[Done]"); 79 | } 80 | } 81 | } 82 | -------------------------------------------------------------------------------- /DoDSamples/Samples/POParser/DoDPOParser_v1a.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.IO; 4 | using System.Text; 5 | 6 | namespace DoDSamples.Samples 7 | { 8 | public class DoDPOParser_v1a 9 | { 10 | private enum State 11 | { 12 | ID, 13 | DateTime, 14 | Amount, 15 | Note 16 | } 17 | 18 | public POLine_v1[] Parse(string path, out int index) => Parse(File.ReadAllLines(path), out index); 19 | 20 | public POLine_v1[] Parse(string[] lines, out int index) 21 | { 22 | index = 0; 23 | 24 | POLine_v1[] transactionLines = new POLine_v1[1000]; 25 | POLine_v1 poLine = new POLine_v1(); 26 | 27 | State state = State.ID; 28 | foreach (var line in lines) 29 | { 30 | if (string.IsNullOrEmpty(line)) 31 | { 32 | if (state >= State.Note) 33 | { 34 | transactionLines[index] = poLine; 35 | state = State.ID; 36 | index++; 37 | } 38 | 39 | continue; 40 | } 41 | switch (state) 42 | { 43 | case State.ID: 44 | { 45 | poLine.ID = int.Parse(line); 46 | 47 | state++; 48 | break; 49 | } 50 | case State.DateTime: 51 | { 52 | var dt = line.Split('T'); 53 | poLine.Date = dt[0]; 54 | poLine.Time = dt[1]; 55 | 56 | state++; 57 | break; 58 | } 59 | case State.Amount: 60 | { 61 | poLine.Amount = double.Parse(line); 62 | 63 | state++; 64 | break; 65 | } 66 | case State.Note: 67 | { 68 | poLine.Note += line; 69 | 70 | state++; 71 | break; 72 | } 73 | } 74 | } 75 | 76 | return transactionLines; 77 | } 78 | } 79 | } 80 | -------------------------------------------------------------------------------- /DoDSamples/Samples/POParser/DoDPOParser_v3a.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.IO; 4 | using System.Reflection; 5 | using System.Runtime.InteropServices; 6 | using System.Text; 7 | 8 | namespace DoDSamples.Samples 9 | { 10 | public class DoDPOParser_v3a 11 | { 12 | private enum State 13 | { 14 | ID, 15 | DateTime, 16 | Amount, 17 | Note 18 | } 19 | 20 | public POLine_v3[] Parse(string path, out int index) => Parse(File.ReadAllLines(path), out index); 21 | 22 | public POLine_v3[] Parse(string[] lines, out int index) 23 | { 24 | index = 0; 25 | 26 | var transactionLines = new POLine_v3[1000]; 27 | POLine_v3 poLine = new POLine_v3(); 28 | 29 | State state = State.ID; 30 | foreach (var line in lines) 31 | { 32 | if (string.IsNullOrEmpty(line)) 33 | { 34 | if (state >= State.Note) 35 | { 36 | transactionLines[index] = poLine; 37 | state = State.ID; 38 | index++; 39 | } 40 | 41 | continue; 42 | } 43 | switch (state) 44 | { 45 | case State.ID: 46 | { 47 | poLine.POData.ID = int.Parse(line); 48 | 49 | state++; 50 | break; 51 | } 52 | case State.DateTime: 53 | { 54 | var dt = line.Split('T'); 55 | poLine.POData.Date = dt[0]; 56 | poLine.POData.Time = dt[1]; 57 | 58 | state++; 59 | break; 60 | } 61 | case State.Amount: 62 | { 63 | poLine.Amount = double.Parse(line); 64 | 65 | state++; 66 | break; 67 | } 68 | case State.Note: 69 | { 70 | poLine.POData.Note += line; 71 | 72 | state++; 73 | break; 74 | } 75 | } 76 | } 77 | 78 | return transactionLines; 79 | } 80 | } 81 | } 82 | -------------------------------------------------------------------------------- /DoDSamples/Samples/POParser/POGenerator.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.Text; 4 | using System.Linq; 5 | 6 | namespace DoDSamples.Samples 7 | { 8 | public class POGenerator 9 | { 10 | string[] words; 11 | 12 | public POGenerator() 13 | { 14 | words = text 15 | .Replace(".", string.Empty) 16 | .Replace(",", string.Empty) 17 | .Split(' '); 18 | } 19 | 20 | POLine line = new POLine(); 21 | 22 | public string Generate() 23 | { 24 | StringBuilder builder = new StringBuilder(); 25 | Random rnd = new Random(); 26 | 27 | for (int i = 0; i < 600; i++) 28 | { 29 | builder.AppendLine((i + 1).ToString()); 30 | 31 | var now = DateTime.Now; 32 | now = now.AddHours(i); 33 | now = now.AddMinutes(rnd.Next(0, 60)); 34 | now = now.AddSeconds(rnd.Next(0, 60)); 35 | 36 | string date = 37 | $"{now.Year}-{now.Month.ToString().PadLeft(2, '0')}-{now.Day.ToString().PadLeft(2, '0')}T{now.Hour.ToString().PadLeft(2, '0')}:{now.Minute.ToString().PadLeft(2, '0')}:{now.Second.ToString().PadLeft(2, '0')}"; 38 | 39 | builder.AppendLine(date); 40 | builder.AppendLine(rnd.Next(100, 900).ToString()); 41 | 42 | for (int s = 0; s < rnd.Next(1, 3); s++) 43 | { 44 | var slice = words.Skip(rnd.Next(0, 100)).Take(rnd.Next(3, 15)); 45 | builder.AppendLine(string.Join(" ", slice)); 46 | } 47 | 48 | builder.AppendLine(); 49 | } 50 | 51 | return builder.ToString(); 52 | } 53 | 54 | 55 | private string text = "Lorem ipsum dolor sit amet, consectetur adipiscing elit. Quisque gravida, dolor at tincidunt eleifend, tellus quam venenatis nibh, quis condimentum est lectus ac turpis. Integer pretium gravida gravida. Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa, non sagittis velit faucibus eu. Quisque sed sem ac ipsum elementum bibendum id id tellus. Pellentesque lobortis fringilla orci vitae fermentum. Nulla a mauris eu sapien luctus viverra nec eleifend diam. Duis quis arcu vel massa bibendum porta. Ut vehicula sed purus nec ornare. Maecenas et tempus dolor. Aliquam non convallis quam. Orci varius natoque penatibus et magnis dis parturient montes, nascetur ridiculus mus. "; 56 | } 57 | } 58 | -------------------------------------------------------------------------------- /DoDSamples/Samples/POParser/DoDPOParser_v2a.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.IO; 4 | using System.Net.Http.Headers; 5 | using System.Runtime.InteropServices; 6 | using System.Text; 7 | 8 | namespace DoDSamples.Samples 9 | { 10 | 11 | public class DoDPOParser_v2a 12 | { 13 | private enum State 14 | { 15 | ID, 16 | DateTime, 17 | Amount, 18 | Note 19 | } 20 | 21 | public POLine_v2[] Parse(string path, out int index) => Parse(File.ReadAllLines(path), out index); 22 | 23 | public POLine_v2[] Parse(string[] lines, out int index) 24 | { 25 | index = 0; 26 | 27 | POLine_v2[] transactionLines = new POLine_v2[1000]; 28 | POLine_v2 poLine = new POLine_v2(); 29 | 30 | State state = State.ID; 31 | foreach (var line in lines) 32 | { 33 | if (string.IsNullOrEmpty(line)) 34 | { 35 | if (state >= State.Note) 36 | { 37 | transactionLines[index] = poLine; 38 | state = State.ID; 39 | index++; 40 | } 41 | 42 | continue; 43 | } 44 | switch (state) 45 | { 46 | case State.ID: 47 | { 48 | poLine.ID = int.Parse(line); 49 | 50 | state++; 51 | break; 52 | } 53 | case State.DateTime: 54 | { 55 | var dt = line.Split('T'); 56 | poLine.PODateTime.Date = dt[0]; 57 | poLine.PODateTime.Time = dt[1]; 58 | 59 | state++; 60 | break; 61 | } 62 | case State.Amount: 63 | { 64 | poLine.Amount = double.Parse(line); 65 | 66 | state++; 67 | break; 68 | } 69 | case State.Note: 70 | { 71 | poLine.Note += line; 72 | 73 | state++; 74 | break; 75 | } 76 | } 77 | } 78 | 79 | return transactionLines; 80 | } 81 | } 82 | } 83 | -------------------------------------------------------------------------------- /DoDSamples/Samples/POParser/DoDPOParser_v1.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.IO; 4 | using System.Text; 5 | 6 | namespace DoDSamples.Samples 7 | { 8 | public struct POLine_v1 9 | { 10 | public int ID; 11 | public double Amount; 12 | public string Date; 13 | public string Time; 14 | public string Note; 15 | } 16 | 17 | public class DoDPOParser_v1 18 | { 19 | 20 | private enum State 21 | { 22 | ID, 23 | DateTime, 24 | Amount, 25 | Note 26 | } 27 | 28 | public List Parse(string path) => Parse(File.ReadAllLines(path)); 29 | 30 | public List Parse(string[] lines) 31 | { 32 | List transactionLines = new List(1000); 33 | POLine_v1 poLine = new POLine_v1(); 34 | 35 | State state = State.ID; 36 | foreach (var line in lines) 37 | { 38 | if (string.IsNullOrEmpty(line)) 39 | { 40 | if (state >= State.Note) 41 | { 42 | transactionLines.Add(poLine); 43 | state = State.ID; 44 | } 45 | 46 | continue; 47 | } 48 | switch (state) 49 | { 50 | case State.ID: 51 | { 52 | poLine.ID = int.Parse(line); 53 | 54 | state++; 55 | break; 56 | } 57 | case State.DateTime: 58 | { 59 | var dt = line.Split('T'); 60 | poLine.Date = dt[0]; 61 | poLine.Time = dt[1]; 62 | 63 | state++; 64 | break; 65 | } 66 | case State.Amount: 67 | { 68 | poLine.Amount = double.Parse(line); 69 | 70 | state++; 71 | break; 72 | } 73 | case State.Note: 74 | { 75 | poLine.Note += line; 76 | 77 | state++; 78 | break; 79 | } 80 | } 81 | } 82 | 83 | return transactionLines; 84 | } 85 | } 86 | } 87 | -------------------------------------------------------------------------------- /DoDSamples/Samples/BlockList.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.Runtime.CompilerServices; 4 | using System.Text; 5 | 6 | namespace DoDSamples 7 | { 8 | public class BlockList 9 | { 10 | private ListBlock[] blocks = new ListBlock[32]; 11 | private int blockIndex = 0; 12 | private int blockSize = 512; 13 | private ListBlock mainBlock = null; 14 | 15 | public BlockList() 16 | { 17 | mainBlock = new ListBlock(blockSize); 18 | blocks[blockIndex++] = mainBlock; 19 | } 20 | 21 | [MethodImpl(MethodImplOptions.AggressiveInlining)] 22 | public void Add(T value) 23 | { 24 | var blockFull = mainBlock.Add(value); 25 | // 26 | // Add another block 27 | // 28 | if (blockFull) 29 | { 30 | mainBlock = new ListBlock(blockSize); 31 | blocks[blockIndex++] = mainBlock; 32 | } 33 | } 34 | 35 | public T Get(int index) 36 | { 37 | var blockId = index / blockSize; 38 | return blocks[blockId].Get(index - (blockId * blockSize)); 39 | } 40 | 41 | public ListBlock GetBlock(int index, out int indexInBlock) 42 | { 43 | var blockId = index / blockSize; 44 | indexInBlock = index - (blockId * blockSize); 45 | return blocks[blockId]; 46 | } 47 | 48 | public void Set(int index, T value) 49 | { 50 | var blockId = index / blockSize; 51 | blocks[blockId].Set(index - (blockId * blockSize), value); 52 | } 53 | 54 | public T this[int index] 55 | { 56 | get { return Get(index); } 57 | set { Set(index, value); } 58 | } 59 | 60 | public class ListBlock 61 | { 62 | public ListBlock(int blockSize) 63 | { 64 | array = new T[blockSize]; 65 | } 66 | 67 | public T Get(int index) 68 | { 69 | return array[index]; 70 | } 71 | 72 | public void Set(int index, T value) 73 | { 74 | array[index] = value; 75 | } 76 | 77 | private T[] array; 78 | private int index = 0; 79 | 80 | [MethodImpl(MethodImplOptions.AggressiveInlining)] 81 | public bool Add(T value) 82 | { 83 | array[index++] = value; 84 | return (index >= array.Length); 85 | } 86 | } 87 | 88 | } 89 | 90 | } 91 | -------------------------------------------------------------------------------- /DoDSamples/Samples/POParser/OOPParser_Fast.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.IO; 4 | using System.Text; 5 | 6 | namespace DoDSamples.Samples 7 | { 8 | public class POLine 9 | { 10 | public int ID { get; set; } 11 | public string Date { get; set; } 12 | public string Time { get; set; } 13 | public double Amount { get; set; } 14 | public string Note { get; set; } 15 | } 16 | 17 | public class POParser_Fast 18 | { 19 | private enum State 20 | { 21 | ID, 22 | DateTime, 23 | Amount, 24 | Note 25 | } 26 | 27 | public List Parse(string path) 28 | { 29 | var lines = File.ReadAllLines(path); 30 | return Parse(lines); 31 | } 32 | 33 | public List Parse(string[] lines) 34 | { 35 | List transactionLines = new List(1000); 36 | POLine poLine = new POLine(); 37 | 38 | State state = State.ID; 39 | foreach (var line in lines) 40 | { 41 | if (string.IsNullOrEmpty(line)) 42 | { 43 | if (state >= State.Note) 44 | { 45 | transactionLines.Add(poLine); 46 | poLine = new POLine(); 47 | state = State.ID; 48 | } 49 | 50 | continue; 51 | } 52 | switch (state) 53 | { 54 | case State.ID: 55 | { 56 | poLine.ID = int.Parse(line); 57 | 58 | state++; 59 | break; 60 | } 61 | case State.DateTime: 62 | { 63 | var dt = line.Split('T'); 64 | poLine.Date = dt[0]; 65 | poLine.Time = dt[1]; 66 | 67 | state++; 68 | break; 69 | } 70 | case State.Amount: 71 | { 72 | poLine.Amount = double.Parse(line); 73 | 74 | state++; 75 | break; 76 | } 77 | case State.Note: 78 | { 79 | poLine.Note += line; 80 | 81 | state++; 82 | break; 83 | } 84 | } 85 | } 86 | 87 | return transactionLines; 88 | } 89 | } 90 | } 91 | -------------------------------------------------------------------------------- /DoDSamples/Samples/RefList.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections; 3 | using System.Collections.Generic; 4 | using System.Runtime.CompilerServices; 5 | using System.Text; 6 | 7 | namespace DoDSamples.Samples 8 | { 9 | 10 | public class RefList : IEnumerable 11 | { 12 | private T[] array = null; 13 | private int index = 0; 14 | private int capacity = 4; 15 | 16 | public RefList(int capacity) 17 | { 18 | this.capacity = capacity; 19 | array = new T[capacity]; 20 | } 21 | 22 | public RefList() 23 | { 24 | array = new T[capacity]; 25 | } 26 | 27 | [MethodImpl(MethodImplOptions.AggressiveInlining)] 28 | public void Add(T value) 29 | { 30 | if (index >= array.Length) 31 | { 32 | Expand(); 33 | } 34 | 35 | array[index++] = value; 36 | } 37 | 38 | public T Get(int index) 39 | { 40 | return array[index]; 41 | } 42 | 43 | public void Set(int index, T value) 44 | { 45 | array[index] = value; 46 | } 47 | 48 | public void Expand() 49 | { 50 | var newCapacity = array.Length * 2; 51 | 52 | T[] newArray = new T[newCapacity]; 53 | Array.Copy(array, newArray, array.Length); 54 | array = newArray; 55 | 56 | capacity = newCapacity; 57 | } 58 | 59 | public T this[int index] 60 | { 61 | get { return array[index]; } 62 | set { array[index] = value; } 63 | } 64 | 65 | public RefEnumerator GetEnumerator() => new RefEnumerator(array, capacity); 66 | IEnumerator IEnumerable.GetEnumerator() => throw new NotSupportedException(); 67 | 68 | public struct RefEnumerator 69 | { 70 | private T[] array; 71 | 72 | private int index; 73 | private int capacity; 74 | 75 | public RefEnumerator(T[] target, int capacity) 76 | { 77 | array = target; 78 | index = -1; 79 | this.capacity = capacity; 80 | } 81 | 82 | public ref T Current 83 | { 84 | get 85 | { 86 | if (array is null || index < 0 || index > capacity) 87 | { 88 | throw new InvalidOperationException(); 89 | } 90 | return ref array[index]; 91 | } 92 | } 93 | 94 | public void Dispose() 95 | { 96 | } 97 | 98 | public bool MoveNext() => ++index < capacity; 99 | 100 | public void Reset() => index = -1; 101 | } 102 | } 103 | } 104 | -------------------------------------------------------------------------------- /DoDSamples/Samples/POParser/DoDPOParser_v3.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.IO; 4 | using System.Reflection; 5 | using System.Runtime.InteropServices; 6 | using System.Text; 7 | 8 | namespace DoDSamples.Samples 9 | { 10 | 11 | // 12 | // You might thing that this is better setting the pack but if you think about it, this data set breaks 13 | // aligment, and thus all potential gains will be nullified by missaligment. 14 | // 15 | //[StructLayout(LayoutKind.Sequential, Pack = 4)] 16 | public struct POLine_v3 17 | { 18 | public double Amount; 19 | public POData POData; 20 | } 21 | 22 | public struct POData 23 | { 24 | public int ID; 25 | public string Date; 26 | public string Time; 27 | public string Note; 28 | } 29 | 30 | public class DoDPOParser_v3 31 | { 32 | private enum State 33 | { 34 | ID, 35 | DateTime, 36 | Amount, 37 | Note 38 | } 39 | 40 | public List Parse(string path) => Parse(File.ReadAllLines(path)); 41 | 42 | public List Parse(string[] lines) 43 | { 44 | List transactionLines = new List(1000); 45 | POLine_v3 poLine = new POLine_v3(); 46 | 47 | State state = State.ID; 48 | foreach (var line in lines) 49 | { 50 | if (string.IsNullOrEmpty(line)) 51 | { 52 | if (state >= State.Note) 53 | { 54 | transactionLines.Add(poLine); 55 | state = State.ID; 56 | } 57 | 58 | continue; 59 | } 60 | switch (state) 61 | { 62 | case State.ID: 63 | { 64 | poLine.POData.ID = int.Parse(line); 65 | 66 | state++; 67 | break; 68 | } 69 | case State.DateTime: 70 | { 71 | var dt = line.Split('T'); 72 | poLine.POData.Date = dt[0]; 73 | poLine.POData.Time = dt[1]; 74 | 75 | state++; 76 | break; 77 | } 78 | case State.Amount: 79 | { 80 | poLine.Amount = double.Parse(line); 81 | 82 | state++; 83 | break; 84 | } 85 | case State.Note: 86 | { 87 | poLine.POData.Note += line; 88 | 89 | state++; 90 | break; 91 | } 92 | } 93 | } 94 | 95 | return transactionLines; 96 | } 97 | } 98 | } 99 | -------------------------------------------------------------------------------- /DoDSamples/Samples/POParser/DoDPOParser_v2.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.IO; 4 | using System.Net.Http.Headers; 5 | using System.Runtime.InteropServices; 6 | using System.Text; 7 | 8 | namespace DoDSamples.Samples 9 | { 10 | 11 | // 12 | // You might thing that this is better setting the pack but if you think about it, this data set breaks 13 | // aligment, and thus all potential gains will be nullified by missaligment. 14 | // 15 | //[StructLayout(LayoutKind.Sequential, Pack = 4)] 16 | public struct POLine_v2 17 | { 18 | public int ID; 19 | public double Amount; 20 | public PODateTime PODateTime; 21 | public string Note; 22 | } 23 | 24 | public struct PODateTime 25 | { 26 | public string Date; 27 | public string Time; 28 | } 29 | 30 | 31 | public class DoDPOParser_v2 32 | { 33 | private enum State 34 | { 35 | ID, 36 | DateTime, 37 | Amount, 38 | Note 39 | } 40 | 41 | public List Parse(string path) => Parse(File.ReadAllLines(path)); 42 | 43 | public List Parse(string[] lines) 44 | { 45 | List transactionLines = new List(1000); 46 | 47 | POLine_v2 poLine = new POLine_v2(); 48 | 49 | State state = State.ID; 50 | foreach (var line in lines) 51 | { 52 | if (string.IsNullOrEmpty(line)) 53 | { 54 | if (state >= State.Note) 55 | { 56 | transactionLines.Add(poLine); 57 | state = State.ID; 58 | } 59 | 60 | continue; 61 | } 62 | switch (state) 63 | { 64 | case State.ID: 65 | { 66 | poLine.ID = int.Parse(line); 67 | 68 | state++; 69 | break; 70 | } 71 | case State.DateTime: 72 | { 73 | var dt = line.Split('T'); 74 | poLine.PODateTime.Date = dt[0]; 75 | poLine.PODateTime.Time = dt[1]; 76 | 77 | state++; 78 | break; 79 | } 80 | case State.Amount: 81 | { 82 | poLine.Amount = double.Parse(line); 83 | 84 | state++; 85 | break; 86 | } 87 | case State.Note: 88 | { 89 | poLine.Note += line; 90 | 91 | state++; 92 | break; 93 | } 94 | } 95 | } 96 | 97 | return transactionLines; 98 | } 99 | } 100 | } 101 | -------------------------------------------------------------------------------- /DoDSamples/Samples/POParser/DoDPOParser_v5.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.IO; 4 | using System.Text; 5 | 6 | namespace DoDSamples.Samples 7 | { 8 | public struct DoDPOLines_v5 9 | { 10 | public int[] ID; 11 | public double[] Amount; 12 | public string[] Date; 13 | public string[] Time; 14 | public int[] NoteOffset; 15 | public StringBuilder AllNotes; 16 | 17 | public DoDPOLines_v5(int size) 18 | { 19 | ID = new int[size]; 20 | Date = new string[size]; 21 | Time = new string[size]; 22 | Amount = new double[size]; 23 | NoteOffset = new int[size]; 24 | AllNotes = new StringBuilder(size); 25 | } 26 | } 27 | 28 | public class DoDPOParser_v5 29 | { 30 | private enum State 31 | { 32 | ID, 33 | DateTime, 34 | Amount, 35 | Note 36 | } 37 | 38 | public DoDPOLines_v5 Parse(string path, out int index) => Parse(File.ReadAllLines(path), out index); 39 | 40 | public DoDPOLines_v5 Parse(string[] lines, out int index) 41 | { 42 | DoDPOLines_v5 transactionLines = new DoDPOLines_v5(1000); 43 | 44 | int offset = 0; 45 | index = 0; 46 | State state = State.ID; 47 | foreach (var line in lines) 48 | { 49 | if (string.IsNullOrEmpty(line)) 50 | { 51 | if (state >= State.Note) 52 | { 53 | state = State.ID; 54 | index++; 55 | } 56 | 57 | continue; 58 | } 59 | switch (state) 60 | { 61 | case State.ID: 62 | { 63 | transactionLines.ID[index] = int.Parse(line); 64 | 65 | state++; 66 | break; 67 | } 68 | case State.DateTime: 69 | { 70 | var dt = line.Split('T'); 71 | transactionLines.Date[index] = dt[0]; 72 | transactionLines.Time[index] = dt[1]; 73 | 74 | state++; 75 | break; 76 | } 77 | case State.Amount: 78 | { 79 | transactionLines.Amount[index] = double.Parse(line); 80 | 81 | state++; 82 | break; 83 | } 84 | case State.Note: 85 | { 86 | offset += line.Length; 87 | 88 | transactionLines.NoteOffset[index] = offset; 89 | transactionLines.AllNotes.Append(line); 90 | 91 | state++; 92 | break; 93 | } 94 | } 95 | } 96 | 97 | return transactionLines; 98 | } 99 | } 100 | } 101 | -------------------------------------------------------------------------------- /DoDSamples/Samples/ReferenceHelpers.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.Reflection.Emit; 4 | using System.Runtime.InteropServices; 5 | using System.Text; 6 | 7 | namespace DoDSamples.Samples 8 | { 9 | public static class ReferenceHelpers 10 | { 11 | public static unsafe long GetAddress(object o) 12 | { 13 | TypedReference reference = __makeref(o); 14 | IntPtr ptr = **(IntPtr**)(&reference); 15 | var result = (long)ptr; 16 | 17 | return result; 18 | } 19 | 20 | public static unsafe IntPtr GetAddressPtr(object o) 21 | { 22 | var a1 = (long)AddressHelper.GetAddress(o); 23 | 24 | TypedReference reference = __makeref(o); 25 | IntPtr ptr = **(IntPtr**)(&reference); 26 | return ptr; 27 | } 28 | 29 | public static Action> GetPinnedPointerInit() 30 | { 31 | var dyn = new DynamicMethod("GetPinnedPtr", typeof(void), new[] { typeof(object), typeof(Action) }, typeof(ReferenceHelpers).Module); 32 | var il = dyn.GetILGenerator(); 33 | il.DeclareLocal(typeof(object), true); 34 | il.Emit(OpCodes.Ldarg_0); 35 | il.Emit(OpCodes.Stloc_0); 36 | il.Emit(OpCodes.Ldarg_1); 37 | il.Emit(OpCodes.Ldloc_0); 38 | il.Emit(OpCodes.Conv_I); 39 | il.Emit(OpCodes.Call, typeof(Action).GetMethod("Invoke")); 40 | il.Emit(OpCodes.Ret); 41 | return (Action>)dyn.CreateDelegate(typeof(Action>)); 42 | } 43 | } 44 | 45 | public static class AddressHelper 46 | { 47 | private static object mutualObject; 48 | private static ObjectReinterpreter reinterpreter; 49 | 50 | static AddressHelper() 51 | { 52 | AddressHelper.mutualObject = new object(); 53 | AddressHelper.reinterpreter = new ObjectReinterpreter(); 54 | AddressHelper.reinterpreter.AsObject = new ObjectWrapper(); 55 | } 56 | 57 | public static IntPtr GetAddress(object obj) 58 | { 59 | lock (AddressHelper.mutualObject) 60 | { 61 | AddressHelper.reinterpreter.AsObject.Object = obj; 62 | IntPtr address = AddressHelper.reinterpreter.AsIntPtr.Value; 63 | AddressHelper.reinterpreter.AsObject.Object = null; 64 | return address; 65 | } 66 | } 67 | 68 | public static T GetInstance(IntPtr address) 69 | { 70 | lock (AddressHelper.mutualObject) 71 | { 72 | AddressHelper.reinterpreter.AsIntPtr.Value = address; 73 | return (T)AddressHelper.reinterpreter.AsObject.Object; 74 | } 75 | } 76 | 77 | [StructLayout(LayoutKind.Explicit)] 78 | private struct ObjectReinterpreter 79 | { 80 | [FieldOffset(0)] public ObjectWrapper AsObject; 81 | [FieldOffset(0)] public IntPtrWrapper AsIntPtr; 82 | } 83 | 84 | private class ObjectWrapper 85 | { 86 | public object Object; 87 | } 88 | 89 | private class IntPtrWrapper 90 | { 91 | public IntPtr Value; 92 | } 93 | } 94 | } 95 | -------------------------------------------------------------------------------- /DoDSamples/Samples/SOAwithSIMD.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.Runtime.Intrinsics; 4 | using System.Runtime.Intrinsics.X86; 5 | using System.Text; 6 | 7 | namespace DoDSamples.Samples 8 | { 9 | public class SOAwithSIMD 10 | { 11 | public int[] GetArray() 12 | { 13 | var array = new int[128 * 1024 * 1024]; 14 | for (int i = 0; i < array.Length; i++) 15 | { 16 | array[i] = i; 17 | } 18 | 19 | return array; 20 | } 21 | 22 | public int Sum(ReadOnlySpan source) 23 | { 24 | int result = 0; 25 | for (int i = 0; i < source.Length; i++) 26 | { 27 | result += source[i]; 28 | } 29 | 30 | return result; 31 | } 32 | 33 | public unsafe int SumVectorizedSse2(SOAStruct source) 34 | { 35 | int result; 36 | 37 | fixed (int* pSource = source.v0) 38 | { 39 | Vector128 vresult = Vector128.Zero; 40 | 41 | int i = 0; 42 | int lastBlockIndex = source.v0.Length - (source.v0.Length % 4); 43 | 44 | while (i < lastBlockIndex) 45 | { 46 | vresult = Sse2.Add(vresult, Sse2.LoadVector128(pSource + i)); 47 | i += 4; 48 | } 49 | 50 | if (Ssse3.IsSupported) 51 | { 52 | vresult = Ssse3.HorizontalAdd(vresult, vresult); 53 | vresult = Ssse3.HorizontalAdd(vresult, vresult); 54 | } 55 | else 56 | { 57 | vresult = Sse2.Add(vresult, Sse2.Shuffle(vresult, 0x4E)); 58 | vresult = Sse2.Add(vresult, Sse2.Shuffle(vresult, 0xB1)); 59 | } 60 | result = vresult.ToScalar(); 61 | 62 | while (i < source.v0.Length) 63 | { 64 | result += pSource[i]; 65 | i += 1; 66 | } 67 | } 68 | 69 | return result; 70 | } 71 | } 72 | 73 | 74 | public struct SOAStruct 75 | { 76 | public int[] v0; 77 | public int[] v1; 78 | public int[] v2; 79 | public int[] v3; 80 | public int[] v4; 81 | public int[] v5; 82 | public int[] v6; 83 | public int[] v7; 84 | public int[] v8; 85 | public int[] v9; 86 | public int[] v10; 87 | public int[] v11; 88 | public int[] v12; 89 | public int[] v13; 90 | public int[] v14; 91 | public int[] v15; 92 | 93 | public SOAStruct(int n) 94 | { 95 | v0 = new int[n]; 96 | v1 = new int[n]; 97 | v2 = new int[n]; 98 | v3 = new int[n]; 99 | v4 = new int[n]; 100 | v5 = new int[n]; 101 | v6 = new int[n]; 102 | v7 = new int[n]; 103 | v8 = new int[n]; 104 | v9 = new int[n]; 105 | v10 = new int[n]; 106 | v11 = new int[n]; 107 | v12 = new int[n]; 108 | v13 = new int[n]; 109 | v14 = new int[n]; 110 | v15 = new int[n]; 111 | } 112 | 113 | } 114 | 115 | class SimpleStruct 116 | { 117 | public int v0; 118 | public int v1; 119 | public int v2; 120 | public int v3; 121 | public int v4; 122 | public int v5; 123 | public int v6; 124 | public int v7; 125 | public int v8; 126 | public int v9; 127 | public int v10; 128 | public int v11; 129 | public int v12; 130 | public int v13; 131 | public int v14; 132 | public int v15; 133 | } 134 | } 135 | -------------------------------------------------------------------------------- /DoDSamples/Samples/AOSvsSOA.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.Runtime.InteropServices; 4 | using System.Text; 5 | 6 | namespace DoDSamples 7 | { 8 | public class AOSvsSOA 9 | { 10 | // 11 | // This is a Data Oriented Design test that will show how 12 | // Struct of arrays has a much better Data Access characteristics and data locality. 13 | // 14 | // SOA [V0,V0,V0,V1,V1,V1] 15 | // AOS [V0,V1,V0,V1,V0,V1] 16 | // 17 | // For AOS for Structs or Classes we will have an 80 pad between which means that we will update each cache line 18 | // to increment the v0 value: 19 | // <0x281AF76B740> 80 80 20 | // <0x281AF76B790> 80 80 21 | // <0x281AF76B7E0> 80 80 22 | // 23 | // For SOA we will update each array value and reuse the same cache line: 24 | // Int32[] <0x216493DB6B8> 32 792 32 792 25 | // Int32[] <0x216493E36E8> 32 792 32 792 26 | // Int32[] <0x216493EB718> 32 792 32 792 27 | // 28 | // SOA is better in general for partial object updates while AOS is good when we want to contantly update entire 29 | // objects wich is almost never :) 30 | // 31 | public void TestAOS() 32 | { 33 | int steps = 1024 * 1024; 34 | int soaSize = 1024 * 8; 35 | 36 | SimpleStruct[] arrayOfStructs = new SimpleStruct[soaSize]; 37 | 38 | for (int i = 0; i < arrayOfStructs.Length; i++) 39 | arrayOfStructs[i] = new SimpleStruct(); 40 | 41 | for (int s = 0; s < steps; s++) 42 | { 43 | for (int i = 0; i < soaSize; i++) 44 | { 45 | arrayOfStructs[i].v0++; 46 | } 47 | } 48 | } 49 | 50 | public void TestSOA() 51 | { 52 | int steps = 1024 * 1024; 53 | int soaSize = 1024 * 8; 54 | 55 | SOAStruct soa = new SOAStruct(soaSize); 56 | 57 | for (int s = 0; s < steps; s++) 58 | { 59 | for (int i = 0; i < soaSize; i++) 60 | { 61 | soa.v0[i]++; 62 | } 63 | } 64 | } 65 | } 66 | 67 | class SOAStruct 68 | { 69 | public int[] v0; 70 | public int[] v1; 71 | public int[] v2; 72 | public int[] v3; 73 | public int[] v4; 74 | public int[] v5; 75 | public int[] v6; 76 | public int[] v7; 77 | public int[] v8; 78 | public int[] v9; 79 | public int[] v10; 80 | public int[] v11; 81 | public int[] v12; 82 | public int[] v13; 83 | public int[] v14; 84 | public int[] v15; 85 | 86 | public SOAStruct(int n) 87 | { 88 | v0 = new int[n]; 89 | v1 = new int[n]; 90 | v2 = new int[n]; 91 | v3 = new int[n]; 92 | v4 = new int[n]; 93 | v5 = new int[n]; 94 | v6 = new int[n]; 95 | v7 = new int[n]; 96 | v8 = new int[n]; 97 | v9 = new int[n]; 98 | v10 = new int[n]; 99 | v11 = new int[n]; 100 | v12 = new int[n]; 101 | v13 = new int[n]; 102 | v14 = new int[n]; 103 | v15 = new int[n]; 104 | } 105 | 106 | } 107 | 108 | class SimpleStruct 109 | { 110 | public int v0; 111 | public int v1; 112 | public int v2; 113 | public int v3; 114 | public int v4; 115 | public int v5; 116 | public int v6; 117 | public int v7; 118 | public int v8; 119 | public int v9; 120 | public int v10; 121 | public int v11; 122 | public int v12; 123 | public int v13; 124 | public int v14; 125 | public int v15; 126 | } 127 | } 128 | -------------------------------------------------------------------------------- /DoDSamples/Samples/POParser/DoDPOParser_v4.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.IO; 4 | using System.Runtime.Intrinsics; 5 | using System.Runtime.Intrinsics.X86; 6 | using System.Text; 7 | 8 | namespace DoDSamples.Samples 9 | { 10 | public struct DoDPOLines_v4 11 | { 12 | public int[] ID; 13 | public double[] Amount; 14 | public string[] Date; 15 | public string[] Time; 16 | public string[] Note; 17 | 18 | public DoDPOLines_v4(int size) 19 | { 20 | ID = new int[size]; 21 | Date = new string[size]; 22 | Time = new string[size]; 23 | Amount = new double[size]; 24 | Note = new string[size]; 25 | } 26 | } 27 | 28 | public class DoDPOParser_v4 29 | { 30 | private enum State 31 | { 32 | ID, 33 | DateTime, 34 | Amount, 35 | Note 36 | } 37 | 38 | public DoDPOLines_v4 Parse(string path, out int index) => Parse(File.ReadAllLines(path), out index); 39 | 40 | public DoDPOLines_v4 Parse(string[] lines, out int index) 41 | { 42 | DoDPOLines_v4 transactionLines = new DoDPOLines_v4(1000); 43 | 44 | index = 0; 45 | State state = State.ID; 46 | foreach (var line in lines) 47 | { 48 | if (string.IsNullOrEmpty(line)) 49 | { 50 | if (state >= State.Note) 51 | { 52 | state = State.ID; 53 | index++; 54 | } 55 | 56 | continue; 57 | } 58 | switch (state) 59 | { 60 | case State.ID: 61 | { 62 | transactionLines.ID[index] = int.Parse(line); 63 | 64 | state++; 65 | break; 66 | } 67 | case State.DateTime: 68 | { 69 | var dt = line.Split('T'); 70 | transactionLines.Date[index] = dt[0]; 71 | transactionLines.Time[index] = dt[1]; 72 | 73 | state++; 74 | break; 75 | } 76 | case State.Amount: 77 | { 78 | transactionLines.Amount[index] = double.Parse(line); 79 | 80 | state++; 81 | break; 82 | } 83 | case State.Note: 84 | { 85 | transactionLines.Note[index] += line; 86 | 87 | state++; 88 | break; 89 | } 90 | } 91 | } 92 | 93 | return transactionLines; 94 | } 95 | 96 | 97 | public unsafe double SumAmount(DoDPOLines_v4 source, int len) 98 | { 99 | double result; 100 | 101 | fixed (double* pSource = source.Amount) 102 | { 103 | Vector128 vresult = Vector128.Zero; 104 | 105 | int i = 0; 106 | int lastBlockIndex = len - (len % 2); 107 | 108 | while (i < lastBlockIndex) 109 | { 110 | vresult = Sse2.Add(vresult, Sse2.LoadVector128(pSource + i)); 111 | i += 2; 112 | } 113 | 114 | vresult = Ssse3.HorizontalAdd(vresult, vresult); 115 | result = vresult.ToScalar(); 116 | 117 | while (i < len) 118 | { 119 | result += pSource[i]; 120 | i += 1; 121 | } 122 | } 123 | 124 | return result; 125 | } 126 | } 127 | } 128 | -------------------------------------------------------------------------------- /DoDSamples/Program.cs: -------------------------------------------------------------------------------- 1 | using BenchmarkDotNet.Running; 2 | using DoDSamples.Samples; 3 | using DoDSamples.Samples.Benchmarks; 4 | using System; 5 | using System.Collections.Generic; 6 | using System.Runtime.Intrinsics; 7 | using System.Runtime.Intrinsics.X86; 8 | 9 | namespace DoDSamples 10 | { 11 | class Program 12 | { 13 | static void Main(string[] args) 14 | { 15 | 16 | 17 | 18 | ///////////////// 19 | // Rows vs Cols. 20 | ///////////////// 21 | 22 | // 23 | // Columns Array Traversal. 24 | // 25 | //RowsVsColsTests.Cols(); 26 | // 27 | // Rows Array Traversal. 28 | // 29 | //RowsVsColsTests.Rows(); 30 | 31 | ///////////////////////////////////// 32 | // PO File Parser - Sum the Amount. 33 | ///////////////////////////////////// 34 | 35 | // 36 | // Regex parser. 37 | // 38 | //POParserTests.TestAmountPO_Regex(); 39 | // 40 | // State Machine OOP Parser. 41 | // 42 | //POParserTests.TestAmountPO_OOP_StateMachine(); 43 | // 44 | // State Machine DoD Parser. 45 | // 46 | //POParserTests.TestAmountPO_DoD_StateMachine(); 47 | // 48 | // State Machine DoD Parser using split. 49 | // 50 | //POParserTests.TestAmountPO_DoD_StateMachine_Split(); 51 | // 52 | // State Machine DoD Parser using hot/cold split. 53 | // 54 | //POParserTests.TestAmountPO_DoD_SateMachine_HotColdSplit(); 55 | // 56 | // Fixed DoD Parsers 57 | // 58 | //POParserTests.TestAmountPO_DoD_StateMachineFix(); 59 | //POParserTests.TestAmountPO_DoD_SateMachine_SplitFix(); 60 | //POParserTests.TestAmountPO_DoD_SateMachine_HotColdSplitFix(); 61 | 62 | // 63 | // DoD SOA 64 | // 65 | //POParserTests.TestAmountPO_DoD_SoA(); 66 | //POParserTests.TestAmountPO_DoD_SoA_SIMD(); 67 | 68 | 69 | ////////////////////////////////////////////// 70 | // PO File Parser - Notes Split And To Lower. 71 | ////////////////////////////////////////////// 72 | 73 | // 74 | // State Machine OOP Split 75 | // 76 | //POParserTests.TestNotesPO_OOP_Split(); 77 | // 78 | // State Machine DoD Split 79 | // 80 | //POParserTests.TestNotesPO_DoD_Split(); 81 | 82 | // 83 | // State Machine OOP ToLower 84 | // 85 | //POParserTests.TestNotesToLowerPO_OOP(); 86 | // 87 | // State Machine DoD ToLower 88 | // 89 | //POParserTests.TestNotesToLowerPO_DoD(); 90 | 91 | 92 | //var summary = BenchmarkRunner.Run(); 93 | //var summary = BenchmarkRunner.Run(); 94 | //var summary = BenchmarkRunner.Run(); 95 | var summary = BenchmarkRunner.Run(); 96 | 97 | 98 | //SIMDSum simd = new SIMDSum(); 99 | 100 | // Utils.Measure(() => simd.Sum(new int[128*1024*1024])); 101 | // Utils.Measure(() => simd.SumVectorizedSse2(array)); 102 | 103 | 104 | //MemoryModelDeadlock memoryModelDeadlock = new MemoryModelDeadlock(); 105 | //Utils.Measure(memoryModelDeadlock.SpinLockTest); 106 | 107 | //AOSvsSOA soa = new AOSvsSOA(); 108 | //Utils.Measure(soa.TestSOA); 109 | 110 | //CacheSize c = new CacheSize(); 111 | 112 | //InstructionLevelDependency ld = new InstructionLevelDependency(); 113 | //Utils.Measure(ld.TestInDependant); 114 | 115 | //int steps = 65536 * 1024; 116 | //int[] array = new int[1024 * 1024 * 1]; 117 | 118 | //var e = Utils.Measure(() => c.TestK(steps, array)); 119 | //e = e * 1000; 120 | //Console.WriteLine((double)e / (double)steps); 121 | 122 | //var n = new POGenerator().Generate(); 123 | 124 | //RowsVsCols test = new RowsVsCols(); 125 | //Utils.Measure(test.Cols); 126 | //Console.ReadKey(); 127 | } 128 | } 129 | } 130 | 131 | -------------------------------------------------------------------------------- /DoDSamples/Samples/InstructionLevelDependency.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.Runtime.CompilerServices; 4 | using System.Runtime.Intrinsics; 5 | using System.Runtime.Intrinsics.X86; 6 | using System.Text; 7 | 8 | namespace DoDSamples 9 | { 10 | #region desc 11 | // 12 | // Instruction Level Dependency: 13 | // Good compilers will do it's best to break dependency chains 14 | // but sometimes it's just impossible and it's up to the user to break non trival chains. 15 | // 16 | #endregion 17 | 18 | public class InstructionLevelDependency 19 | { 20 | public static int steps = 128 * 1024 * 1024; 21 | public static readonly int i32Bits = sizeof(int) * 8 - 1; 22 | 23 | public static int TestDependency() 24 | { 25 | int a = 0; 26 | 27 | for (int i = 0; i < steps; i++) 28 | { 29 | a++; 30 | a++; 31 | a++; 32 | a++; 33 | } 34 | 35 | return a; 36 | } 37 | 38 | public static int TestIndependency() 39 | { 40 | int a = 0, b = 0, c = 0, d = 0; 41 | 42 | for (int i = 0; i < steps; i++) 43 | { 44 | a++; 45 | b++; 46 | c++; 47 | d++; 48 | } 49 | 50 | return a + b + c + d; 51 | } 52 | 53 | public static void TestSum() 54 | { 55 | double[] x = new double[steps]; 56 | double sum = 0; 57 | 58 | for (int i = 0; i < steps; i++) 59 | { 60 | sum += x[i]; 61 | } 62 | } 63 | 64 | public static void TestDependencyUnrolledSum() 65 | { 66 | double[] x = new double[steps]; 67 | double sum = 0; 68 | 69 | int i = 0; 70 | for (; i < steps; i += 4) 71 | { 72 | sum += x[i]; 73 | sum += x[i + 1]; 74 | sum += x[i + 2]; 75 | sum += x[i + 3]; 76 | } 77 | // Sum residuals 78 | for (; i < steps; i++) 79 | { 80 | sum += x[i]; 81 | } 82 | } 83 | 84 | public static void TestIndependencyUnrolledSum() 85 | { 86 | int steps = 64 * 1024 * 1024; 87 | 88 | double[] x = new double[steps]; 89 | double sum = 0; 90 | double sa = 0, sb = 0, sc = 0, sd = 0; 91 | 92 | int i = 0; 93 | for (; i < steps; i += 4) 94 | { 95 | sa += x[i]; 96 | sb += x[i + 1]; 97 | sc += x[i + 2]; 98 | sd += x[i + 3]; 99 | } 100 | 101 | // Sum residuals 102 | for (; i < steps; i++) 103 | { 104 | sum += x[i]; 105 | } 106 | 107 | sum = sa + sb + sc + sd; 108 | } 109 | 110 | public static void TestIndependencyUnrolledSum2() 111 | { 112 | int steps = 64 * 1024 * 1024; 113 | 114 | double[] x = new double[steps]; 115 | double sum = 0; 116 | double sa = 0, sb = 0, sc = 0, sd = 0; 117 | 118 | int i = 0; 119 | for (; i < steps; i += 4) 120 | { 121 | sa += x[i]; 122 | sb += x[i + 1]; 123 | sc += x[i + 2]; 124 | sd += x[i + 3]; 125 | } 126 | 127 | // Sum residuals 128 | for (; i < steps; i++) 129 | { 130 | sum += x[i]; 131 | } 132 | 133 | sum = (sa + sb) + (sc + sd); 134 | } 135 | 136 | public static void TestTrueDependence(int[] x) 137 | { 138 | var min = 0; 139 | 140 | for (int i = 0; i < x.Length; i++) 141 | { 142 | min = Math.Min(min, x[i]); 143 | //min = MinBranch(min, x[i]); 144 | } 145 | } 146 | 147 | public static void TestTrueIndependence(int[] x) 148 | { 149 | var min = 0; 150 | var m1 = 0; 151 | var m2 = 0; 152 | var m3 = 0; 153 | var m4 = 0; 154 | 155 | for (int i = 0; i < x.Length; i += 4) 156 | { 157 | m1 = MinBranchFree(m1, x[i]); 158 | m2 = MinBranchFree(m2, x[i + 1]); 159 | m3 = MinBranchFree(m3, x[i + 2]); 160 | m4 = MinBranchFree(m4, x[i + 3]); 161 | } 162 | 163 | min = MinBranchFree(m1, MinBranchFree(m2, MinBranchFree(m3, m4))); 164 | } 165 | 166 | public static void TestTrueIndependenceAVX(int[] x) 167 | { 168 | var min = 0; 169 | var m1 = 0; 170 | var m2 = 0; 171 | var m3 = 0; 172 | var m4 = 0; 173 | 174 | for (int i = 0; i < x.Length; i += 4) 175 | { 176 | m1 = AVXMin(m1, x[i]); 177 | m2 = AVXMin(m2, x[i + 1]); 178 | m3 = AVXMin(m3, x[i + 2]); 179 | m4 = AVXMin(m4, x[i + 3]); 180 | } 181 | 182 | min = AVXMin(m1, AVXMin(m2, AVXMin(m3, m4))); 183 | } 184 | 185 | public static int TestTrueIndependenceAVXVec(int[] x) 186 | { 187 | return AVXVecMin(x); 188 | } 189 | 190 | public static int TestTrueIndependenceAVXVecIndependant(int[] x) 191 | { 192 | return AVXVecMinIndependent(x); 193 | } 194 | 195 | public static void TestTrueDependenceBranchFree(int[] x) 196 | { 197 | int min = int.MaxValue, inc = 0; 198 | for (int i = 0; i < x.Length; i++) 199 | { 200 | inc = IsMinBranchFree(min, x[i]); 201 | var delta = min - x[i]; 202 | min = min - (delta * inc); 203 | } 204 | } 205 | 206 | [MethodImpl(MethodImplOptions.AggressiveInlining)] 207 | public static int IsMinBranchFree(int x, int y) 208 | { 209 | var v = x - y; 210 | return (int)((1 ^ ((uint)v >> (31)))); 211 | } 212 | 213 | 214 | public static void TestTrueIndependenceDelta(int[] x) 215 | { 216 | var max = int.MaxValue; 217 | int[] m = new int[4] { max, max, max, max }; 218 | var inc = 0; 219 | for (int i = 0; i < x.Length; i += 4) 220 | { 221 | for (int w = 0; w < m.Length; w++) 222 | { 223 | inc = IsMinBranchFree(m[w], x[i + w]); 224 | var delta = m[w] - x[i + w]; 225 | m[w] = m[w] - (delta * inc); 226 | } 227 | } 228 | // todo: residuals + min(m[0],m[1],m[2],m[3]) 229 | } 230 | 231 | [MethodImpl(MethodImplOptions.AggressiveInlining)] 232 | public static int MinBranchFree(int x, int y) 233 | { 234 | return y + ((x - y) & ((x - y) >> (31))); 235 | } 236 | 237 | [MethodImpl(MethodImplOptions.AggressiveInlining)] 238 | public static int AVXMin(int x, int y) 239 | { 240 | var v1 = Vector128.CreateScalarUnsafe(x); 241 | var v2 = Vector128.CreateScalarUnsafe(y); 242 | return Avx.Min(v1, v2).ToScalar(); 243 | } 244 | 245 | [MethodImpl(MethodImplOptions.AggressiveInlining)] 246 | public static unsafe int AVXVecMin(int[] x) 247 | { 248 | int len = x.Length; 249 | var min = Vector128.Create(int.MaxValue); 250 | fixed (int* pSource = x) 251 | { 252 | int i = 0; 253 | int lastBlockIndex = len - (len % 4); 254 | 255 | while (i < lastBlockIndex) { 256 | min = Avx.Min(min, Avx.LoadVector128(pSource + i)); 257 | i += 4; 258 | } 259 | var minValue = min.ToScalar(); 260 | while (i < len) { 261 | minValue = MinBranchFree(minValue, pSource[i]); 262 | i += 1; 263 | } 264 | return minValue; 265 | } 266 | } 267 | 268 | [MethodImpl(MethodImplOptions.AggressiveInlining)] 269 | public static unsafe int AVXVecMinIndependent(int[] x) 270 | { 271 | int len = x.Length; 272 | var min1 = Vector128.Create(int.MaxValue); 273 | var min2 = Vector128.Create(int.MaxValue); 274 | 275 | fixed (int* pSource = x) 276 | { 277 | int i = 0; 278 | int lastBlockIndex = len - (len % 8); 279 | 280 | while (i < lastBlockIndex) 281 | { 282 | min1 = Avx.Min(min1, Avx.LoadVector128(pSource + i)); 283 | min2 = Avx.Min(min2, Avx.LoadVector128(pSource + i + 4)); 284 | 285 | i += 8; 286 | } 287 | var minValue = min1.ToScalar() + min2.ToScalar(); 288 | while (i < len) 289 | { 290 | minValue = MinBranchFree(minValue, pSource[i]); 291 | i += 1; 292 | } 293 | return minValue; 294 | } 295 | } 296 | 297 | [MethodImpl(MethodImplOptions.AggressiveInlining)] 298 | public static int MinBranch(int x, int y) 299 | { 300 | return (x <= y) ? x : y; 301 | } 302 | } 303 | } 304 | 305 | -------------------------------------------------------------------------------- /DoDSamples/Samples/Benchmarks/OOPvsDoDParsers.cs: -------------------------------------------------------------------------------- 1 | using BenchmarkDotNet.Attributes; 2 | using BenchmarkDotNet.Configs; 3 | using BenchmarkDotNet.Order; 4 | using System; 5 | using System.Collections.Generic; 6 | using System.IO; 7 | using System.Runtime.Intrinsics; 8 | using System.Runtime.Intrinsics.X86; 9 | using System.Text; 10 | 11 | namespace DoDSamples.Samples 12 | { 13 | 14 | [Orderer(SummaryOrderPolicy.SlowestToFastest, MethodOrderPolicy.Declared)] 15 | public class OOPvsDoDParsersToLower 16 | { 17 | [Params(100)] 18 | public int Samples = 1; 19 | 20 | private string[] lines = null; 21 | 22 | [GlobalSetup(Targets = new[] 23 | { 24 | nameof(ToLower), 25 | nameof(ToLowerASCIIInPlace_SIMD) 26 | })] 27 | 28 | public void GlobalSetup() 29 | { 30 | lines = File.ReadAllLines(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po"); 31 | } 32 | 33 | [Benchmark] 34 | public void ToLowerASCIIInPlace_SIMD() 35 | { 36 | DoDPOParser_v5 parser = new DoDPOParser_v5(); 37 | var dodLines_v5 = parser.Parse(lines, out var index); 38 | 39 | for (int s = 0; s < Samples; s++) 40 | { 41 | ToLowerASCIIInPlace_SIMD(dodLines_v5.AllNotes.ToString()); 42 | } 43 | } 44 | 45 | [Benchmark] 46 | public void ToLower() 47 | { 48 | DoDPOParser_v5 parser = new DoDPOParser_v5(); 49 | var dodLines_v5 = parser.Parse(lines, out var index); 50 | 51 | for (int s = 0; s < Samples; s++) 52 | { 53 | dodLines_v5.AllNotes.ToString().ToLower(); 54 | } 55 | } 56 | 57 | public static unsafe void ToLowerASCIIInPlace_SIMD(string text) 58 | { 59 | const int upperIntOffset = 2097184; 60 | const int upperCharOffset = 32; 61 | 62 | Vector128 vresult = Vector128.Zero; 63 | Vector128 add = Vector128.Create(upperIntOffset); 64 | 65 | var len = text.Length; 66 | 67 | fixed (char* pSource = text) 68 | { 69 | int i = 0; 70 | int lastBlockIndex = len - (len % 8); 71 | 72 | while (i < lastBlockIndex) 73 | { 74 | int* c = (int*)(pSource + i); 75 | 76 | vresult = Sse2.LoadVector128(c); 77 | vresult = Sse2.Or(vresult, add); 78 | 79 | Sse2.Store(c, vresult); 80 | 81 | i += 8; 82 | } 83 | 84 | while (i < len) 85 | { 86 | char* c = (char*)(pSource + i); 87 | *c = (Char)(*c | upperCharOffset); 88 | 89 | i += 1; 90 | } 91 | } 92 | } 93 | 94 | } 95 | 96 | 97 | [GroupBenchmarksBy(BenchmarkLogicalGroupRule.ByCategory)] 98 | [CategoriesColumn] 99 | [Orderer(SummaryOrderPolicy.SlowestToFastest, MethodOrderPolicy.Declared)] 100 | public class OOPvsDoDParsers 101 | { 102 | [Params(100)] 103 | public int Samples = 1; 104 | 105 | private string[] lines = null; 106 | private string text = null; 107 | 108 | [GlobalSetup(Targets = new[] 109 | { 110 | //nameof(DoD_Parser_ListOfStructs), 111 | nameof(DoD_Parser_ArrayOfStructs), 112 | //nameof(DoD_Parser_ListOfStructs_Split), 113 | nameof(DoD_Parser_ArrayOfStructs_Split), 114 | nameof(DoD_Parser_ArrayOfStructs_HotColdSplit), 115 | nameof(DoD_Parser_StructOfArrays), 116 | nameof(DoD_Parser_StructOfArrays_SIMD), 117 | nameof(OOP_Parser_StateMachine), 118 | 119 | })] 120 | 121 | public void GlobalSetup() 122 | { 123 | lines = File.ReadAllLines(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po"); 124 | } 125 | 126 | [GlobalSetup(Targets = new[] { nameof(OOP_Parser_Regex) })] 127 | public void GlobalSetupA() 128 | { 129 | text = File.ReadAllText(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po"); 130 | } 131 | 132 | [BenchmarkCategory("OOP")] 133 | [Benchmark(Baseline = true)] 134 | public void OOP_Parser_Regex() 135 | { 136 | POParser parser = new POParser(); 137 | var lines_v0 = parser.Parse(text); 138 | 139 | for (int s = 0; s < Samples; s++) 140 | { 141 | double sum = 0; 142 | foreach (var line in lines_v0) 143 | { 144 | sum += line.Amount; 145 | } 146 | } 147 | } 148 | 149 | [BenchmarkCategory("OOP")] 150 | [Benchmark] 151 | public void OOP_Parser_StateMachine() 152 | { 153 | POParser_Fast parser = new POParser_Fast(); 154 | var lines_v0 = parser.Parse(lines); 155 | 156 | for (int s = 0; s < Samples; s++) 157 | { 158 | double sum = 0; 159 | foreach (var line in lines_v0) 160 | { 161 | sum += line.Amount; 162 | } 163 | } 164 | } 165 | 166 | //[BenchmarkCategory("DoD")] 167 | //[Benchmark] 168 | //public void DoD_Parser_ListOfStructs() 169 | //{ 170 | // DoDPOParser_v1 parser = new DoDPOParser_v1(); 171 | // var lines_v1 = parser.Parse(lines); 172 | 173 | // for (int s = 0; s < Samples; s++) 174 | // { 175 | // double sum = 0; 176 | 177 | // foreach (var line in lines_v1) 178 | // { 179 | // sum += line.Amount; 180 | // } 181 | // } 182 | //} 183 | 184 | [BenchmarkCategory("DoD")] 185 | [Benchmark(Baseline = true)] 186 | public void DoD_Parser_ArrayOfStructs() 187 | { 188 | DoDPOParser_v1a parser = new DoDPOParser_v1a(); 189 | var lines_v1 = parser.Parse(lines, out int index); 190 | 191 | for (int s = 0; s < Samples; s++) 192 | { 193 | double sum = 0; 194 | 195 | foreach (var line in lines_v1) 196 | { 197 | sum += line.Amount; 198 | } 199 | } 200 | } 201 | 202 | //[BenchmarkCategory("DoD")] 203 | //[Benchmark] 204 | //public void DoD_Parser_ListOfStructs_Split() 205 | //{ 206 | // DoDPOParser_v2 parser = new DoDPOParser_v2(); 207 | // var lines_v2 = parser.Parse(lines); 208 | 209 | // for (int s = 0; s < Samples; s++) 210 | // { 211 | // double sum = 0; 212 | 213 | // foreach (var line in lines_v2) 214 | // { 215 | // sum += line.Amount; 216 | // } 217 | // } 218 | //} 219 | 220 | [BenchmarkCategory("DoD")] 221 | [Benchmark] 222 | public void DoD_Parser_ArrayOfStructs_Split() 223 | { 224 | DoDPOParser_v2a parser = new DoDPOParser_v2a(); 225 | var lines_v2 = parser.Parse(lines, out int index); 226 | 227 | for (int s = 0; s < Samples; s++) 228 | { 229 | double sum = 0; 230 | 231 | foreach (var line in lines_v2) 232 | { 233 | sum += line.Amount; 234 | } 235 | } 236 | } 237 | 238 | [BenchmarkCategory("DoD")] 239 | [Benchmark] 240 | public void DoD_Parser_ArrayOfStructs_HotColdSplit() 241 | { 242 | DoDPOParser_v3 parser = new DoDPOParser_v3(); 243 | var lines_v3 = parser.Parse(lines); 244 | 245 | for (int s = 0; s < Samples; s++) 246 | { 247 | double sum = 0; 248 | 249 | for (int i = 0; i < lines_v3.Count; i++) 250 | { 251 | sum += lines_v3[i].Amount; 252 | } 253 | } 254 | } 255 | 256 | [BenchmarkCategory("DoD")] 257 | [Benchmark] 258 | public void DoD_Parser_StructOfArrays() 259 | { 260 | DoDPOParser_v4 parser = new DoDPOParser_v4(); 261 | var dodLines_v4 = parser.Parse(lines, out var index); 262 | 263 | for (int s = 0; s < Samples; s++) 264 | { 265 | double sum = 0; 266 | for (int i = 0; i < index; i++) 267 | { 268 | sum += dodLines_v4.Amount[i]; 269 | } 270 | } 271 | } 272 | 273 | [BenchmarkCategory("DoD")] 274 | [Benchmark] 275 | public void DoD_Parser_StructOfArrays_SIMD() 276 | { 277 | DoDPOParser_v4 parser = new DoDPOParser_v4(); 278 | var dodLines_v4 = parser.Parse(lines, out var index); 279 | 280 | for (int s = 0; s < Samples; s++) 281 | { 282 | double sum = SumAmount(dodLines_v4, index); 283 | } 284 | } 285 | 286 | 287 | public unsafe double SumAmount(DoDPOLines_v4 source, int len) 288 | { 289 | double result; 290 | 291 | fixed (double* pSource = source.Amount) 292 | { 293 | Vector128 vresult = Vector128.Zero; 294 | 295 | int i = 0; 296 | int lastBlockIndex = len - (len % 2); 297 | 298 | while (i < lastBlockIndex) 299 | { 300 | vresult = Sse2.Add(vresult, Sse2.LoadVector128(pSource + i)); 301 | i += 2; 302 | } 303 | 304 | vresult = Ssse3.HorizontalAdd(vresult, vresult); 305 | result = vresult.ToScalar(); 306 | 307 | while (i < len) 308 | { 309 | result += pSource[i]; 310 | i += 1; 311 | } 312 | } 313 | 314 | return result; 315 | } 316 | } 317 | } 318 | -------------------------------------------------------------------------------- /DoDSamples/Samples/BitOperations.cs: -------------------------------------------------------------------------------- 1 | using Microsoft.Diagnostics.Runtime.Utilities; 2 | using Microsoft.Diagnostics.Tracing.Parsers.Kernel; 3 | using System; 4 | using System.Collections.Generic; 5 | using System.Runtime.Intrinsics; 6 | using System.Runtime.Intrinsics.X86; 7 | using System.Text; 8 | 9 | namespace DoDSamples.Samples 10 | { 11 | public class BitOperations 12 | { 13 | 14 | // 15 | // Branch Elimination Example: lets count even numbers 16 | // 17 | 18 | 19 | 20 | public static int CountEven(int[] numbers) 21 | { 22 | int counter = 0; 23 | for(int i = 0; i < numbers.Length; i++) 24 | { 25 | if(numbers[i] % 2 == 0) 26 | { 27 | counter++; 28 | } 29 | } 30 | 31 | return counter; 32 | } 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | public static int CountEvenBranchFree(int[] numbers) 41 | { 42 | int counter = 0; 43 | for (int i = 0; i < numbers.Length; i++) 44 | { 45 | var add = numbers[i] & 1; 46 | counter += (1 - add); 47 | } 48 | 49 | return counter; 50 | } 51 | 52 | 53 | 54 | 55 | public static int CountEvenBranchFreeBetter(int[] numbers) 56 | { 57 | int counter = 0; 58 | for (int i = 0; i < numbers.Length; i++) 59 | { 60 | var odd = numbers[i] & 1; 61 | counter += odd; 62 | } 63 | 64 | // Take all odd numbers and substract them from the set 65 | // leaving only even numbers 66 | return numbers.Length - counter; 67 | } 68 | 69 | 70 | 71 | 72 | 73 | public static unsafe int CountEvenSIMD(int[] numbers) 74 | { 75 | int counter = 0; 76 | int len = numbers.Length; 77 | 78 | fixed (int* num = numbers) 79 | { 80 | Vector128 vresult = Vector128.Zero; 81 | Vector128 ones = Vector128.Create(1); 82 | 83 | int i = 0; 84 | int lastBlockIndex = len - (len % 4); 85 | 86 | while (i < lastBlockIndex) 87 | { 88 | var vec = Sse2.LoadVector128(num + i); 89 | var odds = Sse2.And(vec, ones); 90 | vresult = Sse2.Add(vresult, odds); 91 | 92 | i += 4; 93 | } 94 | 95 | vresult = Ssse3.HorizontalAdd(vresult, vresult); 96 | vresult = Ssse3.HorizontalAdd(vresult, vresult); 97 | 98 | counter = vresult.ToScalar(); 99 | 100 | while (i < len) 101 | { 102 | var odd = numbers[i] & 1; 103 | counter += odd; 104 | 105 | i += 1; 106 | } 107 | } 108 | 109 | return numbers.Length - counter; 110 | } 111 | 112 | public static int CountChar(string text, char needle) 113 | { 114 | int count = 0; 115 | 116 | foreach(var c in text) 117 | { 118 | if (c == needle) 119 | count++; 120 | } 121 | 122 | return count; 123 | } 124 | 125 | 126 | 127 | 128 | 129 | 130 | private static int[] jump_table = new int[256]; 131 | 132 | public static void InitJumpTable(char needle) 133 | { 134 | int cIdx = (byte)needle; 135 | 136 | for(int i = 0; i < jump_table.Length; i++) 137 | { 138 | jump_table[i] = 0; 139 | if (i == cIdx) 140 | { 141 | jump_table[i] = 1; 142 | } 143 | } 144 | } 145 | 146 | public static int CountCharJumpTable(string text, char needle) 147 | { 148 | int count = 0; 149 | 150 | foreach (var c in text) 151 | { 152 | count += jump_table[(byte)c]; 153 | } 154 | 155 | return count; 156 | } 157 | 158 | public static int CountCharWORD(string text, char needle) 159 | { 160 | int count = 0; 161 | byte charToFind = (byte)needle; 162 | byte before = (byte)(charToFind - 1); 163 | byte after = (byte)(charToFind + 1); 164 | 165 | unsafe 166 | { 167 | fixed (char* ch = text) 168 | { 169 | int len = text.Length; 170 | 171 | int i = 0; 172 | int lastBlockIndex = len - (len % 4); 173 | 174 | while (i < lastBlockIndex) 175 | { 176 | ulong* p = (ulong*)(ch + i); 177 | var result = (int)CountBetween(*p, before, after); 178 | count += result; 179 | 180 | i += 4; 181 | } 182 | 183 | while (i < len) 184 | { 185 | char* c = (char*)(ch + i); 186 | if (*c == charToFind) 187 | { 188 | count++; 189 | } 190 | i += 1; 191 | } 192 | 193 | return count - len; 194 | } 195 | } 196 | } 197 | 198 | public static int CountWhitespaceWORDLess(string text) 199 | { 200 | int count = 0; 201 | byte charToFind = (byte)' '; 202 | byte after = (byte)(charToFind + 1); 203 | 204 | unsafe 205 | { 206 | fixed (char* ch = text) 207 | { 208 | int len = text.Length; 209 | 210 | int i = 0; 211 | int lastBlockIndex = len - (len % 4); 212 | 213 | while (i < lastBlockIndex) 214 | { 215 | ulong* p = (ulong*)(ch + i); 216 | var result = (int)CountLess(*p, after); 217 | count += result; 218 | 219 | i += 4; 220 | } 221 | 222 | while (i < len) 223 | { 224 | char* c = (char*)(ch + i); 225 | if (*c == charToFind) 226 | { 227 | count++; 228 | } 229 | i += 1; 230 | } 231 | 232 | return count - len; 233 | } 234 | } 235 | } 236 | 237 | public static int CountCharWORDCompact(string text, char needle) 238 | { 239 | int count = 0; 240 | byte charToFind = (byte)needle; 241 | byte before = (byte)(charToFind - 1); 242 | byte after = (byte)(charToFind + 1); 243 | 244 | unsafe 245 | { 246 | fixed (char* ch = text) 247 | { 248 | int len = text.Length; 249 | 250 | int i = 0; 251 | int lastBlockIndex = len - (len % 4); 252 | 253 | while (i < lastBlockIndex) 254 | { 255 | ulong* p = (ulong*)(ch + i); 256 | 257 | var has = HasValue(*p, charToFind); 258 | if (has > 0) 259 | { 260 | var result = CountBetween(*p, before, after); 261 | count += (int)result; 262 | } 263 | 264 | i += 4; 265 | } 266 | 267 | while (i < len) 268 | { 269 | char* c = (char*)(ch + i); 270 | if (*c == charToFind) 271 | { 272 | count++; 273 | } 274 | i += 1; 275 | } 276 | 277 | return count; 278 | } 279 | } 280 | } 281 | 282 | public static int CountWhitespaceWORDCompactLess(string text) 283 | { 284 | int count = 0; 285 | byte charToFind = (byte)' '; 286 | byte after = (byte)(charToFind + 1); 287 | 288 | unsafe 289 | { 290 | fixed (char* ch = text) 291 | { 292 | int len = text.Length; 293 | 294 | int i = 0; 295 | int lastBlockIndex = len - (len % 4); 296 | 297 | while (i < lastBlockIndex) 298 | { 299 | ulong* p = (ulong*)(ch + i); 300 | 301 | var has = HasValue(*p, charToFind); 302 | if (has > 0) 303 | { 304 | var result = CountLess(*p, after); 305 | count += (int)result; 306 | } 307 | 308 | i += 4; 309 | } 310 | 311 | while (i < len) 312 | { 313 | char* c = (char*)(ch + i); 314 | if (*c == charToFind) 315 | { 316 | count++; 317 | } 318 | i += 1; 319 | } 320 | 321 | return count; 322 | } 323 | } 324 | } 325 | 326 | // 327 | // Bit Twindling Hacks: 328 | // https://graphics.stanford.edu/~seander/bithacks.html 329 | // 330 | public static ulong HasZero(ulong v) 331 | { 332 | return (((v) - 0x0101010101010101UL) & ~(v) & 0x8080808080808080UL); 333 | } 334 | 335 | public static ulong HasValue(ulong x, byte n) 336 | { 337 | return (HasZero((x) ^ (~0UL / 255 * (n)))); 338 | } 339 | 340 | public static ulong HasLess(ulong x, byte n) 341 | { 342 | return (((x) - ~0UL / 255 * (n)) & ~(x) & ~0UL / 255 * 128); 343 | } 344 | 345 | public static ulong CountLess(ulong x, byte n) 346 | { 347 | return (((~0UL / 255 * (127 + ((ulong)n)) - ((x) & ~0UL / 255 * 127)) & ~(x) & ~0UL / 255 * 128) / 128 % 255); 348 | } 349 | 350 | public static ulong HasBetween(ulong x, byte m, byte n) 351 | { 352 | return ((~0UL / 255 * (127 + ((ulong)n)) 353 | - ((x) & ~0UL / 255 * 127) & 354 | ~(x) & ((x) & ~0UL / 255 * 127) + 355 | ~0UL / 255 * (127 - ((ulong)m))) & ~0UL / 255 * 128); 356 | } 357 | 358 | public static ulong CountBetween(ulong x, byte m, byte n) 359 | { 360 | return HasBetween(x, m, n) / 128 % 255; 361 | } 362 | 363 | 364 | 365 | } 366 | } 367 | -------------------------------------------------------------------------------- /DoDSamples/Samples/Tests/PoParserTests.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Collections.Generic; 3 | using System.Runtime.Intrinsics; 4 | using System.Runtime.Intrinsics.X86; 5 | using System.Text; 6 | 7 | namespace DoDSamples.Samples 8 | { 9 | public class POParserTests 10 | { 11 | private static int samples = 100_000; 12 | public static void TestAmountPO_Regex() 13 | { 14 | var parser = new POParser(); 15 | var lines = parser.ParseFromPath(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po"); 16 | 17 | Utils.Measure(() => 18 | { 19 | for (int s = 0; s < samples; s++) 20 | { 21 | double sum = 0; 22 | 23 | foreach (var line in lines) 24 | { 25 | sum += line.Amount; 26 | } 27 | } 28 | }); 29 | } 30 | 31 | public static void TestAmountPO_OOP_StateMachine() 32 | { 33 | var parser = new POParser_Fast(); 34 | var lines = parser.Parse(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po"); 35 | 36 | Utils.Measure(() => 37 | { 38 | for (int s = 0; s < samples; s++) 39 | { 40 | double sum = 0; 41 | 42 | foreach (var line in lines) 43 | { 44 | sum += line.Amount; 45 | } 46 | } 47 | }); 48 | } 49 | 50 | public static void TestAmountPO_DoD_StateMachine() 51 | { 52 | var parser = new DoDPOParser_v1(); 53 | var lines = parser.Parse(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po"); 54 | 55 | Utils.Measure(() => 56 | { 57 | for (int s = 0; s < samples; s++) 58 | { 59 | double sum = 0; 60 | 61 | foreach (var line in lines) 62 | { 63 | sum += line.Amount; 64 | } 65 | } 66 | }); 67 | } 68 | 69 | public static void TestAmountPO_DoD_StateMachineFix() 70 | { 71 | var parser = new DoDPOParser_v1a(); 72 | var lines = parser.Parse(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po", out var index); 73 | 74 | Utils.Measure(() => 75 | { 76 | for (int s = 0; s < samples; s++) 77 | { 78 | double sum = 0; 79 | 80 | for (int i = 0; i < index; i++) 81 | { 82 | sum += lines[i].Amount; 83 | } 84 | } 85 | }); 86 | } 87 | 88 | public static void TestAmountPO_DoD_StateMachine_Split() 89 | { 90 | var parser = new DoDPOParser_v2(); 91 | var lines = parser.Parse(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po"); 92 | 93 | Utils.Measure(() => 94 | { 95 | for (int s = 0; s < samples; s++) 96 | { 97 | double sum = 0; 98 | 99 | foreach (var line in lines) 100 | { 101 | sum += line.Amount; 102 | } 103 | } 104 | }); 105 | } 106 | 107 | public static void TestAmountPO_DoD_SateMachine_SplitFix() 108 | { 109 | var parser = new DoDPOParser_v2a(); 110 | var lines = parser.Parse(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po", out var index); 111 | 112 | Utils.Measure(() => 113 | { 114 | for (int s = 0; s < samples; s++) 115 | { 116 | double sum = 0; 117 | 118 | for (int i = 0; i < index; i++) 119 | { 120 | sum += lines[i].Amount; 121 | } 122 | } 123 | }); 124 | } 125 | 126 | 127 | public static void TestAmountPO_DoD_SateMachine_HotColdSplit() 128 | { 129 | var parser = new DoDPOParser_v3(); 130 | var lines = parser.Parse(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po"); 131 | 132 | Utils.Measure(() => 133 | { 134 | for (int s = 0; s < samples; s++) 135 | { 136 | double sum = 0; 137 | 138 | foreach (var line in lines) 139 | { 140 | sum += line.Amount; 141 | } 142 | } 143 | }); 144 | } 145 | 146 | public static void TestAmountPO_DoD_SateMachine_HotColdSplitFix() 147 | { 148 | var parser = new DoDPOParser_v3a(); 149 | var lines = parser.Parse(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po", out var index); 150 | 151 | Utils.Measure(() => 152 | { 153 | for (int s = 0; s < samples; s++) 154 | { 155 | double sum = 0; 156 | 157 | for (int i = 0; i < index; i++) 158 | { 159 | sum += lines[i].Amount; 160 | } 161 | } 162 | }); 163 | } 164 | 165 | public static void TestAmountPO_DoD_SoA() 166 | { 167 | var parser = new DoDPOParser_v4(); 168 | var lines = parser.Parse(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po", out var index); 169 | 170 | Utils.Measure(() => 171 | { 172 | for (int s = 0; s < samples; s++) 173 | { 174 | double sum = 0; 175 | 176 | for (int i = 0; i < index; i++) 177 | { 178 | sum += lines.Amount[i]; 179 | } 180 | } 181 | }); 182 | } 183 | 184 | public static void TestAmountPO_DoD_SoA_SIMD() 185 | { 186 | var parser = new DoDPOParser_v4(); 187 | var lines = parser.Parse(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po", out var index); 188 | 189 | Utils.Measure(() => 190 | { 191 | for (int s = 0; s < samples; s++) 192 | { 193 | double sum = 0; 194 | sum = parser.SumAmount(lines, index); 195 | } 196 | }); 197 | } 198 | 199 | public static void TestNotesPO_OOP_Split() 200 | { 201 | samples = 10000; 202 | 203 | POParser parser = new POParser(); 204 | var lines = parser.ParseFromPath(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po"); 205 | 206 | Utils.Measure(() => 207 | { 208 | for (int s = 0; s < samples; s++) 209 | { 210 | List words = new List(1000); 211 | 212 | foreach (var line in lines) 213 | { 214 | words.AddRange(line.Note.Split(" ")); 215 | } 216 | } 217 | }); 218 | } 219 | 220 | public static void TestNotesPO_DoD_Split() 221 | { 222 | samples = 10000; 223 | 224 | var parser = new DoDPOParser_v5(); 225 | var lines = parser.Parse(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po", out var index); 226 | 227 | Utils.Measure(() => 228 | { 229 | for (int s = 0; s < samples; s++) 230 | { 231 | List words = new List(1000); 232 | words.AddRange(lines.AllNotes.ToString().Split(" ")); 233 | } 234 | }); 235 | } 236 | 237 | public static void TestNotesToLowerPO_OOP() 238 | { 239 | samples = 10000; 240 | 241 | var parser = new DoDPOParser_v5(); 242 | var lines = parser.Parse(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po", out var index); 243 | 244 | Utils.Measure(() => 245 | { 246 | for (int s = 0; s < samples; s++) 247 | { 248 | var all = lines.AllNotes.ToString().ToLower(); 249 | } 250 | }); 251 | } 252 | 253 | public static void TestNotesToLowerPO_DoD() 254 | { 255 | samples = 10000; 256 | 257 | var parser = new DoDPOParser_v5(); 258 | var lines = parser.Parse(@"C:\Users\Y700-17\Desktop\DataOrientedDesign\DoDSamples\DoDSamples\Samples\POParser\Sample.po", out var index); 259 | 260 | Utils.Measure(() => 261 | { 262 | for (int s = 0; s < samples; s++) 263 | { 264 | ToLowerASCIIInPlace_SIMD(lines.AllNotes.ToString()); 265 | } 266 | }); 267 | } 268 | 269 | public static unsafe void ToLowerASCIIInPlace_SIMD(string text) 270 | { 271 | const int upperIntOffset = 2097184; 272 | const int upperCharOffset = 32; 273 | 274 | Vector128 vresult = Vector128.Zero; 275 | Vector128 add = Vector128.Create(upperIntOffset); 276 | 277 | var len = text.Length; 278 | 279 | fixed (char* pSource = text) 280 | { 281 | int i = 0; 282 | int lastBlockIndex = len - (len % 8); 283 | 284 | while (i < lastBlockIndex) 285 | { 286 | int* c = (int*)(pSource + i); 287 | 288 | vresult = Sse2.LoadVector128(c); 289 | vresult = Sse2.Or(vresult, add); 290 | 291 | Sse2.Store(c, vresult); 292 | 293 | i += 8; 294 | } 295 | 296 | while (i < len) 297 | { 298 | char* c = (char*)(pSource + i); 299 | *c = (Char)(*c | upperCharOffset); 300 | 301 | i += 1; 302 | } 303 | } 304 | } 305 | 306 | public static unsafe void ToUpperASCIIInPlace_SIMD(string text) 307 | { 308 | //0b_01111111_11011111_11111111_11011111; 309 | const int upperIntOffset = 2145386463; 310 | const int upperCharOffset = 95; 311 | 312 | Vector128 vresult = Vector128.Zero; 313 | Vector128 add = Vector128.Create(upperIntOffset); 314 | 315 | var len = text.Length; 316 | 317 | fixed (char* pSource = text) 318 | { 319 | int i = 0; 320 | int lastBlockIndex = len - (len % 8); 321 | 322 | while (i < lastBlockIndex) 323 | { 324 | int* c = (int*)(pSource + i); 325 | 326 | vresult = Sse2.LoadVector128(c); 327 | //0b_01111111_11011111_11111111_11011111; 328 | vresult = Sse2.And(vresult, add); 329 | 330 | Sse2.Store(c, vresult); 331 | 332 | i += 8; 333 | } 334 | 335 | while (i < len) 336 | { 337 | char* c = (char*)(pSource + i); 338 | *c = (Char)(*c & upperCharOffset); 339 | 340 | i += 1; 341 | } 342 | } 343 | } 344 | 345 | } 346 | } 347 | -------------------------------------------------------------------------------- /DoDSamples/Samples/POParser/Sample.po: -------------------------------------------------------------------------------- 1 | 1 2 | 2020-05-28T00:49:43 3 | 179 4 | curae; Pellentesque bibendum dolor massa non sagittis velit faucibus eu Quisque sed sem 5 | 6 | 2 7 | 2020-05-28T00:58:55 8 | 811 9 | nibh quis condimentum est lectus ac turpis Integer 10 | 11 | 3 12 | 2020-05-28T02:22:48 13 | 442 14 | fringilla orci vitae 15 | Lorem ipsum dolor 16 | 17 | 4 18 | 2020-05-28T03:41:18 19 | 502 20 | tellus quam venenatis nibh quis condimentum est lectus ac 21 | condimentum est lectus ac turpis Integer pretium gravida 22 | 23 | 5 24 | 2020-05-28T04:24:10 25 | 300 26 | lobortis fringilla orci vitae fermentum Nulla a mauris 27 | quis condimentum est lectus ac 28 | 29 | 6 30 | 2020-05-28T05:06:33 31 | 297 32 | lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in 33 | 34 | 7 35 | 2020-05-28T06:21:52 36 | 673 37 | nec ornare Maecenas et tempus dolor Aliquam non convallis quam Orci varius 38 | velit faucibus eu Quisque sed sem ac ipsum elementum bibendum id id tellus Pellentesque 39 | 40 | 8 41 | 2020-05-28T06:58:45 42 | 527 43 | tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris eu 44 | 45 | 9 46 | 2020-05-28T08:49:56 47 | 665 48 | eu Quisque sed sem 49 | 50 | 10 51 | 2020-05-28T09:30:40 52 | 877 53 | sit amet consectetur adipiscing elit 54 | 55 | 11 56 | 2020-05-28T10:50:10 57 | 209 58 | nibh quis condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum 59 | id tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla 60 | 61 | 12 62 | 2020-05-28T11:07:30 63 | 186 64 | gravida Vestibulum ante ipsum primis in faucibus orci luctus et 65 | bibendum id id 66 | 67 | 13 68 | 2020-05-28T12:22:57 69 | 194 70 | Aliquam non convallis quam Orci varius natoque penatibus et magnis dis parturient montes 71 | sed sem ac 72 | 73 | 14 74 | 2020-05-28T13:16:17 75 | 701 76 | tincidunt eleifend tellus quam venenatis nibh quis condimentum est 77 | 78 | 15 79 | 2020-05-28T14:04:16 80 | 831 81 | ipsum primis in faucibus orci luctus et ultrices posuere cubilia 82 | 83 | 16 84 | 2020-05-28T15:33:41 85 | 132 86 | Vestibulum ante ipsum primis in 87 | 88 | 17 89 | 2020-05-28T16:41:51 90 | 452 91 | quis arcu vel massa bibendum 92 | turpis Integer pretium gravida gravida Vestibulum 93 | 94 | 18 95 | 2020-05-28T17:20:23 96 | 644 97 | viverra nec eleifend diam Duis quis arcu vel massa bibendum porta Ut vehicula 98 | Duis quis arcu vel massa bibendum porta Ut vehicula sed purus 99 | 100 | 19 101 | 2020-05-28T18:37:59 102 | 191 103 | eleifend tellus quam venenatis nibh quis condimentum est lectus 104 | 105 | 20 106 | 2020-05-28T18:57:56 107 | 768 108 | ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in faucibus orci 109 | bibendum id id tellus Pellentesque lobortis fringilla orci 110 | 111 | 21 112 | 2020-05-28T20:23:12 113 | 404 114 | ornare Maecenas et tempus 115 | condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum 116 | 117 | 22 118 | 2020-05-28T21:43:43 119 | 843 120 | sed sem ac ipsum elementum bibendum id id tellus Pellentesque 121 | faucibus eu Quisque sed sem ac ipsum elementum bibendum id 122 | 123 | 23 124 | 2020-05-28T22:12:27 125 | 296 126 | faucibus eu Quisque sed 127 | 128 | 24 129 | 2020-05-28T23:53:00 130 | 645 131 | nec eleifend diam Duis quis arcu 132 | velit faucibus eu Quisque sed sem ac 133 | 134 | 25 135 | 2020-05-29T00:18:38 136 | 104 137 | Orci varius natoque penatibus et magnis dis 138 | pretium gravida gravida Vestibulum 139 | 140 | 26 141 | 2020-05-29T01:40:37 142 | 607 143 | quis condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis 144 | amet consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam 145 | 146 | 27 147 | 2020-05-29T02:09:14 148 | 698 149 | diam Duis quis 150 | 151 | 28 152 | 2020-05-29T03:49:53 153 | 577 154 | orci vitae fermentum Nulla 155 | 156 | 29 157 | 2020-05-29T04:33:32 158 | 587 159 | Vestibulum ante ipsum primis in faucibus 160 | tempus dolor Aliquam non convallis quam Orci 161 | 162 | 30 163 | 2020-05-29T05:41:01 164 | 522 165 | Ut vehicula sed purus nec ornare Maecenas et tempus dolor Aliquam non 166 | ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci 167 | 168 | 31 169 | 2020-05-29T06:03:48 170 | 140 171 | Nulla a mauris eu sapien luctus viverra nec eleifend diam Duis quis arcu vel 172 | 173 | 32 174 | 2020-05-29T07:41:03 175 | 537 176 | elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh 177 | 178 | 33 179 | 2020-05-29T08:15:20 180 | 374 181 | Duis quis arcu vel massa bibendum porta Ut vehicula 182 | 183 | 34 184 | 2020-05-29T09:13:54 185 | 723 186 | id tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla 187 | 188 | 35 189 | 2020-05-29T10:00:06 190 | 796 191 | natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 192 | 193 | 36 194 | 2020-05-29T11:35:29 195 | 317 196 | orci luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non sagittis velit 197 | luctus viverra nec eleifend diam Duis quis arcu vel massa bibendum porta 198 | 199 | 37 200 | 2020-05-29T12:36:21 201 | 235 202 | orci luctus et ultrices posuere cubilia curae; Pellentesque 203 | arcu vel massa 204 | 205 | 38 206 | 2020-05-29T13:45:44 207 | 317 208 | Quisque gravida dolor at tincidunt eleifend tellus quam 209 | mauris eu sapien luctus viverra nec eleifend diam Duis quis arcu vel massa bibendum 210 | 211 | 39 212 | 2020-05-29T13:59:56 213 | 793 214 | fermentum Nulla a mauris eu sapien luctus viverra nec eleifend diam Duis quis 215 | 216 | 40 217 | 2020-05-29T15:14:16 218 | 580 219 | id id tellus Pellentesque lobortis fringilla 220 | gravida gravida Vestibulum 221 | 222 | 41 223 | 2020-05-29T16:46:33 224 | 756 225 | natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 226 | luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non sagittis 227 | 228 | 42 229 | 2020-05-29T17:48:34 230 | 826 231 | est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis 232 | 233 | 43 234 | 2020-05-29T18:01:25 235 | 609 236 | porta Ut vehicula sed purus nec ornare Maecenas 237 | 238 | 44 239 | 2020-05-29T19:18:13 240 | 471 241 | turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in 242 | quam venenatis nibh 243 | 244 | 45 245 | 2020-05-29T20:04:49 246 | 199 247 | consectetur adipiscing elit Quisque 248 | Ut vehicula sed purus nec ornare Maecenas et tempus dolor Aliquam non convallis 249 | 250 | 46 251 | 2020-05-29T21:09:24 252 | 507 253 | cubilia curae; Pellentesque bibendum dolor massa non sagittis velit faucibus eu Quisque 254 | 255 | 47 256 | 2020-05-29T22:31:32 257 | 454 258 | Lorem ipsum dolor sit amet 259 | 260 | 48 261 | 2020-05-29T23:49:28 262 | 470 263 | at tincidunt eleifend tellus 264 | sapien luctus viverra nec eleifend diam Duis quis arcu vel massa 265 | 266 | 49 267 | 2020-05-30T00:50:05 268 | 615 269 | ipsum dolor sit amet consectetur adipiscing elit Quisque 270 | tellus quam venenatis nibh quis condimentum est lectus ac turpis Integer pretium gravida gravida 271 | 272 | 50 273 | 2020-05-30T01:06:38 274 | 789 275 | porta Ut vehicula sed purus nec ornare Maecenas 276 | consectetur adipiscing elit Quisque gravida dolor at tincidunt 277 | 278 | 51 279 | 2020-05-30T02:40:58 280 | 688 281 | bibendum id id tellus Pellentesque lobortis fringilla orci 282 | at tincidunt eleifend tellus quam venenatis nibh quis condimentum est lectus 283 | 284 | 52 285 | 2020-05-30T03:42:21 286 | 775 287 | mauris eu sapien luctus 288 | 289 | 53 290 | 2020-05-30T04:24:24 291 | 312 292 | lectus ac turpis 293 | 294 | 54 295 | 2020-05-30T05:13:56 296 | 708 297 | non convallis quam Orci varius natoque penatibus et magnis dis parturient 298 | mauris eu sapien luctus viverra 299 | 300 | 55 301 | 2020-05-30T06:01:36 302 | 503 303 | at tincidunt eleifend tellus quam venenatis nibh quis condimentum 304 | vitae fermentum Nulla a mauris eu sapien luctus 305 | 306 | 56 307 | 2020-05-30T07:10:30 308 | 857 309 | condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum ante 310 | 311 | 57 312 | 2020-05-30T07:59:20 313 | 260 314 | sem ac ipsum 315 | 316 | 58 317 | 2020-05-30T09:19:19 318 | 641 319 | venenatis nibh quis 320 | 321 | 59 322 | 2020-05-30T10:01:06 323 | 645 324 | dolor Aliquam non convallis quam Orci varius natoque penatibus et 325 | 326 | 60 327 | 2020-05-30T11:18:49 328 | 536 329 | vel massa bibendum porta Ut vehicula sed purus nec ornare Maecenas et tempus dolor 330 | 331 | 61 332 | 2020-05-30T12:34:59 333 | 579 334 | gravida gravida Vestibulum ante ipsum primis in 335 | quis condimentum est 336 | 337 | 62 338 | 2020-05-30T13:29:33 339 | 115 340 | orci vitae fermentum Nulla a mauris eu sapien luctus viverra nec eleifend diam 341 | velit faucibus eu Quisque sed sem ac 342 | 343 | 63 344 | 2020-05-30T14:06:14 345 | 311 346 | gravida Vestibulum ante 347 | 348 | 64 349 | 2020-05-30T15:38:22 350 | 624 351 | nec eleifend diam Duis 352 | 353 | 65 354 | 2020-05-30T16:41:11 355 | 161 356 | Maecenas et tempus dolor Aliquam non convallis quam Orci varius 357 | ornare Maecenas et tempus dolor 358 | 359 | 66 360 | 2020-05-30T17:02:03 361 | 602 362 | luctus viverra nec 363 | bibendum id id tellus Pellentesque lobortis fringilla 364 | 365 | 67 366 | 2020-05-30T18:49:05 367 | 801 368 | dolor at tincidunt eleifend tellus 369 | 370 | 68 371 | 2020-05-30T19:49:30 372 | 408 373 | massa bibendum porta Ut vehicula sed purus nec ornare Maecenas 374 | vehicula sed purus nec ornare Maecenas 375 | 376 | 69 377 | 2020-05-30T20:48:25 378 | 703 379 | gravida gravida Vestibulum ante ipsum 380 | massa non sagittis 381 | 382 | 70 383 | 2020-05-30T21:25:49 384 | 467 385 | gravida Vestibulum ante ipsum primis in 386 | 387 | 71 388 | 2020-05-30T22:31:21 389 | 468 390 | orci vitae fermentum Nulla a mauris eu sapien luctus viverra 391 | 392 | 72 393 | 2020-05-30T23:41:04 394 | 764 395 | Vestibulum ante ipsum primis in faucibus orci luctus et ultrices 396 | 397 | 73 398 | 2020-05-31T00:42:16 399 | 293 400 | Orci varius natoque penatibus et magnis dis parturient montes nascetur 401 | lobortis fringilla orci 402 | 403 | 74 404 | 2020-05-31T01:33:53 405 | 776 406 | et tempus dolor Aliquam non 407 | quis condimentum est lectus ac turpis Integer pretium 408 | 409 | 75 410 | 2020-05-31T02:56:11 411 | 767 412 | ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in faucibus orci luctus 413 | 414 | 76 415 | 2020-05-31T03:32:53 416 | 381 417 | venenatis nibh quis condimentum est lectus ac turpis 418 | 419 | 77 420 | 2020-05-31T04:40:23 421 | 274 422 | ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia 423 | 424 | 78 425 | 2020-05-31T05:54:18 426 | 462 427 | id tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris eu 428 | 429 | 79 430 | 2020-05-31T06:45:52 431 | 226 432 | vel massa bibendum porta 433 | 434 | 80 435 | 2020-05-31T07:21:26 436 | 438 437 | consectetur adipiscing elit Quisque gravida 438 | 439 | 81 440 | 2020-05-31T08:31:33 441 | 159 442 | lobortis fringilla orci vitae fermentum Nulla a mauris eu 443 | 444 | 82 445 | 2020-05-31T09:18:49 446 | 133 447 | massa bibendum porta Ut vehicula sed purus nec ornare Maecenas et tempus dolor Aliquam 448 | 449 | 83 450 | 2020-05-31T10:50:13 451 | 449 452 | at tincidunt eleifend 453 | ipsum dolor sit amet consectetur 454 | 455 | 84 456 | 2020-05-31T11:18:08 457 | 299 458 | convallis quam Orci varius natoque penatibus et magnis dis parturient montes nascetur 459 | Integer pretium gravida gravida Vestibulum ante ipsum primis 460 | 461 | 85 462 | 2020-05-31T12:20:36 463 | 402 464 | Orci varius natoque penatibus et magnis 465 | 466 | 86 467 | 2020-05-31T13:24:53 468 | 192 469 | natoque penatibus et magnis 470 | 471 | 87 472 | 2020-05-31T14:28:03 473 | 889 474 | Aliquam non convallis quam Orci 475 | 476 | 88 477 | 2020-05-31T15:30:21 478 | 818 479 | primis in faucibus orci luctus et 480 | curae; Pellentesque bibendum dolor massa 481 | 482 | 89 483 | 2020-05-31T16:35:10 484 | 549 485 | eleifend tellus quam 486 | a mauris eu sapien luctus viverra nec eleifend diam Duis quis arcu 487 | 488 | 90 489 | 2020-05-31T17:15:48 490 | 162 491 | et ultrices posuere cubilia 492 | 493 | 91 494 | 2020-05-31T18:43:35 495 | 745 496 | ipsum primis in faucibus orci luctus 497 | 498 | 92 499 | 2020-05-31T19:46:05 500 | 483 501 | fermentum Nulla a 502 | adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh quis 503 | 504 | 93 505 | 2020-05-31T20:10:30 506 | 567 507 | curae; Pellentesque bibendum dolor massa 508 | 509 | 94 510 | 2020-05-31T21:27:57 511 | 498 512 | tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla 513 | nec eleifend diam Duis 514 | 515 | 95 516 | 2020-05-31T21:59:30 517 | 404 518 | orci luctus et 519 | 520 | 96 521 | 2020-05-31T23:45:44 522 | 517 523 | ipsum dolor sit amet consectetur adipiscing elit Quisque gravida dolor at tincidunt 524 | 525 | 97 526 | 2020-06-01T00:10:57 527 | 278 528 | sapien luctus viverra nec eleifend diam Duis quis arcu 529 | ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non 530 | 531 | 98 532 | 2020-06-01T00:59:02 533 | 733 534 | ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in faucibus 535 | elit Quisque gravida dolor at tincidunt eleifend tellus 536 | 537 | 99 538 | 2020-06-01T02:25:15 539 | 480 540 | nec ornare Maecenas et tempus dolor Aliquam non convallis quam 541 | 542 | 100 543 | 2020-06-01T03:34:21 544 | 647 545 | sed sem ac ipsum elementum bibendum 546 | 547 | 101 548 | 2020-06-01T04:39:20 549 | 264 550 | sit amet consectetur adipiscing elit Quisque gravida dolor at tincidunt 551 | 552 | 102 553 | 2020-06-01T05:35:57 554 | 133 555 | quam venenatis nibh quis condimentum 556 | 557 | 103 558 | 2020-06-01T06:30:55 559 | 604 560 | sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci vitae 561 | porta Ut vehicula sed purus nec ornare Maecenas et tempus 562 | 563 | 104 564 | 2020-06-01T07:09:55 565 | 393 566 | sed purus nec ornare Maecenas et tempus dolor Aliquam non convallis quam Orci 567 | sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci vitae 568 | 569 | 105 570 | 2020-06-01T08:28:35 571 | 587 572 | amet consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis 573 | massa bibendum porta Ut vehicula sed 574 | 575 | 106 576 | 2020-06-01T09:28:34 577 | 402 578 | consectetur adipiscing elit Quisque gravida dolor at tincidunt 579 | 580 | 107 581 | 2020-06-01T10:04:50 582 | 479 583 | nec ornare Maecenas et tempus dolor Aliquam non convallis quam Orci varius natoque 584 | 585 | 108 586 | 2020-06-01T11:13:48 587 | 286 588 | massa bibendum porta Ut vehicula sed 589 | 590 | 109 591 | 2020-06-01T12:03:07 592 | 717 593 | Ut vehicula sed purus nec ornare Maecenas et 594 | 595 | 110 596 | 2020-06-01T13:32:28 597 | 278 598 | sem ac ipsum elementum bibendum 599 | eu Quisque sed sem ac ipsum elementum bibendum id id tellus 600 | 601 | 111 602 | 2020-06-01T14:00:15 603 | 743 604 | ac ipsum elementum bibendum id id tellus 605 | vitae fermentum Nulla a mauris eu sapien luctus viverra nec eleifend diam Duis 606 | 607 | 112 608 | 2020-06-01T15:03:56 609 | 627 610 | Lorem ipsum dolor 611 | Pellentesque bibendum dolor massa non sagittis velit faucibus 612 | 613 | 113 614 | 2020-06-01T16:21:04 615 | 887 616 | ipsum elementum bibendum id id tellus Pellentesque 617 | 618 | 114 619 | 2020-06-01T17:39:12 620 | 623 621 | arcu vel massa bibendum porta 622 | tellus quam venenatis nibh quis condimentum est 623 | 624 | 115 625 | 2020-06-01T17:57:25 626 | 800 627 | varius natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 628 | 629 | 116 630 | 2020-06-01T19:04:20 631 | 875 632 | Maecenas et tempus dolor Aliquam non convallis quam 633 | 634 | 117 635 | 2020-06-01T20:02:54 636 | 176 637 | Ut vehicula sed purus nec ornare Maecenas et 638 | et tempus dolor Aliquam non 639 | 640 | 118 641 | 2020-06-01T21:06:08 642 | 286 643 | faucibus orci luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non 644 | gravida gravida Vestibulum ante ipsum primis in faucibus orci luctus 645 | 646 | 119 647 | 2020-06-01T22:54:41 648 | 556 649 | Pellentesque bibendum dolor massa non sagittis 650 | eu sapien luctus 651 | 652 | 120 653 | 2020-06-01T23:23:39 654 | 811 655 | sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla 656 | 657 | 121 658 | 2020-06-02T00:56:09 659 | 865 660 | dolor at tincidunt eleifend tellus quam venenatis 661 | eleifend diam Duis quis arcu vel massa bibendum porta Ut vehicula 662 | 663 | 122 664 | 2020-06-02T01:07:37 665 | 614 666 | ipsum elementum bibendum id id tellus 667 | gravida gravida Vestibulum ante ipsum primis 668 | 669 | 123 670 | 2020-06-02T02:20:21 671 | 539 672 | Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia curae; 673 | sapien luctus viverra nec eleifend diam Duis 674 | 675 | 124 676 | 2020-06-02T03:45:08 677 | 586 678 | Duis quis arcu vel massa bibendum porta Ut vehicula sed purus nec ornare Maecenas 679 | tellus quam venenatis nibh quis condimentum est lectus ac turpis Integer pretium gravida 680 | 681 | 125 682 | 2020-06-02T04:47:47 683 | 677 684 | vel massa bibendum porta Ut vehicula sed purus nec ornare Maecenas et tempus dolor 685 | 686 | 126 687 | 2020-06-02T05:07:44 688 | 533 689 | venenatis nibh quis condimentum est lectus 690 | 691 | 127 692 | 2020-06-02T06:42:20 693 | 712 694 | nibh quis condimentum est lectus 695 | ipsum dolor sit amet consectetur adipiscing elit 696 | 697 | 128 698 | 2020-06-02T07:51:43 699 | 238 700 | non sagittis velit faucibus eu Quisque sed sem ac ipsum 701 | luctus viverra nec eleifend diam Duis quis 702 | 703 | 129 704 | 2020-06-02T08:35:17 705 | 724 706 | fermentum Nulla a mauris eu sapien luctus 707 | 708 | 130 709 | 2020-06-02T09:32:39 710 | 740 711 | orci vitae fermentum 712 | 713 | 131 714 | 2020-06-02T10:53:07 715 | 245 716 | Orci varius natoque penatibus et magnis dis parturient montes nascetur 717 | porta Ut vehicula sed purus nec ornare Maecenas et 718 | 719 | 132 720 | 2020-06-02T11:37:46 721 | 696 722 | viverra nec eleifend diam Duis quis 723 | in faucibus orci luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor 724 | 725 | 133 726 | 2020-06-02T12:33:09 727 | 664 728 | sed purus nec ornare Maecenas et tempus dolor Aliquam non convallis quam 729 | sit amet consectetur adipiscing elit 730 | 731 | 134 732 | 2020-06-02T13:52:07 733 | 780 734 | Lorem ipsum dolor sit amet 735 | 736 | 135 737 | 2020-06-02T14:24:35 738 | 721 739 | massa bibendum porta Ut vehicula sed purus nec ornare Maecenas et tempus dolor 740 | 741 | 136 742 | 2020-06-02T15:15:35 743 | 599 744 | nec ornare Maecenas et tempus dolor Aliquam non convallis 745 | amet consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis 746 | 747 | 137 748 | 2020-06-02T16:41:28 749 | 557 750 | ipsum primis in faucibus orci 751 | quis arcu vel massa bibendum porta Ut vehicula sed purus 752 | 753 | 138 754 | 2020-06-02T17:27:15 755 | 153 756 | non sagittis velit faucibus eu Quisque sed sem ac 757 | velit faucibus eu Quisque sed sem ac ipsum elementum 758 | 759 | 139 760 | 2020-06-02T18:22:39 761 | 423 762 | faucibus eu Quisque sed 763 | 764 | 140 765 | 2020-06-02T19:45:00 766 | 650 767 | nec ornare Maecenas et tempus dolor Aliquam 768 | 769 | 141 770 | 2020-06-02T20:01:13 771 | 582 772 | quam venenatis nibh quis condimentum est lectus ac turpis 773 | Integer pretium gravida gravida Vestibulum 774 | 775 | 142 776 | 2020-06-02T21:48:45 777 | 632 778 | ac ipsum elementum bibendum id id 779 | posuere cubilia curae; Pellentesque bibendum dolor massa non 780 | 781 | 143 782 | 2020-06-02T22:06:47 783 | 281 784 | et tempus dolor Aliquam non 785 | ipsum dolor sit amet consectetur adipiscing elit Quisque gravida dolor 786 | 787 | 144 788 | 2020-06-02T23:08:28 789 | 102 790 | purus nec ornare 791 | sed purus nec ornare Maecenas et 792 | 793 | 145 794 | 2020-06-02T23:59:02 795 | 592 796 | Quisque sed sem ac ipsum elementum bibendum id id 797 | 798 | 146 799 | 2020-06-03T01:26:07 800 | 761 801 | luctus et ultrices posuere cubilia curae; Pellentesque 802 | gravida dolor at tincidunt 803 | 804 | 147 805 | 2020-06-03T02:18:58 806 | 880 807 | non convallis quam Orci varius natoque penatibus et magnis dis 808 | 809 | 148 810 | 2020-06-03T03:43:04 811 | 820 812 | Ut vehicula sed purus nec ornare Maecenas et 813 | 814 | 149 815 | 2020-06-03T04:43:54 816 | 460 817 | Orci varius natoque penatibus et magnis 818 | luctus viverra nec eleifend diam Duis 819 | 820 | 150 821 | 2020-06-03T05:27:35 822 | 736 823 | vehicula sed purus nec ornare 824 | 825 | 151 826 | 2020-06-03T06:39:34 827 | 834 828 | nec eleifend diam Duis quis arcu vel 829 | 830 | 152 831 | 2020-06-03T07:02:25 832 | 387 833 | gravida Vestibulum ante ipsum primis in faucibus orci luctus et ultrices 834 | fermentum Nulla a mauris eu sapien luctus viverra nec eleifend diam Duis 835 | 836 | 153 837 | 2020-06-03T08:12:08 838 | 865 839 | tincidunt eleifend tellus quam venenatis nibh quis condimentum est lectus ac turpis 840 | 841 | 154 842 | 2020-06-03T09:36:38 843 | 303 844 | est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis 845 | 846 | 155 847 | 2020-06-03T10:51:51 848 | 437 849 | dolor at tincidunt eleifend tellus quam venenatis nibh quis 850 | consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam 851 | 852 | 156 853 | 2020-06-03T11:41:15 854 | 871 855 | massa non sagittis velit faucibus eu Quisque sed sem ac 856 | 857 | 157 858 | 2020-06-03T12:48:46 859 | 381 860 | bibendum id id tellus Pellentesque lobortis 861 | id tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris eu sapien luctus 862 | 863 | 158 864 | 2020-06-03T13:51:47 865 | 176 866 | Maecenas et tempus dolor Aliquam non convallis quam Orci varius natoque 867 | nec eleifend diam Duis quis arcu 868 | 869 | 159 870 | 2020-06-03T14:23:23 871 | 315 872 | est lectus ac turpis Integer pretium gravida gravida Vestibulum 873 | convallis quam Orci varius natoque penatibus et magnis dis parturient montes 874 | 875 | 160 876 | 2020-06-03T15:11:04 877 | 218 878 | lectus ac turpis Integer pretium gravida 879 | 880 | 161 881 | 2020-06-03T16:41:12 882 | 693 883 | bibendum id id tellus Pellentesque 884 | tempus dolor Aliquam non 885 | 886 | 162 887 | 2020-06-03T17:35:41 888 | 630 889 | posuere cubilia curae; Pellentesque bibendum 890 | 891 | 163 892 | 2020-06-03T18:37:09 893 | 622 894 | Pellentesque bibendum dolor massa non sagittis velit faucibus eu Quisque sed sem ac ipsum 895 | 896 | 164 897 | 2020-06-03T19:47:43 898 | 164 899 | mauris eu sapien luctus viverra nec eleifend diam Duis quis arcu vel 900 | tellus quam venenatis nibh quis condimentum est lectus ac turpis 901 | 902 | 165 903 | 2020-06-03T20:11:13 904 | 524 905 | nec ornare Maecenas et tempus dolor Aliquam 906 | 907 | 166 908 | 2020-06-03T21:38:56 909 | 863 910 | dolor at tincidunt 911 | vehicula sed purus 912 | 913 | 167 914 | 2020-06-03T22:23:45 915 | 605 916 | faucibus orci luctus et ultrices posuere cubilia 917 | 918 | 168 919 | 2020-06-03T23:44:32 920 | 179 921 | turpis Integer pretium gravida gravida Vestibulum 922 | eu Quisque sed sem ac 923 | 924 | 169 925 | 2020-06-04T00:40:51 926 | 611 927 | massa bibendum porta Ut vehicula sed purus nec ornare Maecenas et tempus dolor Aliquam 928 | 929 | 170 930 | 2020-06-04T00:57:10 931 | 126 932 | nec eleifend diam Duis quis arcu vel massa bibendum porta Ut vehicula 933 | 934 | 171 935 | 2020-06-04T02:25:28 936 | 126 937 | turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in faucibus orci luctus et 938 | et tempus dolor Aliquam non convallis quam Orci varius natoque penatibus et magnis dis 939 | 940 | 172 941 | 2020-06-04T03:47:02 942 | 316 943 | velit faucibus eu Quisque sed sem ac ipsum elementum bibendum id id 944 | 945 | 173 946 | 2020-06-04T04:45:43 947 | 628 948 | Ut vehicula sed purus nec ornare Maecenas 949 | vitae fermentum Nulla a mauris eu sapien luctus viverra nec eleifend diam Duis quis 950 | 951 | 174 952 | 2020-06-04T05:39:51 953 | 374 954 | consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh 955 | condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum 956 | 957 | 175 958 | 2020-06-04T06:04:06 959 | 308 960 | Ut vehicula sed 961 | dolor Aliquam non convallis quam Orci varius natoque penatibus et 962 | 963 | 176 964 | 2020-06-04T07:42:23 965 | 537 966 | lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in faucibus 967 | 968 | 177 969 | 2020-06-04T08:02:29 970 | 275 971 | nec ornare Maecenas et tempus 972 | massa bibendum porta Ut vehicula sed purus nec ornare Maecenas et tempus dolor 973 | 974 | 178 975 | 2020-06-04T09:38:37 976 | 369 977 | Pellentesque bibendum dolor massa non sagittis velit faucibus eu Quisque sed sem ac 978 | 979 | 179 980 | 2020-06-04T10:07:23 981 | 586 982 | ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia curae; 983 | adipiscing elit Quisque 984 | 985 | 180 986 | 2020-06-04T11:26:02 987 | 475 988 | condimentum est lectus ac turpis 989 | vel massa bibendum porta Ut vehicula sed purus nec 990 | 991 | 181 992 | 2020-06-04T12:12:05 993 | 111 994 | consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh quis 995 | 996 | 182 997 | 2020-06-04T13:47:00 998 | 318 999 | orci luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa 1000 | 1001 | 183 1002 | 2020-06-04T14:30:31 1003 | 305 1004 | vel massa bibendum porta Ut vehicula sed purus nec ornare Maecenas et 1005 | 1006 | 184 1007 | 2020-06-04T15:55:41 1008 | 843 1009 | lobortis fringilla orci vitae fermentum Nulla a mauris 1010 | 1011 | 185 1012 | 2020-06-04T16:26:25 1013 | 622 1014 | sed purus nec ornare Maecenas et tempus dolor 1015 | 1016 | 186 1017 | 2020-06-04T17:52:22 1018 | 150 1019 | orci luctus et ultrices posuere cubilia curae; Pellentesque 1020 | 1021 | 187 1022 | 2020-06-04T18:51:36 1023 | 134 1024 | Quisque sed sem ac ipsum elementum bibendum 1025 | 1026 | 188 1027 | 2020-06-04T19:28:47 1028 | 354 1029 | diam Duis quis 1030 | 1031 | 189 1032 | 2020-06-04T20:20:56 1033 | 359 1034 | sem ac ipsum elementum bibendum id 1035 | 1036 | 190 1037 | 2020-06-04T21:31:28 1038 | 651 1039 | condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum 1040 | tellus quam venenatis nibh quis 1041 | 1042 | 191 1043 | 2020-06-04T22:23:11 1044 | 345 1045 | Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh quis condimentum est 1046 | 1047 | 192 1048 | 2020-06-04T23:02:51 1049 | 883 1050 | vitae fermentum Nulla a mauris eu sapien 1051 | gravida dolor at tincidunt eleifend tellus quam venenatis 1052 | 1053 | 193 1054 | 2020-06-05T00:28:17 1055 | 691 1056 | bibendum porta Ut vehicula 1057 | faucibus orci luctus et 1058 | 1059 | 194 1060 | 2020-06-05T01:36:09 1061 | 562 1062 | posuere cubilia curae; Pellentesque bibendum dolor massa non sagittis velit faucibus 1063 | elementum bibendum id id tellus Pellentesque lobortis 1064 | 1065 | 195 1066 | 2020-06-05T02:10:09 1067 | 259 1068 | faucibus orci luctus et ultrices posuere cubilia curae; Pellentesque 1069 | 1070 | 196 1071 | 2020-06-05T03:19:47 1072 | 328 1073 | cubilia curae; Pellentesque bibendum dolor massa non sagittis velit faucibus eu Quisque 1074 | gravida dolor at tincidunt eleifend tellus quam venenatis nibh quis condimentum 1075 | 1076 | 197 1077 | 2020-06-05T04:15:28 1078 | 242 1079 | viverra nec eleifend diam Duis quis arcu vel massa bibendum porta Ut vehicula sed 1080 | bibendum dolor massa non sagittis velit faucibus eu Quisque sed sem ac 1081 | 1082 | 198 1083 | 2020-06-05T05:29:26 1084 | 817 1085 | dolor sit amet consectetur adipiscing elit Quisque gravida dolor at tincidunt 1086 | nec eleifend diam Duis quis 1087 | 1088 | 199 1089 | 2020-06-05T06:26:49 1090 | 339 1091 | primis in faucibus orci luctus et ultrices 1092 | Integer pretium gravida gravida Vestibulum ante 1093 | 1094 | 200 1095 | 2020-06-05T07:39:11 1096 | 640 1097 | cubilia curae; Pellentesque bibendum dolor massa non sagittis velit faucibus eu Quisque sed sem 1098 | 1099 | 201 1100 | 2020-06-05T08:04:20 1101 | 393 1102 | Ut vehicula sed purus nec ornare Maecenas et tempus 1103 | 1104 | 202 1105 | 2020-06-05T09:44:38 1106 | 129 1107 | Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh quis 1108 | 1109 | 203 1110 | 2020-06-05T10:05:43 1111 | 472 1112 | in faucibus orci luctus et ultrices 1113 | 1114 | 204 1115 | 2020-06-05T11:14:10 1116 | 175 1117 | venenatis nibh quis condimentum est lectus 1118 | condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis 1119 | 1120 | 205 1121 | 2020-06-05T12:10:56 1122 | 458 1123 | turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in faucibus orci luctus 1124 | fermentum Nulla a mauris eu sapien luctus viverra 1125 | 1126 | 206 1127 | 2020-06-05T12:58:22 1128 | 392 1129 | venenatis nibh quis condimentum est lectus ac turpis Integer 1130 | 1131 | 207 1132 | 2020-06-05T14:30:18 1133 | 268 1134 | adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam 1135 | porta Ut vehicula sed purus 1136 | 1137 | 208 1138 | 2020-06-05T15:19:30 1139 | 329 1140 | Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris eu sapien luctus viverra 1141 | 1142 | 209 1143 | 2020-06-05T16:22:50 1144 | 312 1145 | tempus dolor Aliquam 1146 | ipsum primis in faucibus orci luctus et ultrices posuere cubilia curae; Pellentesque bibendum 1147 | 1148 | 210 1149 | 2020-06-05T17:16:36 1150 | 864 1151 | tincidunt eleifend tellus quam venenatis nibh quis condimentum est lectus 1152 | quis condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum 1153 | 1154 | 211 1155 | 2020-06-05T18:13:00 1156 | 497 1157 | eleifend diam Duis 1158 | condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in 1159 | 1160 | 212 1161 | 2020-06-05T19:48:16 1162 | 623 1163 | arcu vel massa bibendum porta 1164 | 1165 | 213 1166 | 2020-06-05T20:56:29 1167 | 441 1168 | ipsum dolor sit amet consectetur 1169 | 1170 | 214 1171 | 2020-06-05T21:29:54 1172 | 278 1173 | pretium gravida gravida 1174 | venenatis nibh quis condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum 1175 | 1176 | 215 1177 | 2020-06-05T22:06:06 1178 | 492 1179 | nec eleifend diam Duis quis arcu vel massa bibendum porta Ut vehicula sed 1180 | 1181 | 216 1182 | 2020-06-05T23:38:09 1183 | 686 1184 | ornare Maecenas et tempus 1185 | 1186 | 217 1187 | 2020-06-06T00:03:48 1188 | 383 1189 | ipsum elementum bibendum id id tellus 1190 | 1191 | 218 1192 | 2020-06-06T01:12:50 1193 | 110 1194 | mauris eu sapien luctus viverra nec eleifend diam Duis quis arcu vel 1195 | 1196 | 219 1197 | 2020-06-06T02:53:48 1198 | 609 1199 | elementum bibendum id id tellus Pellentesque lobortis fringilla 1200 | ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci 1201 | 1202 | 220 1203 | 2020-06-06T03:12:37 1204 | 870 1205 | sapien luctus viverra nec eleifend diam Duis quis 1206 | 1207 | 221 1208 | 2020-06-06T04:37:48 1209 | 260 1210 | ipsum primis in faucibus orci luctus et ultrices posuere cubilia curae; 1211 | fringilla orci vitae fermentum Nulla a mauris eu sapien 1212 | 1213 | 222 1214 | 2020-06-06T05:50:07 1215 | 482 1216 | consectetur adipiscing elit 1217 | 1218 | 223 1219 | 2020-06-06T06:42:12 1220 | 177 1221 | in faucibus orci luctus et ultrices posuere cubilia curae; Pellentesque 1222 | 1223 | 224 1224 | 2020-06-06T07:31:06 1225 | 727 1226 | Duis quis arcu vel massa bibendum porta 1227 | elementum bibendum id id tellus Pellentesque lobortis fringilla orci 1228 | 1229 | 225 1230 | 2020-06-06T08:16:35 1231 | 604 1232 | orci vitae fermentum Nulla a mauris 1233 | elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh quis condimentum est 1234 | 1235 | 226 1236 | 2020-06-06T09:50:06 1237 | 265 1238 | est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum 1239 | purus nec ornare Maecenas et tempus dolor 1240 | 1241 | 227 1242 | 2020-06-06T10:38:12 1243 | 357 1244 | mauris eu sapien 1245 | lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in faucibus 1246 | 1247 | 228 1248 | 2020-06-06T10:59:11 1249 | 686 1250 | posuere cubilia curae; Pellentesque bibendum dolor 1251 | 1252 | 229 1253 | 2020-06-06T12:15:58 1254 | 163 1255 | faucibus eu Quisque sed sem ac ipsum 1256 | luctus et ultrices posuere cubilia curae; 1257 | 1258 | 230 1259 | 2020-06-06T13:52:10 1260 | 120 1261 | Maecenas et tempus dolor Aliquam 1262 | 1263 | 231 1264 | 2020-06-06T14:02:48 1265 | 429 1266 | pretium gravida gravida Vestibulum ante ipsum primis in faucibus orci 1267 | 1268 | 232 1269 | 2020-06-06T15:38:03 1270 | 710 1271 | ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla 1272 | velit faucibus eu Quisque sed sem ac ipsum elementum bibendum id id tellus 1273 | 1274 | 233 1275 | 2020-06-06T16:18:35 1276 | 315 1277 | est lectus ac 1278 | 1279 | 234 1280 | 2020-06-06T17:32:12 1281 | 884 1282 | ornare Maecenas et tempus dolor Aliquam non convallis quam Orci varius natoque 1283 | tellus quam venenatis nibh 1284 | 1285 | 235 1286 | 2020-06-06T18:33:16 1287 | 825 1288 | Quisque gravida dolor at tincidunt eleifend tellus quam venenatis 1289 | sed sem ac ipsum elementum bibendum 1290 | 1291 | 236 1292 | 2020-06-06T19:15:39 1293 | 732 1294 | massa non sagittis velit faucibus eu Quisque sed 1295 | gravida Vestibulum ante ipsum 1296 | 1297 | 237 1298 | 2020-06-06T19:58:44 1299 | 858 1300 | elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh quis condimentum 1301 | curae; Pellentesque bibendum dolor massa non sagittis velit faucibus eu Quisque sed 1302 | 1303 | 238 1304 | 2020-06-06T21:07:20 1305 | 428 1306 | Maecenas et tempus 1307 | lobortis fringilla orci vitae fermentum Nulla 1308 | 1309 | 239 1310 | 2020-06-06T22:31:29 1311 | 847 1312 | adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh 1313 | bibendum dolor massa non sagittis velit faucibus eu Quisque 1314 | 1315 | 240 1316 | 2020-06-06T23:06:09 1317 | 896 1318 | sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla 1319 | 1320 | 241 1321 | 2020-06-07T00:49:29 1322 | 254 1323 | ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia 1324 | cubilia curae; Pellentesque bibendum dolor massa non sagittis velit faucibus eu Quisque 1325 | 1326 | 242 1327 | 2020-06-07T01:45:30 1328 | 418 1329 | adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh quis condimentum 1330 | et ultrices posuere cubilia curae; Pellentesque bibendum 1331 | 1332 | 243 1333 | 2020-06-07T02:27:49 1334 | 337 1335 | quis condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum 1336 | 1337 | 244 1338 | 2020-06-07T03:10:42 1339 | 501 1340 | non sagittis velit faucibus eu 1341 | dolor at tincidunt eleifend tellus quam venenatis nibh quis condimentum est lectus ac turpis 1342 | 1343 | 245 1344 | 2020-06-07T04:14:07 1345 | 835 1346 | amet consectetur adipiscing elit Quisque gravida 1347 | 1348 | 246 1349 | 2020-06-07T05:42:36 1350 | 203 1351 | Quisque gravida dolor at tincidunt eleifend 1352 | 1353 | 247 1354 | 2020-06-07T06:45:58 1355 | 717 1356 | Maecenas et tempus dolor Aliquam non convallis 1357 | viverra nec eleifend diam Duis quis arcu 1358 | 1359 | 248 1360 | 2020-06-07T07:36:22 1361 | 345 1362 | luctus et ultrices posuere cubilia curae; Pellentesque bibendum 1363 | luctus et ultrices posuere 1364 | 1365 | 249 1366 | 2020-06-07T08:34:56 1367 | 476 1368 | non sagittis velit faucibus eu Quisque sed sem ac ipsum elementum 1369 | bibendum id id tellus Pellentesque lobortis fringilla orci 1370 | 1371 | 250 1372 | 2020-06-07T09:18:59 1373 | 538 1374 | cubilia curae; Pellentesque bibendum dolor massa 1375 | 1376 | 251 1377 | 2020-06-07T10:33:03 1378 | 592 1379 | id id tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris eu 1380 | posuere cubilia curae; Pellentesque bibendum dolor massa non sagittis 1381 | 1382 | 252 1383 | 2020-06-07T11:08:15 1384 | 317 1385 | fringilla orci vitae fermentum Nulla a mauris eu sapien luctus viverra nec eleifend diam 1386 | 1387 | 253 1388 | 2020-06-07T12:22:35 1389 | 628 1390 | sed sem ac ipsum elementum 1391 | 1392 | 254 1393 | 2020-06-07T13:15:09 1394 | 628 1395 | sed sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci vitae 1396 | vel massa bibendum 1397 | 1398 | 255 1399 | 2020-06-07T14:10:00 1400 | 486 1401 | adipiscing elit Quisque gravida dolor 1402 | sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci vitae fermentum 1403 | 1404 | 256 1405 | 2020-06-07T15:41:00 1406 | 220 1407 | eleifend diam Duis quis 1408 | 1409 | 257 1410 | 2020-06-07T15:58:29 1411 | 632 1412 | gravida dolor at 1413 | 1414 | 258 1415 | 2020-06-07T17:51:07 1416 | 267 1417 | nec ornare Maecenas et tempus dolor Aliquam non convallis 1418 | 1419 | 259 1420 | 2020-06-07T18:20:13 1421 | 239 1422 | sagittis velit faucibus eu Quisque sed sem ac ipsum 1423 | luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor 1424 | 1425 | 260 1426 | 2020-06-07T19:17:24 1427 | 446 1428 | quam venenatis nibh quis 1429 | 1430 | 261 1431 | 2020-06-07T20:12:12 1432 | 779 1433 | tellus quam venenatis nibh quis condimentum est 1434 | eleifend tellus quam venenatis 1435 | 1436 | 262 1437 | 2020-06-07T21:44:38 1438 | 104 1439 | vitae fermentum Nulla a mauris eu sapien luctus 1440 | orci luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non 1441 | 1442 | 263 1443 | 2020-06-07T22:18:07 1444 | 623 1445 | a mauris eu sapien 1446 | quis condimentum est lectus ac turpis Integer pretium gravida 1447 | 1448 | 264 1449 | 2020-06-07T23:26:35 1450 | 195 1451 | Vestibulum ante ipsum primis in faucibus orci luctus et 1452 | pretium gravida gravida Vestibulum ante 1453 | 1454 | 265 1455 | 2020-06-08T00:33:48 1456 | 366 1457 | Aliquam non convallis quam Orci varius natoque penatibus et 1458 | luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non 1459 | 1460 | 266 1461 | 2020-06-08T01:43:12 1462 | 399 1463 | sed purus nec ornare Maecenas et tempus dolor Aliquam non convallis quam Orci varius 1464 | dolor massa non sagittis 1465 | 1466 | 267 1467 | 2020-06-08T02:22:13 1468 | 585 1469 | bibendum porta Ut 1470 | ipsum dolor sit amet 1471 | 1472 | 268 1473 | 2020-06-08T03:41:15 1474 | 181 1475 | et ultrices posuere cubilia curae; Pellentesque bibendum 1476 | massa non sagittis velit faucibus eu Quisque sed 1477 | 1478 | 269 1479 | 2020-06-08T04:33:25 1480 | 490 1481 | bibendum porta Ut vehicula 1482 | 1483 | 270 1484 | 2020-06-08T05:52:59 1485 | 341 1486 | Integer pretium gravida gravida 1487 | 1488 | 271 1489 | 2020-06-08T06:31:04 1490 | 374 1491 | cubilia curae; Pellentesque bibendum dolor massa non sagittis velit faucibus eu Quisque sed 1492 | Quisque sed sem ac ipsum elementum 1493 | 1494 | 272 1495 | 2020-06-08T07:21:12 1496 | 301 1497 | massa bibendum porta Ut vehicula sed purus nec 1498 | 1499 | 273 1500 | 2020-06-08T08:12:48 1501 | 143 1502 | sed purus nec ornare Maecenas et tempus dolor Aliquam non convallis quam Orci 1503 | 1504 | 274 1505 | 2020-06-08T09:41:31 1506 | 641 1507 | nec ornare Maecenas et tempus dolor Aliquam non convallis quam Orci varius 1508 | 1509 | 275 1510 | 2020-06-08T10:26:10 1511 | 807 1512 | tellus quam venenatis 1513 | 1514 | 276 1515 | 2020-06-08T11:00:26 1516 | 280 1517 | in faucibus orci luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non 1518 | non sagittis velit faucibus eu Quisque sed sem ac ipsum elementum bibendum id 1519 | 1520 | 277 1521 | 2020-06-08T12:05:33 1522 | 313 1523 | Vestibulum ante ipsum 1524 | viverra nec eleifend diam Duis quis 1525 | 1526 | 278 1527 | 2020-06-08T12:59:33 1528 | 269 1529 | orci vitae fermentum Nulla a mauris eu sapien 1530 | 1531 | 279 1532 | 2020-06-08T14:51:53 1533 | 393 1534 | Nulla a mauris eu sapien luctus viverra 1535 | condimentum est lectus ac turpis Integer pretium 1536 | 1537 | 280 1538 | 2020-06-08T15:16:22 1539 | 876 1540 | Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia 1541 | tellus Pellentesque lobortis fringilla orci 1542 | 1543 | 281 1544 | 2020-06-08T16:42:03 1545 | 326 1546 | velit faucibus eu Quisque sed sem ac ipsum elementum bibendum id id 1547 | at tincidunt eleifend tellus quam venenatis nibh 1548 | 1549 | 282 1550 | 2020-06-08T17:01:18 1551 | 797 1552 | amet consectetur adipiscing elit Quisque gravida dolor 1553 | luctus et ultrices posuere cubilia curae; Pellentesque bibendum 1554 | 1555 | 283 1556 | 2020-06-08T18:20:12 1557 | 830 1558 | velit faucibus eu Quisque sed 1559 | 1560 | 284 1561 | 2020-06-08T19:47:36 1562 | 836 1563 | elementum bibendum id id tellus Pellentesque lobortis fringilla 1564 | faucibus eu Quisque sed sem ac ipsum elementum bibendum id id 1565 | 1566 | 285 1567 | 2020-06-08T20:13:47 1568 | 780 1569 | diam Duis quis arcu vel massa bibendum porta Ut vehicula sed purus nec 1570 | diam Duis quis arcu vel massa bibendum porta Ut vehicula sed purus nec 1571 | 1572 | 286 1573 | 2020-06-08T21:14:04 1574 | 795 1575 | elementum bibendum id id 1576 | eleifend tellus quam venenatis nibh quis condimentum 1577 | 1578 | 287 1579 | 2020-06-08T22:01:28 1580 | 322 1581 | dolor at tincidunt eleifend tellus quam venenatis 1582 | 1583 | 288 1584 | 2020-06-08T23:01:21 1585 | 892 1586 | condimentum est lectus ac turpis Integer pretium 1587 | turpis Integer pretium gravida gravida Vestibulum ante 1588 | 1589 | 289 1590 | 2020-06-09T00:52:29 1591 | 503 1592 | non sagittis velit faucibus eu Quisque sed sem ac ipsum 1593 | adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam 1594 | 1595 | 290 1596 | 2020-06-09T01:35:35 1597 | 446 1598 | arcu vel massa bibendum 1599 | 1600 | 291 1601 | 2020-06-09T02:37:30 1602 | 629 1603 | ipsum primis in faucibus orci luctus et 1604 | 1605 | 292 1606 | 2020-06-09T03:51:05 1607 | 801 1608 | dolor at tincidunt eleifend tellus quam venenatis nibh quis condimentum est lectus ac 1609 | 1610 | 293 1611 | 2020-06-09T03:58:59 1612 | 503 1613 | eu Quisque sed sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis 1614 | 1615 | 294 1616 | 2020-06-09T05:33:51 1617 | 696 1618 | velit faucibus eu Quisque sed sem ac ipsum 1619 | faucibus orci luctus 1620 | 1621 | 295 1622 | 2020-06-09T06:06:56 1623 | 843 1624 | id id tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris 1625 | 1626 | 296 1627 | 2020-06-09T07:33:04 1628 | 152 1629 | est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum 1630 | quam Orci varius natoque penatibus et magnis dis parturient montes nascetur ridiculus 1631 | 1632 | 297 1633 | 2020-06-09T08:32:26 1634 | 843 1635 | Vestibulum ante ipsum primis in 1636 | 1637 | 298 1638 | 2020-06-09T09:00:29 1639 | 832 1640 | porta Ut vehicula sed purus nec ornare Maecenas et tempus dolor Aliquam non convallis 1641 | id id tellus Pellentesque 1642 | 1643 | 299 1644 | 2020-06-09T10:28:51 1645 | 858 1646 | sagittis velit faucibus eu Quisque sed sem 1647 | 1648 | 300 1649 | 2020-06-09T11:15:07 1650 | 761 1651 | Pellentesque bibendum dolor massa non sagittis 1652 | bibendum dolor massa non sagittis velit faucibus eu Quisque sed sem 1653 | 1654 | 301 1655 | 2020-06-09T12:08:35 1656 | 222 1657 | ornare Maecenas et tempus dolor Aliquam non convallis quam Orci varius natoque penatibus 1658 | tempus dolor Aliquam non convallis quam Orci varius natoque penatibus et magnis dis parturient 1659 | 1660 | 302 1661 | 2020-06-09T13:09:38 1662 | 323 1663 | bibendum dolor massa 1664 | 1665 | 303 1666 | 2020-06-09T14:13:48 1667 | 742 1668 | tincidunt eleifend tellus quam venenatis 1669 | curae; Pellentesque bibendum 1670 | 1671 | 304 1672 | 2020-06-09T15:37:29 1673 | 386 1674 | id tellus Pellentesque lobortis 1675 | 1676 | 305 1677 | 2020-06-09T16:25:41 1678 | 107 1679 | fermentum Nulla a mauris 1680 | 1681 | 306 1682 | 2020-06-09T17:16:23 1683 | 545 1684 | sed sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci vitae 1685 | 1686 | 307 1687 | 2020-06-09T18:53:13 1688 | 161 1689 | sagittis velit faucibus eu Quisque sed sem ac ipsum elementum bibendum id id tellus 1690 | 1691 | 308 1692 | 2020-06-09T19:00:22 1693 | 503 1694 | purus nec ornare Maecenas et tempus dolor Aliquam non 1695 | 1696 | 309 1697 | 2020-06-09T20:13:25 1698 | 773 1699 | eu sapien luctus viverra 1700 | id tellus Pellentesque 1701 | 1702 | 310 1703 | 2020-06-09T21:34:42 1704 | 699 1705 | tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris 1706 | ornare Maecenas et 1707 | 1708 | 311 1709 | 2020-06-09T22:40:07 1710 | 325 1711 | tincidunt eleifend tellus quam venenatis 1712 | Pellentesque bibendum dolor massa non sagittis 1713 | 1714 | 312 1715 | 2020-06-09T23:34:38 1716 | 564 1717 | consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh quis 1718 | massa non sagittis velit faucibus eu Quisque sed sem ac ipsum elementum 1719 | 1720 | 313 1721 | 2020-06-10T00:26:12 1722 | 367 1723 | ipsum dolor sit amet consectetur adipiscing elit Quisque gravida dolor 1724 | 1725 | 314 1726 | 2020-06-10T01:10:19 1727 | 803 1728 | et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non sagittis velit faucibus 1729 | eu Quisque sed 1730 | 1731 | 315 1732 | 2020-06-10T02:26:20 1733 | 517 1734 | sed sem ac ipsum elementum bibendum 1735 | viverra nec eleifend diam Duis quis arcu vel massa bibendum porta Ut vehicula 1736 | 1737 | 316 1738 | 2020-06-10T03:51:53 1739 | 602 1740 | tellus quam venenatis 1741 | 1742 | 317 1743 | 2020-06-10T04:25:13 1744 | 846 1745 | orci luctus et ultrices posuere cubilia curae; Pellentesque bibendum 1746 | Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris eu sapien luctus viverra nec 1747 | 1748 | 318 1749 | 2020-06-10T05:31:06 1750 | 856 1751 | in faucibus orci 1752 | ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in faucibus orci luctus 1753 | 1754 | 319 1755 | 2020-06-10T06:35:49 1756 | 159 1757 | Lorem ipsum dolor sit amet 1758 | 1759 | 320 1760 | 2020-06-10T07:12:02 1761 | 771 1762 | arcu vel massa bibendum porta Ut 1763 | dolor at tincidunt eleifend 1764 | 1765 | 321 1766 | 2020-06-10T08:40:59 1767 | 883 1768 | vitae fermentum Nulla a mauris eu sapien luctus viverra 1769 | non convallis quam Orci varius natoque penatibus et 1770 | 1771 | 322 1772 | 2020-06-10T09:12:26 1773 | 891 1774 | sapien luctus viverra nec eleifend 1775 | Quisque sed sem ac ipsum elementum bibendum id 1776 | 1777 | 323 1778 | 2020-06-10T10:04:23 1779 | 230 1780 | eleifend diam Duis quis arcu vel massa bibendum 1781 | 1782 | 324 1783 | 2020-06-10T11:26:39 1784 | 854 1785 | et tempus dolor Aliquam non 1786 | dolor Aliquam non 1787 | 1788 | 325 1789 | 2020-06-10T12:43:50 1790 | 417 1791 | sed purus nec ornare Maecenas et tempus dolor Aliquam 1792 | 1793 | 326 1794 | 2020-06-10T13:00:30 1795 | 260 1796 | turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in 1797 | est lectus ac turpis Integer pretium gravida gravida Vestibulum ante 1798 | 1799 | 327 1800 | 2020-06-10T14:53:02 1801 | 885 1802 | arcu vel massa bibendum porta 1803 | 1804 | 328 1805 | 2020-06-10T15:17:59 1806 | 526 1807 | luctus et ultrices posuere cubilia curae; Pellentesque 1808 | 1809 | 329 1810 | 2020-06-10T15:58:28 1811 | 288 1812 | sed sem ac ipsum 1813 | 1814 | 330 1815 | 2020-06-10T17:12:52 1816 | 800 1817 | Quisque gravida dolor at tincidunt 1818 | 1819 | 331 1820 | 2020-06-10T18:12:04 1821 | 409 1822 | ipsum primis in faucibus orci luctus et 1823 | 1824 | 332 1825 | 2020-06-10T19:40:56 1826 | 239 1827 | diam Duis quis arcu vel massa bibendum porta Ut vehicula sed purus nec ornare 1828 | sapien luctus viverra nec eleifend diam Duis quis arcu vel massa bibendum porta Ut 1829 | 1830 | 333 1831 | 2020-06-10T20:39:07 1832 | 254 1833 | Pellentesque lobortis fringilla orci vitae fermentum Nulla 1834 | eu sapien luctus viverra nec eleifend diam Duis quis 1835 | 1836 | 334 1837 | 2020-06-10T21:36:01 1838 | 185 1839 | sapien luctus viverra 1840 | 1841 | 335 1842 | 2020-06-10T22:03:46 1843 | 217 1844 | consectetur adipiscing elit 1845 | ante ipsum primis in faucibus orci luctus et ultrices 1846 | 1847 | 336 1848 | 2020-06-10T23:55:36 1849 | 235 1850 | id id tellus 1851 | 1852 | 337 1853 | 2020-06-11T00:21:39 1854 | 121 1855 | vitae fermentum Nulla a mauris eu sapien luctus viverra nec eleifend diam Duis 1856 | faucibus orci luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa 1857 | 1858 | 338 1859 | 2020-06-11T01:19:24 1860 | 894 1861 | Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia 1862 | Duis quis arcu vel massa bibendum porta Ut vehicula sed purus nec 1863 | 1864 | 339 1865 | 2020-06-11T01:57:30 1866 | 315 1867 | elementum bibendum id 1868 | 1869 | 340 1870 | 2020-06-11T03:33:47 1871 | 365 1872 | gravida dolor at tincidunt 1873 | Integer pretium gravida gravida Vestibulum ante ipsum primis in faucibus orci luctus et 1874 | 1875 | 341 1876 | 2020-06-11T04:49:18 1877 | 150 1878 | Vestibulum ante ipsum primis in 1879 | 1880 | 342 1881 | 2020-06-11T05:32:34 1882 | 527 1883 | mauris eu sapien 1884 | 1885 | 343 1886 | 2020-06-11T06:23:38 1887 | 248 1888 | diam Duis quis arcu vel massa bibendum porta Ut 1889 | bibendum porta Ut vehicula sed purus nec ornare Maecenas 1890 | 1891 | 344 1892 | 2020-06-11T07:08:15 1893 | 478 1894 | Vestibulum ante ipsum primis in faucibus orci luctus 1895 | 1896 | 345 1897 | 2020-06-11T08:12:14 1898 | 718 1899 | ipsum primis in faucibus orci luctus et ultrices posuere cubilia curae; 1900 | nec eleifend diam Duis quis arcu vel 1901 | 1902 | 346 1903 | 2020-06-11T09:35:40 1904 | 537 1905 | tempus dolor Aliquam non convallis quam Orci varius natoque penatibus et magnis dis parturient 1906 | dolor at tincidunt eleifend tellus quam 1907 | 1908 | 347 1909 | 2020-06-11T10:35:20 1910 | 380 1911 | consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh 1912 | 1913 | 348 1914 | 2020-06-11T11:05:43 1915 | 718 1916 | ipsum primis in faucibus orci luctus 1917 | 1918 | 349 1919 | 2020-06-11T12:14:08 1920 | 284 1921 | eleifend tellus quam venenatis 1922 | eu Quisque sed sem ac ipsum elementum 1923 | 1924 | 350 1925 | 2020-06-11T13:06:49 1926 | 111 1927 | Vestibulum ante ipsum primis in faucibus orci luctus 1928 | varius natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 1929 | 1930 | 351 1931 | 2020-06-11T14:26:37 1932 | 138 1933 | quis arcu vel massa bibendum porta Ut 1934 | 1935 | 352 1936 | 2020-06-11T15:18:42 1937 | 611 1938 | in faucibus orci luctus et ultrices posuere cubilia curae; 1939 | 1940 | 353 1941 | 2020-06-11T16:24:28 1942 | 661 1943 | Orci varius natoque penatibus et 1944 | 1945 | 354 1946 | 2020-06-11T17:05:00 1947 | 675 1948 | elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh quis condimentum 1949 | purus nec ornare Maecenas et tempus dolor 1950 | 1951 | 355 1952 | 2020-06-11T18:13:10 1953 | 762 1954 | sed sem ac ipsum elementum 1955 | nec ornare Maecenas et tempus dolor Aliquam non convallis quam Orci 1956 | 1957 | 356 1958 | 2020-06-11T19:16:29 1959 | 663 1960 | Ut vehicula sed purus nec ornare Maecenas et 1961 | cubilia curae; Pellentesque bibendum dolor massa non sagittis velit faucibus 1962 | 1963 | 357 1964 | 2020-06-11T20:20:51 1965 | 725 1966 | luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa 1967 | 1968 | 358 1969 | 2020-06-11T21:31:32 1970 | 511 1971 | eu Quisque sed sem ac ipsum elementum bibendum 1972 | 1973 | 359 1974 | 2020-06-11T22:18:51 1975 | 660 1976 | Aliquam non convallis quam Orci varius natoque 1977 | 1978 | 360 1979 | 2020-06-11T23:17:05 1980 | 377 1981 | eu Quisque sed sem ac ipsum elementum bibendum 1982 | nibh quis condimentum est lectus ac turpis Integer pretium gravida 1983 | 1984 | 361 1985 | 2020-06-12T00:11:03 1986 | 605 1987 | pretium gravida gravida Vestibulum ante ipsum primis in faucibus 1988 | bibendum id id tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris 1989 | 1990 | 362 1991 | 2020-06-12T01:00:01 1992 | 274 1993 | Ut vehicula sed purus nec 1994 | 1995 | 363 1996 | 2020-06-12T02:33:40 1997 | 700 1998 | non sagittis velit faucibus eu Quisque 1999 | adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh 2000 | 2001 | 364 2002 | 2020-06-12T03:13:42 2003 | 237 2004 | curae; Pellentesque bibendum 2005 | faucibus orci luctus et ultrices posuere 2006 | 2007 | 365 2008 | 2020-06-12T04:39:58 2009 | 472 2010 | Nulla a mauris 2011 | 2012 | 366 2013 | 2020-06-12T04:57:00 2014 | 120 2015 | gravida dolor at tincidunt eleifend tellus 2016 | 2017 | 367 2018 | 2020-06-12T06:05:11 2019 | 798 2020 | arcu vel massa bibendum porta Ut vehicula sed purus nec ornare Maecenas et tempus 2021 | mauris eu sapien luctus viverra nec eleifend diam 2022 | 2023 | 368 2024 | 2020-06-12T07:18:33 2025 | 684 2026 | fermentum Nulla a mauris 2027 | Aliquam non convallis quam Orci varius natoque penatibus et 2028 | 2029 | 369 2030 | 2020-06-12T08:26:20 2031 | 392 2032 | varius natoque penatibus et magnis dis parturient montes 2033 | sapien luctus viverra nec eleifend diam Duis quis arcu vel massa bibendum porta 2034 | 2035 | 370 2036 | 2020-06-12T09:18:01 2037 | 533 2038 | non sagittis velit 2039 | 2040 | 371 2041 | 2020-06-12T10:05:24 2042 | 387 2043 | amet consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend 2044 | 2045 | 372 2046 | 2020-06-12T11:40:47 2047 | 339 2048 | orci luctus et 2049 | 2050 | 373 2051 | 2020-06-12T12:05:23 2052 | 853 2053 | vitae fermentum Nulla a mauris eu sapien luctus viverra nec eleifend diam Duis quis 2054 | 2055 | 374 2056 | 2020-06-12T13:19:12 2057 | 189 2058 | quis arcu vel massa bibendum porta Ut vehicula sed purus nec 2059 | quis condimentum est lectus ac 2060 | 2061 | 375 2062 | 2020-06-12T14:49:27 2063 | 819 2064 | posuere cubilia curae; Pellentesque bibendum 2065 | 2066 | 376 2067 | 2020-06-12T15:23:42 2068 | 104 2069 | sit amet consectetur adipiscing 2070 | luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non sagittis velit 2071 | 2072 | 377 2073 | 2020-06-12T16:09:28 2074 | 580 2075 | massa bibendum porta 2076 | 2077 | 378 2078 | 2020-06-12T17:42:02 2079 | 298 2080 | gravida Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia 2081 | ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci vitae fermentum 2082 | 2083 | 379 2084 | 2020-06-12T18:13:35 2085 | 226 2086 | Duis quis arcu vel massa bibendum porta 2087 | 2088 | 380 2089 | 2020-06-12T19:13:38 2090 | 880 2091 | faucibus orci luctus et ultrices 2092 | 2093 | 381 2094 | 2020-06-12T20:49:46 2095 | 349 2096 | elementum bibendum id id tellus Pellentesque lobortis fringilla orci 2097 | adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus 2098 | 2099 | 382 2100 | 2020-06-12T21:45:02 2101 | 857 2102 | nibh quis condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum 2103 | 2104 | 383 2105 | 2020-06-12T22:21:06 2106 | 591 2107 | Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris eu sapien 2108 | non sagittis velit faucibus eu Quisque 2109 | 2110 | 384 2111 | 2020-06-12T23:52:51 2112 | 178 2113 | dolor massa non sagittis velit faucibus eu Quisque sed sem ac ipsum elementum bibendum 2114 | vel massa bibendum porta Ut vehicula sed 2115 | 2116 | 385 2117 | 2020-06-13T00:01:50 2118 | 268 2119 | est lectus ac turpis Integer 2120 | 2121 | 386 2122 | 2020-06-13T01:52:25 2123 | 420 2124 | dolor at tincidunt eleifend tellus quam venenatis nibh quis condimentum est lectus 2125 | sed purus nec 2126 | 2127 | 387 2128 | 2020-06-13T01:58:06 2129 | 278 2130 | Quisque gravida dolor at tincidunt eleifend 2131 | 2132 | 388 2133 | 2020-06-13T03:33:53 2134 | 446 2135 | posuere cubilia curae; Pellentesque bibendum 2136 | 2137 | 389 2138 | 2020-06-13T03:57:40 2139 | 426 2140 | curae; Pellentesque bibendum 2141 | condimentum est lectus ac turpis Integer pretium 2142 | 2143 | 390 2144 | 2020-06-13T05:43:43 2145 | 804 2146 | Ut vehicula sed purus nec 2147 | Maecenas et tempus dolor Aliquam non convallis 2148 | 2149 | 391 2150 | 2020-06-13T06:43:22 2151 | 206 2152 | natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 2153 | faucibus orci luctus et 2154 | 2155 | 392 2156 | 2020-06-13T07:03:23 2157 | 378 2158 | fermentum Nulla a mauris eu sapien 2159 | 2160 | 393 2161 | 2020-06-13T08:13:17 2162 | 122 2163 | Ut vehicula sed purus nec ornare Maecenas et tempus dolor Aliquam non convallis 2164 | porta Ut vehicula sed purus 2165 | 2166 | 394 2167 | 2020-06-13T09:55:37 2168 | 777 2169 | gravida gravida Vestibulum 2170 | luctus et ultrices posuere cubilia curae; Pellentesque bibendum 2171 | 2172 | 395 2173 | 2020-06-13T10:23:09 2174 | 648 2175 | primis in faucibus 2176 | faucibus orci luctus et ultrices 2177 | 2178 | 396 2179 | 2020-06-13T11:33:39 2180 | 544 2181 | Integer pretium gravida gravida Vestibulum ante ipsum primis 2182 | 2183 | 397 2184 | 2020-06-13T12:20:47 2185 | 625 2186 | eleifend tellus quam venenatis nibh quis condimentum est lectus ac turpis Integer 2187 | 2188 | 398 2189 | 2020-06-13T13:45:24 2190 | 349 2191 | vehicula sed purus nec ornare Maecenas et tempus dolor 2192 | 2193 | 399 2194 | 2020-06-13T14:51:01 2195 | 576 2196 | convallis quam Orci varius natoque penatibus et magnis dis parturient montes nascetur 2197 | orci vitae fermentum Nulla a mauris eu sapien luctus viverra nec eleifend 2198 | 2199 | 400 2200 | 2020-06-13T15:24:26 2201 | 641 2202 | venenatis nibh quis condimentum est 2203 | 2204 | 401 2205 | 2020-06-13T16:37:40 2206 | 660 2207 | curae; Pellentesque bibendum dolor massa non sagittis velit faucibus eu Quisque sed 2208 | 2209 | 402 2210 | 2020-06-13T17:16:22 2211 | 384 2212 | diam Duis quis arcu vel massa bibendum porta Ut vehicula sed 2213 | faucibus eu Quisque sed sem ac ipsum elementum bibendum id id 2214 | 2215 | 403 2216 | 2020-06-13T18:39:28 2217 | 868 2218 | Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere 2219 | diam Duis quis arcu 2220 | 2221 | 404 2222 | 2020-06-13T19:50:23 2223 | 190 2224 | orci vitae fermentum Nulla a mauris eu 2225 | 2226 | 405 2227 | 2020-06-13T20:07:52 2228 | 749 2229 | Quisque sed sem ac ipsum elementum bibendum 2230 | 2231 | 406 2232 | 2020-06-13T21:35:16 2233 | 424 2234 | nec ornare Maecenas 2235 | quam Orci varius natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 2236 | 2237 | 407 2238 | 2020-06-13T22:01:23 2239 | 310 2240 | posuere cubilia curae; Pellentesque 2241 | 2242 | 408 2243 | 2020-06-13T23:39:06 2244 | 438 2245 | quis arcu vel massa bibendum porta Ut 2246 | Ut vehicula sed purus nec ornare Maecenas et 2247 | 2248 | 409 2249 | 2020-06-14T00:30:18 2250 | 833 2251 | est lectus ac turpis Integer pretium 2252 | condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis 2253 | 2254 | 410 2255 | 2020-06-14T01:14:43 2256 | 169 2257 | dolor Aliquam non convallis quam Orci varius natoque penatibus et magnis 2258 | 2259 | 411 2260 | 2020-06-14T02:25:57 2261 | 159 2262 | vel massa bibendum porta Ut vehicula sed purus nec ornare Maecenas et tempus 2263 | Vestibulum ante ipsum primis in 2264 | 2265 | 412 2266 | 2020-06-14T03:45:42 2267 | 115 2268 | massa non sagittis velit faucibus eu Quisque sed 2269 | convallis quam Orci varius natoque penatibus et magnis dis 2270 | 2271 | 413 2272 | 2020-06-14T04:31:43 2273 | 320 2274 | ipsum dolor sit amet consectetur adipiscing elit Quisque gravida 2275 | Ut vehicula sed purus nec ornare Maecenas et tempus dolor Aliquam non convallis 2276 | 2277 | 414 2278 | 2020-06-14T05:29:22 2279 | 171 2280 | primis in faucibus orci luctus et ultrices posuere cubilia curae; Pellentesque 2281 | 2282 | 415 2283 | 2020-06-14T06:22:36 2284 | 560 2285 | Duis quis arcu vel massa bibendum porta Ut vehicula sed purus nec ornare Maecenas 2286 | 2287 | 416 2288 | 2020-06-14T07:50:11 2289 | 769 2290 | vehicula sed purus nec ornare Maecenas et tempus 2291 | 2292 | 417 2293 | 2020-06-14T08:52:16 2294 | 696 2295 | lobortis fringilla orci vitae fermentum Nulla a mauris eu sapien luctus viverra 2296 | dolor sit amet consectetur adipiscing elit 2297 | 2298 | 418 2299 | 2020-06-14T09:47:17 2300 | 164 2301 | Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia 2302 | 2303 | 419 2304 | 2020-06-14T10:14:33 2305 | 190 2306 | quis condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis 2307 | massa bibendum porta Ut vehicula sed purus nec ornare Maecenas et tempus dolor 2308 | 2309 | 420 2310 | 2020-06-14T11:36:31 2311 | 656 2312 | varius natoque penatibus et magnis dis parturient 2313 | lobortis fringilla orci vitae 2314 | 2315 | 421 2316 | 2020-06-14T11:57:33 2317 | 823 2318 | curae; Pellentesque bibendum dolor massa non sagittis velit 2319 | posuere cubilia curae; Pellentesque bibendum dolor 2320 | 2321 | 422 2322 | 2020-06-14T13:52:27 2323 | 549 2324 | posuere cubilia curae; Pellentesque 2325 | 2326 | 423 2327 | 2020-06-14T14:16:35 2328 | 496 2329 | at tincidunt eleifend tellus quam venenatis nibh quis condimentum est lectus 2330 | sed purus nec ornare Maecenas et tempus 2331 | 2332 | 424 2333 | 2020-06-14T15:47:42 2334 | 126 2335 | vel massa bibendum porta Ut 2336 | 2337 | 425 2338 | 2020-06-14T16:02:26 2339 | 748 2340 | Duis quis arcu vel massa bibendum porta Ut vehicula sed purus 2341 | 2342 | 426 2343 | 2020-06-14T17:16:19 2344 | 129 2345 | amet consectetur adipiscing elit 2346 | massa bibendum porta Ut vehicula sed purus nec ornare Maecenas et tempus dolor 2347 | 2348 | 427 2349 | 2020-06-14T18:18:43 2350 | 583 2351 | ornare Maecenas et tempus dolor Aliquam non convallis quam Orci varius natoque penatibus et 2352 | 2353 | 428 2354 | 2020-06-14T19:54:54 2355 | 842 2356 | sem ac ipsum elementum bibendum id 2357 | 2358 | 429 2359 | 2020-06-14T20:04:16 2360 | 205 2361 | vel massa bibendum porta Ut vehicula 2362 | 2363 | 430 2364 | 2020-06-14T21:29:54 2365 | 191 2366 | orci vitae fermentum Nulla a mauris eu sapien luctus viverra 2367 | bibendum porta Ut vehicula sed 2368 | 2369 | 431 2370 | 2020-06-14T21:58:51 2371 | 841 2372 | dolor Aliquam non convallis quam Orci varius natoque penatibus 2373 | 2374 | 432 2375 | 2020-06-14T23:09:26 2376 | 721 2377 | sapien luctus viverra nec eleifend diam Duis quis arcu vel massa bibendum 2378 | vel massa bibendum porta Ut 2379 | 2380 | 433 2381 | 2020-06-15T00:51:27 2382 | 889 2383 | ipsum dolor sit amet consectetur adipiscing elit Quisque gravida 2384 | 2385 | 434 2386 | 2020-06-15T01:45:39 2387 | 491 2388 | pretium gravida gravida Vestibulum ante ipsum 2389 | 2390 | 435 2391 | 2020-06-15T02:06:41 2392 | 348 2393 | sed sem ac ipsum elementum bibendum id 2394 | 2395 | 436 2396 | 2020-06-15T03:09:42 2397 | 105 2398 | est lectus ac turpis Integer pretium gravida gravida Vestibulum 2399 | vehicula sed purus nec ornare Maecenas 2400 | 2401 | 437 2402 | 2020-06-15T04:51:17 2403 | 181 2404 | condimentum est lectus ac turpis 2405 | 2406 | 438 2407 | 2020-06-15T04:58:19 2408 | 776 2409 | dolor at tincidunt eleifend 2410 | non convallis quam Orci varius natoque 2411 | 2412 | 439 2413 | 2020-06-15T06:06:43 2414 | 461 2415 | Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia 2416 | 2417 | 440 2418 | 2020-06-15T07:39:36 2419 | 884 2420 | bibendum porta Ut vehicula sed purus nec ornare Maecenas et tempus dolor Aliquam non 2421 | 2422 | 441 2423 | 2020-06-15T08:54:22 2424 | 144 2425 | massa bibendum porta Ut vehicula 2426 | 2427 | 442 2428 | 2020-06-15T09:54:26 2429 | 897 2430 | amet consectetur adipiscing elit Quisque gravida dolor at tincidunt 2431 | 2432 | 443 2433 | 2020-06-15T10:02:36 2434 | 476 2435 | non convallis quam Orci varius natoque penatibus et magnis dis parturient montes nascetur ridiculus 2436 | quam Orci varius natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 2437 | 2438 | 444 2439 | 2020-06-15T11:34:28 2440 | 870 2441 | dolor massa non sagittis velit faucibus 2442 | 2443 | 445 2444 | 2020-06-15T12:09:20 2445 | 478 2446 | id tellus Pellentesque 2447 | tellus quam venenatis 2448 | 2449 | 446 2450 | 2020-06-15T13:08:07 2451 | 464 2452 | Integer pretium gravida gravida Vestibulum ante 2453 | Pellentesque lobortis fringilla 2454 | 2455 | 447 2456 | 2020-06-15T14:17:43 2457 | 112 2458 | natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 2459 | amet consectetur adipiscing elit Quisque 2460 | 2461 | 448 2462 | 2020-06-15T15:00:22 2463 | 372 2464 | bibendum dolor massa non sagittis velit faucibus eu Quisque 2465 | 2466 | 449 2467 | 2020-06-15T16:51:21 2468 | 679 2469 | et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non sagittis velit faucibus 2470 | luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non 2471 | 2472 | 450 2473 | 2020-06-15T17:00:14 2474 | 346 2475 | lobortis fringilla orci vitae fermentum Nulla a mauris 2476 | at tincidunt eleifend tellus quam venenatis nibh 2477 | 2478 | 451 2479 | 2020-06-15T18:36:07 2480 | 819 2481 | bibendum porta Ut vehicula sed purus nec ornare Maecenas et tempus dolor Aliquam non 2482 | Integer pretium gravida gravida Vestibulum ante ipsum primis in faucibus orci 2483 | 2484 | 452 2485 | 2020-06-15T19:52:47 2486 | 653 2487 | sit amet consectetur adipiscing 2488 | 2489 | 453 2490 | 2020-06-15T20:51:50 2491 | 869 2492 | non sagittis velit faucibus eu Quisque 2493 | 2494 | 454 2495 | 2020-06-15T21:31:30 2496 | 801 2497 | dolor massa non sagittis 2498 | Pellentesque bibendum dolor massa 2499 | 2500 | 455 2501 | 2020-06-15T22:20:29 2502 | 589 2503 | arcu vel massa bibendum porta Ut vehicula 2504 | 2505 | 456 2506 | 2020-06-15T23:22:32 2507 | 698 2508 | dolor at tincidunt eleifend tellus quam venenatis nibh quis condimentum est 2509 | 2510 | 457 2511 | 2020-06-16T00:55:22 2512 | 218 2513 | eleifend tellus quam venenatis nibh quis condimentum 2514 | 2515 | 458 2516 | 2020-06-16T01:08:48 2517 | 577 2518 | venenatis nibh quis 2519 | bibendum porta Ut vehicula sed purus nec ornare Maecenas 2520 | 2521 | 459 2522 | 2020-06-16T02:27:42 2523 | 592 2524 | curae; Pellentesque bibendum dolor massa non sagittis velit 2525 | at tincidunt eleifend tellus quam venenatis nibh quis condimentum est 2526 | 2527 | 460 2528 | 2020-06-16T03:52:37 2529 | 550 2530 | velit faucibus eu Quisque sed sem ac ipsum elementum bibendum id id tellus Pellentesque 2531 | Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia curae; 2532 | 2533 | 461 2534 | 2020-06-16T04:42:07 2535 | 665 2536 | condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum ante 2537 | 2538 | 462 2539 | 2020-06-16T05:27:28 2540 | 355 2541 | Pellentesque lobortis fringilla orci 2542 | 2543 | 463 2544 | 2020-06-16T06:53:06 2545 | 164 2546 | bibendum id id 2547 | 2548 | 464 2549 | 2020-06-16T07:40:23 2550 | 550 2551 | bibendum dolor massa non sagittis velit faucibus 2552 | orci luctus et ultrices posuere 2553 | 2554 | 465 2555 | 2020-06-16T08:10:45 2556 | 594 2557 | turpis Integer pretium gravida 2558 | mauris eu sapien luctus viverra nec eleifend diam Duis quis arcu 2559 | 2560 | 466 2561 | 2020-06-16T09:24:20 2562 | 311 2563 | primis in faucibus orci luctus et ultrices posuere cubilia curae; 2564 | 2565 | 467 2566 | 2020-06-16T10:50:04 2567 | 801 2568 | luctus viverra nec eleifend diam Duis quis arcu vel massa bibendum porta Ut 2569 | ipsum dolor sit amet consectetur adipiscing elit Quisque gravida dolor at 2570 | 2571 | 468 2572 | 2020-06-16T11:41:37 2573 | 315 2574 | quam venenatis nibh quis condimentum est lectus 2575 | 2576 | 469 2577 | 2020-06-16T12:21:32 2578 | 501 2579 | luctus viverra nec eleifend 2580 | 2581 | 470 2582 | 2020-06-16T13:25:41 2583 | 565 2584 | Integer pretium gravida gravida Vestibulum ante 2585 | 2586 | 471 2587 | 2020-06-16T14:50:37 2588 | 293 2589 | tincidunt eleifend tellus quam venenatis nibh 2590 | sed sem ac 2591 | 2592 | 472 2593 | 2020-06-16T15:31:21 2594 | 103 2595 | tempus dolor Aliquam non convallis quam Orci varius 2596 | 2597 | 473 2598 | 2020-06-16T16:13:55 2599 | 253 2600 | lobortis fringilla orci vitae 2601 | 2602 | 474 2603 | 2020-06-16T17:06:57 2604 | 473 2605 | ornare Maecenas et tempus dolor Aliquam 2606 | 2607 | 475 2608 | 2020-06-16T18:43:17 2609 | 712 2610 | natoque penatibus et 2611 | 2612 | 476 2613 | 2020-06-16T18:57:55 2614 | 497 2615 | orci vitae fermentum Nulla a mauris eu sapien luctus viverra 2616 | 2617 | 477 2618 | 2020-06-16T20:09:57 2619 | 480 2620 | et ultrices posuere cubilia curae; Pellentesque bibendum 2621 | 2622 | 478 2623 | 2020-06-16T21:05:56 2624 | 577 2625 | fringilla orci vitae fermentum Nulla a mauris eu sapien luctus viverra nec eleifend 2626 | ipsum dolor sit amet consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend 2627 | 2628 | 479 2629 | 2020-06-16T22:34:37 2630 | 768 2631 | consectetur adipiscing elit Quisque gravida 2632 | 2633 | 480 2634 | 2020-06-16T23:52:17 2635 | 745 2636 | natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 2637 | Orci varius natoque penatibus et magnis dis parturient montes 2638 | 2639 | 481 2640 | 2020-06-17T00:53:51 2641 | 892 2642 | sed sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci 2643 | lobortis fringilla orci vitae fermentum Nulla a 2644 | 2645 | 482 2646 | 2020-06-17T01:30:12 2647 | 204 2648 | Lorem ipsum dolor sit amet 2649 | 2650 | 483 2651 | 2020-06-17T02:12:42 2652 | 746 2653 | venenatis nibh quis condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum 2654 | 2655 | 484 2656 | 2020-06-17T03:34:46 2657 | 555 2658 | nibh quis condimentum est lectus ac turpis 2659 | ante ipsum primis in 2660 | 2661 | 485 2662 | 2020-06-17T04:39:51 2663 | 800 2664 | at tincidunt eleifend tellus quam venenatis nibh quis condimentum est lectus ac turpis 2665 | 2666 | 486 2667 | 2020-06-17T05:08:33 2668 | 156 2669 | bibendum id id tellus Pellentesque lobortis 2670 | 2671 | 487 2672 | 2020-06-17T06:12:37 2673 | 562 2674 | at tincidunt eleifend tellus quam venenatis nibh quis condimentum est lectus 2675 | vel massa bibendum porta 2676 | 2677 | 488 2678 | 2020-06-17T06:57:26 2679 | 364 2680 | dolor massa non sagittis velit faucibus eu Quisque sed sem ac ipsum elementum bibendum 2681 | 2682 | 489 2683 | 2020-06-17T08:12:05 2684 | 374 2685 | natoque penatibus et magnis dis parturient montes 2686 | 2687 | 490 2688 | 2020-06-17T09:05:49 2689 | 540 2690 | sagittis velit faucibus eu Quisque sed sem ac ipsum elementum bibendum id 2691 | adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam 2692 | 2693 | 491 2694 | 2020-06-17T10:52:14 2695 | 756 2696 | nibh quis condimentum est lectus ac turpis Integer 2697 | 2698 | 492 2699 | 2020-06-17T11:52:43 2700 | 311 2701 | ac ipsum elementum bibendum id id tellus Pellentesque lobortis 2702 | eleifend diam Duis quis arcu vel massa bibendum porta Ut vehicula 2703 | 2704 | 493 2705 | 2020-06-17T12:13:10 2706 | 871 2707 | pretium gravida gravida Vestibulum ante ipsum primis in 2708 | 2709 | 494 2710 | 2020-06-17T13:25:59 2711 | 216 2712 | faucibus orci luctus et ultrices posuere cubilia 2713 | Aliquam non convallis quam Orci varius natoque penatibus et magnis dis parturient montes nascetur 2714 | 2715 | 495 2716 | 2020-06-17T14:24:53 2717 | 205 2718 | Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh quis condimentum 2719 | 2720 | 496 2721 | 2020-06-17T14:59:58 2722 | 161 2723 | Pellentesque lobortis fringilla orci vitae fermentum Nulla a 2724 | sed sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis 2725 | 2726 | 497 2727 | 2020-06-17T16:30:36 2728 | 624 2729 | Nulla a mauris eu sapien luctus viverra nec eleifend diam Duis quis arcu vel 2730 | id id tellus 2731 | 2732 | 498 2733 | 2020-06-17T17:39:26 2734 | 520 2735 | massa bibendum porta Ut vehicula sed purus nec ornare 2736 | cubilia curae; Pellentesque bibendum dolor massa non sagittis velit faucibus eu 2737 | 2738 | 499 2739 | 2020-06-17T18:09:02 2740 | 502 2741 | sit amet consectetur adipiscing 2742 | 2743 | 500 2744 | 2020-06-17T19:31:44 2745 | 666 2746 | Maecenas et tempus dolor Aliquam non convallis quam Orci varius 2747 | 2748 | 501 2749 | 2020-06-17T20:09:02 2750 | 345 2751 | massa bibendum porta Ut 2752 | porta Ut vehicula 2753 | 2754 | 502 2755 | 2020-06-17T21:27:19 2756 | 577 2757 | bibendum porta Ut 2758 | ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia curae; 2759 | 2760 | 503 2761 | 2020-06-17T22:55:13 2762 | 297 2763 | faucibus orci luctus et ultrices posuere cubilia curae; Pellentesque 2764 | sit amet consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend 2765 | 2766 | 504 2767 | 2020-06-17T23:46:40 2768 | 876 2769 | ante ipsum primis in faucibus orci luctus et ultrices posuere 2770 | 2771 | 505 2772 | 2020-06-18T00:10:26 2773 | 591 2774 | posuere cubilia curae; Pellentesque 2775 | turpis Integer pretium gravida gravida Vestibulum ante ipsum primis 2776 | 2777 | 506 2778 | 2020-06-18T01:43:36 2779 | 795 2780 | quam venenatis nibh 2781 | quis condimentum est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum 2782 | 2783 | 507 2784 | 2020-06-18T02:19:59 2785 | 318 2786 | faucibus eu Quisque sed 2787 | luctus viverra nec eleifend diam Duis quis arcu vel massa bibendum 2788 | 2789 | 508 2790 | 2020-06-18T03:10:08 2791 | 256 2792 | sed sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis 2793 | 2794 | 509 2795 | 2020-06-18T03:57:25 2796 | 268 2797 | a mauris eu sapien luctus viverra nec eleifend diam Duis quis arcu 2798 | bibendum porta Ut vehicula sed purus 2799 | 2800 | 510 2801 | 2020-06-18T05:18:30 2802 | 691 2803 | nibh quis condimentum est lectus ac turpis Integer 2804 | purus nec ornare Maecenas 2805 | 2806 | 511 2807 | 2020-06-18T06:04:27 2808 | 290 2809 | pretium gravida gravida Vestibulum ante ipsum primis in faucibus 2810 | 2811 | 512 2812 | 2020-06-18T07:15:20 2813 | 552 2814 | sagittis velit faucibus eu Quisque sed sem ac 2815 | sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis 2816 | 2817 | 513 2818 | 2020-06-18T08:36:34 2819 | 390 2820 | Nulla a mauris eu sapien 2821 | 2822 | 514 2823 | 2020-06-18T09:16:53 2824 | 856 2825 | consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus quam venenatis 2826 | Maecenas et tempus dolor Aliquam non convallis quam 2827 | 2828 | 515 2829 | 2020-06-18T10:01:14 2830 | 375 2831 | dolor sit amet consectetur 2832 | mauris eu sapien luctus viverra nec 2833 | 2834 | 516 2835 | 2020-06-18T11:38:44 2836 | 275 2837 | dolor Aliquam non convallis quam Orci varius natoque penatibus 2838 | sit amet consectetur adipiscing 2839 | 2840 | 517 2841 | 2020-06-18T11:58:18 2842 | 412 2843 | gravida dolor at tincidunt eleifend 2844 | ipsum dolor sit amet consectetur adipiscing 2845 | 2846 | 518 2847 | 2020-06-18T13:00:03 2848 | 128 2849 | bibendum porta Ut vehicula 2850 | 2851 | 519 2852 | 2020-06-18T14:48:29 2853 | 580 2854 | Pellentesque lobortis fringilla orci vitae fermentum Nulla 2855 | fermentum Nulla a mauris eu sapien luctus viverra 2856 | 2857 | 520 2858 | 2020-06-18T15:01:58 2859 | 489 2860 | velit faucibus eu Quisque sed sem ac ipsum elementum bibendum id 2861 | et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non 2862 | 2863 | 521 2864 | 2020-06-18T16:24:30 2865 | 751 2866 | mauris eu sapien luctus viverra nec eleifend diam 2867 | vitae fermentum Nulla a mauris eu sapien luctus 2868 | 2869 | 522 2870 | 2020-06-18T17:06:53 2871 | 736 2872 | Orci varius natoque penatibus et magnis dis 2873 | adipiscing elit Quisque gravida dolor at tincidunt eleifend 2874 | 2875 | 523 2876 | 2020-06-18T18:49:05 2877 | 616 2878 | sed sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci 2879 | mauris eu sapien luctus viverra nec eleifend diam Duis 2880 | 2881 | 524 2882 | 2020-06-18T19:17:31 2883 | 267 2884 | massa bibendum porta Ut vehicula 2885 | Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh quis condimentum est lectus 2886 | 2887 | 525 2888 | 2020-06-18T20:38:43 2889 | 234 2890 | fermentum Nulla a 2891 | 2892 | 526 2893 | 2020-06-18T21:06:51 2894 | 164 2895 | vitae fermentum Nulla a mauris eu sapien luctus viverra nec eleifend diam Duis quis 2896 | 2897 | 527 2898 | 2020-06-18T22:04:04 2899 | 112 2900 | natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 2901 | Orci varius natoque 2902 | 2903 | 528 2904 | 2020-06-18T23:28:20 2905 | 763 2906 | Quisque sed sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis 2907 | non sagittis velit faucibus 2908 | 2909 | 529 2910 | 2020-06-19T00:21:51 2911 | 154 2912 | viverra nec eleifend diam Duis quis arcu vel 2913 | id tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris 2914 | 2915 | 530 2916 | 2020-06-19T01:12:32 2917 | 686 2918 | natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 2919 | 2920 | 531 2921 | 2020-06-19T02:19:56 2922 | 245 2923 | luctus viverra nec eleifend diam Duis quis arcu vel massa bibendum porta 2924 | 2925 | 532 2926 | 2020-06-19T03:01:00 2927 | 278 2928 | a mauris eu sapien luctus 2929 | eleifend diam Duis quis arcu vel massa bibendum porta 2930 | 2931 | 533 2932 | 2020-06-19T03:59:57 2933 | 219 2934 | sapien luctus viverra nec eleifend diam Duis quis arcu 2935 | 2936 | 534 2937 | 2020-06-19T05:01:09 2938 | 551 2939 | Ut vehicula sed purus nec ornare Maecenas et tempus dolor Aliquam non 2940 | 2941 | 535 2942 | 2020-06-19T06:37:45 2943 | 571 2944 | et ultrices posuere cubilia curae; Pellentesque bibendum dolor massa non sagittis velit faucibus 2945 | luctus viverra nec eleifend diam 2946 | 2947 | 536 2948 | 2020-06-19T07:56:24 2949 | 291 2950 | tempus dolor Aliquam non convallis quam Orci varius 2951 | sem ac ipsum elementum 2952 | 2953 | 537 2954 | 2020-06-19T08:37:44 2955 | 450 2956 | mauris eu sapien luctus viverra nec eleifend diam Duis 2957 | massa non sagittis velit faucibus eu Quisque 2958 | 2959 | 538 2960 | 2020-06-19T09:20:05 2961 | 422 2962 | varius natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 2963 | primis in faucibus orci luctus et ultrices 2964 | 2965 | 539 2966 | 2020-06-19T10:55:11 2967 | 825 2968 | Orci varius natoque penatibus 2969 | 2970 | 540 2971 | 2020-06-19T11:17:00 2972 | 802 2973 | ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in 2974 | dolor massa non sagittis velit faucibus eu Quisque sed sem ac ipsum 2975 | 2976 | 541 2977 | 2020-06-19T12:19:21 2978 | 751 2979 | ante ipsum primis in faucibus orci 2980 | sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci 2981 | 2982 | 542 2983 | 2020-06-19T13:04:45 2984 | 224 2985 | mauris eu sapien luctus 2986 | 2987 | 543 2988 | 2020-06-19T14:00:10 2989 | 882 2990 | Integer pretium gravida gravida Vestibulum ante ipsum primis in 2991 | 2992 | 544 2993 | 2020-06-19T15:33:07 2994 | 524 2995 | venenatis nibh quis condimentum est lectus ac turpis Integer 2996 | a mauris eu sapien luctus 2997 | 2998 | 545 2999 | 2020-06-19T16:14:39 3000 | 545 3001 | a mauris eu 3002 | sapien luctus viverra nec eleifend 3003 | 3004 | 546 3005 | 2020-06-19T17:07:16 3006 | 103 3007 | ornare Maecenas et 3008 | 3009 | 547 3010 | 2020-06-19T18:35:57 3011 | 747 3012 | tincidunt eleifend tellus quam venenatis nibh quis condimentum est lectus ac turpis Integer pretium 3013 | orci luctus et 3014 | 3015 | 548 3016 | 2020-06-19T19:14:12 3017 | 270 3018 | massa non sagittis velit faucibus eu Quisque sed sem ac ipsum 3019 | eu Quisque sed sem ac ipsum elementum bibendum id id tellus Pellentesque lobortis 3020 | 3021 | 549 3022 | 2020-06-19T20:44:14 3023 | 346 3024 | eu Quisque sed 3025 | Quisque gravida dolor at tincidunt 3026 | 3027 | 550 3028 | 2020-06-19T21:22:38 3029 | 172 3030 | ipsum dolor sit amet consectetur adipiscing elit Quisque gravida 3031 | 3032 | 551 3033 | 2020-06-19T21:57:00 3034 | 788 3035 | orci luctus et ultrices posuere cubilia curae; Pellentesque bibendum dolor 3036 | 3037 | 552 3038 | 2020-06-19T23:35:12 3039 | 112 3040 | viverra nec eleifend diam Duis quis arcu vel massa bibendum porta 3041 | 3042 | 553 3043 | 2020-06-20T00:32:51 3044 | 485 3045 | gravida Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere 3046 | quis arcu vel massa 3047 | 3048 | 554 3049 | 2020-06-20T01:25:00 3050 | 687 3051 | sed sem ac ipsum elementum bibendum 3052 | velit faucibus eu Quisque sed sem ac ipsum elementum bibendum id id tellus 3053 | 3054 | 555 3055 | 2020-06-20T02:48:11 3056 | 107 3057 | massa non sagittis velit faucibus eu Quisque sed sem ac ipsum 3058 | 3059 | 556 3060 | 2020-06-20T03:20:59 3061 | 898 3062 | luctus et ultrices posuere cubilia curae; Pellentesque bibendum 3063 | 3064 | 557 3065 | 2020-06-20T04:46:37 3066 | 587 3067 | eleifend diam Duis quis arcu vel massa bibendum porta Ut vehicula sed 3068 | turpis Integer pretium 3069 | 3070 | 558 3071 | 2020-06-20T05:28:02 3072 | 844 3073 | tincidunt eleifend tellus quam 3074 | 3075 | 559 3076 | 2020-06-20T05:57:42 3077 | 424 3078 | gravida Vestibulum ante 3079 | Orci varius natoque penatibus et magnis dis parturient montes 3080 | 3081 | 560 3082 | 2020-06-20T07:18:29 3083 | 191 3084 | at tincidunt eleifend tellus quam venenatis nibh quis condimentum est lectus 3085 | ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci 3086 | 3087 | 561 3088 | 2020-06-20T08:55:34 3089 | 178 3090 | orci vitae fermentum Nulla a mauris 3091 | adipiscing elit Quisque gravida dolor at 3092 | 3093 | 562 3094 | 2020-06-20T09:07:07 3095 | 139 3096 | elit Quisque gravida dolor at tincidunt eleifend tellus 3097 | 3098 | 563 3099 | 2020-06-20T10:49:23 3100 | 716 3101 | Aliquam non convallis quam Orci 3102 | 3103 | 564 3104 | 2020-06-20T11:12:27 3105 | 846 3106 | curae; Pellentesque bibendum dolor massa non sagittis velit 3107 | 3108 | 565 3109 | 2020-06-20T12:18:14 3110 | 449 3111 | Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia 3112 | orci vitae fermentum Nulla a mauris eu sapien luctus viverra nec eleifend diam Duis 3113 | 3114 | 566 3115 | 2020-06-20T13:46:34 3116 | 701 3117 | Quisque gravida dolor at tincidunt eleifend tellus quam venenatis nibh 3118 | 3119 | 567 3120 | 2020-06-20T14:09:28 3121 | 614 3122 | varius natoque penatibus et magnis dis parturient montes nascetur ridiculus mus 3123 | amet consectetur adipiscing elit Quisque gravida dolor at tincidunt 3124 | 3125 | 568 3126 | 2020-06-20T15:21:52 3127 | 383 3128 | Nulla a mauris eu sapien luctus viverra nec eleifend diam Duis quis 3129 | 3130 | 569 3131 | 2020-06-20T16:45:44 3132 | 589 3133 | arcu vel massa bibendum porta Ut vehicula sed purus nec ornare 3134 | 3135 | 570 3136 | 2020-06-20T17:11:24 3137 | 334 3138 | lectus ac turpis Integer pretium gravida gravida Vestibulum 3139 | 3140 | 571 3141 | 2020-06-20T18:06:51 3142 | 650 3143 | arcu vel massa bibendum porta Ut vehicula sed purus nec ornare Maecenas et 3144 | ultrices posuere cubilia curae; Pellentesque bibendum dolor massa 3145 | 3146 | 572 3147 | 2020-06-20T19:03:36 3148 | 659 3149 | Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris eu 3150 | 3151 | 573 3152 | 2020-06-20T20:06:47 3153 | 338 3154 | est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in faucibus 3155 | dolor massa non sagittis velit faucibus eu Quisque sed sem ac ipsum elementum 3156 | 3157 | 574 3158 | 2020-06-20T21:24:16 3159 | 637 3160 | Ut vehicula sed purus 3161 | Integer pretium gravida 3162 | 3163 | 575 3164 | 2020-06-20T22:18:43 3165 | 848 3166 | bibendum dolor massa non sagittis velit faucibus eu 3167 | 3168 | 576 3169 | 2020-06-20T23:32:52 3170 | 129 3171 | orci vitae fermentum Nulla a mauris eu sapien luctus viverra nec eleifend diam Duis 3172 | 3173 | 577 3174 | 2020-06-21T00:41:07 3175 | 217 3176 | Orci varius natoque 3177 | 3178 | 578 3179 | 2020-06-21T01:29:44 3180 | 528 3181 | non convallis quam Orci varius natoque penatibus et magnis dis parturient montes 3182 | 3183 | 579 3184 | 2020-06-21T02:13:30 3185 | 187 3186 | tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris eu sapien luctus viverra 3187 | Vestibulum ante ipsum 3188 | 3189 | 580 3190 | 2020-06-21T03:17:35 3191 | 793 3192 | cubilia curae; Pellentesque bibendum dolor massa non sagittis velit faucibus eu Quisque sed 3193 | 3194 | 581 3195 | 2020-06-21T04:46:21 3196 | 519 3197 | bibendum id id tellus Pellentesque lobortis fringilla orci vitae fermentum Nulla a mauris eu 3198 | gravida Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia curae; 3199 | 3200 | 582 3201 | 2020-06-21T05:45:49 3202 | 420 3203 | faucibus eu Quisque sed sem ac ipsum elementum bibendum id id 3204 | orci luctus et ultrices posuere cubilia curae; 3205 | 3206 | 583 3207 | 2020-06-21T06:55:53 3208 | 865 3209 | sagittis velit faucibus eu Quisque sed 3210 | et ultrices posuere cubilia curae; 3211 | 3212 | 584 3213 | 2020-06-21T07:12:00 3214 | 136 3215 | orci luctus et ultrices posuere cubilia curae; Pellentesque 3216 | 3217 | 585 3218 | 2020-06-21T08:08:33 3219 | 680 3220 | quis arcu vel massa bibendum porta Ut vehicula sed purus 3221 | 3222 | 586 3223 | 2020-06-21T09:56:09 3224 | 584 3225 | sed purus nec 3226 | 3227 | 587 3228 | 2020-06-21T10:29:52 3229 | 839 3230 | arcu vel massa bibendum porta Ut vehicula sed purus 3231 | 3232 | 588 3233 | 2020-06-21T11:46:08 3234 | 316 3235 | sit amet consectetur adipiscing elit Quisque gravida dolor at tincidunt eleifend tellus 3236 | 3237 | 589 3238 | 2020-06-21T12:36:47 3239 | 199 3240 | amet consectetur adipiscing elit Quisque gravida dolor at 3241 | 3242 | 590 3243 | 2020-06-21T13:35:29 3244 | 661 3245 | bibendum dolor massa non sagittis velit faucibus eu 3246 | 3247 | 591 3248 | 2020-06-21T14:06:30 3249 | 778 3250 | est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis in faucibus 3251 | at tincidunt eleifend tellus 3252 | 3253 | 592 3254 | 2020-06-21T15:30:44 3255 | 151 3256 | Pellentesque bibendum dolor massa non sagittis velit faucibus 3257 | eleifend diam Duis quis arcu vel massa bibendum porta Ut vehicula sed 3258 | 3259 | 593 3260 | 2020-06-21T16:16:13 3261 | 484 3262 | bibendum porta Ut vehicula sed purus nec ornare Maecenas 3263 | dolor Aliquam non convallis quam Orci varius 3264 | 3265 | 594 3266 | 2020-06-21T16:59:12 3267 | 145 3268 | fermentum Nulla a mauris eu sapien luctus viverra nec eleifend 3269 | 3270 | 595 3271 | 2020-06-21T17:57:40 3272 | 782 3273 | ac ipsum elementum bibendum id id tellus Pellentesque lobortis fringilla orci vitae 3274 | 3275 | 596 3276 | 2020-06-21T19:42:00 3277 | 429 3278 | ac turpis Integer pretium gravida 3279 | velit faucibus eu Quisque sed sem ac ipsum elementum bibendum 3280 | 3281 | 597 3282 | 2020-06-21T19:59:38 3283 | 244 3284 | eu sapien luctus viverra nec eleifend diam Duis quis arcu 3285 | 3286 | 598 3287 | 2020-06-21T21:42:34 3288 | 818 3289 | est lectus ac turpis Integer pretium gravida gravida Vestibulum ante ipsum primis 3290 | 3291 | 599 3292 | 2020-06-21T22:40:37 3293 | 124 3294 | tempus dolor Aliquam non convallis quam Orci varius natoque penatibus et magnis dis parturient 3295 | arcu vel massa bibendum porta Ut vehicula sed purus 3296 | 3297 | 600 3298 | 2020-06-21T23:42:30 3299 | 218 3300 | sapien luctus viverra nec eleifend 3301 | 3302 | --------------------------------------------------------------------------------