1/*
2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
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;
--- 142 unchanged lines hidden (view full) ---
151 m_msg_counter++;
152 m_msgs_this_cycle++;
153
154 // Calculate the arrival time of the message, that is, the first
155 // cycle the message can be dequeued.
156 assert(delta > 0);
157 Tick arrival_time = 0;
158
159 if (!RubySystem::getRandomization() || !m_randomization) {
160 // No randomization
161 arrival_time = current_time + delta;
162 } else {
163 // Randomization - ignore delta
164 if (m_strict_fifo) {
165 if (m_last_arrival_time < current_time) {
166 m_last_arrival_time = current_time;
167 }
--- 297 unchanged lines hidden ---
2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
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;
--- 142 unchanged lines hidden (view full) ---
151 m_msg_counter++;
152 m_msgs_this_cycle++;
153
154 // Calculate the arrival time of the message, that is, the first
155 // cycle the message can be dequeued.
156 assert(delta > 0);
157 Tick arrival_time = 0;
158
159 if (!RubySystem::getRandomization() || !m_randomization) {
160 // No randomization
161 arrival_time = current_time + delta;
162 } else {
163 // Randomization - ignore delta
164 if (m_strict_fifo) {
165 if (m_last_arrival_time < current_time) {
166 m_last_arrival_time = current_time;
167 }
--- 297 unchanged lines hidden ---