|
1 /* |
|
2 * Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies). |
|
3 * All rights reserved. |
|
4 * |
|
5 * Redistribution and use in source and binary forms, with or without |
|
6 * modification, are permitted provided that the following conditions are met: |
|
7 * |
|
8 * - Redistributions of source code must retain the above copyright notice, |
|
9 * this list of conditions and the following disclaimer. |
|
10 * - Redistributions in binary form must reproduce the above copyright notice, |
|
11 * this list of conditions and the following disclaimer in the documentation |
|
12 * and/or other materials provided with the distribution. |
|
13 * - Neither the name of Nokia Corporation nor the names of its contributors |
|
14 * may be used to endorse or promote products derived from this software |
|
15 * without specific prior written permission. |
|
16 * |
|
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
|
18 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
|
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
|
21 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
|
22 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
|
23 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
|
24 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
|
25 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
|
26 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
27 * POSSIBILITY OF SUCH DAMAGE. |
|
28 * |
|
29 * Initial Contributors: |
|
30 * Nokia Corporation - initial contribution. |
|
31 * |
|
32 * Contributors: |
|
33 * |
|
34 * Description: |
|
35 * |
|
36 */ |
|
37 |
|
38 using System; |
|
39 using System.Collections; |
|
40 using HeapLib.Array; |
|
41 using HeapLib.Cells; |
|
42 using SymbianUtils.Range; |
|
43 |
|
44 namespace HeapLib.Array |
|
45 { |
|
46 internal class HeapCellArrayAllocationNumberMap |
|
47 { |
|
48 #region Constructors & destructor |
|
49 public HeapCellArrayAllocationNumberMap( HeapCellArrayBase aArray ) |
|
50 { |
|
51 int index = 0; |
|
52 /* |
|
53 System.IO.StreamWriter w = new System.IO.StreamWriter( "C:\\temp\\temp.txt", false ); |
|
54 */ |
|
55 foreach( HeapCell cell in aArray ) |
|
56 { |
|
57 if ( cell.Type == HeapCell.TType.EAllocated ) |
|
58 { |
|
59 uint allocNum = cell.AllocationNumber; |
|
60 // |
|
61 iRange.UpdateMin( allocNum ); |
|
62 iRange.UpdateMax( allocNum ); |
|
63 // |
|
64 if ( !iTable.ContainsKey( allocNum ) ) |
|
65 { |
|
66 iTable.Add( allocNum, index ); |
|
67 //w.WriteLine( " Alloc#: " + allocNum.ToString("d8") + ", addr: 0x" + cell.Address.ToString("x8") + ", indx: " + index.ToString() ); |
|
68 } |
|
69 else |
|
70 { |
|
71 //w.WriteLine( "DUPE Alloc#: " + allocNum.ToString("d8") + ", addr: 0x" + cell.Address.ToString("x8") ); |
|
72 } |
|
73 } |
|
74 ++index; |
|
75 } |
|
76 //w.Close(); |
|
77 // |
|
78 iEntries = aArray; |
|
79 } |
|
80 #endregion |
|
81 |
|
82 #region API |
|
83 public bool InRange( uint aAllocNum ) |
|
84 { |
|
85 return iRange.Contains( aAllocNum ); |
|
86 } |
|
87 #endregion |
|
88 |
|
89 #region Properties |
|
90 public HeapCell this[ uint aAllocNum ] |
|
91 { |
|
92 get |
|
93 { |
|
94 HeapCell ret = null; |
|
95 // |
|
96 object indexObj = iTable[ aAllocNum ]; |
|
97 if ( indexObj != null ) |
|
98 { |
|
99 int index = (int) indexObj; |
|
100 if ( index >= 0 && index < iEntries.Count ) |
|
101 { |
|
102 ret = iEntries[ index ]; |
|
103 } |
|
104 } |
|
105 // |
|
106 return ret; |
|
107 } |
|
108 } |
|
109 #endregion |
|
110 |
|
111 #region Data members |
|
112 private readonly HeapCellArrayBase iEntries; |
|
113 private Hashtable iTable = new Hashtable(); |
|
114 private SymbianUtils.Range.AddressRange iRange = new AddressRange(); |
|
115 #endregion |
|
116 } |
|
117 } |