Advertisement
Guest User

Untitled

a guest
Apr 5th, 2019
131
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.45 KB | None | 0 0
  1.  
  2. /* WARNING: Function: __i686.get_pc_thunk.bx replaced with injection: get_pc_thunk_bx */
  3. /* WARNING: Globals starting with '_' overlap smaller symbols at the same address */
  4.  
  5. void MakeNewTree(void)
  6.  
  7. {
  8. int iVar1;
  9. int iVar2;
  10. int *piVar3;
  11. int iVar4;
  12. int iVar5;
  13. int iVar6;
  14. int local_98ac;
  15. int *local_98a8;
  16. int local_98a0;
  17. int *local_989c;
  18. int local_9898;
  19. int aiStack39056 [7935];
  20. int aiStack7316 [257];
  21. int aiStack6288 [512];
  22. int local_1090 [512];
  23. int local_890 [512];
  24. int local_90 [32];
  25.  
  26. piVar3 = local_90;
  27. do {
  28. *piVar3 = 0;
  29. piVar3 = piVar3 + 1;
  30. } while (piVar3 != (int *)&stack0xfffffff0);
  31. iVar5 = 0;
  32. iVar4 = 0;
  33. do {
  34. iVar6 = m_BitLenTable[iVar5];
  35. iVar1 = local_90[iVar6];
  36. iVar4 += (uint)(iVar6 == 0);
  37. aiStack39056[iVar6 * 0x100 + iVar1] = iVar5;
  38. iVar5 += 1;
  39. local_90[iVar6] = iVar1 + 1;
  40. } while (iVar5 != 0x100);
  41. piVar3 = m_Nodes + 2;
  42. do {
  43. *piVar3 = -1;
  44. piVar3[1] = -1;
  45. piVar3 = piVar3 + 6;
  46. } while (piVar3 != (int *)&DAT_00021468);
  47. iVar5 = 0x101;
  48. do {
  49. aiStack7316[iVar5] = iVar5;
  50. iVar5 += 1;
  51. } while (iVar5 != 0x200);
  52. local_989c = local_90 + 1;
  53. m_Nodes[1537] = -1;
  54. _m_Root = 0x100;
  55. local_9898 = -0x100;
  56. local_98a0 = 0xff;
  57. local_98ac = 1;
  58. do {
  59. if (0 < *local_989c) {
  60. iVar6 = *local_989c + iVar4;
  61. iVar5 = iVar4 + local_9898;
  62. do {
  63. iVar1 = local_1090[local_98ac + -1];
  64. iVar2 = aiStack39056[iVar5 * 0x3fffffff + iVar4];
  65. if (m_Nodes[iVar1 * 6 + 2] == -1) {
  66. m_Nodes[iVar1 * 6 + 2] = iVar2;
  67. }
  68. else {
  69. m_Nodes[iVar1 * 6 + 3] = iVar2;
  70. local_98ac = local_98ac + -1;
  71. }
  72. iVar4 += 1;
  73. m_Nodes[iVar2 * 6 + 1] = iVar1;
  74. if (iVar4 == 0x100) {
  75. return;
  76. }
  77. } while (iVar4 != iVar6);
  78. }
  79. iVar5 = 0;
  80. if (local_98ac != 0) {
  81. iVar6 = local_98a0 + -1;
  82. local_98a8 = aiStack6288 + iVar6;
  83. iVar5 = 0;
  84. do {
  85. local_98a0 = iVar6 - iVar5;
  86. iVar1 = local_1090[local_98ac + -1];
  87. iVar2 = *local_98a8;
  88. if (m_Nodes[iVar1 * 6 + 2] == -1) {
  89. m_Nodes[iVar1 * 6 + 2] = iVar2;
  90. }
  91. else {
  92. m_Nodes[iVar1 * 6 + 3] = iVar2;
  93. local_98ac = local_98ac + -1;
  94. }
  95. m_Nodes[iVar2 * 6 + 1] = iVar1;
  96. local_890[iVar5] = iVar2;
  97. if (iVar5 == iVar6) {
  98. return;
  99. }
  100. iVar5 += 1;
  101. local_98a8 = local_98a8 + -1;
  102. } while (local_98ac != 0);
  103. if (0 < iVar5) {
  104. iVar6 = 0;
  105. do {
  106. local_1090[iVar6] = local_890[iVar6];
  107. iVar6 += 1;
  108. } while (iVar6 != iVar5);
  109. }
  110. }
  111. local_989c = local_989c + 1;
  112. local_9898 += -0x100;
  113. local_98ac = iVar5;
  114. if (local_989c == (int *)&stack0xfffffff0) {
  115. return;
  116. }
  117. } while( true );
  118. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement