• 无锁链表


    #ifndef lkf_h
    #define lkf_h
    
    struct lkf_node {
        struct lkf_node* next;
    };
    
    struct lkf_list {
        struct lkf_node root;
        struct lkf_node** tail;
    };
    
    
    #define LKF_INIT(name) {.root = {NULL}, .tail = &(name.root.next)}
    #define LKF_LIST(name) 
    struct lkf_list name = LKF_INIT(name)
    
    #define INIT_LKF(name) 
    do { 
        name->root.next = NULL; 
        name->tail = &(name->root.next); 
    } while (0)
    
    static inline void lkf_node_put(struct lkf_list* list, struct lkf_node* node)
    {
        node->next = NULL;
        struct lkf_node** ptr = __sync_lock_test_and_set(&(list->tail), &(node->next));
        *ptr = node;
    }
    
    static inline struct lkf_node* lkf_node_get_one(struct lkf_list* list)
    {
        struct lkf_node* head = __sync_lock_test_and_set(&(list->root.next), NULL);
        if (head == NULL) {
            return NULL;
        }
    
        struct lkf_node* next = head->next;
        if (next != NULL) {
            list->root.next = next;
            head->next = head;
            return head;
        }
    
        int b = __sync_bool_compare_and_swap(&(list->tail), &(head->next), &(list->root.next));
        if (b) {
            head->next = head;
            return head;
        }
    
        list->root.next = head;
        return NULL;
    }
    
    static inline struct lkf_node* lkf_node_get(struct lkf_list* list)
    {
        struct lkf_node* ptr = __sync_lock_test_and_set(&(list->root.next), NULL);
        if (ptr == NULL) {
            return NULL;
        }
    
        struct lkf_node** last = __sync_lock_test_and_set(&(list->tail), &(list->root.next));
        *last = ptr;
        return *last;
    }
    
    static inline struct lkf_node* lkf_node_next(struct lkf_node* node)
    {
        struct lkf_node* ptr = node->next;
        if (ptr == NULL || ptr->next == NULL) {
            return NULL;
        }
    
        if (ptr == node) {
            return ptr;
        }
    
        node->next = ptr->next;
        ptr->next = NULL;
        return ptr;
    }
    
    #endif
    
  • 相关阅读:
    poj2778 DNA Sequence(AC自动机+矩阵快速幂)
    poj2001 Shortest Prefixes (trie树)
    hdu5536 Chip Factory
    解决 苹果手机点击输入框页面自动放大111
    css 记录
    对复选框自定义样式 优化方法
    css引入外部字体
    jquery获取当前页面的URL信息
    左侧导行伸缩控制
    表单提交同类数据的做成数组
  • 原文地址:https://www.cnblogs.com/zylthinking/p/5975710.html
Copyright © 2020-2023  润新知