Lines Matching defs:size

178             return (pc >> 2) % localHistories.size();
193 assert(localHistories.size() > 0);
209 return localHistoryLength * localHistories.size();
225 /** Pre-assigned size in bits assigned to this feature */
226 const int size;
234 p2(_p2), p3(_p3), coeff(_coeff), size(_size), width(_width),
250 * Sets the size requirements of the table, used when initializing
251 * to set the proper size of the tables
305 for (int i = 0; i < acyclic_histories.size(); i += 1) {
306 if (acyclic_histories[i].size() > 0) {
354 /** runtime values and data used to count the size in bits */
375 if (modhist_lengths.size() < (j + 1)) {
389 if (modpath_lengths.size() < (j + 1)) {
403 for (int i = 0; i < v.size(); i += 1) {
409 return v.size()-1;
413 * Computes the size in bits of the structures needed to keep track
415 * those tables that did not had their size specified.
418 * @param local_history_length size of each local history entry
485 GHIST(int p1, int p2, double coeff, int size, int width,
487 : HistorySpec(p1, p2, 0, coeff, size, width, mpp)
536 ACYCLIC(int p1, int p2, int p3, double coeff, int size, int width,
538 : HistorySpec(p1, p2, p3, coeff, size, width, mpp)
570 if (mpp.acyclic_bits.size() < (p1 + 1)) {
573 if (mpp.acyclic_bits[p1].size() < (p1 + 2)) {
584 MODHIST(int p1, int p2, double coeff, int size, int width,
586 : HistorySpec(p1, p2, 0, coeff, size, width, mpp)
613 BIAS(double coeff, int size, int width,
615 : HistorySpec(0, 0, 0, coeff, size, width, mpp)
628 RECENCY(int p1, int p2, int p3, double coeff, int size, int width,
630 : HistorySpec(p1, p2, p3, coeff, size, width, mpp)
670 IMLI(int p1, double coeff, int size, int width,
672 : HistorySpec(p1, 0, 0, coeff, size, width, mpp)
691 PATH(int p1, int p2, int p3, double coeff, int size, int width,
693 : HistorySpec(p1, p2, p3, coeff, size, width, mpp)
737 LOCAL(int p1, double coeff, int size, int width,
739 : HistorySpec(p1, 0, 0, coeff, size, width, mpp)
759 MODPATH(int p1, int p2, int p3, double coeff, int size, int width,
761 : HistorySpec(p1, p2, p3, coeff, size, width, mpp)
786 GHISTPATH(int p1, int p2, int p3, double coeff, int size, int width,
788 : HistorySpec(p1, p2, p3, coeff, size, width, mpp)
858 GHISTMODPATH(int p1, int p2, int p3, double coeff, int size, int width,
860 : HistorySpec(p1, p2, p3, coeff, size, width, mpp)
890 BLURRYPATH(int p1, int p2, int p3, double coeff, int size, int width,
892 : HistorySpec(p1, p2, p3, coeff, size, width, mpp)
922 if (mpp.blurrypath_bits.size() < (p1 + 1)) {
925 if (mpp.blurrypath_bits[p1].size() < p2) {
936 RECENCYPOS(int p1, double coeff, int size, int width,
938 : HistorySpec(p1, 0, 0, coeff, size, width, mpp)
977 SGHISTPATH(int p1, int p2, int p3, double coeff, int size, int width,
979 : HistorySpec(p1, p2, p3, coeff, size, width, mpp)