This repository has been archived by the owner on May 3, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 34
/
CrowdDetox.cpp
executable file
·1241 lines (1106 loc) · 37.2 KB
/
CrowdDetox.cpp
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
/*!
@file CrowdDetox.cpp
@author Jason Geffner (jason@crowdstrike.com)
@brief CrowdDetox v1.0.2 Beta
@details The CrowdDetox plugin for Hex-Rays automatically removes junk
code and variables from Hex-Rays function decompilations.
See LICENSE file in top level directory for details.
@copyright CrowdStrike, Inc. Copyright (c) 2013. All rights reserved.
*/
//
// Disable warnings about:
// 1. Code in hexrays.hpp casting to bools
// 2. Deprecated code in typeinf.hpp (included by hexrays.hpp)
//
#pragma warning(push)
#pragma warning(disable: 4800 4996)
#include <hexrays.hpp>
#pragma warning(pop)
#ifndef _countof
#define _countof(array) (sizeof(array)/sizeof(array[0]))
#endif
#define UNUSED(x) (void)(x)
//
// Hex-Rays API pointer
//
hexdsp_t* hexdsp = NULL;
//
// This global flag tracks whether or not this plugin has been initialized
//
bool g_fInitialized = false;
/*!
@brief Removes junk code and variables from the given function
@param[in] pFunction The function from which to remove junk code and
variables
*/
void
Detox (
cfunc_t* pFunction
)
{
lvars_t* pVariables;
//
// This structure is derived from ctree_visitor_t. It is used to find
// legitimate ctree_t items and legitimate variables.
//
struct ida_local FIND_LEGIT_ITEMS_VISITOR : public ctree_visitor_t
{
private:
//
// This flag is used to ensure that afVariableIsLegit has been
// initialized
//
bool fInitialized;
//
// This variable keeps track of the function being decompiled
//
cfunc_t* pFunction;
//
// This vector helps ensure we don't descend through items through
// which we've already descended
//
qvector<citem_t*> vectorDescendantsMarkedLegit;
//
// This flag keeps track of the "mode" in which we're visiting ctree
// items. By default, this flag is false. However, the code sets it to
// true in order to mark all descendant ctree items and variables as
// legitimate. Hex-Rays is single-threaded, so there are no thread-
// safety issues.
//
bool fMarkingDescendantsLegit;
/*!
@brief Determine if the given function call is legitimate (as
opposed to a trivial macro)
@param[in] pExpression The expression containing the function call
@return Returns true if the function call appears to be legitimate,
returns false otherwise
*/
bool
IsLegitimateCall (
cexpr_t* pExpression
)
{
cexpr_t* pCalledFunction;
char szFunctionName[1024];
//
// These macros are from IDA's defs.h
//
char* aszNonLegitHelpers[] =
{
"__ROL__",
"__ROL1__",
"__ROL2__",
"__ROL4__",
"__ROL8__",
"__ROR1__",
"__ROR2__",
"__ROR4__",
"__ROR8__",
"LOBYTE",
"LOWORD",
"LODWORD",
"HIBYTE",
"HIWORD",
"HIDWORD",
"BYTEn",
"WORDn",
"BYTE1",
"BYTE2",
"BYTE3",
"BYTE4",
"BYTE5",
"BYTE6",
"BYTE7",
"BYTE8",
"BYTE9",
"BYTE10",
"BYTE11",
"BYTE12",
"BYTE13",
"BYTE14",
"BYTE15",
"WORD1",
"WORD2",
"WORD3",
"WORD4",
"WORD5",
"WORD6",
"WORD7",
"SLOBYTE",
"SLOWORD",
"SLODWORD",
"SHIBYTE",
"SHIWORD",
"SHIDWORD",
"SBYTEn",
"SWORDn",
"SBYTE1",
"SBYTE2",
"SBYTE3",
"SBYTE4",
"SBYTE5",
"SBYTE6",
"SBYTE7",
"SBYTE8",
"SBYTE9",
"SBYTE10",
"SBYTE11",
"SBYTE12",
"SBYTE13",
"SBYTE14",
"SBYTE15",
"SWORD1",
"SWORD2",
"SWORD3",
"SWORD4",
"SWORD5",
"SWORD6",
"SWORD7",
"__CFSHL__",
"__CFSHR__",
"__CFADD__",
"__CFSUB__",
"__OFADD__",
"__OFSUB__",
"__RCL__",
"__RCR__",
"__MKCRCL__",
"__MKCRCR__",
"__SETP__",
"__MKCSHL__",
"__MKCSHR__",
"__SETS__",
"__ROR__"
};
//
// Ensure that the input expression is a call
//
if (pExpression->op != cot_call)
{
return false;
}
//
// Get a pointer to the called function
//
pCalledFunction = pExpression->x;
//
// If the called function isn't a built-in "helper" (IDA macro),
// assume it's a call to a legitimate function
//
if (pCalledFunction->op != cot_helper)
{
return true;
}
//
// Get the name of the called "helper" function/macro
//
if (0 == pCalledFunction->print1(
szFunctionName,
_countof(szFunctionName) - 1,
NULL))
{
return false;
}
tag_remove(
szFunctionName,
szFunctionName,
_countof(szFunctionName) - 1);
//
// If the helper function is one of the macros from defs.h, it's
// not *necessarily* legitimate (though if one of the arguments to
// the function is legitimate, then the expression will get marked
// as legitimate anyway)
//
for (int i = 0; i < _countof(aszNonLegitHelpers); i++)
{
if (0 == strcmp(szFunctionName, aszNonLegitHelpers[i]))
{
return false;
}
}
//
// Otherwise, if the helper function is something like
// "__readfsdword", then it's probably legitimate
//
return true;
}
/*!
@brief This function, called by Hex-Rays when the ctree visitor
visits an expresison item, is a stub for visit_item()
@param[in] pExpression The visited expression item
@return Returns 0 to continue the traversal, returns 1 to stop
the traversal
*/
int
idaapi
visit_expr (
cexpr_t* pExpression
)
{
return visit_item(
pExpression);
}
/*!
@brief This function, called by Hex-Rays when the ctree visitor
visits a statement item, is a stub for visit_item()
@param[in] pExpression The visited statement item
@return Returns 0 to continue the traversal, returns 1 to stop
the traversal
*/
int
idaapi
visit_insn (
cinsn_t* pInstruction
)
{
return visit_item(
pInstruction);
}
/*!
@brief This function determines if a ctree item is legitimate; it
marks variables legitimate via the afVariableIsLegit array
and saves legitimate items in the vectorLegitItems vector
@param[in] pItem The visited ctree item
@return Returns 0 to continue the traversal, returns 1 to stop
the traversal
*/
int
visit_item (
citem_t* pItem
)
{
cexpr_t* pExpression;
char szType[16];
//
// Ensure that we're initialized
//
if (!fInitialized)
{
if (!Initialize())
{
return 1;
}
}
//
// If we're traversing the graph solely to mark descendants as
// legitimate...
//
if (fMarkingDescendantsLegit)
{
//
// Don't descend through items through which we've already
// descended
//
if (vectorDescendantsMarkedLegit.has(pItem))
{
return 0;
}
//
// If this is a variable, mark the variable legitimate
//
if (pItem->op == cot_var)
{
afVariableIsLegit[((cexpr_t*)pItem)->v.idx] = true;
}
//
// Mark the item itself legitimate
//
if (!vectorLegitItems.has(pItem))
{
vectorLegitItems.push_back(
pItem);
fNewLegitItemFound = true;
}
//
// Remember that we've now descended through this item
//
vectorDescendantsMarkedLegit.push_back(
pItem);
//
// Continue marking other descendant items as legitimate
//
return 0;
}
//
// If this item was already marked as legititmate...
//
if (vectorLegitItems.has(pItem))
{
//
// If we have a legitimate item that's an if/for/while/do/
// return statement then mark the expression part of that node
// (for example, the "x" in "if(x)") as legitimate as well
//
pExpression = NULL;
switch (pItem->op)
{
case cit_if:
pExpression = &((cinsn_t*)pItem)->cif->expr; break;
case cit_for:
pExpression = &((cinsn_t*)pItem)->cfor->expr; break;
case cit_while:
pExpression = &((cinsn_t*)pItem)->cwhile->expr; break;
case cit_do:
pExpression = &((cinsn_t*)pItem)->cdo->expr; break;
case cit_return:
pExpression = &((cinsn_t*)pItem)->creturn->expr; break;
default:
break;
}
if (pExpression == NULL)
{
return 0;
}
//
// If the expression hasn't already been marked as legitimate
// then mark it so and mark all of its descendants as
// legitimate as well
//
if (!vectorDescendantsMarkedLegit.has(pExpression))
{
//
// Mark all items under this expression/call as legitimate
//
fMarkingDescendantsLegit = true;
apply_to(
pExpression,
NULL);
fMarkingDescendantsLegit = false;
//
// cit_for statements require us to also process the
// for-loop initialization and step expressions
//
if (pItem->op == cit_for)
{
//
// Process the for-loop's initialization expression
//
pExpression = &((cinsn_t*)pItem)->cfor->init;
if (!vectorDescendantsMarkedLegit.has(pExpression))
{
//
// Mark all items under this expression as legit
//
fMarkingDescendantsLegit = true;
apply_to(
pExpression,
NULL);
fMarkingDescendantsLegit = false;
}
//
// Process the for-loop's step expression
//
pExpression = &((cinsn_t*)pItem)->cfor->step;
if (!vectorDescendantsMarkedLegit.has(pExpression))
{
//
// Mark all items under this expression as legit
//
fMarkingDescendantsLegit = true;
apply_to(
pExpression,
NULL);
fMarkingDescendantsLegit = false;
}
}
}
return 0;
}
//
// If this item is a legitimate variable and/or a CPPEH_RECORD
// variable, or a function, global variable, legit macro, goto,
// break, continue, return, or asm-statement then mark the ancestor
// expressions as legitimate
//
if (pItem->op == cot_var)
{
if (!afVariableIsLegit[((cexpr_t*)pItem)->v.idx])
{
if (T_NORMAL != print_type_to_one_line(
szType,
_countof(szType),
idati,
((cexpr_t*)pItem)->type.u_str()))
{
return 0;
}
if (0 != strcmp(szType, "CPPEH_RECORD"))
{
return 0;
}
}
}
else if (!((pItem->op == cot_obj) ||
((pItem->op == cot_call) &&
IsLegitimateCall((cexpr_t*)pItem)) ||
(pItem->op == cit_goto) ||
(pItem->op == cit_break) ||
(pItem->op == cit_continue) ||
(pItem->op == cit_return)) ||
(pItem->op == cit_asm))
{
return 0;
}
//
// Iterate through all ancestors (assumes that the decompilation
// graph is a tree and that no item has more than one parent)
//
for(citem_t* pCurrentItem = pItem;
pCurrentItem != NULL;
pCurrentItem = pFunction->body.find_parent_of(pCurrentItem))
{
if (!vectorLegitItems.has(pCurrentItem))
{
vectorLegitItems.push_back(
pCurrentItem);
fNewLegitItemFound = true;
}
if ((pCurrentItem->op == cit_expr) ||
((pCurrentItem->op == cot_call) &&
IsLegitimateCall((cexpr_t*)pCurrentItem)) ||
(pCurrentItem->op == cit_return))
{
//
// This is a cit_expr statement node or cot_call
// expression
//
if (!vectorDescendantsMarkedLegit.has(pCurrentItem))
{
//
// Mark all items under this expression/call as legit
//
fMarkingDescendantsLegit = true;
apply_to(
pCurrentItem,
NULL);
fMarkingDescendantsLegit = false;
}
}
}
return 0;
}
public:
//
// This flag keeps track of whether or not new legitimate ctree items
// were found during the ctree traversal
//
bool fNewLegitItemFound;
//
// This vector is a list of all legitimate ctree items
//
qvector<citem_t*> vectorLegitItems;
//
// This flag array (indexed to match the order of indeces in the
// function's lvars_t vector) keeps track of whether each variable is
// legitimate or not
//
bool* afVariableIsLegit;
/*!
@brief Allocate and initialize the afVariableIsLegit array
@param[in] pItem The visited ctree item
@return Returns 0 to continue the traversal, returns 1 to stop
the traversal
*/
bool
Initialize (
void
)
{
lvars_t* pVariables;
//
// Allocate the afVariableIsLegit array
//
pVariables = pFunction->get_lvars();
afVariableIsLegit = (bool*)malloc(
pVariables->size());
if (afVariableIsLegit == NULL)
{
msg(
"CrowdDetox error: Cannot allocate %d bytes.\n",
pVariables->size() * sizeof(bool));
return false;
}
//
// Initialize the afVariableIsLegit array based on function
// arguments
//
for (size_t i = 0; i < pVariables->size(); i++)
{
afVariableIsLegit[i] = pVariables->at(i).is_arg_var();
}
fInitialized = true;
return true;
}
//
// FIND_LEGIT_ITEMS_VISITOR constructor
//
FIND_LEGIT_ITEMS_VISITOR(cfunc_t* _pFunction):
ctree_visitor_t(CV_PARENTS),
fInitialized(false),
pFunction(_pFunction),
afVariableIsLegit(NULL),
fNewLegitItemFound(false),
fMarkingDescendantsLegit(false)
{
//
// Do nothing
//
}
//
// FIND_LEGIT_ITEMS_VISITOR destructor
//
~FIND_LEGIT_ITEMS_VISITOR()
{
//
// Free the afVariableIsLegit array
//
if (afVariableIsLegit != NULL)
{
free(
afVariableIsLegit);
afVariableIsLegit = NULL;
}
}
};
//
// Keep traversing the function's ctree until no new legitimate items are
// found
//
FIND_LEGIT_ITEMS_VISITOR fliv(pFunction);
do
{
fliv.fNewLegitItemFound = false;
fliv.apply_to(
&pFunction->body,
NULL);
} while (fliv.fNewLegitItemFound);
//
// This structure is derived from ctree_visitor_t. It is used to prune
// junk ctree_t items from the decompilation graph.
//
struct ida_local PRUNE_ITEMS_VISITOR : public ctree_visitor_t
{
private:
//
// This vector is a list of all previously-found legitimate ctree items
//
qvector<citem_t*>* pVectorLegitItems;
//
// This variable keeps track of the function being decompiled
//
cfunc_t* pFunction;
//
// The modes in which the decompilation tree will be traversed
//
enum VisitingMode
{
Pruning,
CleaningUpGotoLabels,
ChangingGotos,
FindingChildrenOfParent
};
VisitingMode visitingMode;
//
// Used in FindingChildrenOfParent visiting mode. Parent currently
// being analyzed.
//
citem_t* pCurrentParent;
//
// Used in FindingChildrenOfParent visiting mode. This vector tracks
// children of the currently analyzed parent block.
//
qvector<citem_t*> vectorChildrenOfParentBlock;
//
// Used in ChangingGotos visiting mode. Stores original goto
// destination label number.
//
int nOldLabelNumber;
//
// Used in ChangingGotos visiting mode. Stores new goto destination
// label number. If -1, change gotos to return.
//
int nNewLabelNumber;
//
// If this item and all of its descendants contain no goto-labels,
// this is false (no cleaning up done). If a goto label was cleaned up,
// this is true.
bool fGotoCleaned;
/*!
@brief This function, called by Hex-Rays when the ctree visitor
visits an expresison item, is a stub for visit_item()
@param[in] pExpression The visited expression item
@return Returns 0 to continue the traversal, returns 1 to stop
the traversal
*/
int
idaapi
visit_expr (
cexpr_t* pExpression
)
{
return visit_item(
pExpression);
}
/*!
@brief This function, called by Hex-Rays when the ctree visitor
visits a statement item, is a stub for visit_item()
@param[in] pExpression The visited statement item
@return Returns 0 to continue the traversal, returns 1 to stop
the traversal
*/
int
idaapi
visit_insn (
cinsn_t* pInstruction
)
{
return visit_item(
pInstruction);
}
/*!
@brief This function prunes junk items from the decompilation graph
@param[in] pItem The visited ctree item
@return Returns 0 to continue the traversal, returns 1 to stop
the traversal
*/
int
visit_item (
citem_t* pItem
)
{
cblock_t* pBlock;
citem_t* pParent;
citem_t* pNewDestination;
//
// If we're in the (default) Pruning mode...
//
if (visitingMode == Pruning)
{
//
// Erase all empty items from cit_block items
//
if (pItem->op == cit_block)
{
pBlock = ((cinsn_t*)pItem)->cblock;
for (
cblock_t::iterator pIterator = pBlock->begin();
pIterator != pBlock->end();
pIterator++)
{
if ((pIterator->op == cit_empty) ||
(pIterator->op == cot_empty))
{
pBlock->erase(
pIterator);
fPruned = true;
return 1;
}
}
return 0;
}
//
// Don't cleanup cit_break, cit_continue, cit_goto, cit_empty,
// cot_empty, cit_asm, or cit_return items
//
if ((pItem->op == cit_break) ||
(pItem->op == cit_continue) ||
(pItem->op == cit_goto) ||
(pItem->op == cit_empty) ||
(pItem->op == cot_empty) ||
(pItem->op == cit_asm) ||
(pItem->op == cit_return))
{
//
// Don't cleanup descendants of these items, either
//
prune_now();
return 0;
}
//
// Cleanup everything else unless it's marked as legitimate
//
if (pVectorLegitItems->has(pItem))
{
return 0;
}
//
// Only cleanup statements, not expressions
//
if (pItem->is_expr())
{
return 0;
}
//
// Keep cleaning up goto labels under this item until no labels
// remain
//
visitingMode = CleaningUpGotoLabels;
fGotoCleaned = true;
while (fGotoCleaned)
{
fGotoCleaned = false;
apply_to(
pItem,
NULL);
}
visitingMode = Pruning;
//
// Execute the actual cleanup() call
//
((cinsn_t*)pItem)->cleanup();
fPruned = true;
return 1;
}
//
// If we're in CleaningUpGotoLabels mode...
//
else if (visitingMode == CleaningUpGotoLabels)
{
//
// Keep searching this tree branch until we find a goto label
//
if (pItem->label_num == -1)
{
return 0;
}
//
// We found an item with a goto label, so save its old label
// number
//
nOldLabelNumber = pItem->label_num;
//
// Find a new place to assign this label
//
pParent = pItem;
pNewDestination = NULL;
while (pNewDestination == NULL)
{
while (NULL != (pParent = pFunction->body.find_parent_of(pParent)))
{
if (pParent->op == cit_block)
{
break;
}
}
if (pParent == NULL)
{
//
// We couldn't find any parent block, which means we
// can't move the goto label. Instead, change the gotos
// that point to this label into returns.
//
//
// Change gotos that jump to nOldLabelNumber to instead
// be returns
//
nNewLabelNumber = -1;
visitingMode = ChangingGotos;
apply_to(
&pFunction->body,
NULL);
fGotoCleaned = true;
return 1;
}
//
// The parent block was found. See if there are any
// children of that parent block whose EA is greater than
// that of the current label's item.
//
pCurrentParent = pParent;
vectorChildrenOfParentBlock.clear();
visitingMode = FindingChildrenOfParent;
apply_to(
pParent,
NULL);
visitingMode = CleaningUpGotoLabels;
for (size_t i = 0;
i < vectorChildrenOfParentBlock.size();
i++)
{
if (!(vectorChildrenOfParentBlock[i]->ea > pItem->ea))
{
continue;
}
if ((pNewDestination == NULL) ||
(vectorChildrenOfParentBlock[i]->ea <
pNewDestination->ea))
{
pNewDestination = vectorChildrenOfParentBlock[i];
}
}
}
//
// We now have a pNewDestination for our label
//
//
// If the new destination already has a label number...
//
if (pNewDestination->label_num != -1)
{
//
// Update all goto items in the graph that originally
// pointed to the old label to now point to
// pNewDestination's label
//
nNewLabelNumber = pNewDestination->label_num;
visitingMode = ChangingGotos;
apply_to(
&pFunction->body,
NULL);
fGotoCleaned = true;
return 1;
}
//
// Otherwise, just move the label
//
pNewDestination->label_num = pItem->label_num;
pItem->label_num = -1;
fGotoCleaned = true;
return 1;
}
//
// If we're in FindingChildrenOfParent mode...
//
else if (visitingMode == FindingChildrenOfParent)
{
//
// If the item is a child of the current parent, add it to the
// vectorChildrenOfParentBlock vector
//
if (parents.back() == pCurrentParent)
{
vectorChildrenOfParentBlock.push_back(pItem);
}
return 0;
}
//
// If we're in the ChaningGotos mode...
//
else if (visitingMode == ChangingGotos)
{
//
// Change cit_goto items to either point to a new goto label or
// to be a cit_return instead.
//
if (!((pItem->op == cit_goto) &&
(((cinsn_t*)pItem)->cgoto->label_num == nOldLabelNumber)))
{
return 0;
}
if (nNewLabelNumber != -1)
{
//
// Change the destination label of the goto
//
((cinsn_t*)pItem)->cgoto->label_num = nNewLabelNumber;
return 0;