UserStringHeap.cs 1.9 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
  1. //
  2. // UserStringHeap.cs
  3. //
  4. // Author:
  5. // Jb Evain (jbevain@gmail.com)
  6. //
  7. // Copyright (c) 2008 - 2011 Jb Evain
  8. //
  9. // Permission is hereby granted, free of charge, to any person obtaining
  10. // a copy of this software and associated documentation files (the
  11. // "Software"), to deal in the Software without restriction, including
  12. // without limitation the rights to use, copy, modify, merge, publish,
  13. // distribute, sublicense, and/or sell copies of the Software, and to
  14. // permit persons to whom the Software is furnished to do so, subject to
  15. // the following conditions:
  16. //
  17. // The above copyright notice and this permission notice shall be
  18. // included in all copies or substantial portions of the Software.
  19. //
  20. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  21. // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  22. // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  23. // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
  24. // LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
  25. // OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
  26. // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  27. //
  28. using System;
  29. using Mono.Cecil.PE;
  30. namespace Mono.Cecil.Metadata
  31. {
  32. sealed class UserStringHeap : StringHeap
  33. {
  34. public UserStringHeap(Section section, uint start, uint size)
  35. : base(section, start, size)
  36. {
  37. }
  38. protected override string ReadStringAt(uint index)
  39. {
  40. byte[] data = Section.Data;
  41. int start = (int)(index + Offset);
  42. uint length = (uint)(Mixin.ReadCompressedUInt32(data, ref start) & ~1);
  43. if (length < 1)
  44. return string.Empty;
  45. var chars = new char[length / 2];
  46. for (int i = start, j = 0; i < start + length; i += 2)
  47. chars[j++] = (char)(data[i] | (data[i + 1] << 8));
  48. return new string(chars);
  49. }
  50. }
  51. }