BSL_LIST_AddElement BSL_LIST_Concat BSL_LIST_Copy BSL_LIST_Curr BSL_LIST_DeleteAll BSL_LIST_DeleteAllAfterSort BSL_LIST_DeleteCurrent BSL_LIST_DeleteNode BSL_LIST_DetachCurrent BSL_LIST_DetachNode BSL_LIST_First BSL_LIST_FirstNode BSL_LIST_FREE BSL_LIST_FREE_AFTER_SORT BSL_LIST_FreeWithoutData BSL_LIST_GetData BSL_LIST_GetElmtIndex BSL_LIST_GetIndexNode BSL_LIST_GetMaxElements BSL_LIST_GetMaxQsortCount BSL_LIST_GetNextNode BSL_LIST_GetPrevNode BSL_LIST_Last BSL_LIST_New BSL_LIST_Next BSL_LIST_PFUNC_CMP BSL_LIST_PFUNC_DUP BSL_LIST_PFUNC_FREE BSL_LIST_Prev BSL_LIST_RevList BSL_LIST_Search BSL_LIST_SetMaxElements BSL_LIST_SetMaxQsortCount BSL_LIST_Sort BslList BslListNode BslListPosition

BSL_LIST_FREE_AFTER_SORT #define BSL_LIST_FREE_AFTER_SORT (   pList ) 值: do { \ BSL_LIST_DeleteAllAfterSort(pList); \ if (NULL != (pList)) { \ BSL_SAL_FREE(pList); \ (pList) = NULL; \ } \ } while (0) Delete all the nodes in the list and then frees the header. But it does not delete the data pointers inside the list nodes. It is used only after sort to delete the input list to the sort function.