#include <pthread.h>
#include <atomic>
#include <chrono>
#include "row.hpp"
#include "sort_algorithms.hpp"

struct MatrixSortContext {
    uint8_t* A;
    int F, H, W;
};

struct DynamicArgs {
    MatrixSortContext* ctx;
    std::atomic<int>* next_row;
    int total_rows;
    int chunk_size;
};

void* dynamic_worker(void* arg) {
    DynamicArgs* da = (DynamicArgs*)arg;
    int start;

    // Κάθε thread παίρνει δυναμικά το επόμενο διαθέσιμο chunk γραμμών
    while ((start = da->next_row->fetch_add(da->chunk_size)) < da->total_rows) {
        int end = std::min(start + da->chunk_size, da->total_rows);
        for (int i = start; i < end; ++i) {
            uint8_t* row_ptr = da->ctx->A + (static_cast<size_t>(i) * da->ctx->W);
            row<uint8_t> r(row_ptr, (uint32_t)da->ctx->W, false);
            quick_sort(r);
        }
    }
    return nullptr;
}

long long run_dynamic_scheduler(MatrixSortContext* ctx, int K, int chunk_size = 10) {
    int total_rows = ctx->F * ctx->H;
    std::atomic<int> next_row(0);
    pthread_t threads[K];
    DynamicArgs args[K];

    auto t1 = std::chrono::high_resolution_clock::now();
    for (int i = 0; i < K; ++i) {
        args[i] = {ctx, &next_row, total_rows, chunk_size};
        pthread_create(&threads[i], nullptr, dynamic_worker, &args[i]);
    }
    for (int i = 0; i < K; ++i) pthread_join(threads[i], nullptr);
    auto t2 = std::chrono::high_resolution_clock::now();

    return std::chrono::duration_cast<std::chrono::milliseconds>(t2 - t1).count();
}