Lines Matching refs:req
661 static int printstate_next_ticket(struct entry *req)
666 req->ticket = r;
667 req->ticket_completed_ref = printstate.ticket_completed;
673 void printstate_mark_req_completed(const struct entry *req)
675 if (req->ticket > printstate.ticket_completed)
676 printstate.ticket_completed = req->ticket;
680 bool printstate_has_new_req_arrived(const struct entry *req)
682 return (printstate.ticket_counter != req->ticket);
716 bool prev_req_won_race(const struct entry *req)
718 return (printstate.ticket_completed != req->ticket_completed_ref);
761 static int table_get_probability(const struct entry *req,
764 int diff = req->ticket - req->ticket_completed_ref;
1009 static long go_to_sleep(const struct entry *req)
1017 while (!printstate_has_new_req_arrived(req)) {
1023 if (printstate_has_new_req_arrived(req))
1074 size_t bufspace, const struct entry *req, bool excuse,
1095 sec, us, req->ticket, str);
1098 sec, us, req->ticket);
1113 size_t bufspace, const struct entry *req,
1116 __print_skipmessage(resize_msg, timestamp, buffer, bufspace, req,
1121 size_t bufspace, const struct entry *req,
1124 __print_skipmessage(NULL, timestamp, buffer, bufspace, req, true,
1131 const struct entry *req)
1166 sec, us, req->ticket, slept_ms);
1170 us, req->ticket);
1459 struct entry req;
1521 printstate_next_ticket(&req);
1523 printstate_mark_req_completed(&req);
1529 bufspace, &req,
1535 if (queue_try_to_add_entry(&printqueue, &req) != 0) {
1556 struct entry req;
1571 req = queue_wait_for_entry(&printqueue);
1574 if (prev_req_won_race(&req)) {
1575 printstate_mark_req_completed(&req);
1579 &req, "print loop");
1596 prob = table_get_probability(&req, &resize_msg);
1598 slept = go_to_sleep(&req);
1608 printstate_mark_req_completed(&req);
1623 bufspace, slept, &req);
1626 buffer, bufspace, &req, true);
1629 bufspace, &req, false);