Lines Matching full:pstdout
188 pfprintf(PSTDOUT,"loading %d questions\n", num_questions);
205 pfprintf(PSTDOUT,"LOAD_TREE: loading question %d\n", i);
260 /* pfprintf(PSTDOUT,"got len %d\n", len);*/
453 if (ilen > 0) pfprintf(PSTDOUT,"LOAD_TREE: got input %s out %s\n", in, outputs[i]);
454 pfprintf(PSTDOUT,"LOAD_TREE: outputs[%d] len %d out %x out %s\n", i, olen, outputs[i], outputs[i]);
507 pfprintf(PSTDOUT,"loading letter mapping\n");
519 pfprintf(PSTDOUT,"loading questions\n");
545 /* pfprintf(PSTDOUT,"loading for t %d\n", t);*/
574 pfprintf(PSTDOUT,"LOAD_TREE: Tree for let %d num_nodes %d\n", let, tree->num_nodes);
582 pfprintf(PSTDOUT,"LOAD_TREE: node[%d] %d %d", i, tree->left_nodes[i], tree->values_or_question1[i]);
589 pfprintf(PSTDOUT," %x", (unsigned short) tree->question2[i]);
594 pfprintf(PSTDOUT,"\n");
703 pfprintf(PSTDOUT,"LOAD_TREE: allowable_cons_comb[%d]: %s\n", lts->num_cons_comb, tempstr);
728 pfprintf(PSTDOUT,"loaded %d cons combinations\n", lts->num_cons_comb);
874 pfprintf(PSTDOUT,"LOAD_TREE: got %d outputs, loading trees\n", lts->num_outputs);
1050 /*pfprintf(PSTDOUT,"left context\n");*/
1068 /*pfprintf(PSTDOUT,"right context\n");*/
1091 /*pfprintf(PSTDOUT,"word stuff\n"); */
1106 /* pfprintf(PSTDOUT,"syl stuff\n");*/
1130 pfprintf(PSTDOUT,"first_syl_end %d last_syl_start %d\n", first_syl_end, last_syl_start);
1165 pfprintf(PSTDOUT,"first_syl_end %d last_syl_start %d\n", first_syl_end, last_syl_start);
1195 pfprintf(PSTDOUT,"first_syl_end %d last_syl_start %d\n", first_syl_end, last_syl_start);
1230 pfprintf(PSTDOUT,"first_syl_end %d last_syl_start %d\n", first_syl_end, last_syl_start);
1242 /* pfprintf(PSTDOUT,"strings\n");*/
1244 pfprintf(PSTDOUT,"input word %s num_strings %d\n", input_word, lts->num_strings);
1254 pfprintf(PSTDOUT,"dp %c ", lm->letters[dp->letter]);
1257 pfprintf(PSTDOUT,"%c", lm->letters[word[i]]);
1259 pfprintf(PSTDOUT," %c%c%c {%c} %c%c%c liw %d siw %d s2iw %d nw %d sir %d s2ir %d left_DFRE %d right_DFRE %d\n",
1376 pfprintf(PSTDOUT,"checking {%s} vs c[%d] {%s}\n", cons_string, i, lts->allowable_cons_comb[i]);
1439 pfprintf(PSTDOUT,"cons comb %s %s not allowed\n", output_phone_string[j-1],
1453 pfprintf(PSTDOUT,"cons comb %s %s not allowed\n", output_phone_string[j-1],
1553 /* pfprintf(PSTDOUT,"about to call find_phone1\n");*/
1557 pfprintf(PSTDOUT,"got phone %d for initial | (LTS_MARKER_PIPESEP)\n", left_phone);
1572 pfprintf(PSTDOUT,"about to call find_phone2 num_out %d\n", num_out);
1573 pfprintf(PSTDOUT,"out[%d] %s\n", num_out-1, output_phone_string[num_out-1]);
1581 pfprintf(PSTDOUT,"got phone %d for %s\n", left_phone, output_phone_string[num_out-1]);
1596 /* pfprintf(PSTDOUT,"calling fill up dp\n");*/
1599 /* pfprintf(PSTDOUT,"calling find output\n");*/
1603 pfprintf(PSTDOUT,"got output %d\n", output_index);
1611 pfprintf(PSTDOUT,"GOT INPUT %s for %s letter %c\n", lts->input_for_output[output_index], word, word[i]);
1642 pfprintf(PSTDOUT,"using backoff output %s instead of regular %s\n",
1704 pfprintf(PSTDOUT,"WORKING on letter %d %c\n", i, input_sentence[i]);
1722 pfprintf(PSTDOUT,"Did not find %s in dictionary\n", word);
