1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213
|
//---------------------------------------------------------------------
// <copyright file="MetadataMappingHasherVisitor.HashSourceBuilder.cs" company="Microsoft">
// Copyright (c) Microsoft Corporation. All rights reserved.
// </copyright>
// @owner Microsoft
// @backupOwner Microsoft
//---------------------------------------------------------------------
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Diagnostics;
using System.Data.Common.Utils;
using System.Security.Cryptography;
using System.Globalization;
using System.IO;
namespace System.Data.Mapping
{
/// <summary>
/// This class keeps recomputing the hash and adding it to the front of the
/// builder when the length of the string gets too long
/// </summary>
internal class CompressingHashBuilder : StringHashBuilder
{
// this max comes from the value that Md5Hasher uses for a buffer size when it is reading
// from a stream
private const int HashCharacterCompressionThreshold = 0x1000 / 2; // num bytes / 2 to convert to typical unicode char size
private const int SpacesPerIndent = 4;
private int _indent = 0;
// we are starting the buffer at 1.5 times the number of bytes
// for the threshold
internal CompressingHashBuilder(HashAlgorithm hashAlgorithm)
: base(hashAlgorithm, (HashCharacterCompressionThreshold + (HashCharacterCompressionThreshold / 2)) * 2)
{
}
internal override void Append(string content)
{
base.Append(string.Empty.PadLeft(SpacesPerIndent * _indent, ' '));
base.Append(content);
CompressHash();
}
internal override void AppendLine(string content)
{
base.Append(string.Empty.PadLeft(SpacesPerIndent * _indent, ' '));
base.AppendLine(content);
CompressHash();
}
/// <summary>
/// add string like "typename Instance#1"
/// </summary>
/// <param name="objectIndex"></param>
internal void AppendObjectStartDump(object o, int objectIndex)
{
base.Append(string.Empty.PadLeft(SpacesPerIndent * _indent, ' '));
base.Append(o.GetType().ToString());
base.Append(" Instance#");
base.AppendLine(objectIndex.ToString(CultureInfo.InvariantCulture));
CompressHash();
this._indent++;
}
internal void AppendObjectEndDump()
{
Debug.Assert(this._indent > 0, "Indent and unindent should be paired");
this._indent--;
}
private void CompressHash()
{
if(base.CharCount >= HashCharacterCompressionThreshold)
{
string hash = ComputeHash();
Clear();
base.Append(hash);
}
}
}
/// <summary>
/// this class collects several strings together, and allows you to (
/// </summary>
internal class StringHashBuilder
{
private HashAlgorithm _hashAlgorithm;
private const string NewLine = "\n";
List<string> _strings = new List<string>();
int _totalLength;
byte[] _cachedBuffer;
internal StringHashBuilder(HashAlgorithm hashAlgorithm)
{
_hashAlgorithm = hashAlgorithm;
}
internal StringHashBuilder(HashAlgorithm hashAlgorithm, int startingBufferSize)
:this(hashAlgorithm)
{
Debug.Assert(startingBufferSize > 0, "should be a non zero positive integer");
_cachedBuffer = new byte[startingBufferSize];
}
internal int CharCount { get { return _totalLength; } }
internal virtual void Append(string s)
{
InternalAppend(s);
}
internal virtual void AppendLine(string s)
{
InternalAppend(s);
InternalAppend(NewLine);
}
private void InternalAppend(string s)
{
if (s.Length == 0)
return;
_strings.Add(s);
_totalLength += s.Length;
}
internal string ComputeHash()
{
int byteCount = GetByteCount();
if(_cachedBuffer == null)
{
// assume it is a one time use, and
// it will grow later if needed
_cachedBuffer = new byte[byteCount];
}
else if (_cachedBuffer.Length < byteCount)
{
// grow it by what is needed at a minimum, or 1.5 times bigger
// if that is bigger than what is needed this time. We
// make it 1.5 times bigger in hopes to reduce the number of allocations (consider the
// case where the next one it 1 bigger)
int bufferSize = Math.Max(_cachedBuffer.Length + (_cachedBuffer.Length / 2), byteCount);
_cachedBuffer = new byte[bufferSize];
}
int start = 0;
foreach (string s in _strings)
{
start += Encoding.Unicode.GetBytes(s, 0, s.Length, _cachedBuffer, start);
}
Debug.Assert(start == byteCount, "Did we use a different calculation for these?");
byte[] hash = _hashAlgorithm.ComputeHash(_cachedBuffer, 0, byteCount);
return ConvertHashToString(hash);
}
internal void Clear()
{
_strings.Clear();
_totalLength = 0;
}
public override string ToString()
{
StringBuilder builder = new StringBuilder();
_strings.ForEach(s => builder.Append(s));
return builder.ToString();
}
private int GetByteCount()
{
int count = 0;
foreach (string s in _strings)
{
count += Encoding.Unicode.GetByteCount(s);
}
return count;
}
private static string ConvertHashToString(byte[] hash)
{
StringBuilder stringData = new StringBuilder(hash.Length * 2);
// Loop through each byte of the data and format each one as a
// hexadecimal string
for (int i = 0; i < hash.Length; i++)
{
stringData.Append(hash[i].ToString("x2", CultureInfo.InvariantCulture));
}
return stringData.ToString();
}
public static string ComputeHash(HashAlgorithm hashAlgorithm, string source)
{
StringHashBuilder builder = new StringHashBuilder(hashAlgorithm);
builder.Append(source);
return builder.ComputeHash();
}
}
}
|