1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 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 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368
|
#include "bonnie.h"
#include <stdlib.h>
#include <fcntl.h>
#include <dirent.h>
#include <unistd.h>
#include <sys/wait.h>
#include "sync.h"
#include <string.h>
#include <limits.h>
#include "bon_io.h"
#include "bon_time.h"
#define END_SEEK_PROCESS INT_MIN
CFileOp::~CFileOp()
{
Close();
if(m_name)
{
unlink(m_name);
free(m_name);
}
delete m_buf;
}
Thread *CFileOp::newThread(int threadNum)
{
return new CFileOp(threadNum, this);
}
CFileOp::CFileOp(int threadNum, CFileOp *parent)
: Thread(threadNum, parent)
, m_timer(parent->m_timer)
, m_file_size(parent->m_file_size)
, m_fd(-1)
, m_isopen(false)
, m_name(PCHAR(malloc(strlen(parent->m_name) + 5)))
, m_sync(parent->m_sync)
#ifdef O_DIRECT
, m_use_direct_io(parent->m_use_direct_io)
#endif
, m_chunk_bits(parent->m_chunk_bits)
, m_chunk_size(parent->m_chunk_size)
, m_total_chunks(parent->m_total_chunks)
, m_buf(new char[m_chunk_size])
{
strcpy(m_name, parent->m_name);
}
int CFileOp::action(PVOID)
{
struct report_s seeker_report;
if(reopen(false))
return 1;
int ticket;
int rc;
Duration dur, test_time;
rc = Read(&ticket, sizeof(ticket), 0);
CPU_Duration test_cpu;
test_time.getTime(&seeker_report.StartTime);
test_cpu.start();
if(rc == sizeof(ticket) && ticket != END_SEEK_PROCESS) do
{
bool update = false;
if(ticket < 0)
{
ticket = abs(ticket);
update = true;
}
dur.start();
if(doseek(ticket % m_total_chunks, update) )
return 1;
dur.stop();
} while((rc = Read(&ticket, sizeof(ticket), 0)) == sizeof(ticket)
&& ticket != END_SEEK_PROCESS);
if(rc != sizeof(ticket))
{
fprintf(stderr, "Can't read ticket.\n");
return 1;
}
Close();
// seeker report is start and end times, CPU used, and latency
test_time.getTime(&seeker_report.EndTime);
seeker_report.CPU = test_cpu.stop();
seeker_report.Latency = dur.getMax();
if(Write(&seeker_report, sizeof(seeker_report), 0) != sizeof(seeker_report))
{
fprintf(stderr, "Can't write report.\n");
return 1;
}
return 0;
}
int CFileOp::seek_test(Rand &r, bool quiet, int Seeks, int SeekProcCount, Sync &s)
{
int message_count = SeekProcCount + Seeks;
int *seek_tickets = (int *)malloc(sizeof(int) * message_count);
int next;
for(next = 0; next < Seeks; next++)
{
seek_tickets[next] = r.getNum();
if(seek_tickets[next] < 0)
seek_tickets[next] = abs(seek_tickets[next]);
if(seek_tickets[next] % UpdateSeek == 0)
seek_tickets[next] = -seek_tickets[next];
}
for( ; next < (Seeks + SeekProcCount); next++)
seek_tickets[next] = END_SEEK_PROCESS;
if(reopen(false))
return 1;
go(NULL, SeekProcCount);
sleep(3);
if(s.decrement_and_wait(Lseek))
return 1;
if(!quiet) fprintf(stderr, "start 'em...");
if(Write(seek_tickets, sizeof(int) * message_count, 0) != (int)sizeof(int) * message_count)
{
fprintf(stderr, "Can't write tickets.\n");
return 1;
}
Close();
for (next = 0; next < SeekProcCount; next++)
{ /* for each child */
struct report_s seeker_report;
int rc;
if((rc = Read(&seeker_report, sizeof(seeker_report), 0))
!= sizeof(seeker_report))
{
fprintf(stderr, "Can't read from pipe, expected %d, got %d.\n"
, int(sizeof(seeker_report)), rc);
return 1;
}
/*
* each child writes back its CPU, start & end times. The elapsed time
* to do all the seeks is the time the first child started until the
* time the last child stopped
*/
m_timer.add_delta_report(seeker_report, Lseek);
if(!quiet) fprintf(stderr, "done...");
} /* for each child */
if(!quiet) fprintf(stderr, "\n");
return 0;
}
int CFileOp::seek(int offset, int whence)
{
OFF_TYPE rc;
OFF_TYPE real_offset = offset;
real_offset *= m_chunk_size;
rc = file_lseek(m_fd, real_offset, whence);
if(rc == OFF_TYPE(-1))
{
sprintf(m_buf, "Error in lseek to chunk %d(" OFF_T_PRINTF ")", offset, real_offset);
perror(m_buf);
return rc;
}
return 0;
}
int CFileOp::read_block(PVOID buf)
{
int total = 0;
bool printed_error = false;
while(total != m_chunk_size)
{
int rc = read(m_fd, buf, m_chunk_size - total);
if(rc == -1)
{
io_error("re-write read"); // exits program
}
else if(rc != m_chunk_size)
{
if(!printed_error)
{
fprintf(stderr, "Can't read a full block, only got %d bytes.\n", rc);
printed_error = true;
if(rc == 0)
return -1;
}
}
total += rc;
}
return total;
}
int CFileOp::read_block_byte(char *buf)
{
char next;
for(int i = 0; i < m_chunk_size; i++)
{
if(read(m_fd, &next, 1) != 1)
{
fprintf(stderr, "Can't read a byte\n");
return -1;
}
/* just to fool optimizers */
buf[int(next)]++;
}
return 0;
}
int CFileOp::write_block(PVOID buf)
{
int rc = ::write(m_fd, buf, m_chunk_size);
if(rc != m_chunk_size)
{
perror("Can't write block.");
return -1;
}
return rc;
}
int CFileOp::write_block_byte()
{
for(int i = 0; i < m_chunk_size; i++)
{
char c = i & 0x7f;
if(write(m_fd, &c, 1) != 1)
{
fprintf(stderr, "Can't write() - disk full?\n");
return -1;
}
}
return 0;
}
int CFileOp::Open(CPCCHAR base_name, bool create)
{
m_name = PCHAR(malloc(strlen(base_name) + 5));
strcpy(m_name, base_name);
return reopen(create);
}
CFileOp::CFileOp(BonTimer &timer, int file_size, int chunk_bits, bool use_sync
#ifdef O_DIRECT
, bool use_direct_io
#endif
)
: m_timer(timer)
, m_file_size(file_size)
, m_fd(-1)
, m_isopen(false)
, m_name(NULL)
, m_sync(use_sync)
#ifdef O_DIRECT
, m_use_direct_io(use_direct_io)
#endif
, m_chunk_bits(chunk_bits)
, m_chunk_size(1 << m_chunk_bits)
, m_total_chunks(Unit / m_chunk_size * file_size)
, m_buf(new char[m_chunk_size])
{
if(m_total_chunks / file_size * m_chunk_size != Unit)
{
fprintf(stderr, "File size %d too big for chunk size %d\n", file_size, m_chunk_size);
exit(1);
}
}
int CFileOp::reopen(bool create)
{
if(m_isopen) Close();
m_isopen = true;
if(m_open(m_name, create))
return 1;
return 0;
}
int CFileOp::m_open(CPCCHAR base_name, bool create)
{
int flags;
if(create)
{ /* create from scratch */
unlink(base_name);
flags = O_RDWR | O_CREAT | O_EXCL;
#ifdef O_DIRECT
if(m_use_direct_io)
flags |= O_DIRECT;
#endif
}
else
{
flags = O_RDWR;
#ifdef _LARGEFILE64_SOURCE
flags |= O_LARGEFILE;
#endif
}
m_fd = file_open(base_name, flags, S_IRUSR | S_IWUSR);
if(m_fd == -1)
{
fprintf(stderr, "Can't open file %s\n", base_name);
return -1;
}
return 0;
}
void CFileOp::Close()
{
if(!m_isopen)
return;
if(m_fd != -1)
{
if(fsync(m_fd))
fprintf(stderr, "Can't sync file.\n");
close(m_fd);
}
m_isopen = false;
m_fd = -1;
}
/*
* Do a typical-of-something random I/O. Any serious application that
* has a random I/O bottleneck is going to be smart enough to operate
* in a page mode, and not stupidly pull individual words out at
* odd offsets. To keep the cache from getting too clever, some
* pages must be updated. However an application that updated each of
* many random pages that it looked at is hard to imagine.
* However, it would be wrong to put the update percentage in as a
* parameter - the effect is too nonlinear. Need a profile
* of what Oracle or Ingres or some such actually does.
* Be warned - there is a *sharp* elbow in this curve - on a 1-MiB file,
* most substantial unix systems show >2000 random I/Os per second -
* obviously they've cached the whole thing and are just doing buffer
* copies.
*/
int
CFileOp::doseek(unsigned int where, bool update)
{
if (seek(where, SEEK_SET) == -1)
return -1;
if (read_block(PVOID(m_buf)) == -1)
return -1;
/* every so often, update a block */
if (update)
{ /* update this block */
/* touch a byte */
m_buf[where % m_chunk_size]--;
if(seek(where, SEEK_SET) == -1)
return io_error("lseek in doseek update");
if (write_block(PVOID(m_buf)) == -1)
return -1;
if(m_sync)
{
if(fsync(m_fd))
{
fprintf(stderr, "Can't sync file.\n");
return -1;
}
}
} /* update this block */
return 0;
}
|