You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
114 lines
3.2 KiB
114 lines
3.2 KiB
/*
|
|
* Copyright 2010-2013 Samy Al Bahra.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef _CK_HP_STACK_H
|
|
#define _CK_HP_STACK_H
|
|
|
|
#include <ck_cc.h>
|
|
#include <ck_hp.h>
|
|
#include <ck_pr.h>
|
|
#include <ck_stack.h>
|
|
#include <stddef.h>
|
|
|
|
#define CK_HP_STACK_SLOTS_COUNT 1
|
|
#define CK_HP_STACK_SLOTS_SIZE sizeof(void *)
|
|
|
|
CK_CC_INLINE static void
|
|
ck_hp_stack_push_mpmc(struct ck_stack *target, struct ck_stack_entry *entry)
|
|
{
|
|
|
|
ck_stack_push_upmc(target, entry);
|
|
return;
|
|
}
|
|
|
|
CK_CC_INLINE static bool
|
|
ck_hp_stack_trypush_mpmc(struct ck_stack *target, struct ck_stack_entry *entry)
|
|
{
|
|
|
|
return ck_stack_trypush_upmc(target, entry);
|
|
}
|
|
|
|
CK_CC_INLINE static struct ck_stack_entry *
|
|
ck_hp_stack_pop_mpmc(ck_hp_record_t *record, struct ck_stack *target)
|
|
{
|
|
struct ck_stack_entry *entry, *update;
|
|
|
|
do {
|
|
entry = ck_pr_load_ptr(&target->head);
|
|
if (entry == NULL)
|
|
return (NULL);
|
|
|
|
ck_hp_set(record, 0, entry);
|
|
ck_pr_fence_strict_memory();
|
|
} while (entry != ck_pr_load_ptr(&target->head));
|
|
|
|
while (ck_pr_cas_ptr_value(&target->head, entry, entry->next, &entry) == false) {
|
|
if (entry == NULL)
|
|
return (NULL);
|
|
|
|
ck_hp_set(record, 0, entry);
|
|
ck_pr_fence_strict_memory();
|
|
update = ck_pr_load_ptr(&target->head);
|
|
while (entry != update) {
|
|
ck_hp_set(record, 0, update);
|
|
ck_pr_fence_strict_memory();
|
|
entry = update;
|
|
update = ck_pr_load_ptr(&target->head);
|
|
if (update == NULL)
|
|
return (NULL);
|
|
}
|
|
}
|
|
|
|
return (entry);
|
|
}
|
|
|
|
CK_CC_INLINE static bool
|
|
ck_hp_stack_trypop_mpmc(ck_hp_record_t *record, struct ck_stack *target, struct ck_stack_entry **r)
|
|
{
|
|
struct ck_stack_entry *entry;
|
|
|
|
entry = ck_pr_load_ptr(&target->head);
|
|
if (entry == NULL)
|
|
return false;
|
|
|
|
ck_hp_set(record, 0, entry);
|
|
ck_pr_fence_strict_memory();
|
|
if (entry != ck_pr_load_ptr(&target->head))
|
|
goto leave;
|
|
|
|
if (ck_pr_cas_ptr_value(&target->head, entry, entry->next, &entry) == false)
|
|
goto leave;
|
|
|
|
*r = entry;
|
|
return true;
|
|
|
|
leave:
|
|
ck_hp_set(record, 0, NULL);
|
|
return false;
|
|
}
|
|
|
|
#endif /* _CK_HP_STACK_H */
|