Light

gfoidl / dotnet-runtime Goto Github PK

This project forked from dotnet/runtime

.NET is a cross-platform runtime and libraries, for cloud, IoT and desktop apps. It includes a garbage collector, JIT compiler, primitive data types and class libraries.

Home Page: https://docs.microsoft.com/dotnet/core/

License: MIT License

Batchfile 0.03% Shell 0.17% PowerShell 0.06% CMake 0.15% Python 0.21% C# 79.66% C++ 10.63% C 8.00% Perl 0.01% Assembly 0.30% Yacc 0.03% Makefile 0.01% Roff 0.15% XSLT 0.09% HTML 0.01% OpenEdge ABL 0.03% Dockerfile 0.01% Visual Basic .NET 0.44% Objective-C 0.02% Ruby 0.01%

dotnet-runtime's People

Contributors

Watchers

dotnet-runtime's Issues

L1-cache locality for SpanHelpers.IndexOfAny

dotnet-runtime/src/libraries/System.Private.CoreLib/src/System/SpanHelpers.Byte.cs

Lines 54 to 76 in c82abc5

    
           public static int IndexOfAny(ref byte searchSpace, int searchSpaceLength, ref byte value, int valueLength) 
        
           { 
        
               Debug.Assert(searchSpaceLength >= 0); 
        
               Debug.Assert(valueLength >= 0); 
        
               if (valueLength == 0) 
        
                   return -1;  // A zero-length set of values is always treated as "not found". 
        
               int offset = -1; 
        
               for (int i = 0; i < valueLength; i++) 
        
               { 
        
                   int tempIndex = IndexOf(ref searchSpace, Unsafe.Add(ref value, i), searchSpaceLength); 
        
                   if ((uint)tempIndex < (uint)offset) 
        
                   { 
        
                       offset = tempIndex; 
        
                       // Reduce space for search, cause we don't care if we find the search value after the index of a previously found value 
        
                       searchSpaceLength = tempIndex; 
        
                       if (offset == 0) 
        
                           break; 
        
                   } 
        
               } 
        
               return offset;

Seeks over the whole searchSpace over and over, possible evicting data from the L1-cache.
For idea see loop strip mining.

Optimized string.Replace(char, char) vector code path

Cf. 549d7c4

local build
tests
benchmarks for different remaining elements
switch to Vector128<ushort> insted? -- clarify at review

Recommend Projects

React

A declarative, efficient, and flexible JavaScript library for building user interfaces.
Vue.js

🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
Typescript

TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
TensorFlow

An Open Source Machine Learning Framework for Everyone
Django

The Web framework for perfectionists with deadlines.
Laravel

A PHP framework for web artisans
D3

Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

javascript

JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
web

Some thing interesting about web. New door for the world.
server

A server is a program made to process requests and deliver data to clients.
Machine learning

Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Visualization

Some thing interesting about visualization, use data art
Game

Some thing interesting about game, make everyone happy.

Recommend Org

Facebook

We are working to build community through open source technology. NB: members must have two-factor auth.
Microsoft

Open source projects and samples from Microsoft.
Google

Google ❤️ Open Source for everyone.
Alibaba

Alibaba Open Source for everyone
D3

Data-Driven Documents codes.
Tencent

China tencent open source team.

	public static int IndexOfAny(ref byte searchSpace, int searchSpaceLength, ref byte value, int valueLength)
	{
	Debug.Assert(searchSpaceLength >= 0);
	Debug.Assert(valueLength >= 0);

	if (valueLength == 0)
	return -1; // A zero-length set of values is always treated as "not found".

	int offset = -1;
	for (int i = 0; i < valueLength; i++)
	{
	int tempIndex = IndexOf(ref searchSpace, Unsafe.Add(ref value, i), searchSpaceLength);
	if ((uint)tempIndex < (uint)offset)
	{
	offset = tempIndex;
	// Reduce space for search, cause we don't care if we find the search value after the index of a previously found value
	searchSpaceLength = tempIndex;

	if (offset == 0)
	break;
	}
	}
	return offset;