-
Notifications
You must be signed in to change notification settings - Fork 84
Expand file tree
/
Copy pathdmelement.cpp
More file actions
1420 lines (1204 loc) · 40.5 KB
/
dmelement.cpp
File metadata and controls
1420 lines (1204 loc) · 40.5 KB
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
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//========= Copyright Valve Corporation, All rights reserved. ============//
//
// Purpose:
//
//=============================================================================
#include "datamodel/dmelement.h"
#include "tier0/dbg.h"
#include "datamodel.h"
#include "tier1/utllinkedlist.h"
#include "tier1/utlbuffer.h"
#include "datamodel/dmattribute.h"
#include "Color.h"
#include "mathlib/mathlib.h"
#include "mathlib/vmatrix.h"
#include "datamodel/dmelementfactoryhelper.h"
#include "datamodel/dmattributevar.h"
#include "dmattributeinternal.h"
#include "DmElementFramework.h"
// memdbgon must be the last include file in a .cpp file!!!
#include "tier0/memdbgon.h"
//-----------------------------------------------------------------------------
// helper class to allow CDmeHandle access to g_pDataModelImp
//-----------------------------------------------------------------------------
void CDmeElementRefHelper::Ref( DmElementHandle_t hElement, bool bStrong )
{
g_pDataModelImp->OnElementReferenceAdded( hElement, bStrong );
}
void CDmeElementRefHelper::Unref( DmElementHandle_t hElement, bool bStrong )
{
g_pDataModelImp->OnElementReferenceRemoved( hElement, bStrong );
}
//-----------------------------------------------------------------------------
// element reference struct - containing attribute referrers and handle refcount
//-----------------------------------------------------------------------------
void DmElementReference_t::AddAttribute( CDmAttribute *pAttribute )
{
if ( m_attributes.m_hAttribute != DMATTRIBUTE_HANDLE_INVALID )
{
DmAttributeList_t *pLink = new DmAttributeList_t; // TODO - create a fixed size allocator for these
pLink->m_hAttribute = m_attributes.m_hAttribute;
pLink->m_pNext = m_attributes.m_pNext;
m_attributes.m_pNext = pLink;
}
m_attributes.m_hAttribute = pAttribute->GetHandle();
}
void DmElementReference_t::RemoveAttribute( CDmAttribute *pAttribute )
{
DmAttributeHandle_t hAttribute = pAttribute->GetHandle();
if ( m_attributes.m_hAttribute == hAttribute )
{
DmAttributeList_t *pNext = m_attributes.m_pNext;
if ( pNext )
{
m_attributes.m_hAttribute = pNext->m_hAttribute;
m_attributes.m_pNext = pNext->m_pNext;
delete pNext;
}
else
{
m_attributes.m_hAttribute = DMATTRIBUTE_HANDLE_INVALID;
}
return;
}
for ( DmAttributeList_t *pLink = &m_attributes; pLink->m_pNext; pLink = pLink->m_pNext )
{
DmAttributeList_t *pNext = pLink->m_pNext;
if ( pNext->m_hAttribute == hAttribute )
{
pLink->m_pNext = pNext->m_pNext;
delete pNext; // TODO - create a fixed size allocator for these
return;
}
}
Assert( 0 );
}
//-----------------------------------------------------------------------------
// Class factory
//-----------------------------------------------------------------------------
IMPLEMENT_ELEMENT_FACTORY( DmElement, CDmElement );
//-----------------------------------------------------------------------------
// For backward compat: DmeElement -> creates a CDmElement class
//-----------------------------------------------------------------------------
CDmElementFactory< CDmElement > g_CDmeElement_Factory( "DmeElement" );
CDmElementFactoryHelper g_CDmeElement_Helper( "DmeElement", &g_CDmeElement_Factory, true );
//-----------------------------------------------------------------------------
// Constructor, destructor
//-----------------------------------------------------------------------------
CDmElement::CDmElement( DmElementHandle_t handle, const char *pElementType, const DmObjectId_t &id, const char *pElementName, DmFileId_t fileid ) :
m_ref( handle ), m_Type( g_pDataModel->GetSymbol( pElementType ) ), m_fileId( fileid ),
m_pAttributes( NULL ), m_bDirty( false ), m_bBeingUnserialized( false ), m_bIsAcessible( true )
{
MEM_ALLOC_CREDIT();
g_pDataModelImp->AddElementToFile( m_ref.m_hElement, m_fileId );
m_Name.InitAndSet( this, "name", pElementName, FATTRIB_TOPOLOGICAL | FATTRIB_STANDARD );
CopyUniqueId( id, &m_Id );
}
CDmElement::~CDmElement()
{
g_pDataModelImp->RemoveElementFromFile( m_ref.m_hElement, m_fileId );
}
void CDmElement::PerformConstruction()
{
OnConstruction();
}
void CDmElement::PerformDestruction()
{
OnDestruction();
}
//-----------------------------------------------------------------------------
// Purpose: Deletes all attributes
//-----------------------------------------------------------------------------
void CDmElement::Purge()
{
// Don't create "undo" records for attribute changes here, since
// the entire element is getting deleted...
CDisableUndoScopeGuard guard;
while ( m_pAttributes )
{
#if defined( _DEBUG )
// So you can see what attribute is being destroyed
const char *pName = m_pAttributes->GetName();
NOTE_UNUSED( pName );
#endif
CDmAttribute *pNext = m_pAttributes->NextAttribute();
CDmAttribute::DestroyAttribute( m_pAttributes );
m_pAttributes = pNext;
}
g_pDataModelImp->NotifyState( NOTIFY_CHANGE_TOPOLOGICAL );
}
void CDmElement::SetId( const DmObjectId_t &id )
{
CopyUniqueId( id, &m_Id );
}
//-----------------------------------------------------------------------------
// RTTI implementation
//-----------------------------------------------------------------------------
void CDmElement::SetTypeSymbol( CUtlSymbol sym )
{
m_classType = sym;
}
bool CDmElement::IsA( UtlSymId_t typeSymbol ) const
{
// NOTE: This pattern here is used to avoid a zillion virtual function
// calls in the implementation of IsA. The IsA_Implementation is
// all static function calls.
return IsA_Implementation( typeSymbol );
}
int CDmElement::GetInheritanceDepth( UtlSymId_t typeSymbol ) const
{
// NOTE: This pattern here is used to avoid a zillion virtual function
// calls in the implementation of IsA. The IsA_Implementation is
// all static function calls.
return GetInheritanceDepth_Implementation( typeSymbol, 0 );
}
// Helper for GetInheritanceDepth
int CDmElement::GetInheritanceDepth( const char *pTypeName ) const
{
CUtlSymbol typeSymbol = g_pDataModel->GetSymbol( pTypeName );
return GetInheritanceDepth( typeSymbol );
}
//-----------------------------------------------------------------------------
// Is the element dirty?
//-----------------------------------------------------------------------------
bool CDmElement::IsDirty() const
{
return m_bDirty;
}
void CDmElement::MarkDirty( bool bDirty )
{
if ( bDirty && !m_bDirty )
{
g_pDmElementFrameworkImp->AddElementToDirtyList( m_ref.m_hElement );
}
m_bDirty = bDirty;
}
void CDmElement::MarkAttributesClean()
{
for ( CDmAttribute *pAttr = m_pAttributes; pAttr; pAttr = pAttr->NextAttribute() )
{
// No Undo for flag changes
pAttr->RemoveFlag( FATTRIB_DIRTY );
}
}
void CDmElement::MarkBeingUnserialized( bool beingUnserialized )
{
if ( m_bBeingUnserialized != beingUnserialized )
{
m_bBeingUnserialized = beingUnserialized;
// After we finish unserialization, call OnAttributeChanged; assume everything changed
if ( !beingUnserialized )
{
for( CDmAttribute *pAttribute = m_pAttributes; pAttribute; pAttribute = pAttribute->NextAttribute() )
{
pAttribute->OnUnserializationFinished();
}
// loop referencing attributes, and call OnAttributeChanged on them as well
if ( m_ref.m_attributes.m_hAttribute != DMATTRIBUTE_HANDLE_INVALID )
{
for ( DmAttributeList_t *pAttrLink = &m_ref.m_attributes; pAttrLink; pAttrLink = pAttrLink->m_pNext )
{
CDmAttribute *pAttr = g_pDataModel->GetAttribute( pAttrLink->m_hAttribute );
if ( !pAttr || pAttr->GetOwner()->GetFileId() == m_fileId )
continue; // attributes in this file will already have OnAttributeChanged called on them
pAttr->OnUnserializationFinished();
}
}
// Mostly used for backward compatibility reasons
CDmElement *pElement = g_pDataModel->GetElement( m_ref.m_hElement );
pElement->OnElementUnserialized();
// Force a resolve also, and set it up to remove it from the dirty list
// after unserialization is complete
pElement->Resolve();
MarkDirty( false );
MarkAttributesClean();
g_pDataModelImp->NotifyState( NOTIFY_CHANGE_TOPOLOGICAL );
}
}
}
bool CDmElement::IsBeingUnserialized() const
{
return m_bBeingUnserialized;
}
// Should only be called from datamodel, who will take care of changing the fileset entry as well
void CDmElement::ChangeHandle( DmElementHandle_t handle )
{
m_ref.m_hElement = handle;
}
// returns element reference struct w/ list of referrers and handle count
DmElementReference_t *CDmElement::GetReference()
{
return &m_ref;
}
void CDmElement::SetReference( const DmElementReference_t &ref )
{
Assert( !m_ref.IsWeaklyReferenced() );
m_ref = ref;
}
int CDmElement::EstimateMemoryUsage( CUtlHash< DmElementHandle_t > &visited, TraversalDepth_t depth, int *pCategories )
{
if ( visited.Find( m_ref.m_hElement ) != visited.InvalidHandle() )
return 0;
visited.Insert( m_ref.m_hElement );
int nDataModelUsage = g_pDataModelImp->EstimateMemoryOverhead( );
int nReferenceUsage = m_ref.EstimateMemoryOverhead();
CDmElement *pElement = g_pDataModel->GetElement( m_ref.m_hElement );
int nInternalUsage = sizeof( *this ) - sizeof( CUtlString ); // NOTE: The utlstring is the 'name' attribute var
int nOuterUsage = pElement->AllocatedSize() - nInternalUsage;
Assert( nOuterUsage >= 0 );
if ( pCategories )
{
pCategories[MEMORY_CATEGORY_OUTER] += nOuterUsage;
pCategories[MEMORY_CATEGORY_DATAMODEL] += nDataModelUsage;
pCategories[MEMORY_CATEGORY_REFERENCES] += nReferenceUsage;
pCategories[MEMORY_CATEGORY_ELEMENT_INTERNAL] += nInternalUsage;
}
int nAttributeDataUsage = 0;
for ( CDmAttribute *pAttr = m_pAttributes; pAttr; pAttr = pAttr->NextAttribute() )
{
nAttributeDataUsage += pAttr->EstimateMemoryUsageInternal( visited, depth, pCategories );
}
return nInternalUsage + nDataModelUsage + nReferenceUsage + nOuterUsage + nAttributeDataUsage;
}
//-----------------------------------------------------------------------------
// these functions are here for the mark and sweep algorithm for deleting orphaned subtrees
// it's conservative, so it can return true for orphaned elements but false really means it isn't accessible
//-----------------------------------------------------------------------------
bool CDmElement::IsAccessible() const
{
return m_bIsAcessible;
}
void CDmElement::MarkAccessible( bool bAccessible )
{
m_bIsAcessible = bAccessible;
}
void CDmElement::MarkAccessible( TraversalDepth_t depth /* = TD_ALL */ )
{
if ( m_bIsAcessible )
return;
m_bIsAcessible = true;
for ( const CDmAttribute *pAttr = FirstAttribute(); pAttr != NULL; pAttr = pAttr->NextAttribute() )
{
if ( !ShouldTraverse( pAttr, depth ) )
continue;
if ( pAttr->GetType() == AT_ELEMENT )
{
CDmElement *pChild = pAttr->GetValueElement<CDmElement>();
if ( !pChild )
continue;
pChild->MarkAccessible( depth );
}
else if ( pAttr->GetType() == AT_ELEMENT_ARRAY )
{
const CDmrElementArrayConst<> elementArrayAttr( pAttr );
int nChildren = elementArrayAttr.Count();
for ( int i = 0; i < nChildren; ++i )
{
CDmElement *pChild = elementArrayAttr[ i ];
if ( !pChild )
continue;
pChild->MarkAccessible( depth );
}
}
}
}
//-----------------------------------------------------------------------------
// returns the first path to the element found traversing all element/element array attributes - not necessarily the shortest
//-----------------------------------------------------------------------------
// do we want a true visited set to avoid retraversing the same subtree over and over again?
// for most dag trees, it's probably a perf loss, since multiple instances are rare, (and searching the visited set costs log(n))
// for trees that include channels, it's probably a perf win, since many channels link into the same element most of the time
bool CDmElement::FindElement( const CDmElement *pElement, CUtlVector< ElementPathItem_t > &elementPath, TraversalDepth_t depth ) const
{
if ( this == pElement )
return true;
ElementPathItem_t search( GetHandle() );
if ( elementPath.Find( search ) != elementPath.InvalidIndex() )
return false;
int idx = elementPath.AddToTail( search );
ElementPathItem_t &pathItem = elementPath[ idx ];
for ( const CDmAttribute *pAttr = FirstAttribute(); pAttr != NULL; pAttr = pAttr->NextAttribute() )
{
if ( !ShouldTraverse( pAttr, depth ) )
continue;
if ( pAttr->GetType() == AT_ELEMENT )
{
pathItem.hAttribute = const_cast< CDmAttribute* >( pAttr )->GetHandle();
pathItem.nIndex = -1;
CDmElement *pChild = pAttr->GetValueElement<CDmElement>();
if ( pChild && pChild->FindElement( pElement, elementPath, depth ) )
return true;
}
else if ( pAttr->GetType() == AT_ELEMENT_ARRAY )
{
pathItem.hAttribute = const_cast< CDmAttribute* >( pAttr )->GetHandle();
CDmrElementArrayConst<> elementArrayAttr( pAttr );
int nChildren = elementArrayAttr.Count();
for ( int i = 0; i < nChildren; ++i )
{
pathItem.nIndex = i;
CDmElement *pChild = elementArrayAttr[ i ];
if ( pChild && pChild->FindElement( pElement, elementPath, depth ) )
return true;
}
}
}
elementPath.Remove( idx );
return false;
}
bool CDmElement::FindReferer( DmElementHandle_t hElement, CUtlVector< ElementPathItem_t > &elementPath, TraversalDepth_t depth /* = TD_SHALLOW */ ) const
{
DmElementHandle_t hThis = GetHandle();
DmAttributeReferenceIterator_t hAttr = g_pDataModel->FirstAttributeReferencingElement( hThis );
for ( ; hAttr != DMATTRIBUTE_REFERENCE_ITERATOR_INVALID; hAttr = g_pDataModel->NextAttributeReferencingElement( hAttr ) )
{
CDmAttribute *pAttr = g_pDataModel->GetAttribute( hAttr );
if ( !pAttr )
continue;
if ( !ShouldTraverse( pAttr, depth ) )
continue;
DmElementHandle_t hOwner = pAttr->GetOwner()->GetHandle();
if ( elementPath.Find( ElementPathItem_t( hOwner ) ) != elementPath.InvalidIndex() )
return false;
int i = elementPath.AddToTail();
ElementPathItem_t &item = elementPath[ i ];
item.hElement = hOwner;
item.hAttribute = pAttr->GetHandle();
item.nIndex = -1;
if ( pAttr->GetType() == AT_ELEMENT_ARRAY )
{
CDmrElementArray<> array( pAttr );
item.nIndex = array.Find( hThis );
}
if ( hOwner == hElement )
return true;
CDmElement *pOwner = GetElement< CDmElement >( hOwner );
if ( pOwner->FindReferer( hElement, elementPath, depth ) )
return true;
elementPath.Remove( i );
}
return false;
}
void CDmElement::RemoveAllReferencesToElement( CDmElement *pElement )
{
for ( CDmAttribute *pAttr = FirstAttribute(); pAttr != NULL; pAttr = pAttr->NextAttribute() )
{
if ( pAttr->GetType() == AT_ELEMENT )
{
CDmElement *pChild = pAttr->GetValueElement<CDmElement>();
if ( pChild == pElement )
{
pAttr->SetValue( DMELEMENT_HANDLE_INVALID );
}
}
else if ( pAttr->GetType() == AT_ELEMENT_ARRAY )
{
CDmrElementArray<> elementArrayAttr( pAttr );
int nChildren = elementArrayAttr.Count();
for ( int i = nChildren - 1; i >= 0; --i )
{
CDmElement *pChild = elementArrayAttr[ i ];
if ( pChild == pElement )
{
elementArrayAttr.Remove( i );
}
}
}
}
}
int CDmElement::EstimateMemoryUsage( TraversalDepth_t depth /* = TD_DEEP */ )
{
return g_pDataModel->EstimateMemoryUsage( GetHandle(), depth );
}
//-----------------------------------------------------------------------------
//
// Implementation Undo for copied objects
//
//-----------------------------------------------------------------------------
CDmElement* CDmElement::CopyInternal( TraversalDepth_t depth /* = TD_DEEP */ ) const
{
CDmElement *pCopy = GetElement< CDmElement >( g_pDataModel->CreateElement( GetType(), GetName(), GetFileId() ) );
if ( pCopy )
{
CopyAttributesTo( pCopy, depth );
}
return pCopy;
}
//-----------------------------------------------------------------------------
// Copy - implementation of shallow and deep element copying
// - allows attributes to be marked to always (or never) copy
//-----------------------------------------------------------------------------
void CDmElement::CopyAttributesTo( CDmElement *pCopy, TraversalDepth_t depth ) const
{
CDisableUndoScopeGuard sg;
CUtlMap< DmElementHandle_t, DmElementHandle_t, int > refmap( DefLessFunc( DmElementHandle_t ) );
CopyAttributesTo( pCopy, refmap, depth );
CUtlHashFast< DmElementHandle_t > visited;
uint nPow2Size = 1;
while( nPow2Size < refmap.Count() )
{
nPow2Size <<= 1;
}
visited.Init( nPow2Size );
pCopy->FixupReferences( visited, refmap, depth );
}
//-----------------------------------------------------------------------------
// Copy an element-type attribute
//-----------------------------------------------------------------------------
void CDmElement::CopyElementAttribute( const CDmAttribute *pSrcAttr, CDmAttribute *pDestAttr, CRefMap &refmap, TraversalDepth_t depth ) const
{
DmElementHandle_t hSrc = pSrcAttr->GetValue<DmElementHandle_t>();
CDmElement *pSrc = GetElement< CDmElement >( hSrc );
if ( pSrc == NULL )
{
pDestAttr->SetValue( DMELEMENT_HANDLE_INVALID );
return;
}
if ( pSrc->IsShared() )
{
pDestAttr->SetValue( pSrcAttr );
return;
}
int idx = refmap.Find( hSrc );
if ( idx != refmap.InvalidIndex() )
{
pDestAttr->SetValue( refmap[ idx ] );
return;
}
if ( ShouldTraverse( pSrcAttr, depth ) )
{
DmElementHandle_t hDest = pDestAttr->GetValue<DmElementHandle_t>();
if ( hDest == DMELEMENT_HANDLE_INVALID )
{
hDest = g_pDataModel->CreateElement( pSrc->GetType(), pSrc->GetName(), pSrc->GetFileId() );
pDestAttr->SetValue( hDest );
}
CDmElement *pDest = GetElement< CDmElement >( hDest );
pSrc->CopyAttributesTo( pDest, refmap, depth );
return;
}
pDestAttr->SetValue( pSrcAttr );
}
//-----------------------------------------------------------------------------
// Copy an element array-type attribute
//-----------------------------------------------------------------------------
void CDmElement::CopyElementArrayAttribute( const CDmAttribute *pAttr, CDmAttribute *pCopyAttr, CRefMap &refmap, TraversalDepth_t depth ) const
{
CDmrElementArrayConst<> srcAttr( pAttr );
CDmrElementArray<> destAttr( pCopyAttr );
destAttr.RemoveAll(); // automatically releases each handle
bool bCopy = ShouldTraverse( pAttr, depth );
int n = srcAttr.Count();
destAttr.EnsureCapacity( n );
for ( int i = 0; i < n; ++i )
{
DmElementHandle_t hSrc = srcAttr.GetHandle( i );
CDmElement *pSrc = srcAttr[i];
if ( pSrc == NULL )
{
destAttr.AddToTail( DMELEMENT_HANDLE_INVALID );
continue;
}
if ( pSrc->IsShared() )
{
destAttr.AddToTail( srcAttr[ i ] );
continue;
}
int idx = refmap.Find( hSrc );
if ( idx != refmap.InvalidIndex() )
{
destAttr.AddToTail( refmap[ idx ] );
continue;
}
if ( bCopy )
{
DmElementHandle_t hDest = g_pDataModel->CreateElement( pSrc->GetType(), pSrc->GetName(), pSrc->GetFileId() );
destAttr.AddToTail( hDest );
CDmElement *pDest = GetElement< CDmElement >( hDest );
pSrc->CopyAttributesTo( pDest, refmap, depth );
continue;
}
destAttr.AddToTail( srcAttr[ i ] );
}
}
//-----------------------------------------------------------------------------
// internal recursive copy method
// builds refmap of old element's handle -> copy's handle, and uses it to fixup references
//-----------------------------------------------------------------------------
void CDmElement::CopyAttributesTo( CDmElement *pCopy, CRefMap &refmap, TraversalDepth_t depth ) const
{
refmap.Insert( this->GetHandle(), pCopy->GetHandle() );
// loop attrs, copying - element (and element array) attrs can be marked to always copy deep(er)
for ( const CDmAttribute *pAttr = FirstAttribute(); pAttr != NULL; pAttr = pAttr->NextAttribute() )
{
DmAttributeType_t type = pAttr->GetType();
const char *pAttrName = pAttr->GetName();
CDmAttribute *pCopyAttr = pCopy->GetAttribute( pAttrName );
if ( pCopyAttr == NULL )
{
pCopyAttr = pCopy->AddAttribute( pAttrName, type );
int flags = pAttr->GetFlags();
Assert( ( flags & FATTRIB_EXTERNAL ) == 0 );
flags &= ~FATTRIB_EXTERNAL;
pCopyAttr->ClearFlags();
pCopyAttr->AddFlag( flags );
}
// Temporarily remove the read-only flag from the copy while we copy into it
bool bReadOnly = pCopyAttr->IsFlagSet( FATTRIB_READONLY );
if ( bReadOnly )
{
pCopyAttr->RemoveFlag( FATTRIB_READONLY );
}
if ( type == AT_ELEMENT )
{
CopyElementAttribute( pAttr, pCopyAttr, refmap, depth );
}
else if ( type == AT_ELEMENT_ARRAY )
{
CopyElementArrayAttribute( pAttr, pCopyAttr, refmap, depth );
}
else
{
pCopyAttr->SetValue( pAttr );
}
if ( bReadOnly )
{
pCopyAttr->AddFlag( FATTRIB_READONLY );
}
}
}
//-----------------------------------------------------------------------------
// FixupReferences
// fixes up any references that Copy wasn't able to figure out
// example:
// during a shallow copy, a channel doesn't copy its target element,
// but the targets parent might decide to copy it, (later on in the travesal)
// so the channel needs to change to refer to the copy
//-----------------------------------------------------------------------------
void CDmElement::FixupReferences( CUtlHashFast< DmElementHandle_t > &visited, const CRefMap &refmap, TraversalDepth_t depth )
{
if ( visited.Find( GetHandle() ) != visited.InvalidHandle() )
return;
visited.Insert( GetHandle(), DMELEMENT_HANDLE_INVALID ); // ignore data arguement - we're just using it as a set
// loop attrs, copying - element (and element array) attrs can be marked to always copy deep(er)
for ( CDmAttribute *pAttr = FirstAttribute(); pAttr != NULL; pAttr = pAttr->NextAttribute() )
{
DmAttributeType_t type = pAttr->GetType();
bool bCopy = ShouldTraverse( pAttr, depth );
if ( type == AT_ELEMENT )
{
DmElementHandle_t handle = pAttr->GetValue<DmElementHandle_t>();
int idx = refmap.Find( handle );
if ( idx == refmap.InvalidIndex() )
{
CDmElement *pElement = GetElement< CDmElement >( handle );
if ( pElement == NULL || !bCopy )
continue;
pElement->FixupReferences( visited, refmap, depth );
}
else
{
pAttr->SetValue( refmap[ idx ] );
}
}
else if ( type == AT_ELEMENT_ARRAY )
{
CDmrElementArray<> attrArray( pAttr );
int nElements = attrArray.Count();
for ( int i = 0; i < nElements; ++i )
{
DmElementHandle_t handle = attrArray.GetHandle( i );
int idx = refmap.Find( handle );
if ( idx == refmap.InvalidIndex() )
{
CDmElement *pElement = GetElement< CDmElement >( handle );
if ( pElement == NULL || !bCopy )
continue;
pElement->FixupReferences( visited, refmap, depth );
}
else
{
attrArray.SetHandle( i, refmap[ idx ] );
}
}
}
}
}
//-----------------------------------------------------------------------------
// Change type (only possible when versioning file formats)
//-----------------------------------------------------------------------------
void CDmElement::SetType( const char *pType )
{
if ( !g_pDataModelImp->IsCreatingUntypedElements() )
{
Warning( "Unable to set type unless you're creating untyped elements!\n" );
return;
}
m_Type = g_pDataModel->GetSymbol( pType );
}
//-----------------------------------------------------------------------------
// owning file
//-----------------------------------------------------------------------------
void CDmElement::SetFileId( DmFileId_t fileid )
{
g_pDataModelImp->RemoveElementFromFile( m_ref.m_hElement, m_fileId );
m_fileId = fileid;
g_pDataModelImp->AddElementToFile( m_ref.m_hElement, fileid );
}
//-----------------------------------------------------------------------------
// recursively set fileid's, with option to only change elements in the matched file
//-----------------------------------------------------------------------------
void CDmElement::SetFileId( DmFileId_t fileid, TraversalDepth_t depth, bool bOnlyIfMatch /* = false */ )
{
if ( depth != TD_NONE )
{
CUtlHashFast< DmElementHandle_t > visited;
visited.Init( 4096 ); // this will make visited behave reasonably (perf-wise) for trees w/ around 4k elements in them
SetFileId_R( visited, fileid, depth, GetFileId(), bOnlyIfMatch );
}
else
{
SetFileId( fileid );
}
}
void CDmElement::SetFileId_R( CUtlHashFast< DmElementHandle_t > &visited, DmFileId_t fileid, TraversalDepth_t depth, DmFileId_t match, bool bOnlyIfMatch )
{
if ( bOnlyIfMatch && match != GetFileId() )
return;
if ( visited.Find( GetHandle() ) != visited.InvalidHandle() )
return;
visited.Insert( GetHandle(), DMELEMENT_HANDLE_INVALID ); // ignore data arguement - we're just using it as a set
SetFileId( fileid );
for ( CDmAttribute *pAttr = FirstAttribute(); pAttr != NULL; pAttr = pAttr->NextAttribute() )
{
DmAttributeType_t type = pAttr->GetType();
if ( !ShouldTraverse( pAttr, depth ) )
continue;
if ( type == AT_ELEMENT )
{
CDmElement *pElement = pAttr->GetValueElement<CDmElement>();
if ( pElement )
{
pElement->SetFileId_R( visited, fileid, depth, match, bOnlyIfMatch );
}
}
else if ( type == AT_ELEMENT_ARRAY )
{
CDmrElementArray<> attrArray( pAttr );
int nElements = attrArray.Count();
for ( int i = 0; i < nElements; ++i )
{
CDmElement *pElement = attrArray[ i ];
if ( pElement )
{
pElement->SetFileId_R( visited, fileid, depth, match, bOnlyIfMatch );
}
}
}
}
}
//-----------------------------------------------------------------------------
//
//-----------------------------------------------------------------------------
DmElementHandle_t CDmElement::GetHandle() const
{
Assert( m_ref.m_hElement != DMELEMENT_HANDLE_INVALID );
return m_ref.m_hElement;
}
//-----------------------------------------------------------------------------
// Iteration
//-----------------------------------------------------------------------------
int CDmElement::AttributeCount() const
{
int nAttrs = 0;
for ( CDmAttribute *pAttr = m_pAttributes; pAttr; pAttr = pAttr->NextAttribute() )
{
++nAttrs;
}
return nAttrs;
}
CDmAttribute* CDmElement::FirstAttribute()
{
return m_pAttributes;
}
const CDmAttribute* CDmElement::FirstAttribute() const
{
return m_pAttributes;
}
bool CDmElement::HasAttribute( const char *pAttributeName, DmAttributeType_t type ) const
{
CDmAttribute *pAttribute = FindAttribute( pAttributeName );
if ( !pAttribute )
return false;
return ( type == AT_UNKNOWN || ( pAttribute->GetType() == type ) );
}
//-----------------------------------------------------------------------------
//
// Implementation Undo for CDmAttributeTyped
//
//-----------------------------------------------------------------------------
class CUndoAttributeRemove : public CUndoElement
{
typedef CUndoElement BaseClass;
public:
CUndoAttributeRemove( CDmElement *pElement, CDmAttribute *pOldAttribute, const char *attributeName, DmAttributeType_t type )
: BaseClass( "CUndoAttributeRemove" ),
m_pElement( pElement ),
m_pOldAttribute( pOldAttribute ),
m_symAttribute( attributeName ),
m_Type( type )
{
Assert( pElement && pElement->GetFileId() != DMFILEID_INVALID );
}
~CUndoAttributeRemove()
{
// Kill old version...
CDmAttributeAccessor::DestroyAttribute( m_pOldAttribute );
}
virtual void Undo()
{
// Add it back in w/o any data
CDmAttribute *pAtt = m_pElement->AddAttribute( m_symAttribute.String(), m_Type );
if ( pAtt )
{
// Copy data from old version
pAtt->SetValue( m_pOldAttribute );
}
}
virtual void Redo()
{
m_pElement->RemoveAttribute( m_symAttribute.String() );
}
private:
CDmElement *m_pElement;
CUtlSymbol m_symAttribute;
DmAttributeType_t m_Type;
CDmAttribute *m_pOldAttribute;
};
//-----------------------------------------------------------------------------
// Containing object
//-----------------------------------------------------------------------------
void CDmElement::RemoveAttributeByPtrNoDelete( CDmAttribute *ptr )
{
for ( CDmAttribute **ppAttr = &m_pAttributes; *ppAttr; ppAttr = ( *ppAttr )->GetNextAttributeRef() )
{
if ( ptr == *ppAttr )
{
MarkDirty();
ptr->InvalidateHandle();
*ppAttr = ( *ppAttr )->NextAttribute();
g_pDataModelImp->NotifyState( NOTIFY_CHANGE_TOPOLOGICAL );
return;
}
}
}
//-----------------------------------------------------------------------------
// Attribute removal
//-----------------------------------------------------------------------------
void CDmElement::RemoveAttribute( CDmAttribute **pAttrRef )
{
CDmAttribute *pAttrToDelete = *pAttrRef;
// Removal of external attributes is verboten
Assert( !pAttrToDelete->IsFlagSet( FATTRIB_EXTERNAL ) );
if( pAttrToDelete->IsFlagSet( FATTRIB_EXTERNAL ) )
return;
MarkDirty();
// UNDO Hook
bool storedbyundo = false;
if ( g_pDataModel->UndoEnabledForElement( this ) )
{
MEM_ALLOC_CREDIT_CLASS();
CUndoAttributeRemove *pUndo = new CUndoAttributeRemove( this, pAttrToDelete, pAttrToDelete->GetName(), pAttrToDelete->GetType() );
g_pDataModel->AddUndoElement( pUndo );
storedbyundo = true;
}
*pAttrRef = ( *pAttrRef )->NextAttribute();
if ( !storedbyundo )
{
CDmAttribute::DestroyAttribute( pAttrToDelete );
}
g_pDataModelImp->NotifyState( NOTIFY_CHANGE_TOPOLOGICAL );
}
void CDmElement::RemoveAttribute( const char *pAttributeName )
{
UtlSymId_t find = g_pDataModel->GetSymbol( pAttributeName );
for ( CDmAttribute **ppAttr = &m_pAttributes; *ppAttr; ppAttr = ( *ppAttr )->GetNextAttributeRef() )
{
if ( find == ( *ppAttr )->GetNameSymbol() )
{
RemoveAttribute( ppAttr );
return;
}
}
}
void CDmElement::RemoveAttributeByPtr( CDmAttribute *pAttribute )
{
Assert( pAttribute );
for ( CDmAttribute **ppAttr = &m_pAttributes; *ppAttr; ppAttr = ( *ppAttr )->GetNextAttributeRef() )
{
if ( pAttribute == *ppAttr )
{
RemoveAttribute( ppAttr );
return;
}
}
}