int StorageN11Action::unref() { refcount_--; if (!refcount_) { if (action_hook.is_linked()) stateSet_->erase(stateSet_->iterator_to(*this)); if (getVariable()) lmm_variable_free(getModel()->getMaxminSystem(), getVariable()); xbt_free(getCategory()); delete this; return 1; } return 0; }
void test(int nb_cnst, int nb_var, int nb_elem) { lmm_system_t Sys = NULL; lmm_constraint_t *cnst = xbt_new0(lmm_constraint_t, nb_cnst); lmm_variable_t *var = xbt_new0(lmm_variable_t, nb_var); int *used = xbt_new0(int, nb_cnst); int i, j, k; Sys = lmm_system_new(1); for (i = 0; i < nb_cnst; i++) { cnst[i] = lmm_constraint_new(Sys, NULL, float_random(10.0)); } for (i = 0; i < nb_var; i++) { var[i] = lmm_variable_new(Sys, NULL, 1.0, -1.0, nb_elem); for (j = 0; j < nb_cnst; j++) used[j] = 0; for (j = 0; j < nb_elem; j++) { k = int_random(nb_cnst); if (used[k]) { j--; continue; } lmm_expand(Sys, cnst[k], var[i], float_random(1.0)); used[k] = 1; } } printf("Starting to solve\n"); date = xbt_os_time() * 1000000; lmm_solve(Sys); date = xbt_os_time() * 1000000 - date; for (i = 0; i < nb_var; i++) lmm_variable_free(Sys, var[i]); lmm_system_free(Sys); free(cnst); free(var); free(used); }
int surf_action_unref(surf_action_t action) { surf_model_t model = action->model_type; action->refcount--; if (!action->refcount) { xbt_swag_remove(action, action->state_set); if (((surf_action_lmm_t) action)->variable) lmm_variable_free(model->model_private->maxmin_system, ((surf_action_lmm_t) action)->variable); if (model->model_private->update_mechanism == UM_LAZY) { /* remove from heap */ surf_action_lmm_heap_remove(model->model_private->action_heap,(surf_action_lmm_t)action); xbt_swag_remove(action, model->model_private->modified_set); } #ifdef HAVE_TRACING xbt_free(action->category); #endif surf_action_free(&action); return 1; } return 0; }
static void test(int nb_cnst, int nb_var, int nb_elem, unsigned int pw_base_limit, unsigned int pw_max_limit, float rate_no_limit, int max_share, int mode) { lmm_system_t Sys = NULL; lmm_constraint_t *cnst = xbt_new0(lmm_constraint_t, nb_cnst); lmm_variable_t *var = xbt_new0(lmm_variable_t, nb_var); int *used = xbt_new0(int, nb_cnst); int i; int j; int k; int l; int concurrency_share; Sys = lmm_system_new(1); for (i = 0; i < nb_cnst; i++) { cnst[i] = lmm_constraint_new(Sys, NULL, float_random(10.0)); if(rate_no_limit>float_random(1.0)) //Look at what happens when there is no concurrency limit l=-1; else //Badly logarithmically random concurrency limit in [2^pw_base_limit+1,2^pw_base_limit+2^pw_max_limit] l=(1<<pw_base_limit)+(1<<int_random(pw_max_limit)); lmm_constraint_concurrency_limit_set(cnst[i],l ); } for (i = 0; i < nb_var; i++) { var[i] = lmm_variable_new(Sys, NULL, 1.0, -1.0, nb_elem); //Have a few variables with a concurrency share of two (e.g. cross-traffic in some cases) concurrency_share=1+int_random(max_share); lmm_variable_concurrency_share_set(var[i],concurrency_share); for (j = 0; j < nb_cnst; j++) used[j] = 0; for (j = 0; j < nb_elem; j++) { k = int_random(nb_cnst); if (used[k]>=concurrency_share) { j--; continue; } lmm_expand(Sys, cnst[k], var[i], float_random(1.5)); lmm_expand_add(Sys, cnst[k], var[i], float_random(1.5)); used[k]++; } } fprintf(stderr,"Starting to solve(%i)\n",myrand()%1000); date = xbt_os_time() * 1000000; lmm_solve(Sys); date = xbt_os_time() * 1000000 - date; if(mode==2){ fprintf(stderr,"Max concurrency:\n"); l=0; for (i = 0; i < nb_cnst; i++) { j=lmm_constraint_concurrency_maximum_get(cnst[i]); k=lmm_constraint_concurrency_limit_get(cnst[i]); xbt_assert(k<0 || j<=k); if(j>l) l=j; fprintf(stderr,"(%i):%i/%i ",i,j,k); lmm_constraint_concurrency_maximum_reset(cnst[i]); xbt_assert(!lmm_constraint_concurrency_maximum_get(cnst[i])); if(i%10==9) fprintf(stderr,"\n"); } fprintf(stderr,"\nTotal maximum concurrency is %i\n",l); lmm_print(Sys); } for (i = 0; i < nb_var; i++) lmm_variable_free(Sys, var[i]); lmm_system_free(Sys); free(cnst); free(var); free(used); }