summaryrefslogtreecommitdiffstats
path: root/private/rpc/ndrdbg/pdict.cxx
blob: 136b73e7359d3e24351d1b8e9e3f85465eaf64f8 (plain) (blame)
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
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
/*+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 Copyright (c) 1989 Microsoft Corporation

 Module Name:
    
    pdict.cxx

 Abstract:

    Implements a dictionary for handling pointers.

 Notes:


 History:

     Aug 25, 1994        RyszardK        Created

 ----------------------------------------------------------------------------*/

#include <sysinc.h>
#include <rpc.h>
#include <rpcndr.h>

#include <ntsdexts.h>
#include <ntdbg.h>

extern "C" {
#include <ndrtypes.h>
#include <ndrp.h>
}

#include "bufout.hxx"

BOOL 
PTR_DICT::IsInDictionary(
    long            Key
    )
/*++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Routine Description:

    Checks if the pointer withe given key is in the dictionary,

Arguments:

    Offset     - the offset of the pointer in the struct

Returns:
    TRUE       - is
    FALSE      - is not

----------------------------------------------------------------------------*/
{
    Dict_Status    Status;

    POINTER_DESC   Entry;

    Entry.Offset = Key;
    Entry.pMember = NULL;

    Status    = Dict_Find( &Entry );

    if ( Status == EMPTY_DICTIONARY  ||  Status == ITEM_NOT_FOUND )
        return FALSE;
    else
        return TRUE;
}


void 
PTR_DICT::Register(
    long            Offset,
    POINTER  *      pMember
    )
/*++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Routine Description:

    Adds a pointer to the dictionary

Arguments:

    Offset     - the offset of the pointer in the struct
    pMember    - the pointer object
    
----------------------------------------------------------------------------*/
{
    Dict_Status    Status;

    POINTER_DESC * pEntry = new POINTER_DESC;

    pEntry->Offset = Offset;
    pEntry->pMember = pMember;

    Status    = Dict_Find( pEntry );

    switch( Status )
        {
        case EMPTY_DICTIONARY:
        case ITEM_NOT_FOUND:

            Dict_Insert( pEntry );
            EntryCount++;
            break;

        default:
            ABORT1( "Offset already in the dictionary? %x\n", Offset );
            break;
        }
    return;
}


int
PTR_DICT::Compare(
    pUserType   pE1,
    pUserType   pE2
    )
/*++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

 Routine Description:

     Offset is the key that orders the entries.

 Arguments:

 Return Value:
    
----------------------------------------------------------------------------*/
{
    if( ((POINTER_DESC *)pE1)->Offset < ((POINTER_DESC *)pE2)->Offset )
        return( 1 );
    else
    if( ((POINTER_DESC *)pE1)->Offset > ((POINTER_DESC *)pE2)->Offset )
        return( -1 );
    else
        return( 0 );
}

POINTER_DESC *
PTR_DICT::GetFirst()
{
    Dict_Status     Status;
    POINTER_DESC *  pFirst = 0;

    Status = Dict_Next( 0 );

    if ( Status == SUCCESS )
        pFirst = (POINTER_DESC *)Dict_Curr_Item();

    return( pFirst );
}

POINTER_DESC *
PTR_DICT::GetNext()
{
    Dict_Status     Status;
    POINTER_DESC    *pCurr, *pNext = 0;

    pCurr = (POINTER_DESC *)Dict_Curr_Item();

    if ( pCurr )
        {
        Status = Dict_Next( pCurr );
        if ( Status == SUCCESS )
            pNext = (POINTER_DESC *)Dict_Curr_Item();
        }

    return( pNext );
}

POINTER_DESC *
PTR_DICT::GetPrev()
{
    Dict_Status     Status;
    POINTER_DESC    *pCurr, *pPrev = 0;

    pCurr = (POINTER_DESC *)Dict_Curr_Item();

    if ( pCurr )
        {
        Status = Dict_Prev( pCurr );
        if ( Status == SUCCESS )
            pPrev = (POINTER_DESC *)Dict_Curr_Item();
        }

    return( pPrev );
}

POINTER *
PTR_DICT::GetPointerMember( long BufferOffset )
{
    Dict_Status     Status;
    POINTER_DESC    Item;
    POINTER_DESC    *pCurr = 0;
    POINTER *       pMember = NULL;

    Item.Offset = BufferOffset;
    Status = Dict_Find( & Item );

    switch( Status )
        {
        case EMPTY_DICTIONARY:
        case ITEM_NOT_FOUND:
            break;

        default:
            pCurr = (POINTER_DESC *) Dict_Curr_Item();
            pMember = pCurr->pMember;
            if ( BufferOffset != pCurr->Offset )
                Print("Offset mismatch actual=%x, dict=%x\n",
                       BufferOffset,
                       pCurr->Offset );
            break;
        }

    return( pMember );
}

void
PTR_DICT::AddDictEntries(
    PTR_DICT * pDict )
{
    if ( pDict->GetCount() )
        {
        POINTER_DESC *  pDesc;

        while ( pDict->GetNext() )
            ;

        pDesc = (POINTER_DESC *)pDict->Dict_Curr_Item();

        while ( pDesc )
            {
            Register( pDesc->Offset, pDesc->pMember );

            pDesc = pDict->GetPrev();
            }
        }
}

void
PTR_DICT::DeleteDictMembers()
/*++
    Deleting members themselves can't be a part of the dictionary destructor.
    The reason is that the members describe pointers and the pointer's span
    of life may depend on the parent object not on the current object that
    would tak away its dictionary when desctructing itself.
    In other words, only the topmost parent can remove the members after
    printing them.
--*/
{
    POINTER_DESC *  pDesc;
    unsigned short  Count;
    Dict_Status     Status;

    if ( (Count = GetCount()) == 0  )
        return;

    pDesc = (POINTER_DESC *)Dict_Curr_Item();

        while ( pDesc )
        {
        Status = Dict_Delete( (void **) &pDesc );
        if ( Status != ITEM_NOT_FOUND  &&
             Status != EMPTY_DICTIONARY  &&
             Status != NULL_ITEM )
            {
            delete pDesc->pMember;
            pDesc = (POINTER_DESC *)Dict_Curr_Item();
            }
        }
}

void
PTR_DICT::OutputPointees(
     NDR * pObject
     )
/*
    Deletes the pointer members after printing pointees.
*/
{
    PTR_DICT *  pParentDict = pObject->GetParentDict();

    if ( pParentDict )
        {
        // Move members to parent dictionary to output pointees later.

        pParentDict->AddDictEntries( this );
        return;
        }

    if ( GetCount() )
        {
        POINTER_DESC  *pDesc, *pDescDone;

        while ( GetNext() )
            ;

        pDesc = (POINTER_DESC *)Dict_Curr_Item();

        IndentInc();

        while ( pDesc )
            {
            pDesc->pMember->Output();
            pDescDone = pDesc;
            pDesc = GetPrev();
            delete pDescDone->pMember;
            }

        IndentDec();
        }
}