- net=(t_net *)allineed;
- c_list=(t_list *)(allineed+sizeof(t_net));
- g_list=(t_list *)(allineed+sizeof(t_net)+sizeof(t_list));
- job=(t_list *)(allineed+sizeof(t_net)+2*sizeof(t_list));
+ list_reset(&(priv.job));
+ list_reset(&(priv.client));
+
+ count_j=0;
+ count_c=0;
+
+ if((priv.client.current==NULL)||(priv.job.current==NULL)) return 2;
+
+ j=(t_job *)priv.job.current->data;
+ c=(t_client *)priv.client.current->data;
+ if(j->status==IN_QUEUE) count_j++;
+ if(c->status==IDLE) count_c++;
+
+ while(list_next(&(priv.job))!=L_NO_NEXT_ELEMENT) {
+ j=(t_job *)priv.job.current->data;
+ if(j->status==IN_QUEUE) count_j++;
+ }
+ while(list_next(&(priv.client))!=L_NO_NEXT_ELEMENT) {
+ c=(t_client *)priv.client.current->data;
+ if(c->status==IDLE) count_c++;
+ }
+
+ min=(count_c<count_j)?count_c:count_j;
+
+ if(min!=0) {
+ printf("d: distributing jobs ...\n");
+ printf("%d queued jobs, %d idle clients\n\n",count_j,count_c);
+ }