codes-workload.c 5.45 KB
Newer Older
1 2 3 4 5 6
/*
 * Copyright (C) 2013 University of Chicago.
 * See COPYRIGHT notice in top-level directory.
 *
 */

7
#include <assert.h>
8 9 10 11 12

#include "ross.h"
#include "codes/codes-workload.h"
#include "codes-workload-method.h"

13 14 15 16
/* list of available methods.  These are statically compiled for now, but we
 * could make generators optional via autoconf tests etc. if needed 
 */ 
extern struct codes_workload_method test_workload_method;
17
extern struct codes_workload_method bgp_io_workload_method;
18
#ifdef USE_DARSHAN
19
extern struct codes_workload_method darshan_io_workload_method;
20
#endif
21

22
static struct codes_workload_method *method_array[] = 
23 24 25 26 27 28 29
{
    &test_workload_method,
    &bgp_io_workload_method,
#ifdef USE_DARSHAN
    &darshan_io_workload_method,
#endif
    NULL};
30

Philip Carns's avatar
Philip Carns committed
31 32 33 34 35
/* This shim layer is responsible for queueing up reversed operations and
 * re-issuing them so that the underlying workload generator method doesn't
 * have to worry about reverse events.
 *
 * NOTE: we could make this faster with a smarter data structure.  For now
36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57
 * we just have a linked list of rank_queue structs, one per rank that has
 * opened the workload.  We then have a linked list off of each of those
 * to hold a lifo queue of operations that have been reversed for that rank.
 */

/* holds an operation that has been reversed */
struct rc_op
{
    struct codes_workload_op op;
    struct rc_op* next;
};

/* tracks lifo queue of reversed operations for a given rank */
struct rank_queue
{
    int rank;
    struct rc_op *lifo;
    struct rank_queue *next;
};

static struct rank_queue *ranks = NULL;

58 59
int codes_workload_load(const char* type, const char* params, int rank)
{
60 61
    int i;
    int ret;
62
    struct rank_queue *tmp;
63 64 65 66 67

    for(i=0; method_array[i] != NULL; i++)
    {
        if(strcmp(method_array[i]->method_name, type) == 0)
        {
68
            /* load appropriate workload generator */
69 70 71 72 73
            ret = method_array[i]->codes_workload_load(params, rank);
            if(ret < 0)
            {
                return(-1);
            }
74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92

            /* are we tracking information for this rank yet? */
            tmp = ranks;
            while(tmp)
            {
                if(tmp->rank == rank)
                    break;
                tmp = tmp->next;
            }
            if(tmp == NULL)
            {
                tmp = malloc(sizeof(*tmp));
                assert(tmp);
                tmp->rank = rank;
                tmp->lifo = NULL;
                tmp->next = ranks;
                ranks = tmp;
            }

93 94 95 96 97
            return(i);
        }
    }

    fprintf(stderr, "Error: failed to find workload generator %s\n", type);
98 99 100
    return(-1);
}

101
void codes_workload_get_next(int wkld_id, int rank, struct codes_workload_op *op)
102
{
103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123
    struct rank_queue *tmp;
    struct rc_op *tmp_op;

    /* first look to see if we have a reversed operation that we can
     * re-issue
     */
    tmp = ranks;
    while(tmp)
    {
        if(tmp->rank == rank)
            break;
        tmp = tmp->next;
    }
    assert(tmp);
    if(tmp->lifo)
    {
        tmp_op = tmp->lifo;
        tmp->lifo = tmp_op->next; 

        *op = tmp_op->op;
        free(tmp_op);
124
        //printf("codes_workload_get_next re-issuing reversed operation.\n");
125 126 127 128
        return;
    }

    /* ask generator for the next operation */
129
    //printf("codes_workload_get_next issuing new operation.\n");
130 131
    method_array[wkld_id]->codes_workload_get_next(rank, op);

132 133 134
    return;
}

135
void codes_workload_get_next_rc(int wkld_id, int rank, const struct codes_workload_op *op)
136
{
137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153
    struct rank_queue *tmp;
    struct rc_op *tmp_op;

    tmp = ranks;
    while(tmp)
    {
        if(tmp->rank == rank)
            break;
        tmp = tmp->next;
    }
    assert(tmp);

    tmp_op = malloc(sizeof(*tmp_op));
    assert(tmp_op);
    tmp_op->op = *op;
    tmp_op->next = tmp->lifo;
    tmp->lifo = tmp_op;
154

155 156 157
    return;
}

158 159 160 161 162
void* codes_workload_get_info(int wkld_id, int rank)
{
    return method_array[wkld_id]->codes_workload_get_info(rank);
}

163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198
void codes_workload_print_op(FILE *f, struct codes_workload_op *op, int rank){
    switch(op->op_type){
        case CODES_WK_END:
            fprintf(f, "op: rank:%d, type:end\n", rank);
            break;
        case CODES_WK_DELAY:
            fprintf(f, "op: rank:%d, type:delay, seconds:%lf\n", 
                    rank, op->u.delay.seconds);
            break;
        case CODES_WK_BARRIER:
            fprintf(f, "op: rank:%d, type:barrier, count:%d, root:%d\n", 
                    rank, op->u.barrier.count, op->u.barrier.root);
            break;
        case CODES_WK_OPEN:
            fprintf(f, "op: rank:%d, type:open, file_id:%lu, flag:%d\n",
                    rank, op->u.open.file_id, op->u.open.create_flag);
            break;
        case CODES_WK_CLOSE:
            fprintf(f, "op: rank:%d, type:close, file_id:%lu\n",
                    rank, op->u.close.file_id);
            break;
        case CODES_WK_WRITE:
            fprintf(f, "op: rank:%d, type:write, "
                       "file_id:%lu, off:%lu, size:%lu\n",
                    rank, op->u.write.file_id, op->u.write.offset, 
                    op->u.write.size);
            break;
        case CODES_WK_READ:
            fprintf(f, "op: rank:%d, type:read, "
                       "file_id:%lu, off:%lu, size:%lu\n",
                    rank, op->u.read.file_id, op->u.read.offset, 
                    op->u.read.size);
            break;
    }
}

199 200 201 202 203 204 205 206
/*
 * Local variables:
 *  c-indent-level: 4
 *  c-basic-offset: 4
 * End:
 *
 * vim: ft=c ts=8 sts=4 sw=4 expandtab
 */