ybwc.h

Go to the documentation of this file.

#ifndef EDAX_YBWC_H
#define EDAX_YBWC_H

#include "util.h"
#include "const.h"
#include "settings.h"

#include <stdbool.h>

struct Search;
struct Move;
struct MoveList;
struct Task;

typedef struct Task {
        volatile bool loop;          
        volatile bool run;           
        volatile bool is_helping;    
        struct Search *search;       
        struct Node *node;           
        struct Move *move;           
        Thread thread;               
        unsigned long long n_calls;  
        unsigned long long n_nodes;  
        Lock lock;                   
        Condition cond;              
        struct TaskStack *container; 
} Task;

typedef struct Node {
        volatile int bestmove;       
        volatile int bestscore;      
        volatile int alpha;          
        int beta;                    
        bool pv_node;                
        volatile int n_slave;        
        volatile bool stop_point;    
        volatile bool is_waiting;        
        int depth;                   
        int height;                  
        struct Search *search;       
        struct Search *slave[SPLIT_MAX_SLAVES]; 
        struct Node *parent;         
        struct Move *move;           
        volatile int n_moves_done;   
        volatile int n_moves_todo;   
        volatile bool is_helping;        
        Task help[1];                
        Lock lock;                   
        Condition cond;              
} Node;

/* node function declaration */
void node_init(Node*, struct Search*, const int, const int, const int, const int, Node*);
void node_free(Node*);
bool node_split(Node*, struct Move*);
void node_stop_slaves(Node*);
void node_wait_slaves(Node*);
void node_update(Node*, struct Move*);
struct Move * node_first_move(Node*, struct MoveList*);
struct Move * node_next_move(Node*);

/* task function declaration */
void* task_loop(void*);
void* task_help(void*);
void task_init(Task*);
void task_free(Task*);
void task_update(Task*);
void task_search(Task *task);

typedef struct TaskStack {
        SpinLock spin;               
        Task *task;                  
        Task **stack;                
        int n;                       
        int n_idle;                  
} TaskStack;

/* task stack function declaration */
void task_stack_init(TaskStack*, const int);
void task_stack_free(TaskStack*);
void task_stack_resize(TaskStack*, const int);
void task_stack_stop(TaskStack*, const Stop);
Task* task_stack_get_idle_task(TaskStack*);
void task_stack_put_idle_task(TaskStack*, Task*);
void task_stack_clear(TaskStack*);
unsigned long long task_stack_count_nodes(TaskStack*);

#endif