blob: d1920a5cd95c39158d21de53f4f33bd11bbaa267 (
plain)
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
|
// Copyright 2006 Google Inc. All Rights Reserved.
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// queue.h : simple queue api
// This is an interface to a simple thread safe queue,
// used to hold data blocks and patterns.
// The order in which the blocks are returned is random.
#ifndef STRESSAPPTEST_QUEUE_H_ // NOLINT
#define STRESSAPPTEST_QUEUE_H_
#include <sys/types.h>
#include <pthread.h>
// This file must work with autoconf on its public version,
// so these includes are correct.
#include "sattypes.h" // NOLINT
#include "pattern.h" // NOLINT
// Tag indicating no preference.
static const int kDontCareTag = -1;
// Tag indicating no preference.
static const int kInvalidTag = 0xf001;
// This describes a block of memory, and the expected fill pattern.
struct page_entry {
uint64 offset;
void *addr;
uint64 paddr;
class Pattern *pattern;
int32 tag; // These are tags for use in NUMA affinity or other uses.
uint32 touch; // Counter of the number of reads from this page.
uint64 ts; // Timestamp of the last read from this page.
uint32 lastcpu; // Last CPU to write this page.
class Pattern *lastpattern; // Expected Pattern at last read.
};
static inline void init_pe(struct page_entry *pe) {
pe->offset = 0;
pe->addr = NULL;
pe->pattern = NULL;
pe->tag = kInvalidTag;
pe->touch = 0;
pe->ts = 0;
pe->lastcpu = 0;
}
// This is a threadsafe randomized queue of pages for
// worker threads to use.
class PageEntryQueue {
public:
explicit PageEntryQueue(uint64 queuesize);
~PageEntryQueue();
// Push a page onto the list.
int Push(struct page_entry *pe);
// Pop a random page off of the list.
int PopRandom(struct page_entry *pe);
private:
struct page_entry *pages_; // Where the pages are held.
int64 nextin_;
int64 nextout_;
int64 q_size_; // Size of the queue.
int64 pushed_; // Number of pages pushed, total.
int64 popped_; // Number of pages popped, total.
pthread_mutex_t q_mutex_;
DISALLOW_COPY_AND_ASSIGN(PageEntryQueue);
};
#endif // MILES_TESTS_SAT_QUEUE_H_ NOLINT
|
