int i = 0;
bool found = false;
- for (i=0; i<count && found == false; i++) {
+ for (i=0; i<count; i++) {
if (queue[i].job == (int)jobid) {
found = true;
+ break;
}
}
return fill_job_info1(mem_ctx,
r,
- &queue[i-1],
+ &queue[i],
i,
snum,
ntprinter);
NT_DEVICEMODE *nt_devmode;
WERROR result;
- for (i=0; i<count && found == false; i++) {
+ for (i=0; i<count; i++) {
if (queue[i].job == (int)jobid) {
found = true;
+ break;
}
}
return fill_job_info2(mem_ctx,
r,
- &queue[i-1],
+ &queue[i],
i,
snum,
ntprinter,