Release of fifo and mutexQueue to OSS with bio refactored

[asagege]

Overview:

This PR introduces two novel data structures, along with a significant refactoring of the existing bio utility that demonstrates their practical value.

New Creative Components:

• FIFO - A high-performance queue that's significantly more space and time efficient than adlist.
• mutexQueue - A thread-safe wrapper around FIFO that encapsulates synchronization primitives into a reusable abstraction. This creative design eliminates repetitive mutex/condition operations throughout the codebase.

Refactored Components:

• bio.c - refactored using mutexQueue, with 56 lines of code eliminated while achieving more maintainable code.

These prepare the prerequisite data structures for bgIteration.

Details:

1. FIFO - fifo.h, fifo.c, test_fifo.c

2. mutexQueue - mutexqueue.h, mutexqueue.c, test_mutexqueue.c

3. bio.c Refactoring:

   Before: Manual management of 3 synchronization primitives per queue
   After: Single mutexQueue abstraction handles everything

   Key improvements:

   • Simplified synchronization - mutexQueue encapsulates mutex locking and condition variable signaling, eliminating manual coordination in:

     • bioInit()
     • bioSubmitJob()
     • bioProcessBackgroundJobs()
     • bioPendingJobsOfType()

   • Thread-safe counters - Replaced manual locking of bio_jobs_counter with atomic operations

   • bioDrainWorker() now uses polling on the queue abstraction instead of managing low-level synchronization

Testing:

• Unit tests for FIFO in test_fifo.c: pass,
  COMPARE_PERFORMANCE_TO_ADLISTshows the improvement = 78.69% (List: 122 ms, FIFO: 26 ms)
• Unit tests for mutexQueue in test_mutexqueue.c: pass
• bio.c functionality preserved with refactored implementation