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

  /src/external/apache2/llvm/dist/clang/lib/Lex/
Preprocessor.cpp 118 // "Poison" __VA_ARGS__, __VA_OPT__ which can only appear in the expansion of
300 llvm::errs() << "\n Poison Reasons: "
733 void Preprocessor::PoisonSEHIdentifiers(bool Poison) {
736 Ident__exception_code->setIsPoisoned(Poison);
737 Ident___exception_code->setIsPoisoned(Poison);
738 Ident_GetExceptionCode->setIsPoisoned(Poison);
739 Ident__exception_info->setIsPoisoned(Poison);
740 Ident___exception_info->setIsPoisoned(Poison);
741 Ident_GetExceptionInfo->setIsPoisoned(Poison);
742 Ident__abnormal_termination->setIsPoisoned(Poison);
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/IR/
IRBuilder.cpp 1068 // First insert it into a poison vector so we can shuffle it.
1070 Value *Poison = PoisonValue::get(VectorType::get(V->getType(), EC));
1071 V = CreateInsertElement(Poison, V, ConstantInt::get(I32Ty, 0),
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineSimplifyDemanded.cpp 562 // If this shift has "nsw" keyword, then the result is either a poison
1068 /// This method analyzes which elements of the operand are undef or poison and
1095 // If the entire vector is undef or poison, just return this info.
1100 if (DemandedElts.isNullValue()) { // If nothing is demanded, provide poison.
1114 Constant *Poison = PoisonValue::get(EltTy);
1117 if (!DemandedElts[i]) { // If not demanded, set to poison.
1118 Elts.push_back(Poison);
1127 if (isa<UndefValue>(Elt)) // Already undef or poison.
1308 // operation. The shuffle prevents poison from the operand vector from
1309 // leaking to the result by replacing poison with an undefined value
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
AddressSanitizer.cpp 1055 // Deploy and poison redzones around dynamic alloca call. To do this, we
1831 // Set up the arguments to our poison/unpoison functions.
1835 // Add a call to poison all external globals before the given function starts.
1905 // - Need to poison all copies, not just the main thread's one.
2976 // Poison given range in shadow using larges store size with out leading and
3007 Value *Poison = IRB.getIntN(StoreSizeInBytes * 8, Val);
3009 Poison, IRB.CreateIntToPtr(Ptr, Poison->getType()->getPointerTo()),
3135 // Insert poison calls for lifetime intrinsics for dynamic allocas.
3400 // Poison the stack red zones at the entry
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Lex/
Preprocessor.h 1938 void PoisonSEHIdentifiers(bool Poison = true); // Borland
2141 /// \#pragma GCC poison/system_header/dependency and \#pragma once.
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp 2669 // %R.vec = shuffle %wide.vec, poison, <0, 3, 6, 9> ; R elements
2670 // %G.vec = shuffle %wide.vec, poison, <1, 4, 7, 10> ; G elements
2671 // %B.vec = shuffle %wide.vec, poison, <2, 5, 8, 11> ; B elements
2682 // %B_U.vec = shuffle %B.vec, poison, <0, 1, 2, 3, u, u, u, u>
8525 // EdgeMask is poison. Using 'and' here introduces undefined behavior.
9504 // If we're constructing lane 0, initialize to start from poison.
9507 Value *Poison = PoisonValue::get(
9509 State.set(this, Poison, State.Instance->Part);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
ScalarEvolution.cpp 3874 /// TODO: In reality it is better to check the poison recursively
6353 // Only proceed if we can prove that I does not yield poison.
6399 // If we know that \c I can never be poison period, then that's enough.
6406 // If the add recurrence is poison in any iteration, it is poison on all
6407 // future iterations (since incrementing poison yields poison). If the result
6411 // choosing a sufficiently evil value for the poison feeding into the branch)
6413 // poison. There are two possibilities (let's call the iteration in which \p
6414 // I first became poison as K)
    [all...]

Completed in 33 milliseconds