/* * Copyright 2010-2015 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. */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "../../common.h" static unsigned int n_threads; static unsigned int barrier; static unsigned int e_barrier; #ifndef PAIRS #define PAIRS 5000000 #endif struct node { unsigned int value; ck_epoch_entry_t epoch_entry; ck_stack_entry_t stack_entry; }; static ck_stack_t stack = {NULL, NULL}; static ck_epoch_t stack_epoch; CK_STACK_CONTAINER(struct node, stack_entry, stack_container) CK_EPOCH_CONTAINER(struct node, epoch_entry, epoch_container) static struct affinity a; static void destructor(ck_epoch_entry_t *p) { struct node *e = epoch_container(p); free(e); return; } static void * thread(void *unused CK_CC_UNUSED) { struct node **entry, *e; ck_epoch_record_t record; ck_stack_entry_t *s; unsigned long smr = 0; unsigned int i; ck_epoch_register(&stack_epoch, &record); if (aff_iterate(&a)) { perror("ERROR: failed to affine thread"); exit(EXIT_FAILURE); } entry = malloc(sizeof(struct node *) * PAIRS); if (entry == NULL) { ck_error("Failed allocation.\n"); } for (i = 0; i < PAIRS; i++) { entry[i] = malloc(sizeof(struct node)); if (entry == NULL) { ck_error("Failed individual allocation\n"); } } ck_pr_inc_uint(&barrier); while (ck_pr_load_uint(&barrier) < n_threads); for (i = 0; i < PAIRS; i++) { ck_epoch_begin(&record, NULL); ck_stack_push_upmc(&stack, &entry[i]->stack_entry); s = ck_stack_pop_upmc(&stack); ck_epoch_end(&record, NULL); e = stack_container(s); ck_epoch_call(&record, &e->epoch_entry, destructor); smr += ck_epoch_poll(&record) == false; } ck_pr_inc_uint(&e_barrier); while (ck_pr_load_uint(&e_barrier) < n_threads); fprintf(stderr, "Deferrals: %lu (%2.2f)\n", smr, (double)smr / PAIRS); fprintf(stderr, "Peak: %u (%2.2f%%), %u pending\nReclamations: %u\n\n", record.n_peak, (double)record.n_peak / PAIRS * 100, record.n_pending, record.n_dispatch); ck_epoch_barrier(&record); ck_pr_inc_uint(&e_barrier); while (ck_pr_load_uint(&e_barrier) < (n_threads << 1)); if (record.n_pending != 0) { ck_error("ERROR: %u pending, expecting none.\n", record.n_pending); } return (NULL); } int main(int argc, char *argv[]) { unsigned int i; pthread_t *threads; if (argc != 3) { ck_error("Usage: stack \n"); } n_threads = atoi(argv[1]); a.delta = atoi(argv[2]); a.request = 0; threads = malloc(sizeof(pthread_t) * n_threads); ck_epoch_init(&stack_epoch); for (i = 0; i < n_threads; i++) pthread_create(threads + i, NULL, thread, NULL); for (i = 0; i < n_threads; i++) pthread_join(threads[i], NULL); return (0); }