recurrent (reference) in projects: third_party - OpenGrok search results

Repository(s)

Full Search		Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition		Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol		Only finds symbol(e.g. methods classes,function,variables).
File Path		Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History		History log comments.
Type		Type of analyzer used to filter file types include with selected(e.g. just C sources).

Help

Searched refs:recurrent (Results 1 - 6 of 6) sorted by relevance

/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A D	scalar_analysis.cpp	326 // Find which node is the recurrent expression. in AnalyzePhiInstruction() 382 // If the loop which the recurrent expression belongs to is either \|loop in IsLoopInvariant() 399 // Traverse the DAG to find the recurrent expression belonging to \|loop\|. in GetCoefficientFromRecurrentTerm() 432 // Rebuild the \|node\| eliminating, if it exists, the recurrent term which 436 // If the node is already a recurrent expression belonging to loop then just in BuildGraphWithoutRecurrentTerm() 438 SERecurrentNode* recurrent = node->AsSERecurrentNode(); in BuildGraphWithoutRecurrentTerm() local 439 if (recurrent) { in BuildGraphWithoutRecurrentTerm() 440 if (recurrent->GetLoop() == loop) { in BuildGraphWithoutRecurrentTerm() 441 return recurrent->GetOffset(); in BuildGraphWithoutRecurrentTerm() 448 // Otherwise find the recurrent nod in BuildGraphWithoutRecurrentTerm() 597 const SERecurrentNode* recurrent = node->AsSERecurrentNode(); operator ()() local [all...]
H A D	scalar_analysis_simplification.cpp	73 // children X3, -Y2, and the constant 3. Graphs containing a recurrent 75 // recurrent expression. So for an induction variable (i=0, i++) if you add 1 to 77 // recurrent expression of (i=1,i++). 105 SERecurrentNode* UpdateCoefficient(SERecurrentNode* recurrent, 108 // If the graph contains a recurrent expression, ie, an expression with the 110 // can be rewritten to be a recurrent expression. 115 // ValueUnknown node (i.e, a load) or a recurrent expression. 118 // Each recurrent expression is an expression with respect to a specific loop. 119 // If we have two different recurrent terms with respect to the same loop in a 131 // We can eliminate recurrent expression 287 UpdateCoefficient( SERecurrentNode* recurrent, int64_t coefficient_update) const UpdateCoefficient() argument [all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A D	scalar_analysis.cpp	326 // Find which node is the recurrent expression. in AnalyzePhiInstruction() 382 // If the loop which the recurrent expression belongs to is either \|loop in IsLoopInvariant() 399 // Traverse the DAG to find the recurrent expression belonging to \|loop\|. in GetCoefficientFromRecurrentTerm() 432 // Rebuild the \|node\| eliminating, if it exists, the recurrent term which 436 // If the node is already a recurrent expression belonging to loop then just in BuildGraphWithoutRecurrentTerm() 438 SERecurrentNode* recurrent = node->AsSERecurrentNode(); in BuildGraphWithoutRecurrentTerm() local 439 if (recurrent) { in BuildGraphWithoutRecurrentTerm() 440 if (recurrent->GetLoop() == loop) { in BuildGraphWithoutRecurrentTerm() 441 return recurrent->GetOffset(); in BuildGraphWithoutRecurrentTerm() 448 // Otherwise find the recurrent nod in BuildGraphWithoutRecurrentTerm() 597 const SERecurrentNode* recurrent = node->AsSERecurrentNode(); operator ()() local [all...]
H A D	scalar_analysis_simplification.cpp	73 // children X3, -Y2, and the constant 3. Graphs containing a recurrent 75 // recurrent expression. So for an induction variable (i=0, i++) if you add 1 to 77 // recurrent expression of (i=1,i++). 105 SERecurrentNode* UpdateCoefficient(SERecurrentNode* recurrent, 108 // If the graph contains a recurrent expression, ie, an expression with the 110 // can be rewritten to be a recurrent expression. 115 // ValueUnknown node (i.e, a load) or a recurrent expression. 118 // Each recurrent expression is an expression with respect to a specific loop. 119 // If we have two different recurrent terms with respect to the same loop in a 131 // We can eliminate recurrent expression 287 UpdateCoefficient( SERecurrentNode* recurrent, int64_t coefficient_update) const UpdateCoefficient() argument [all...]
/third_party/spirv-tools/source/opt/
H A D	scalar_analysis.cpp	325 // Find which node is the recurrent expression. in AnalyzePhiInstruction() 381 // If the loop which the recurrent expression belongs to is either \|loop in IsLoopInvariant() 398 // Traverse the DAG to find the recurrent expression belonging to \|loop\|. in GetCoefficientFromRecurrentTerm() 431 // Rebuild the \|node\| eliminating, if it exists, the recurrent term which 435 // If the node is already a recurrent expression belonging to loop then just in BuildGraphWithoutRecurrentTerm() 437 SERecurrentNode* recurrent = node->AsSERecurrentNode(); in BuildGraphWithoutRecurrentTerm() local 438 if (recurrent) { in BuildGraphWithoutRecurrentTerm() 439 if (recurrent->GetLoop() == loop) { in BuildGraphWithoutRecurrentTerm() 440 return recurrent->GetOffset(); in BuildGraphWithoutRecurrentTerm() 447 // Otherwise find the recurrent nod in BuildGraphWithoutRecurrentTerm() 596 const SERecurrentNode* recurrent = node->AsSERecurrentNode(); operator ()() local [all...]
H A D	scalar_analysis_simplification.cpp	72 // children X3, -Y2, and the constant 3. Graphs containing a recurrent 74 // recurrent expression. So for an induction variable (i=0, i++) if you add 1 to 76 // recurrent expression of (i=1,i++). 104 SERecurrentNode* UpdateCoefficient(SERecurrentNode* recurrent, 107 // If the graph contains a recurrent expression, ie, an expression with the 109 // can be rewritten to be a recurrent expression. 114 // ValueUnknown node (i.e, a load) or a recurrent expression. 117 // Each recurrent expression is an expression with respect to a specific loop. 118 // If we have two different recurrent terms with respect to the same loop in a 130 // We can eliminate recurrent expression 286 UpdateCoefficient( SERecurrentNode* recurrent, int64_t coefficient_update) const UpdateCoefficient() argument [all...]

Completed in 5 milliseconds