/*

 * validate_mips.c - validate MIPS event tables + encodings

 *

 * Copyright (c) 2011 Google, Inc

 * Contributed by Stephane Eranian <eranian@gmail.com>

 *

 * Permission is hereby granted, free of charge, to any person obtaining a copy

 * of this software and associated documentation files (the "Software"), to deal

 * in the Software without restriction, including without limitation the rights

 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies

 * of the Software, and to permit persons to whom the Software is furnished to do so,

 * subject to the following conditions:

 *

 * The above copyright notice and this permission notice shall be included in all

 * copies or substantial portions of the Software.

 *

 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,

 * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A

 * PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT

 * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF

 * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE

 * OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

 *

 */

#include <sys/types.h>

#include <stdio.h>

#include <stdlib.h>

#include <inttypes.h>

#include <stdarg.h>

#include <errno.h>

#include <unistd.h>

#include <string.h>

#include <perfmon/pfmlib.h>

#define MAX_ENCODING	2

#define SRC_LINE	.line = __LINE__

typedef struct {

	const char *name;

	const char *fstr;

	uint64_t codes[MAX_ENCODING];

	int ret, count, line;

} test_event_t;

static const test_event_t mips_test_events[]={

	{ SRC_LINE,

	  .name = "mips_74k::cycles",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0xa,

	  .codes[1] = 0xf,

	  .fstr = "mips_74k::CYCLES:k=1:u=1:s=0:e=0",

	},

	{ SRC_LINE,

	  .name = "mips_74k::cycles:k",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0x2,

	  .codes[1] = 0xf,

	  .fstr = "mips_74k::CYCLES:k=1:u=0:s=0:e=0",

	},

	{ SRC_LINE,

	  .name = "mips_74k::cycles:u",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0x8,

	  .codes[1] = 0xf,

	  .fstr = "mips_74k::CYCLES:k=0:u=1:s=0:e=0",

	},

	{ SRC_LINE,

	  .name = "mips_74k::cycles:s",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0x4,

	  .codes[1] = 0xf,

	  .fstr = "mips_74k::CYCLES:k=0:u=0:s=1:e=0",

	},

	{ SRC_LINE,

	  .name = "mips_74k::cycles:e",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0x1,

	  .codes[1] = 0xf,

	  .fstr = "mips_74k::CYCLES:k=0:u=0:s=0:e=1",

	},

	{ SRC_LINE,

	  .name = "mips_74k::cycles:u:k",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0xa,

	  .codes[1] = 0xf,

	  .fstr = "mips_74k::CYCLES:k=1:u=1:s=0:e=0",

	},

	{ SRC_LINE,

	  .name = "mips_74k::instructions",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0x2a,

	  .codes[1] = 0xf,

	  .fstr = "mips_74k::INSTRUCTIONS:k=1:u=1:s=0:e=0",

	},

	{ SRC_LINE,

	  .name = "mips_74k::instructions:k",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0x22,

	  .codes[1] = 0xf,

	  .fstr = "mips_74k::INSTRUCTIONS:k=1:u=0:s=0:e=0",

	},

	{ SRC_LINE,

	  .name = "mips_74k::instructions:u",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0x28,

	  .codes[1] = 0xf,

	  .fstr = "mips_74k::INSTRUCTIONS:k=0:u=1:s=0:e=0",

	},

	{ SRC_LINE,

	  .name = "mips_74k::instructions:s",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0x24,

	  .codes[1] = 0xf,

	  .fstr = "mips_74k::INSTRUCTIONS:k=0:u=0:s=1:e=0",

	},

	{ SRC_LINE,

	  .name = "mips_74k::instructions:e",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0x21,

	  .codes[1] = 0xf,

	  .fstr = "mips_74k::INSTRUCTIONS:k=0:u=0:s=0:e=1",

	},

	{ SRC_LINE,

	  .name = "mips_74k::instructions:u:k",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0x2a,

	  .codes[1] = 0xf,

	  .fstr = "mips_74k::INSTRUCTIONS:k=1:u=1:s=0:e=0",

	},

	{ SRC_LINE,

	  .name = "mips_74k::PREDICTED_JR_31:u:k",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0x4a,

	  .codes[1] = 0x5,

	  .fstr = "mips_74k::PREDICTED_JR_31:k=1:u=1:s=0:e=0",

	},

	{ SRC_LINE,

	  .name = "mips_74k::JR_31_MISPREDICTIONS:s:e",

	  .ret  = PFM_SUCCESS,

	  .count = 2,

	  .codes[0] = 0x45,

	  .codes[1] = 0xa,

	  .fstr = "mips_74k::JR_31_MISPREDICTIONS:k=0:u=0:s=1:e=1",

	},

};

#define NUM_TEST_EVENTS (int)(sizeof(mips_test_events)/sizeof(test_event_t))

static int check_test_events(FILE *fp)

{

	const test_event_t *e;

	char *fstr;

	uint64_t *codes;

	int count, i, j;

	int ret, errors = 0;

	for (i = 0, e = mips_test_events; i < NUM_TEST_EVENTS; i++, e++) {

		codes = NULL;

		count = 0;

		fstr = NULL;

		ret = pfm_get_event_encoding(e->name, PFM_PLM0 | PFM_PLM3, &fstr, NULL, &codes, &count);

		if (ret != e->ret) {

			fprintf(fp,"Event%d %s, ret=%s(%d) expected %s(%d)\n", i, e->name, pfm_strerror(ret), ret, pfm_strerror(e->ret), e->ret);

			errors++;

		} else {

			if (ret != PFM_SUCCESS) {

				if (fstr) {

					fprintf(fp,"Event%d %s, expected fstr NULL but it is not\n", i, e->name);

					errors++;

				}

				if (count != 0) {

					fprintf(fp,"Event%d %s, expected count=0 instead of %d\n", i, e->name, count);

					errors++;

				}

				if (codes) {

					fprintf(fp,"Event%d %s, expected codes[] NULL but it is not\n", i, e->name);

					errors++;

				}

			} else {

				if (count != e->count) {

					fprintf(fp,"Event%d %s, count=%d expected %d\n", i, e->name, count, e->count);

					errors++;

				}

				for (j=0; j < count; j++) {

					if (codes[j] != e->codes[j]) {

						fprintf(fp,"Event%d %s, codes[%d]=%#"PRIx64" expected %#"PRIx64"\n", i, e->name, j, codes[j], e->codes[j]);

						errors++;

					}

				}

				if (e->fstr && strcmp(fstr, e->fstr)) {

					fprintf(fp,"Event%d %s, fstr=%s expected %s\n", i, e->name, fstr, e->fstr);

					errors++;

				}

			}

		}

		if (codes)

			free(codes);

		if (fstr)

			free(fstr);

	}

	printf("\t %d MIPS events: %d errors\n", i, errors);

	return errors;

}

int

validate_arch(FILE *fp)

{

	return check_test_events(fp);

}