8 typedef unsigned long long pointer;
9 typedef atomic_ullong pointer_t;
11 #define MAKE_POINTER(ptr, count) ((((pointer)count) << 32) | ptr)
12 #define PTR_MASK 0xffffffffLL
13 #define COUNT_MASK (0xffffffffLL << 32)
15 static inline void set_count(pointer *p, unsigned int val) { *p = (*p & ~COUNT_MASK) | ((pointer)val << 32); }
16 static inline void set_ptr(pointer *p, unsigned int val) { *p = (*p & ~PTR_MASK) | val; }
17 static inline unsigned int get_count(pointer p) { return (p & COUNT_MASK) >> 32; }
18 static inline unsigned int get_ptr(pointer p) { return p & PTR_MASK; }
28 node_t nodes[MAX_NODES + 1];
31 void init_queue(queue_t *q, int num_threads);
39 typedef struct tag_elem {
48 __queue = new_spec_list();
49 tag = new_id_tag(); // Beginning of available id
51 tag_elem_t* new_tag_elem(call_id_t id, unsigned int data) {
52 tag_elem_t *e = (tag_elem_t*) CMODEL_MALLOC(sizeof(tag_elem_t));
58 void free_tag_elem(tag_elem_t *e) {
62 call_id_t get_id(void *wrapper) {
63 return ((tag_elem_t*) wrapper)->id;
66 unsigned int get_data(void *wrapper) {
67 return ((tag_elem_t*) wrapper)->data;
70 # Only check the happens-before relationship according to the id of the
71 # commit_point_set. For commit_point_set that has same ID, A -> B means
72 # B happens after the previous A.
82 @Commit_point_set: Enqueue_Success_Point
85 # __ID__ is an internal macro that refers to the id of the current
87 tag_elem_t *elem = new_tag_elem(__ID__, val);
88 push_back(__queue, elem);
91 void enqueue(queue_t *q, unsigned int val);
96 @Commit_point_set: Dequeue_Success_Point | Dequeue_Empty_Point
97 @ID: get_id(front(__queue))
99 unsigned int _Old_Val = get_data(front(__queue));
105 unsigned int dequeue(queue_t *q);
106 int get_thread_num();