| 1624 | |
| 1625 | |
| 1626 | static void prt_que2(OUTFILE outfile, |
| 1627 | const lhb* LOCK_header, |
| 1628 | const SCHAR* string, const srq* que_inst, USHORT que_offset, |
| 1629 | const TEXT* prefix) |
| 1630 | { |
| 1631 | /************************************** |
| 1632 | * |
| 1633 | * p r t _ q u e 2 |
| 1634 | * |
| 1635 | ************************************** |
| 1636 | * |
| 1637 | * Functional description |
| 1638 | * Print the contents of a self-relative que. |
| 1639 | * But don't try to count the entries, as they might be invalid |
| 1640 | * |
| 1641 | **************************************/ |
| 1642 | const SLONG offset = SRQ_REL_PTR(que_inst); |
| 1643 | |
| 1644 | if (offset == que_inst->srq_forward && offset == que_inst->srq_backward) |
| 1645 | { |
| 1646 | FPRINTF(outfile, "%s: *empty*\n", string); |
| 1647 | return; |
| 1648 | } |
| 1649 | |
| 1650 | FPRINTF(outfile, "%s:\tforward: %s, backward: %s\n", string, |
| 1651 | (const TEXT*) HtmlLink(prefix, que_inst->srq_forward - que_offset), |
| 1652 | (const TEXT*) HtmlLink(prefix, que_inst->srq_backward - que_offset)); |
| 1653 | } |
| 1654 | |
| 1655 | static void prt_html_begin(OUTFILE outfile) |
| 1656 | { |