[Improve][CI] Optimized CI

Author: hawk9821

tools/github/ci_duration_analysis.py

@@ -106,26 +106,35 @@ def parse_jobs_from_data(data):
 
 def print_job_summary(parsed_jobs):
     success_jobs = [job for job in parsed_jobs if job['conclusion'] == 'success']
-    print(f"A total of {len(parsed_jobs)} tasks were parsed, among which {len(success_jobs)} tasks were successful (success)\n")
+    # Sort by total elapsed time (seconds) in descending order,
+    # handling potential None values (treat None as 0 and place them at the end).
+    success_jobs_sorted = sorted(
+        success_jobs,
+        key=lambda x: x['total_duration_seconds'] or 0,
+        reverse=True
+    )
+
+    print(
+        f"A total of {len(parsed_jobs)} tasks were parsed, among which {len(success_jobs_sorted)} tasks were successful (success)\n")
 
     job_table_data = []
     headers = ["Sequence Number", "Job Name", "Job ID", "CONCLUSION", "STARTED_AT",
                "Total Duration (Seconds)", "Total Duration (Minutes)", "Expected"]
 
-    for i, job in enumerate(success_jobs, 1):
-        remainder = job['total_duration_minutes'] % 20
-        cost = (math.ceil(job['total_duration_minutes'] / 20) + 1) * 20 if remainder >= 10 else \
-            (math.ceil(job['total_duration_minutes'] / 20)) * 20
+    for i, job in enumerate(success_jobs_sorted, 1):
+        remainder = job['total_duration_minutes'] % 20 if job['total_duration_minutes'] is not None else 0
+        expectedCost = (math.ceil(job['total_duration_minutes'] / 20) + 1) * 20 if remainder >= 10 else \
+                (math.ceil(job['total_duration_minutes'] / 20)) * 20 if job['total_duration_minutes'] is not None else None
         job_table_data.append([
-            i, job['name'], job['job_id'], job['conclusion'],job['started_at'],
-            job['total_duration_seconds'], job['total_duration_minutes'], cost
+            i, job['name'], job['job_id'], job['conclusion'], job['started_at'],
+            job['total_duration_seconds'], job['total_duration_minutes'], expectedCost
         ])
 
     print("Overview of the Task:")
     print(tabulate(job_table_data, headers=headers, tablefmt="pipe"))
     print()
 
-    for i, job in enumerate(success_jobs, 1):
+    for i, job in enumerate(success_jobs_sorted, 1):
         print(f"\nTask {i}: The 3 steps with the longest duration for {job['name']}:")
         if job['steps']:
             sorted_steps = sorted(job['steps'], key=lambda x: x['duration_seconds'], reverse=True)
@@ -134,7 +143,9 @@ def print_job_summary(parsed_jobs):
                 [s['name'], s['number'], s['status'], s['conclusion'], s['duration_seconds']]
                 for s in top_steps
             ]
-            print(tabulate(step_table_data, headers=["Step name", "No", "Status", "Conclusion", "Total Duration (seconds)"], tablefmt="pipe"))
+            print(tabulate(step_table_data,
+                           headers=["Step name", "No", "Status", "Conclusion", "Total Duration (seconds)"],
+                           tablefmt="pipe"))
         else:
             print("There is no step information for this task.")
         print("\n" + "-" * 80)