list.c.017i.build_ssa_passes 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130
  1. uxListRemove (struct ListItem_t * const pxItemToRemove)
  2. {
  3. struct List_t * const pxList;
  4. UBaseType_t D.6028;
  5. <bb 2> :
  6. pxList = pxItemToRemove->pvContainer;
  7. _1 = pxItemToRemove->pxNext;
  8. _2 = pxItemToRemove->pxPrevious;
  9. _1->pxPrevious = _2;
  10. _3 = pxItemToRemove->pxPrevious;
  11. _4 = pxItemToRemove->pxNext;
  12. _3->pxNext = _4;
  13. _5 = pxList->pxIndex;
  14. if (pxItemToRemove == _5)
  15. goto <bb 3>; [INV]
  16. else
  17. goto <bb 4>; [INV]
  18. <bb 3> :
  19. _6 = pxItemToRemove->pxPrevious;
  20. pxList->pxIndex = _6;
  21. <bb 4> :
  22. pxItemToRemove->pvContainer = 0B;
  23. _7 = pxList->uxNumberOfItems;
  24. _8 = _7 + 4294967295;
  25. pxList->uxNumberOfItems = _8;
  26. D.6028 = pxList->uxNumberOfItems;
  27. <bb 5> :
  28. <L3>:
  29. return D.6028;
  30. }
  31. vListInsert (struct List_t * const pxList, struct ListItem_t * const pxNewListItem)
  32. {
  33. const TickType_t xValueOfInsertion;
  34. struct ListItem_t * pxIterator;
  35. <bb 2> :
  36. xValueOfInsertion = pxNewListItem->xItemValue;
  37. if (xValueOfInsertion == 4294967295)
  38. goto <bb 3>; [INV]
  39. else
  40. goto <bb 4>; [INV]
  41. <bb 3> :
  42. pxIterator = pxList->xListEnd.pxPrevious;
  43. goto <bb 7>; [INV]
  44. <bb 4> :
  45. pxIterator = &pxList->xListEnd;
  46. goto <bb 6>; [INV]
  47. <bb 5> :
  48. pxIterator = pxIterator->pxNext;
  49. <bb 6> :
  50. _1 = pxIterator->pxNext;
  51. _2 = _1->xItemValue;
  52. if (xValueOfInsertion >= _2)
  53. goto <bb 5>; [INV]
  54. else
  55. goto <bb 7>; [INV]
  56. <bb 7> :
  57. _3 = pxIterator->pxNext;
  58. pxNewListItem->pxNext = _3;
  59. _4 = pxNewListItem->pxNext;
  60. _4->pxPrevious = pxNewListItem;
  61. pxNewListItem->pxPrevious = pxIterator;
  62. pxIterator->pxNext = pxNewListItem;
  63. pxNewListItem->pvContainer = pxList;
  64. _5 = pxList->uxNumberOfItems;
  65. _6 = _5 + 1;
  66. pxList->uxNumberOfItems = _6;
  67. return;
  68. }
  69. vListInsertEnd (struct List_t * const pxList, struct ListItem_t * const pxNewListItem)
  70. {
  71. struct ListItem_t * const pxIndex;
  72. <bb 2> :
  73. pxIndex = pxList->pxIndex;
  74. pxNewListItem->pxNext = pxIndex;
  75. _1 = pxIndex->pxPrevious;
  76. pxNewListItem->pxPrevious = _1;
  77. _2 = pxIndex->pxPrevious;
  78. _2->pxNext = pxNewListItem;
  79. pxIndex->pxPrevious = pxNewListItem;
  80. pxNewListItem->pvContainer = pxList;
  81. _3 = pxList->uxNumberOfItems;
  82. _4 = _3 + 1;
  83. pxList->uxNumberOfItems = _4;
  84. return;
  85. }
  86. vListInitialiseItem (struct ListItem_t * const pxItem)
  87. {
  88. <bb 2> :
  89. pxItem->pvContainer = 0B;
  90. return;
  91. }
  92. vListInitialise (struct List_t * const pxList)
  93. {
  94. <bb 2> :
  95. _1 = &pxList->xListEnd;
  96. pxList->pxIndex = _1;
  97. pxList->xListEnd.xItemValue = 4294967295;
  98. _2 = &pxList->xListEnd;
  99. pxList->xListEnd.pxNext = _2;
  100. _3 = &pxList->xListEnd;
  101. pxList->xListEnd.pxPrevious = _3;
  102. pxList->uxNumberOfItems = 0;
  103. return;
  104. }