Home
last modified time | relevance | path

Searched full:recurrent (Results 1 – 16 of 16) sorted by relevance

/freebsd/sys/contrib/device-tree/Bindings/npu/
H A Darm,ethos.yaml18 Recurrent Neural Networks (RNN)
/freebsd/lib/msun/src/
H A De_jnf.c129 * then recurrent value may overflow and the result is in jnf()
H A De_jn.c171 * then recurrent value may overflow and the result is in jn()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DEVLIndVarSimplify.cpp221 assert(RecValue && "expect recurrent IndVar value"); in run()
/freebsd/contrib/ntp/html/drivers/
H A Ddriver46.html337 since now all error events are logged. Persistent/recurrent
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachinePipeliner.cpp2270 /// A heuristic to filter nodes in recurrent node-sets if the register
2340 /// recurrent node-sets, and attempt to schedule all nodes together. This is
2341 /// a heuristic. If the MII is large and all the recurrent node-sets are small,
2343 /// starting with the recurrent node-sets.
2393 // in a recurrent set. in groupRemainingNodes()
2403 // in a recurrent set. in groupRemainingNodes()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DIVDescriptors.h358 // The fast-math flags on the recurrent instructions. We propagate these
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DLoopVectorizationLegality.h325 /// Returns True if given address is invariant and is used to store recurrent
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLoopUtils.h495 /// If the final value of any expressions that are recurrent in the loop can
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DHashRecognize.cpp394 // select must ultimately end up in the same recurrent BinOp. in matchConditionalRecurrence()
H A DIVDescriptors.cpp1548 // recurrent expression from the PHI node in-place. in isInductionPHI()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp491 /// 3. The reg containing recurrent expr related with currect loop in the
642 // If ScaledReg is not a recurrent expr, or it is but its loop is not current in isCanonical()
643 // loop, meanwhile BaseRegs contains a recurrent expr reg related with current in isCanonical()
677 // BaseRegs containing the recurrent expr related with Loop L. Swap the in canonicalize()
4174 // We may generate non canonical Formula if G is a recurrent expr reg in GenerateConstantOffsetsImpl()
H A DIndVarSimplify.cpp1915 // that are recurrent in the loop, and substitute the exit values from the in run()
/freebsd/share/dict/
H A Dweb2a19477 ever-recurrent
H A Dweb2165076 recurrent
/freebsd/contrib/ntp/
H A DCommitLog[all...]