HomeSort by relevance Sort by last modified time
    Searched full:possible (Results 1576 - 1600 of 7007) sorted by null

<<61626364656667686970>>

  /external/llvm/docs/tutorial/
OCamlLangImpl8.html 205 <p>While it is possible to engineer more and more complex solutions to problems
230 <p>It is certainly possible to implement a safe language in LLVM, but LLVM IR
275 <p>Third, it is <em>possible and easy</em> to add language-specific
284 <p>In addition to simple library knowledge, it is possible to embed a variety of
  /external/llvm/include/llvm/ADT/
PointerIntPair.h 33 /// possible. For example, PointerIntPair<void*, 1, bool> will put the bit for
  /external/llvm/include/llvm/CodeGen/
GCStrategy.h 20 // Garbage collection is generally only possible at certain points in code.
SchedulerRegistry.h 77 /// schedules nodes in source code order when possible.
  /external/llvm/include/llvm/MC/
MCInst.h 150 /// \brief Dump the MCInst as prettily as possible using the additional MC
  /external/llvm/include/llvm/Support/
CrashRecoveryContext.h 75 /// make as little assumptions as possible about the program state when
DOTGraphTraits.h 13 // specializing this template, lots of customization opportunities are possible.
  /external/llvm/include/llvm-c/
Disassembler.h 60 * returned in the Value field. It is possible that some symbols in the
  /external/llvm/lib/Analysis/IPA/
FindUsedTypes.cpp 92 // passed in, then the types are printed symbolically if possible, using the
  /external/llvm/lib/CodeGen/
InterferenceCache.cpp 108 // Use advanceTo only when possible.
SpillPlacement.h 119 /// possible number of PrefX constraints will be violated, weighted by
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGFast.cpp 463 /// whatever is necessary (i.e. backtracking or cloning) to make it possible.
575 // possible copy the value directly. Do not try duplicate the def.
577 // possible to copy the value but it require cross register class copies
579 // If cross copy register class is null, then it's not possible to copy
  /external/llvm/lib/Support/
Regex.cpp 109 // Then the replacement string, honoring possible substitutions.
  /external/llvm/lib/Target/PowerPC/
PPCSubtarget.h 121 /// registers in 32-bit mode when possible. This can only true if
  /external/llvm/lib/Target/X86/Disassembler/
X86Disassembler.h 68 // factored out into C for possible use by other projects.
  /external/llvm/lib/Target/X86/
X86RegisterInfo.h 85 /// in the specified class to or from. Returns NULL if it is possible to copy
  /external/llvm/lib/VMCore/
Dominators.cpp 95 // It is not possible to determine dominance between two PHI nodes
  /external/llvm/test/Analysis/ScalarEvolution/
trip-count10.ll 78 ; Trip counts for non-polynomial iterations. It's theoretically possible
  /external/llvm/test/TableGen/
TargetInstrInfo.td 76 // 2. The asm string is captured here, which makes it possible to get rid of
  /external/llvm/tools/llvmc/doc/
LLVMC-Tutorial.rst 32 as possible, so most of the familiar options work::
  /external/llvm/utils/TableGen/
CodeGenTarget.h 118 /// getRegisterVTs - Find the union of all possible SimpleValueTypes for the
  /external/llvm/utils/unittest/googletest/include/gtest/
gtest-test-part.h 49 // The possible outcomes of a test part (i.e. an assertion or an
  /external/mesa3d/docs/
README.WINDML 97 - It's possible to mix UGL/OpenGL application with a software
glfbdev-driver.html 101 This will make it impossible to detect keypresses like Shift+Tab, you will also need to specify -gpmmouse for mouse support. This option can be used with a debugger, and it is possible to single step a program with gdb and set the FRAMEBUFFER environment variable to a different framebuffer for display. The program will not be able to handle vt switching on it's own, so it will always display.
  /external/mesa3d/src/glsl/
lower_jumps.cpp 30 * 1. Pull jumps out of ifs where possible
329 /* move both jumps out if possible */
395 * Smarter options (such as undoing the increment) are possible but it's not worth implementing them,
412 /* move out a jump out if possible */

Completed in 1673 milliseconds

<<61626364656667686970>>