| /external/libvorbis/doc/ |
| 09-helper.tex | 13 \subsection{Functions}
|
| /external/bison/doc/ |
| refcard.tex | 468 \section {Functions}
|
| /external/llvm/include/llvm/MC/ |
| MCModule.h | 59 FunctionListTy Functions;
98 const_func_iterator func_begin() const { return Functions.begin(); }
99 func_iterator func_begin() { return Functions.begin(); }
100 const_func_iterator func_end() const { return Functions.end(); }
101 func_iterator func_end() { return Functions.end(); }
|
| /external/llvm/include/llvm/CodeGen/ |
| GCStrategy.h | 65 list_type Functions;
134 iterator begin() { return Functions.begin(); }
135 iterator end() { return Functions.end(); }
|
| /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/guava-tests/test/com/google/common/base/ |
| FunctionsTest.java | 33 * Tests for {@link Functions}.
42 Function<String, String> identity = Functions.identity();
48 Function<Long, Long> identity = Functions.identity();
54 checkCanReserializeSingleton(Functions.identity());
58 assertEquals("3", Functions.toStringFunction().apply(3));
59 assertEquals("hiya", Functions.toStringFunction().apply("hiya"));
61 Functions.toStringFunction().apply(
68 Functions.toStringFunction().apply(null);
77 checkCanReserializeSingleton(Functions.toStringFunction());
83 tester.testAllPublicStaticMethods(Functions.class)
[all...] |
| /external/chromium_org/tools/site_compare/commands/ |
| maskmaker.py | 13 import os # Functions for walking the directory tree
|
| timeload.py | 15 import os # Functions for walking the directory tree
19 import drivers # Functions for driving keyboard/mouse/windows, OS-specific
20 import operators # Functions that, given two bitmaps as input, produce
22 import scrapers # Functions that know how to capture a render from
|
| compare2.py | 13 import os # Functions for walking the directory tree
17 import drivers # Functions for driving keyboard/mouse/windows, OS-specific
18 import operators # Functions that, given two bitmaps as input, produce
20 import scrapers # Functions that know how to capture a render from
|
| /external/guava/guava/src/com/google/common/base/ |
| Functions.java | 33 * <p>All methods returns serializable functions as long as they're given serializable parameters.
40 public final class Functions {
41 private Functions() {}
182 * Returns the composition of two functions. For {@code f: A->B} and {@code g: B->C}, composition
237 /** @see Functions#forPredicate */
321 /** @see Functions#forSupplier*/
|
| /external/llvm/include/llvm/Analysis/ |
| ProfileInfo.h | 174 typename std::set<const FType*> Functions;
176 dbgs() << "Functions: \n";
179 Functions.insert(F);
184 Functions.insert(fi->first);
188 for (typename std::set<const FType*>::iterator FI = Functions.begin(), FE = Functions.end();
198 for (typename std::set<const FType*>::iterator FI = Functions.begin(), FE = Functions.end();
209 dbgs() << "Functions: \n";
|
| /external/llvm/tools/llvm-symbolizer/ |
| LLVMSymbolize.h | 118 SymbolMapTy Functions;
|
| /external/llvm/include/llvm/Support/ |
| GCOV.h | 167 SmallVector<GCOVFunction *, 16> Functions;
|
| /external/llvm/lib/Analysis/IPA/ |
| CallGraphSCCPass.cpp | 14 // recursive functions, which they process all at once.
142 // Run pass P on all functions in the current SCC.
163 /// RefreshCallGraph - Scan the functions in the specified CFG and resync the
187 // Scan all functions in the SCC.
214 // constant folding happens of well known functions etc.
387 std::string Functions;
389 raw_string_ostream OS(Functions);
397 dumpPassInfo(P, EXECUTION_MSG, ON_CG_MSG, Functions);
442 // functions in this SCC. However, we support iterative compilation in the
|
| /external/llvm/lib/ExecutionEngine/ |
| ExecutionEngineBindings.cpp | 354 SimpleBindingMemoryManager(const SimpleBindingMMFunctions& Functions,
368 SimpleBindingMMFunctions Functions;
373 const SimpleBindingMMFunctions& Functions,
375 : Functions(Functions), Opaque(Opaque) {
376 assert(Functions.AllocateCodeSection &&
378 assert(Functions.AllocateDataSection &&
380 assert(Functions.FinalizeMemory &&
382 assert(Functions.Destroy &&
387 Functions.Destroy(Opaque)
[all...] |
| /external/llvm/lib/ExecutionEngine/IntelJITEvents/ |
| IntelJITEventListener.cpp | 11 // Amplifier XE 2011 about JITted functions.
194 MethodAddressVector Functions;
196 // Use symbol info to iterate functions in the object.
216 Functions.push_back((void*)Addr);
257 LoadedObjectMap[ObjData] = Functions;
268 MethodAddressVector& Functions = OI->second;
271 for (MethodAddressVector::iterator FI = Functions.begin(),
272 FE = Functions.end();
|
| /external/llvm/tools/bugpoint/ |
| CrashDebugger.cpp | 171 /// ReduceCrashingFunctions reducer - This works by removing functions and
209 std::set<Function*> Functions;
215 Functions.insert(CMF);
218 outs() << "Checking for crash with only these functions: ";
222 // Loop over and delete any functions which we aren't supposed to be playing
225 if (!I->isDeclaration() && !Functions.count(I))
234 Funcs.assign(Functions.begin(), Functions.end());
246 /// the CFG really fast which can reduce large functions quickly.
490 // Now try to reduce the number of functions in the module to something small
[all...] |
| /external/chromium_org/tools/site_compare/ |
| site_compare.py | 18 import os # Functions for walking the directory tree
22 import drivers # Functions for driving keyboard/mouse/windows, OS-specific
23 import operators # Functions that, given two bitmaps as input, produce
25 import scrapers # Functions that know how to capture a render from
|
| /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 | 699 llvm::SmallPtrSet<Decl *, 16> Functions;
724 return Functions.insert(F->getCanonicalDecl());
|
| /external/clang/lib/Sema/ |
| SemaAccess.cpp | 97 // functions (which can gain privileges through friendship), but we
112 Functions.push_back(Function->getCanonicalDecl());
142 SmallVector<FunctionDecl*, 4> Functions;
501 I = EC.Functions.begin(), E = EC.Functions.end(); I != E; ++I) {
517 if (EC.Functions.empty()) return AR_inaccessible;
522 I = EC.Functions.begin(), E = EC.Functions.end(); I != E; ++I) {
800 // static member functions.
801 if (S.getLangOpts().MicrosoftMode && !EC.Functions.empty()
[all...] |
| SemaExpr.cpp | 230 // wrappers for simple C library functions.
[all...] |
| TreeTransform.h | 63 /// or the parts of an AST node using the various transformation functions,
78 /// \c TransformXXX functions (where XXX is the name of an AST node, e.g.,
83 /// functions to control how AST nodes are rebuilt when their operands change.
88 /// There are a handful of other functions that can be overridden, allowing one
296 /// transformations) or some set of the TransformXXXType functions
[all...] |
| /prebuilts/sdk/tools/lib/ |
| guava-10.0.1.jar | |
| lint.jar | |
