HomeSort by: relevance | last modified time | path
    Searched defs:backward (Results 1 - 11 of 11) sorted by relevancy

  /src/sys/uvm/
uvm_page_array.c 142 const bool backward = (flags & UVM_PAGE_ARRAY_FILL_BACKWARD) != 0; local
159 (backward ? radix_tree_gang_lookup_tagged_node_reverse :
165 (backward ? radix_tree_gang_lookup_node_reverse :
201 if (backward) {
  /src/external/bsd/less/dist/
forwback.c 15 * scrolling either forward or backward.
399 * Display n lines, scrolling backward.
505 * Display n more lines, backward.
508 public void backward(int n, int force, int only_last) function
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
RegisterScavenging.h 77 /// Use backward() to move towards the beginning of the block. This is
95 void backward();
97 /// Call backward() as long as the internal iterator does not point to \p I.
98 void backward(MachineBasicBlock::iterator I) { function in class:llvm::RegScavenger
100 backward();
  /src/distrib/utils/more/
prim.c 203 * Display n lines, scrolling backward.
280 * Display n more lines, backward.
284 backward(n, only_last) function
285 /*###283 [cc] conflicting types for `backward'%%%*/
330 * It is more convenient to paint the screen backward,
608 * either forward or backward.
715 * Backward search: start just before the top line
  /src/external/gpl3/gdb/dist/gdb/
break-cond-parse.c 37 between GHI and JKL. Parsing 'backward' will return the token 'DEF' and
47 backward enumerator in enum:parse_direction
68 gdb_assert (direction == parse_direction::backward);
192 string), and no backward scan is performed. */
208 /* Find the next token. If moving backward and this token starts at
212 if (direction == parse_direction::backward && t.data () <= cond_start)
243 if (direction == parse_direction::backward && v.data () <= cond_start)
251 /* When moving backward we will first parse the value token then the
253 if (direction == parse_direction::backward)
275 direction = parse_direction::backward;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RegisterScavenging.cpp 241 void RegScavenger::backward() { function in class:RegScavenger
675 RS.backward(I);
  /src/external/apache2/llvm/dist/llvm/tools/llvm-profgen/
ProfiledBinary.cpp 467 void InstructionPointer::backward() { function in class:llvm::sampleprof::InstructionPointer
  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-loop-prefetch.cc 178 /* Do we have a backward hardware sequential prefetching? */
673 bool backward; local
681 backward = step < 0;
690 if (backward)
696 if ((backward && HAVE_BACKWARD_PREFETCH)
697 || (!backward && HAVE_FORWARD_PREFETCH))
777 bool backward;
794 backward = step < 0;
823 if (backward)
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-loop-prefetch.cc 178 /* Do we have a backward hardware sequential prefetching? */
673 bool backward; local
681 backward = step < 0;
690 if (backward)
696 if ((backward && HAVE_BACKWARD_PREFETCH)
697 || (!backward && HAVE_FORWARD_PREFETCH))
777 bool backward;
794 backward = step < 0;
823 if (backward)
  /src/external/public-domain/xz/dist/src/liblzma/lzma/
lzma_encoder_optimum_normal.c 224 backward(lzma_lzma1_encoder *restrict coder, uint32_t *restrict len_res, function
853 backward(coder, len_res, back_res, cur);
  /src/sys/external/bsd/ipf/netinet/
ip_state.c 2851 int backward; local
2872 * backward : original packet was backward compared to
2875 backward = IP6_NEQ(&is->is_src, src);
2876 fin->fin_rev = !backward;
2877 i = (!backward << 1) + fin->fin_out;
2878 oi = (backward << 1) + !fin->fin_out;

Completed in 42 milliseconds