OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Simplified
(Results
1 - 4
of
4
) sorted by relevancy
/src/external/apache2/llvm/dist/llvm/include/llvm/Target/
TargetOptions.h
47
Simplified
, // Use one table per function type, with types projected
/src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
PPCMIPeephole.cpp
381
bool
Simplified
= false;
406
Simplified
= true;
474
Simplified
|= TII->onlyFoldImmediate(UseMI, MI, MIDestReg);
550
Simplified
= true;
580
Simplified
= true;
592
Simplified
= true;
604
Simplified
= true;
613
Simplified
= true;
658
Simplified
= true;
675
Simplified
= true
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/Analysis/
InstructionSimplify.cpp
14
//
simplified
: This is usually true and assuming it simplifies the logic (if
15
// they have not been
simplified
then results are correct but maybe suboptimal).
154
// %cmp
simplified
to the select condition (%cond).
182
/// We know comparison with both branches of select can be
simplified
, but they
188
// If the false value
simplified
to false, then the result of the compare
190
// value
simplified
to false and the true value to true, returning "Cond".
194
// If the true value
simplified
to true, then the result of the compare
199
// Finally, if the false value
simplified
to true and the true value to
415
// If they
simplified
to the same value, then return the common value.
420
// If one branch
simplified
to undef, return the other one
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
TargetLowering.cpp
608
bool
Simplified
= SimplifyDemandedBits(Op, DemandedBits, Known, TLO);
609
if (
Simplified
) {
613
return
Simplified
;
894
/// simplify Op, create a new
simplified
DAG node and return true, returning the
952
// If this is the root being
simplified
, allow it to have multiple uses,
2315
bool
Simplified
=
2317
if (
Simplified
) {
2322
return
Simplified
;
Completed in 24 milliseconds
Indexes created Wed Jun 10 00:26:05 UTC 2026