list.c.076i.inline 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241
  1. IPA summary for uxListRemove/8 is missing.
  2. IPA summary for vListInsert/7 is missing.
  3. IPA summary for vListInsertEnd/6 is missing.
  4. IPA summary for vListInitialiseItem/5 is missing.
  5. IPA summary for vListInitialise/4 is missing.
  6. Flattening functions:
  7. Overall time estimate: 0.000000 weighted by profile: 0.000000
  8. Deciding on inlining of small functions. Starting with size 0.
  9. Reclaiming functions:
  10. Reclaiming variables:
  11. Clearing address taken flags:
  12. Deciding on functions to be inlined into all callers and removing useless speculations:
  13. Overall time estimate: 0.000000 weighted by profile: 0.000000
  14. Why inlining failed?
  15. IPA summary for uxListRemove/8 is missing.
  16. IPA summary for vListInsert/7 is missing.
  17. IPA summary for vListInsertEnd/6 is missing.
  18. IPA summary for vListInitialiseItem/5 is missing.
  19. IPA summary for vListInitialise/4 is missing.
  20. Symbol table:
  21. uxListRemove/8 (uxListRemove) @06b86380
  22. Type: function definition analyzed
  23. Visibility: force_output externally_visible no_reorder public
  24. References:
  25. Referring:
  26. Availability: available
  27. Function flags: body
  28. Called by:
  29. Calls:
  30. vListInsert/7 (vListInsert) @06b86d20
  31. Type: function definition analyzed
  32. Visibility: force_output externally_visible no_reorder public
  33. References:
  34. Referring:
  35. Availability: available
  36. Function flags: body
  37. Called by:
  38. Calls:
  39. vListInsertEnd/6 (vListInsertEnd) @06b86a80
  40. Type: function definition analyzed
  41. Visibility: force_output externally_visible no_reorder public
  42. References:
  43. Referring:
  44. Availability: available
  45. Function flags: body
  46. Called by:
  47. Calls:
  48. vListInitialiseItem/5 (vListInitialiseItem) @06b867e0
  49. Type: function definition analyzed
  50. Visibility: force_output externally_visible no_reorder public
  51. References:
  52. Referring:
  53. Availability: available
  54. Function flags: body
  55. Called by:
  56. Calls:
  57. vListInitialise/4 (vListInitialise) @06b86540
  58. Type: function definition analyzed
  59. Visibility: force_output externally_visible no_reorder public
  60. References:
  61. Referring:
  62. Availability: available
  63. Function flags: body
  64. Called by:
  65. Calls:
  66. ;; Function vListInitialise (vListInitialise, funcdef_no=4, decl_uid=5983, cgraph_uid=5, symbol_order=4)
  67. vListInitialise (struct List_t * const pxList)
  68. {
  69. struct MiniListItem_t * _1;
  70. struct MiniListItem_t * _2;
  71. struct MiniListItem_t * _3;
  72. <bb 2> :
  73. _1 = &pxList_4(D)->xListEnd;
  74. pxList_4(D)->pxIndex = _1;
  75. pxList_4(D)->xListEnd.xItemValue = 4294967295;
  76. _2 = &pxList_4(D)->xListEnd;
  77. pxList_4(D)->xListEnd.pxNext = _2;
  78. _3 = &pxList_4(D)->xListEnd;
  79. pxList_4(D)->xListEnd.pxPrevious = _3;
  80. pxList_4(D)->uxNumberOfItems ={v} 0;
  81. return;
  82. }
  83. ;; Function vListInitialiseItem (vListInitialiseItem, funcdef_no=5, decl_uid=5985, cgraph_uid=6, symbol_order=5)
  84. vListInitialiseItem (struct ListItem_t * const pxItem)
  85. {
  86. <bb 2> :
  87. pxItem_2(D)->pvContainer = 0B;
  88. return;
  89. }
  90. ;; Function vListInsertEnd (vListInsertEnd, funcdef_no=6, decl_uid=5991, cgraph_uid=7, symbol_order=6)
  91. vListInsertEnd (struct List_t * const pxList, struct ListItem_t * const pxNewListItem)
  92. {
  93. struct ListItem_t * const pxIndex;
  94. struct xLIST_ITEM * _1;
  95. struct xLIST_ITEM * _2;
  96. long unsigned int _3;
  97. long unsigned int _4;
  98. <bb 2> :
  99. pxIndex_7 = pxList_6(D)->pxIndex;
  100. pxNewListItem_8(D)->pxNext = pxIndex_7;
  101. _1 = pxIndex_7->pxPrevious;
  102. pxNewListItem_8(D)->pxPrevious = _1;
  103. _2 = pxIndex_7->pxPrevious;
  104. _2->pxNext = pxNewListItem_8(D);
  105. pxIndex_7->pxPrevious = pxNewListItem_8(D);
  106. pxNewListItem_8(D)->pvContainer = pxList_6(D);
  107. _3 ={v} pxList_6(D)->uxNumberOfItems;
  108. _4 = _3 + 1;
  109. pxList_6(D)->uxNumberOfItems ={v} _4;
  110. return;
  111. }
  112. ;; Function vListInsert (vListInsert, funcdef_no=7, decl_uid=5988, cgraph_uid=8, symbol_order=7)
  113. vListInsert (struct List_t * const pxList, struct ListItem_t * const pxNewListItem)
  114. {
  115. const TickType_t xValueOfInsertion;
  116. struct ListItem_t * pxIterator;
  117. struct xLIST_ITEM * _1;
  118. long unsigned int _2;
  119. struct xLIST_ITEM * _3;
  120. struct xLIST_ITEM * _4;
  121. long unsigned int _5;
  122. long unsigned int _6;
  123. <bb 2> :
  124. xValueOfInsertion_11 = pxNewListItem_10(D)->xItemValue;
  125. if (xValueOfInsertion_11 == 4294967295)
  126. goto <bb 3>; [INV]
  127. else
  128. goto <bb 4>; [INV]
  129. <bb 3> :
  130. pxIterator_15 = pxList_12(D)->xListEnd.pxPrevious;
  131. goto <bb 7>; [INV]
  132. <bb 4> :
  133. pxIterator_13 = &pxList_12(D)->xListEnd;
  134. goto <bb 6>; [INV]
  135. <bb 5> :
  136. pxIterator_14 = pxIterator_7->pxNext;
  137. <bb 6> :
  138. # pxIterator_7 = PHI <pxIterator_13(4), pxIterator_14(5)>
  139. _1 = pxIterator_7->pxNext;
  140. _2 = _1->xItemValue;
  141. if (xValueOfInsertion_11 >= _2)
  142. goto <bb 5>; [INV]
  143. else
  144. goto <bb 7>; [INV]
  145. <bb 7> :
  146. # pxIterator_8 = PHI <pxIterator_15(3), pxIterator_7(6)>
  147. _3 = pxIterator_8->pxNext;
  148. pxNewListItem_10(D)->pxNext = _3;
  149. _4 = pxNewListItem_10(D)->pxNext;
  150. _4->pxPrevious = pxNewListItem_10(D);
  151. pxNewListItem_10(D)->pxPrevious = pxIterator_8;
  152. pxIterator_8->pxNext = pxNewListItem_10(D);
  153. pxNewListItem_10(D)->pvContainer = pxList_12(D);
  154. _5 ={v} pxList_12(D)->uxNumberOfItems;
  155. _6 = _5 + 1;
  156. pxList_12(D)->uxNumberOfItems ={v} _6;
  157. return;
  158. }
  159. ;; Function uxListRemove (uxListRemove, funcdef_no=8, decl_uid=5993, cgraph_uid=9, symbol_order=8)
  160. uxListRemove (struct ListItem_t * const pxItemToRemove)
  161. {
  162. struct List_t * const pxList;
  163. UBaseType_t D.6028;
  164. struct xLIST_ITEM * _1;
  165. struct xLIST_ITEM * _2;
  166. struct xLIST_ITEM * _3;
  167. struct xLIST_ITEM * _4;
  168. struct ListItem_t * _5;
  169. struct xLIST_ITEM * _6;
  170. long unsigned int _7;
  171. long unsigned int _8;
  172. UBaseType_t _18;
  173. <bb 2> :
  174. pxList_12 = pxItemToRemove_11(D)->pvContainer;
  175. _1 = pxItemToRemove_11(D)->pxNext;
  176. _2 = pxItemToRemove_11(D)->pxPrevious;
  177. _1->pxPrevious = _2;
  178. _3 = pxItemToRemove_11(D)->pxPrevious;
  179. _4 = pxItemToRemove_11(D)->pxNext;
  180. _3->pxNext = _4;
  181. _5 = pxList_12->pxIndex;
  182. if (pxItemToRemove_11(D) == _5)
  183. goto <bb 3>; [INV]
  184. else
  185. goto <bb 4>; [INV]
  186. <bb 3> :
  187. _6 = pxItemToRemove_11(D)->pxPrevious;
  188. pxList_12->pxIndex = _6;
  189. <bb 4> :
  190. pxItemToRemove_11(D)->pvContainer = 0B;
  191. _7 ={v} pxList_12->uxNumberOfItems;
  192. _8 = _7 + 4294967295;
  193. pxList_12->uxNumberOfItems ={v} _8;
  194. _18 ={v} pxList_12->uxNumberOfItems;
  195. <bb 5> :
  196. <L3>:
  197. return _18;
  198. }