HomeSort by relevance Sort by last modified time
    Searched defs:Functions (Results 1 - 15 of 15) sorted by null

  /external/bison/doc/
refcard.tex 470 \section {Functions}
  /external/llvm/include/llvm/CodeGen/
GCStrategy.h 64 list_type Functions;
124 iterator begin() { return Functions.begin(); }
125 iterator end() { return Functions.end(); }
  /external/llvm/lib/ExecutionEngine/RuntimeDyld/
RuntimeDyldImpl.h 49 StringMap<sys::MemoryBlock> Functions;
  /external/llvm/lib/Transforms/Utils/
BasicInliner.cpp 44 /// addFunction - Add function into the list of functions to process.
45 /// All functions must be inserted using this interface before invoking
48 Functions.push_back(F);
57 /// inlineFuctions - Walk all call sites in all functions supplied by
59 /// inlined functions.
64 std::vector<Function *> Functions;
70 /// inlineFuctions - Walk all call sites in all functions supplied by
72 /// inlined functions.
76 // inline call sites in the original functions, not call sites that result
77 // from inlining other functions
    [all...]
  /external/dropbear/libtommath/
bn.tex 75 LibTomMath is a library of source code which provides a series of efficient and carefully written functions for manipulating
160 instructs the system to build all of the functions. This is how LibTomMath used to be packaged. This will give you
281 However, LibTomMath was written with cryptography in mind. It provides essentially all of the functions a cryptosystem
350 All LTM functions that use the mp\_int type will expect a pointer to mp\_int structure. You must allocate memory to
356 The arithmetic functions of the library are all organized to have the same style prototype. That is source operands
365 Another feature of the way the functions have been implemented is that source operands can be destination operands as well.
385 represents the default integer which is zero. If the functions returns MP\_OKAY then the mp\_int is ready to be used
386 by the other LibTomMath functions.
545 \section{Maintenance Functions}
642 small constant assignment functions. The first function is used to set a single digit constant while the second set
    [all...]
  /external/guava/src/com/google/common/base/
Functions.java 29 * Useful functions.
31 * <p>All methods returns serializable functions as long as they're given
40 public final class Functions {
41 private Functions() {}
169 * Returns the composition of two functions. For {@code f: A->B} and
223 /** @see Functions#forPredicate */
  /external/llvm/include/llvm/Analysis/
ProfileInfo.h 175 typename std::set<const FType*> Functions;
177 dbgs() << "Functions: \n";
180 Functions.insert(F);
185 Functions.insert(fi->first);
189 for (typename std::set<const FType*>::iterator FI = Functions.begin(), FE = Functions.end();
199 for (typename std::set<const FType*>::iterator FI = Functions.begin(), FE = Functions.end();
210 dbgs() << "Functions: \n";
  /external/llvm/lib/Analysis/IPA/
CallGraphSCCPass.cpp 14 // recursive functions, which they process all at once.
139 // Run pass P on all functions in the current SCC.
160 /// RefreshCallGraph - Scan the functions in the specified CFG and resync the
184 // Scan all functions in the SCC.
211 // constant folding happens of well known functions etc.
381 std::string Functions;
383 raw_string_ostream OS(Functions);
391 dumpPassInfo(P, EXECUTION_MSG, ON_CG_MSG, Functions);
436 // functions in this SCC. However, we support iterative compilation in the
  /external/llvm/tools/bugpoint/
CrashDebugger.cpp 173 /// ReduceCrashingFunctions reducer - This works by removing functions and
211 std::set<Function*> Functions;
217 Functions.insert(CMF);
220 outs() << "Checking for crash with only these functions: ";
224 // Loop over and delete any functions which we aren't supposed to be playing
227 if (!I->isDeclaration() && !Functions.count(I))
236 Funcs.assign(Functions.begin(), Functions.end());
248 /// the CFG really fast which can reduce large functions quickly.
491 // Now try to reduce the number of functions in the module to something small
    [all...]
  /external/dropbear/libtomcrypt/
crypt.tex 124 (and helper API functions) are able to use the new designs automatically. There exists self-check functions for each
146 With this library all core functions (ciphers, hashes, prngs, and bignum) have the same prototype definition. They all load
149 know how to use Safer+, RC6, or Serpent as well. With all of the core functions there are central descriptor tables
167 are essentially structures with pointers to functions. While you can still call particular functions
226 In general the API is very simple to memorize and use. Most of the functions return either {\bf void} or {\bf int}. Functions
228 if it failed. Certain functions that return int will return $-1$ to indicate an error. These functions will be explicitl
    [all...]
  /external/clang/include/clang/Sema/
Overload.h 661 llvm::SmallPtrSet<Decl *, 16> Functions;
676 return Functions.insert(F->getCanonicalDecl());
  /external/clang/lib/Sema/
SemaAccess.cpp 96 // functions (which can gain privileges through friendship), but we
105 Functions.push_back(Function);
132 llvm::SmallVector<FunctionDecl*, 4> Functions;
476 I = EC.Functions.begin(), E = EC.Functions.end(); I != E; ++I) {
492 if (EC.Functions.empty()) return AR_inaccessible;
497 I = EC.Functions.begin(), E = EC.Functions.end(); I != E; ++I) {
    [all...]
SemaExpr.cpp 135 // FIXME: C++0x implicitly-deleted special member functions could be
149 /// (and other functions in future), which have been declared with sentinel
    [all...]
TreeTransform.h 61 /// or the parts of an AST node using the various transformation functions,
76 /// \c TransformXXX functions (where XXX is the name of an AST node, e.g.,
81 /// functions to control how AST nodes are rebuilt when their operands change.
86 /// There are a handful of other functions that can be overridden, allowing one
293 /// transformations) or some set of the TransformXXXType functions
    [all...]
  /prebuilt/common/tradefed/
tradefed-prebuilt.jar 

Completed in 567 milliseconds