HomeSort by: relevance | last modified time | path
    Searched refs:That (Results 1 - 25 of 103) sorted by relevancy

1 2 3 4 5

  /src/external/apache2/llvm/dist/llvm/include/llvm/Passes/
StandardInstrumentations.h 10 /// This header defines a class that provides bookkeeping for all standard
39 /// Needs state to be able to print module after pass that invalidates IR unit
124 // in the Graph (BBGuard). That is if any of the block is deleted or RAUWed
157 // Base class for classes that report changes to the IR.
169 // 6. When a pass is run on an IR that is not interesting (based on options).
231 // An abstract template base class that handles printing banners and
238 // Print a module dump of the first IR that is changed.
240 // Report that the IR was omitted because it did not change.
242 // Report that the pass was invalidated.
244 // Report that the IR was filtered out
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
Registry.h 91 bool operator==(const iterator &That) const { return Cur == That.Cur; }
110 /// Use of this template requires that:
134 /// strictly speaking that's not allowed by the C++ standard (we would need to
  /src/usr.bin/make/unit-tests/
varmod-assign-shell.mk 5 # is different from the other places that capture the output of an external
15 # error message instead of the command that was executed. That's where the
deptgt.mk 9 # dependency line: That doesn't work, and make immediately rejects it.
directive-export-impl.mk 19 # This is a variable that references another variable. At this point, the
26 # VarFlags.reexport. After that, ExportVars registers the variable name in
27 # .MAKE.EXPORTED. That's all for now.
48 # These flags means that the variable is still marked as being re-exported
varmod-loop-delete.mk 6 # A side effect of the modifier ':@' is that the loop variable is created as
25 # Set up the variable that deletes itself when it is evaluated.
42 # In the command that is associated with a target, the scope is the
43 # one from the target. That scope only contains a few variables like
44 # '.TARGET', '.ALLSRC', '.IMPSRC'. Make does not expect that these
archive.mk 7 # archive handling. That's why it deviates from the tutorial style of
41 # that calls Var_Parse. It's an esoteric scenario since at the point where
51 # XXX: I had expected that this dependency would select all *.mk files from
59 # TODO: Be more specific: mention that the variable "UNDEF" is not defined.
66 # TODO: Be more specific: mention that the variable "UNDEF" is not defined.
cond-func.mk 3 # Tests for those parts of the functions in .if conditions that are common
17 # so that no unbalanced braces appear in the top-level expression.
46 # Characters that could be mistaken for operators must not appear directly
88 # default function that is called when a bare word is parsed. For the plain
102 # That variable is not defined (yet).
cond-op.mk 30 # This kind of condition looks so unfamiliar that it doesn't occur in
41 # TODO: Demonstrate that the precedence of the ! and == operators actually
44 # for an example that doesn't require much thought.
56 # That's another opportunity for writing confusing code.
63 # after the '0' or the '1', it knows that the condition will be malformed.
91 # Demonstration that '&&' has higher precedence than '||'.
varmod-defined.mk 38 # Special characters that would be interpreted differently can be escaped.
51 # error that is silently ignored. This makes all dollar signs disappear,
84 # can be used to add comments in the middle of an expression. That
94 # that they preserve dollars in a ':=' assignment. This is because
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineAddSub.cpp 163 /// Similar to FAddend::drillDownOneStep() except that the value being
266 void FAddendCoef::operator=(const FAddendCoef &That) {
267 if (That.isInt())
268 set(That.IntVal);
270 set(That.getFpVal());
273 void FAddendCoef::operator+=(const FAddendCoef &That) {
275 if (isInt() == That.isInt()) {
277 IntVal += That.IntVal;
279 getFpVal().add(That.getFpVal(), RndMode);
284 const APFloat &T = That.getFpVal()
    [all...]
  /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/stdcpp/
vector.d 119 bool opEquals(this This, That)(auto ref That rhs)
120 if (is(immutable That == immutable vector)) { return as_array == rhs.as_array; }
124 int opCmp(this This, That)(auto ref That rhs)
125 if (is(immutable That == immutable vector)) { return __cmp(as_array, rhs.as_array); }
  /src/sys/arch/sun2/sun2/
locore.s 12 * modification, are permitted provided that the following conditions
50 * modification, are permitted provided that the following conditions
119 | These entry points are here in pretty low memory, so that they
143 | Make sure the initial frame pointer is zero so that
154 | That is all the assembly startup code we need on the sun3!
181 * (The MMU has a "boot" bit that forces access to the PROM)
  /src/external/apache2/llvm/dist/llvm/lib/Support/Windows/
Program.inc 76 // Lets attach the extension manually. That is needed for files
192 // process. We have to concatenate them all, while quoting the args that
563 // The documentation on CreateProcessW states that the size of the argument
  /src/external/lgpl3/gmp/dist/mpn/arm/
mul_1.asm 24 dnl The GNU MP Library is distributed in the hope that it will be useful, but
43 C We should rewrite this along the lines of addmul_1.asm. That should save a
  /src/external/lgpl3/gmp/dist/mpn/ia64/
invert_limb.asm 24 dnl The GNU MP Library is distributed in the hope that it will be useful, but
43 C explicitly chopping in the last fma. That would save about 10 cycles.
  /src/external/lgpl3/gmp/dist/mpn/x86/pentium4/sse2/
addlsh1_n.asm 22 dnl The GNU MP Library is distributed in the hope that it will be useful, but
44 C that's used seems to work best. Not sure why, but %ecx,4 with src1 and/or
48 C then psrlq to get the new carry. That makes 4 c/l the target speed, which
  /src/crypto/external/apache2/openssl/lib/libcrypto/arch/vax/
bn_asm_vax.S 160 #; and remainder by 2, add the bit that was dropped when dividing by 2
179 #; end up with a 33 bit quotient. That's no problem however, it usually
262 # (contradict that, and I'll fix the problem!)
  /src/crypto/external/bsd/openssl/lib/libcrypto/arch/vax/
bn_asm_vax.S 160 #; and remainder by 2, add the bit that was dropped when dividing by 2
179 #; end up with a 33 bit quotient. That's no problem however, it usually
262 # (contradict that, and I'll fix the problem!)
  /src/crypto/external/bsd/openssl.old/lib/libcrypto/arch/vax/
bn_asm_vax.S 160 #; and remainder by 2, add the bit that was dropped when dividing by 2
179 #; end up with a 33 bit quotient. That's no problem however, it usually
262 # (contradict that, and I'll fix the problem!)
  /src/external/gpl3/gcc/dist/libgcc/config/cris/
mulsi3.S 10 ;; GCC is distributed in the hope that it will be useful, but WITHOUT ANY
71 ;; /* Make GCC understand that only the low part of "min" will be
82 ;; That approach was abandoned since the caveats outweighted the
91 ;; so that argument doesn't really hold anymore, and it's unlikely there
  /src/external/gpl3/gcc.old/dist/libgcc/config/cris/
mulsi3.S 10 ;; GCC is distributed in the hope that it will be useful, but WITHOUT ANY
71 ;; /* Make GCC understand that only the low part of "min" will be
82 ;; That approach was abandoned since the caveats outweighted the
91 ;; so that argument doesn't really hold anymore, and it's unlikely there
  /src/external/lgpl3/gmp/dist/mpn/arm64/
aorsmul_1.asm 24 dnl The GNU MP Library is distributed in the hope that it will be useful, but
42 C and thus avoid csinc, but only for addmul_1. Since that saves no time
45 C That is likely to save a few cycles.
  /src/external/lgpl3/gmp/dist/mpn/sparc32/v9/
add_n.asm 23 dnl The GNU MP Library is distributed in the hope that it will be useful, but
43 C require that `o' registers' upper 32 bits are preserved by the operating
44 C system, but if they are not, they must be zeroed. That is indeed what
sub_n.asm 23 dnl The GNU MP Library is distributed in the hope that it will be useful, but
43 C require that `o' registers' upper 32 bits are preserved by the operating
44 C system, but if they are not, they must be zeroed. That is indeed what

Completed in 54 milliseconds

1 2 3 4 5