1/*
2 * Copyright (c) 2018 Inria
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;

--- 24 unchanged lines hidden (view full) ---

33 * Definitions of a skewed associative indexing policy.
34 */
35
36#include "mem/cache/tags/indexing_policies/skewed_associative.hh"
37
38#include "base/bitfield.hh"
39#include "base/intmath.hh"
40#include "base/logging.hh"
41#include "mem/cache/replacement_policies/base.hh"
42
43SkewedAssociative::SkewedAssociative(const Params *p)
44 : BaseIndexingPolicy(p), msbShift(floorLog2(numSets) - 1)
45{
46 if (assoc > NUM_SKEWING_FUNCTIONS) {
47 warn_once("Associativity higher than number of skewing functions. " \
48 "Expect sub-optimal skewing.\n");
49 }

--- 177 unchanged lines hidden ---