IPA summary for uxListRemove/8 is missing. IPA summary for vListInsert/7 is missing. IPA summary for vListInsertEnd/6 is missing. IPA summary for vListInitialiseItem/5 is missing. IPA summary for vListInitialise/4 is missing. Flattening functions: Overall time estimate: 0.000000 weighted by profile: 0.000000 Deciding on inlining of small functions. Starting with size 0. Reclaiming functions: Reclaiming variables: Clearing address taken flags: Deciding on functions to be inlined into all callers and removing useless speculations: Overall time estimate: 0.000000 weighted by profile: 0.000000 Why inlining failed? IPA summary for uxListRemove/8 is missing. IPA summary for vListInsert/7 is missing. IPA summary for vListInsertEnd/6 is missing. IPA summary for vListInitialiseItem/5 is missing. IPA summary for vListInitialise/4 is missing. Symbol table: uxListRemove/8 (uxListRemove) @06b36ee0 Type: function definition analyzed Visibility: force_output externally_visible no_reorder public References: Referring: Availability: available Function flags: body Called by: Calls: vListInsert/7 (vListInsert) @06b36c40 Type: function definition analyzed Visibility: force_output externally_visible no_reorder public References: Referring: Availability: available Function flags: body Called by: Calls: vListInsertEnd/6 (vListInsertEnd) @06b369a0 Type: function definition analyzed Visibility: force_output externally_visible no_reorder public References: Referring: Availability: available Function flags: body Called by: Calls: vListInitialiseItem/5 (vListInitialiseItem) @06b36700 Type: function definition analyzed Visibility: force_output externally_visible no_reorder public References: Referring: Availability: available Function flags: body Called by: Calls: vListInitialise/4 (vListInitialise) @06b36460 Type: function definition analyzed Visibility: force_output externally_visible no_reorder public References: Referring: Availability: available Function flags: body Called by: Calls: ;; Function vListInitialise (vListInitialise, funcdef_no=4, decl_uid=5982, cgraph_uid=5, symbol_order=4) vListInitialise (struct List_t * const pxList) { struct MiniListItem_t * _1; struct MiniListItem_t * _2; struct MiniListItem_t * _3; : _1 = &pxList_4(D)->xListEnd; pxList_4(D)->pxIndex = _1; pxList_4(D)->xListEnd.xItemValue = 4294967295; _2 = &pxList_4(D)->xListEnd; pxList_4(D)->xListEnd.pxNext = _2; _3 = &pxList_4(D)->xListEnd; pxList_4(D)->xListEnd.pxPrevious = _3; pxList_4(D)->uxNumberOfItems ={v} 0; return; } ;; Function vListInitialiseItem (vListInitialiseItem, funcdef_no=5, decl_uid=5984, cgraph_uid=6, symbol_order=5) vListInitialiseItem (struct ListItem_t * const pxItem) { : pxItem_2(D)->pvContainer = 0B; return; } ;; Function vListInsertEnd (vListInsertEnd, funcdef_no=6, decl_uid=5990, cgraph_uid=7, symbol_order=6) vListInsertEnd (struct List_t * const pxList, struct ListItem_t * const pxNewListItem) { struct ListItem_t * const pxIndex; struct xLIST_ITEM * _1; struct xLIST_ITEM * _2; long unsigned int _3; long unsigned int _4; : pxIndex_7 = pxList_6(D)->pxIndex; pxNewListItem_8(D)->pxNext = pxIndex_7; _1 = pxIndex_7->pxPrevious; pxNewListItem_8(D)->pxPrevious = _1; _2 = pxIndex_7->pxPrevious; _2->pxNext = pxNewListItem_8(D); pxIndex_7->pxPrevious = pxNewListItem_8(D); pxNewListItem_8(D)->pvContainer = pxList_6(D); _3 ={v} pxList_6(D)->uxNumberOfItems; _4 = _3 + 1; pxList_6(D)->uxNumberOfItems ={v} _4; return; } ;; Function vListInsert (vListInsert, funcdef_no=7, decl_uid=5987, cgraph_uid=8, symbol_order=7) vListInsert (struct List_t * const pxList, struct ListItem_t * const pxNewListItem) { const TickType_t xValueOfInsertion; struct ListItem_t * pxIterator; struct xLIST_ITEM * _1; long unsigned int _2; struct xLIST_ITEM * _3; struct xLIST_ITEM * _4; long unsigned int _5; long unsigned int _6; : xValueOfInsertion_11 = pxNewListItem_10(D)->xItemValue; if (xValueOfInsertion_11 == 4294967295) goto ; [INV] else goto ; [INV] : pxIterator_15 = pxList_12(D)->xListEnd.pxPrevious; goto ; [INV] : pxIterator_13 = &pxList_12(D)->xListEnd; goto ; [INV] : pxIterator_14 = pxIterator_7->pxNext; : # pxIterator_7 = PHI _1 = pxIterator_7->pxNext; _2 = _1->xItemValue; if (xValueOfInsertion_11 >= _2) goto ; [INV] else goto ; [INV] : # pxIterator_8 = PHI _3 = pxIterator_8->pxNext; pxNewListItem_10(D)->pxNext = _3; _4 = pxNewListItem_10(D)->pxNext; _4->pxPrevious = pxNewListItem_10(D); pxNewListItem_10(D)->pxPrevious = pxIterator_8; pxIterator_8->pxNext = pxNewListItem_10(D); pxNewListItem_10(D)->pvContainer = pxList_12(D); _5 ={v} pxList_12(D)->uxNumberOfItems; _6 = _5 + 1; pxList_12(D)->uxNumberOfItems ={v} _6; return; } ;; Function uxListRemove (uxListRemove, funcdef_no=8, decl_uid=5992, cgraph_uid=9, symbol_order=8) uxListRemove (struct ListItem_t * const pxItemToRemove) { struct List_t * const pxList; UBaseType_t D.6027; struct xLIST_ITEM * _1; struct xLIST_ITEM * _2; struct xLIST_ITEM * _3; struct xLIST_ITEM * _4; struct ListItem_t * _5; struct xLIST_ITEM * _6; long unsigned int _7; long unsigned int _8; UBaseType_t _18; : pxList_12 = pxItemToRemove_11(D)->pvContainer; _1 = pxItemToRemove_11(D)->pxNext; _2 = pxItemToRemove_11(D)->pxPrevious; _1->pxPrevious = _2; _3 = pxItemToRemove_11(D)->pxPrevious; _4 = pxItemToRemove_11(D)->pxNext; _3->pxNext = _4; _5 = pxList_12->pxIndex; if (pxItemToRemove_11(D) == _5) goto ; [INV] else goto ; [INV] : _6 = pxItemToRemove_11(D)->pxPrevious; pxList_12->pxIndex = _6; : pxItemToRemove_11(D)->pvContainer = 0B; _7 ={v} pxList_12->uxNumberOfItems; _8 = _7 + 4294967295; pxList_12->uxNumberOfItems ={v} _8; _18 ={v} pxList_12->uxNumberOfItems; : : return _18; }