refactor: 统一无限循环写法，while (true) 改为 for (;;)

Author: wicyn

taskflowlite/core/async_task.hpp

@@ -1060,7 +1060,7 @@ inline auto Executor::submit(T&& task, I first, S last)
         }
     } else if constexpr (repeat_async_task<T>) {
         // repeat: 允许 Finished → Running 转换，但禁止 Running 并发提交
-        while (true) {
+        for (;;) {
             auto cur = topo->m_state.load(std::memory_order_acquire);
             if (cur == Topology::State::Running) [[unlikely]] {
                 throw Exception("AsyncTask Error: Task is already running.");
@@ -1135,7 +1135,7 @@ inline auto Runtime::submit(T&& task, I first, S last)
             throw Exception("AsyncTask Error: Task is not in Idle state.");
         }
     } else if constexpr (repeat_async_task<T>) {
-        while (true) {
+        for (;;) {
             auto cur = topo->m_state.load(std::memory_order_acquire);
             if (cur == Topology::State::Running) [[unlikely]] {
                 throw Exception("AsyncTask Error: Task is already running.");

taskflowlite/core/executor.hpp

@@ -1,4 +1,4 @@
-/// @file  executor.hpp
+/// @file  executor.hpp
 /// @brief 任务调度器 —— Work-Stealing 并行执行引擎，框架唯一的 OS 线程持有者。
 /// @author wicyn
 /// @contact https://github.com/wicyn
@@ -612,7 +612,7 @@ inline void Executor::_spawn(std::size_t num_workers) {
             m_handler->on_start(wr);
 
             Work* w = nullptr;
-            while (true) {
+            for (;;) {
                 // 本地队列优先：LIFO 顺序，缓存命中率最高
                 while (w) {
                     try {
@@ -661,7 +661,7 @@ inline Work* Executor::_wait_for_work(Worker& wr) noexcept {
     std::size_t const yield_limit = nw * wr.m_adaptive_factor + wr.m_max_steals;
 
     // 阶段一：窃取
-    while (true) {
+    for (;;) {
         Work* w = (vtm < nw)
         ? m_workers[vtm].m_wslq.steal()
         : m_shared_buffers[vtm - nw].queue.steal();
@@ -977,7 +977,7 @@ inline void Executor::_process_dependent(Work* w, I first, S last, std::size_t&
 
         auto& state = work->m_topology->m_state;
 
-        while (true) {
+        for (;;) {
             // 1. 每次循环开头，直接获取内存中的最新状态
             auto target = state.load(std::memory_order_acquire);
 

taskflowlite/core/free_stack.hpp

@@ -48,7 +48,7 @@ class alignas(cache_line_size * 2) FreeStack : public Immovable<FreeStack> {
     /// @param p 待推入 chunk 起始地址; 必须满足 ChunkLink 的安全前提。
     TFL_FORCE_INLINE void push(void* p) noexcept {
         Tagged curr = m_head.load(std::memory_order_relaxed);
-        while (true) {
+        for (;;) {
             ChunkLink::store(p, curr.ptr);
             const Tagged next{p, curr.tag + 1};
             if (m_head.compare_exchange_weak(curr, next, std::memory_order_release, std::memory_order_relaxed)) {

taskflowlite/core/macros.hpp

@@ -170,7 +170,7 @@ using std::unreachable;
     __builtin_unreachable();
 #   endif
     // Why: 即使编译器不支持上述扩展,无限空循环也构成合法 C++ UB,起到类似提示作用。
-    while (true) {
+    for (;;) {
     }
 }
 #endif

taskflowlite/core/notifier.hpp

@@ -127,7 +127,7 @@ class Notifier : Immovable<Notifier> {
 
         std::uint64_t state = m_state.load(std::memory_order_seq_cst);
 
-        while (true) {
+        for (;;) {
             // 目标轮次尚未到来：存在更早进入 prepare 的线程尚未完成
             if (std::int64_t((state & k_epoch_mask) - epoch) < 0) {
                 std::this_thread::yield();
@@ -176,7 +176,7 @@ class Notifier : Immovable<Notifier> {
 
         std::uint64_t state = m_state.load(std::memory_order_relaxed);
 
-        while (true) {
+        for (;;) {
             if (std::int64_t((state & k_epoch_mask) - epoch) < 0) {
                 std::this_thread::yield();
                 state = m_state.load(std::memory_order_relaxed);
@@ -211,7 +211,7 @@ class Notifier : Immovable<Notifier> {
         std::atomic_thread_fence(std::memory_order_seq_cst);
         std::uint64_t state = m_state.load(std::memory_order_acquire);
 
-        while (true) {
+        for (;;) {
             // 无等待者
             if ((state & k_stack_mask) == k_stack_mask && (state & k_prewaiter_mask) == 0) {
                 return;
@@ -254,7 +254,7 @@ class Notifier : Immovable<Notifier> {
         std::atomic_thread_fence(std::memory_order_seq_cst);
         std::uint64_t state = m_state.load(std::memory_order_acquire);
 
-        while (true) {
+        for (;;) {
             if ((state & k_stack_mask) == k_stack_mask && (state & k_prewaiter_mask) == 0) {
                 return;
             }

taskflowlite/core/unordered_dense.hpp

@@ -1272,7 +1272,7 @@ class table : public std::conditional_t<is_map_v<T>, base_table_type_map<T>, bas
         auto dist_and_fingerprint = dist_and_fingerprint_from_hash(hash);
         auto bucket_idx = bucket_idx_from_hash(hash);
 
-        while (true) {
+        for (;;) {
             auto* bucket = &at(m_buckets, bucket_idx);
             if (dist_and_fingerprint == bucket->m_dist_and_fingerprint) {
                 if (m_equal(key, get_key(m_values[bucket->m_value_idx]))) {
@@ -1317,7 +1317,7 @@ class table : public std::conditional_t<is_map_v<T>, base_table_type_map<T>, bas
         bucket_idx = next(bucket_idx);
         bucket = &at(m_buckets, bucket_idx);
 
-        while (true) {
+        for (;;) {
             if (dist_and_fingerprint == bucket->m_dist_and_fingerprint) {
                 if (m_equal(key, get_key(m_values[bucket->m_value_idx]))) {
                     return begin() + static_cast<difference_type>(bucket->m_value_idx);
@@ -1617,7 +1617,7 @@ class table : public std::conditional_t<is_map_v<T>, base_table_type_map<T>, bas
             auto bucket_idx = bucket_idx_from_hash(hash);
 
             bool key_found = false;
-            while (true) {
+            for (;;) {
                 auto const& bucket = at(m_buckets, bucket_idx);
                 if (dist_and_fingerprint > bucket.m_dist_and_fingerprint) {
                     break;