+
+ count_j=0;
+ count_c=0;
+
+ if((c_list->current==NULL)||(job->current==NULL)) return 2;
+
+ j=(t_job *)job->current->data;
+ c=(t_client *)c_list->current->data;
+ if(j->status==IN_QUEUE) count_j++;
+ if(c->status==IDLE) count_c++;
+
+ while(list_next(job)!=L_NO_NEXT_ELEMENT) {
+ j=(t_job *)job->current->data;
+ if(j->status==IN_QUEUE) count_j++;
+ }
+ while(list_next(c_list)!=L_NO_NEXT_ELEMENT) {
+ if(j->status==IN_QUEUE) count_j++;
+ 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",count_j,count_c);
+ }
+
+ list_reset(job);
+ list_reset(c_list);
+
+ while(min) {