/* An efficient way for all nodes to wait for all others to have a certain status. The node with the lowest nodeid polls all the others for their status (wait_status_all) and all the others poll the node with the low id for its accumulated result (wait_status_low). When all nodes have set status flag X, then status flag X_ALL will be set on the low nodeid.  */
uint32_t dlm_recover_status(struct dlm_ls *ls)
/* An efficient way for all nodes to wait for all others to have a certain status. The node with the lowest nodeid polls all the others for their status (wait_status_all) and all the others poll the node with the low id for its accumulated result (wait_status_low). When all nodes have set status flag X, then status flag X_ALL will be set on the low nodeid.  */
uint32_t dlm_recover_status(struct dlm_ls *ls)
{
	uint32_t status;
	spin_lock(&ls->ls_recover_lock);
	status = ls->ls_recover_status;
	spin_unlock(&ls->ls_recover_lock);
	return status;
}