HomeSort by: relevance | last modified time | path
    Searched refs:computing (Results 1 - 9 of 9) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
mode-switching.cc 83 int computing;
581 if (bb_info[bb_index].computing != confluence_info.no_mode
636 /* A backward transfer function for computing the bb_info single_succ
696 int old_mode = bb_info[e->src->index].computing;
705 bb_info[e->src->index].computing = new_mode;
759 int mode_out = bb_info[bb_index].computing;
783 bb_info[bb_index].computing = mode_out;
891 if (info[bb->index].computing != no_mode)
892 info[bb->index].mode_out = info[bb->index].computing;
993 info[bb->index].computing = last_mode
82 int computing; member in struct:bb_info
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
mode-switching.cc 83 int computing;
648 info[bb->index].computing = last_mode;
685 /* Insert a fake computing definition of MODE into entry
688 info[bb->index].computing = mode;
696 /* Set the anticipatable and computing arrays. */
706 if (info[bb->index].computing == m)
82 int computing; member in struct:bb_info
  /src/external/lgpl3/gmp/dist/mpn/alpha/
divrem_2.asm 44 C * Use branch-free code for computing di.
  /src/external/lgpl3/gmp/dist/mpn/ia64/
dive_1.asm 50 C The critical path during initialization is for computing the inverse of the
divrem_1.asm 50 C computing leading limb.
  /src/external/mit/libuv/dist/
LINKS.md 12 * [Julia](http://julialang.org/): Scientific computing programming language
  /src/external/ibm-public/postfix/dist/conf/
postfix-tls-script 786 $FATAL "error computing certificate public key digest"
790 $FATAL "error computing public key digest"
891 $FATAL error computing SHA2-256 SPKI digest of "$key"
  /src/external/mit/isl/dist/doc/
implementation.tex 161 and in computing a unique representation for existentially quantified
324 Maximization problems can be handled in a similar way by computing
380 check for implicit equalities among the integer points by computing
383 Computing the affine hull is fairly expensive, but it can
681 for computing this affine hull is that of \textcite{Karr1976affine},
884 For computing an approximation of the transitive closure of $R$,
908 \subsection{Computing an Approximation of $R^k$}
1426 then the accuracy of the approximation may be improved by computing
1639 By computing the power of $R_3$ and $R_1 \cup R_2$ separately
1992 Such an overapproximation can be obtained by computing strides
    [all...]
  /src/external/bsd/ntp/dist/util/
ntp-keygen-opts.def 891 Use the larger moduli with caution, as this can consume considerable computing
994 Use the larger moduli with caution, as this can consume considerable computing

Completed in 40 milliseconds