/dports/chinese/libime/libime-1.0.9/src/libime/core/kenlm/lm/ |
H A D | partial.hh | 16 unsigned char next_use; member 34 value.next_use = add_length; in ExtendLoop() 43 add_rbegin, add_rbegin + value.next_use, in ExtendLoop() 47 value.next_use)); in ExtendLoop() 57 if (value.next_use != add_length) { in ExtendLoop() 65 for (; i < length && value.next_use; ++i) { in ExtendLoop() 67 add_rbegin, add_rbegin + value.next_use, in ExtendLoop() 71 value.next_use)); in ExtendLoop() 105 right.length += value.next_use; in RevealBefore() 125 right.length = value.next_use; in RevealAfter() [all …]
|
H A D | left.hh | 116 unsigned char next_use = out_->right.length; in NonTerminal() local 119 if (ExtendLeft(in, next_use, 1, out_->right.backoff, back)) return; in NonTerminal() 123 if (ExtendLeft(in, next_use, extend_length, back, back2)) return; in NonTerminal() 128 for (const float *i = back; i != back + next_use; ++i) prob_ += *i; in NonTerminal() 141 for (WordIndex *i = out_->right.words + next_use - 1; i >= out_->right.words; --i) { in NonTerminal() 148 std::copy(back, back + next_use, out_->right.backoff + in.right.length); in NonTerminal() 149 out_->right.length = in.right.length + next_use; in NonTerminal() 172 out_->right.words, out_->right.words + next_use, // Words to extend into in ExtendLeft() 176 next_use)); // Length of n-gram to use in next scoring. in ExtendLeft() 177 if (next_use != out_->right.length) { in ExtendLeft() [all …]
|
/dports/devel/libfirm/libfirm-1.21.0/ir/be/ |
H A D | beuses.c | 59 unsigned next_use; member 112 temp.next_use = USES_INFINITY; in get_or_set_use_block() 119 be_next_use_t next_use; in get_or_set_use_block() local 124 result->next_use = next_use.time; in get_or_set_use_block() 125 result->outermost_loop = next_use.outermost_loop; in get_or_set_use_block() 275 unsigned next_use = USES_INFINITY; in get_next_use() local 306 if (USES_IS_INFINITE(use->next_use)) { in get_next_use() 314 use_dist = use->next_use; in get_next_use() 324 if (use_dist < next_use) { in get_next_use() 325 next_use = use_dist; in get_next_use() [all …]
|
H A D | bestate.c | 214 be_next_use_t next_use; in compute_block_start_state() local 264 if (USES_IS_INFINITE(next_use.time)) { in compute_block_start_state() 272 next_use.outermost_loop)); in compute_block_start_state() 279 best_time = next_use.time; in compute_block_start_state() 285 next_use.outermost_loop)); in compute_block_start_state() 291 best_time = next_use.time; in compute_block_start_state() 312 if (USES_IS_INFINITE(next_use.time)) { in compute_block_start_state() 320 next_use.outermost_loop)); in compute_block_start_state() 327 best_time = next_use.time; in compute_block_start_state() 333 next_use.outermost_loop)); in compute_block_start_state() [all …]
|
/dports/lang/gcc9/gcc-9.4.0/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/lang/gcc48/gcc-4.8.5/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/lang/gcc11/gcc-11.2.0/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/lang/sdcc/sdcc-4.0.0/support/regression/tests/ |
H A D | gcc-torture-execute-20080519-1.c | 17 struct du_chain *next_use; member 40 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/lang/gcc8/gcc-8.5.0/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/lang/gnat_util/gcc-6-20180516/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20080519-1.c | 8 struct du_chain *next_use; member 31 for (last = this; last->next_use; last = last->next_use) in regrename_optimize()
|