#include <dag.h>
Public Attributes | |
| dagnode_t * | node |
| dagnode_t * | src |
| daglink_s * | next |
| daglink_s * | history |
| daglink_s * | bypass |
| int32 | ascr |
| int32 | lscr |
| int32 | pscr |
| int32 | hscr |
| s3frmid_t | ef |
| int16 | pscr_valid |
| void * | hook |
|
|
Acoustic score for segment of source node ending just before the end point of this link. (Actually this gets corrupted because of filler node deletion.) |
|
|
If this links A->B, bypassing A->fillnode->B, then bypass is ptr to fillnode->B |
|
|
End time for this link. Should be 1 before the start time of destination node (or source node for reverse links), but gets corrupted because of filler deletion |
|
|
Previous link along best path (for traceback) |
|
|
A hook that could allow arbitrary data structure to use daglink_t |
|
|
Heuristic score from end of link to dag exit node |
|
|
LM score to the SUCCESSOR node |
|
|
Next in same dagnode_t.succlist or dagnode_t.predlist |
|
|
Target of link (source determined by dagnode_t.succlist or dagnode_t.predlist) |
|
|
Best path score to root beginning with this link |
|
|
Flag to avoid evaluating the same path multiple times |
|
|
Source node of link |
1.3.9.1