int maxfuturedelay;
};
+struct PendingFutureValue {
+ uint64_t value;
+ modelclock_t expiration;
+ ModelAction * act;
+};
+
/**
* Structure for holding small ModelChecker members that should be snapshotted
*/
bool isfinalfeasible();
void check_promises(ClockVector *old_cv, ClockVector * merge_cv);
void get_release_seq_heads(ModelAction *act,
- std::vector<const ModelAction *> *release_heads);
+ std::vector< const ModelAction *, MyAlloc<const ModelAction *> > *release_heads);
void finish_execution();
bool isfeasibleprefix();
void set_assert() {asserted=true;}
private:
/** The scheduler to use: tracks the running/ready Threads */
Scheduler *scheduler;
-
+
bool thin_air_constraint_may_allow(const ModelAction * writer, const ModelAction *reader);
bool has_asserted() {return asserted;}
void reset_asserted() {asserted=false;}
bool resolve_promises(ModelAction *curr);
void compute_promises(ModelAction *curr);
-
void check_curr_backtracking(ModelAction * curr);
void add_action_to_lists(ModelAction *act);
ModelAction * get_last_action(thread_id_t tid);
bool r_modification_order(ModelAction *curr, const ModelAction *rf);
bool w_modification_order(ModelAction *curr);
bool release_seq_head(const ModelAction *rf,
- std::vector<const ModelAction *> *release_heads) const;
+ std::vector< const ModelAction *, MyAlloc<const ModelAction *> > *release_heads) const;
bool resolve_release_sequences(void *location);
ModelAction *diverge;
HashTable<void *, std::vector<action_list_t>, uintptr_t, 4 > *obj_thrd_map;
std::vector<Promise *> *promises;
+ std::vector<struct PendingFutureValue> *futurevalues;
/**
* Collection of lists of objects that might synchronize with one or