| /external/guava/guava-tests/test/com/google/common/base/ |
| SuppliersTest.java | 52 Function<Number, Integer> intValueFunction =
53 new Function<Number, Integer>() {
75 Function<List<Integer>, List<Integer>> addElementFunction =
76 new Function<List<Integer>, List<Integer>>() {
238 Function<Supplier<Boolean>, Supplier<Boolean>> memoizer =
239 new Function<Supplier<Boolean>, Supplier<Boolean>>() {
251 Function<Supplier<Boolean>, Supplier<Boolean>> memoizer =
252 new Function<Supplier<Boolean>, Supplier<Boolean>>() {
262 Function<Supplier<Boolean>, Supplier<Boolean>> memoizer)
373 Function<Supplier<Integer>, Integer> supplierFunction
[all...] |
| /external/llvm/lib/ExecutionEngine/Interpreter/ |
| ExternalFunctions.cpp | 18 // invoke the function using libffi, after finding its address.
53 static ManagedStatic<std::map<const Function *, ExFunc> > ExportedFunctions;
58 static ManagedStatic<std::map<const Function *, RawFunc> > RawFunctions;
85 // Try to find address of external function given a Function object.
90 static ExFunc lookupFunction(const Function *F) {
91 // Function not found, look it up... start by figuring out what the
92 // composite function name should be.
103 if (FnPtr == 0) // Try calling a generic function... if it exists...
181 static bool ffiInvoke(RawFunc Fn, Function *F
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter7/ |
| toy.cpp | 152 /// CallExprAST - Expression class for function calls.
194 /// PrototypeAST - This class represents the "prototype" for a function,
216 Function *Codegen();
218 void CreateArgumentAllocas(Function *F);
221 /// FunctionAST - This class represents a function definition itself.
229 Function *Codegen();
522 return ErrorP("Expected function name in prototype");
614 /// the function. This is used for mutable variables etc.
615 static AllocaInst *CreateEntryBlockAlloca(Function *TheFunction,
628 // Look this variable up in the function
[all...] |
| /external/v8/test/mjsunit/ |
| debug-stepout-scope.js | 35 function listener(event, exec_state, event_data, data) {
56 function test1() {
65 function test2() {
79 function test3() {
91 function test4() {
98 function test5() {
111 function test6() {
122 function test7() {
124 function foo() {}
129 function test8()
[all...] |
| /external/llvm/lib/ExecutionEngine/JIT/ |
| JIT.cpp | 26 #include "llvm/IR/Function.h"
42 // to the function.
80 // libgcc defines the __register_frame function to dynamically register new
83 // function here so that code generated by the JIT cooperates with the unwinding
87 // The __register_frame function works with Linux.
162 /// libgcc,we provide our own function, which "tricks" libgcc by modifying the
229 /// bugpoint or gdb users to search for a function by name without any context.
245 //search function in every instance of JIT
249 if (Function *F = (*Jit)->FindFunctionNamed(Name))
252 // The function is not available : fallback on the first created (wil
[all...] |
| /frameworks/compile/libbcc/lib/Renderscript/ |
| RSForEachExpand.cpp | 23 #include <llvm/IR/Function.h>
42 * ForEach-able function to be invoked over the appropriate data cells of the
44 * support doing this for any ForEach-able compute kernels. The new function
45 * name is the original function name followed by ".expand". Note that we
46 * still generate code for the original function.
60 uint32_t getRootSignature(llvm::Function *F) {
66 for (llvm::Function::arg_iterator B = F->arg_begin(),
86 // hard-coded to look at only the first such function.
158 /* Performs the actual optimization on a selected function. On success, the
159 * Module will contain a new function of the name "<NAME>.expand" tha
[all...] |
| /external/llvm/lib/IR/ |
| Module.cpp | 37 template class llvm::SymbolTableListTraits<Function, Module>;
133 // getOrInsertFunction - Look up the specified function in the module symbol
134 // table. If it does not exist, add a prototype for the function and return
141 // See if we have a definition for the specified function already.
145 Function *New = Function::Create(Ty, GlobalVariable::ExternalLinkage, Name);
152 // Okay, the function exists. Does it have externally visible linkage?
154 // Clear the function's name.
162 // If the function exists but has the wrong type, return a bitcast to the
167 // Otherwise, we just found the existing function or a prototype
[all...] |
| BasicBlock.cpp | 28 if (Function *F = getParent())
42 BasicBlock::BasicBlock(LLVMContext &C, const Twine &Name, Function *NewParent,
46 // Make sure that we get added to a function
51 "Cannot insert block before another block with no function!");
85 void BasicBlock::setParent(Function *parent) {
104 /// moveBefore - Unlink this basic block from its current function and
105 /// insert it into the function that MovePos lives in, right before MovePos.
111 /// moveAfter - Unlink this basic block from its current function and
112 /// insert it into the function that MovePos lives in, right after MovePos.
114 Function::iterator I = MovePos
[all...] |
| /external/v8/test/cctest/ |
| test-debug.cc | 68 // Helper function used by the CHECK_EQ function when given Address
83 // Helper function used by the CHECK_NE function when given Address
97 // Helper function used by the CHECK function when given code
169 // Compile and run the supplied source and return the fequested function.
170 static v8::Local<v8::Function> CompileFunction(DebugLocalContext* env,
174 return v8::Local<v8::Function>::Cast(
179 // Compile and run the supplied source and return the requested function
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| InlineFunction.cpp | 1 //===- InlineFunction.cpp - Code to perform function inlining -------------===//
10 // This file implements inlining of a function into a call site, resolving
71 /// unwind edges introduced for calls within the inlined function.
159 /// invokes. This function analyze BB to see if there are any calls, and if so,
178 // We only need to check for function calls: inlined invoke
186 // Convert this function call into an invoke instruction. First, split the
219 /// in the body of the inlined function into invokes.
222 /// block of the inlined code (the last block is the end of the function),
228 Function *Caller = FirstNewBlock->getParent();
230 // The inlined code is currently at the end of the function, scan from th
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ComputingConcurrentHashMap.java | 21 import com.google.common.base.Function;
45 final Function<? super K, ? extends V> computingFunction;
52 Function<? super K, ? extends V> computingFunction) {
78 V getOrCompute(K key, int hash, Function<? super K, ? extends V> computingFunction)
286 final Function<? super K, ? extends V> computingFunction;
291 public ComputingValueReference(Function<? super K, ? extends V> computingFunction) {
384 Function<? super K, ? extends V> computingFunction) {
420 final Function<? super K, ? extends V> computingFunction;
426 ConcurrentMap<K, V> delegate, Function<? super K, ? extends V> computingFunction) {
|
| Collections2.java | 23 import com.google.common.base.Function;
242 * Returns a collection that applies {@code function} to each element of
261 Function<? super F, T> function) {
262 return new TransformedCollection<F, T>(fromCollection, function);
267 final Function<? super F, ? extends T> function; field in class:Collections2.TransformedCollection
270 Function<? super F, ? extends T> function) {
272 this.function = checkNotNull(function)
[all...] |
| Tables.java | 24 import com.google.common.base.Function;
260 private static final Function<Cell<?, ?, ?>, Cell<?, ?, ?>> TRANSPOSE_CELL =
261 new Function<Cell<?, ?, ?>, Cell<?, ?, ?>>() {
282 super(original.cellSet(), (Function) TRANSPOSE_CELL);
373 * Returns a view of a table where each value is transformed by a function.
382 * null values provided that the function is capable of accepting null input.
383 * The transformed table might contain null values, if the function sometimes
389 * <p>The function is applied lazily, invoked when needed. This is necessary
390 * for the returned table to be a view, but it means that the function will be
392 * {@code Table.toString()}. For this to perform well, {@code function} shoul
406 final Function<? super V1, V2> function; field in class:Tables.TransformedTable
[all...] |
| /external/clang/lib/CodeGen/ |
| CGObjCRuntime.h | 26 class Function;
91 /// Emits a try / catch statement. This function is intended to be called by
94 /// to call when entering and exiting a \@catch() block, and the function
96 /// NULL, then the function assumes that the EH personality function provides
105 /// the object. This function can be called by subclasses that use
109 llvm::Function *syncEnterFn,
110 llvm::Function *syncExitFn);
115 /// Generate the function required to register all Objective-C components in
117 virtual llvm::Function *ModuleInitFunction() = 0
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| IntervalIterator.h | 14 // 1. A Function* object, composed of BasicBlock nodes.
23 // passing a false value into the intervals_begin() function. This causes the
37 #include "llvm/IR/Function.h"
56 inline BasicBlock *getSourceGraphNode(Function *, BasicBlock *BB) {
101 IntervalIterator(Function *M, bool OwnMemory) : IOwnMem(OwnMemory) {
235 typedef IntervalIterator<BasicBlock, Function> function_interval_iterator;
240 inline function_interval_iterator intervals_begin(Function *F,
244 inline function_interval_iterator intervals_end(Function *) {
|
| PathNumbering.h | 207 // Represents the Ball Larus DAG for a given Function. Can calculate
212 // Initializes a BallLarusDag from the CFG of a given function. Must
215 BallLarusDag(Function &F)
238 // Returns the function for the DAG.
239 Function& getFunction();
283 // The function represented by this DAG.
284 Function& _function;
|
| /external/llvm/lib/CodeGen/ |
| StackProtector.cpp | 27 #include "llvm/IR/Function.h"
46 Function *F;
58 /// the function.
78 /// RequiresStackProtector - Check whether or not this function needs a
95 virtual bool runOnFunction(Function &Fn);
107 bool StackProtector::runOnFunction(Function &Fn) {
190 /// \brief Check whether or not this function needs a stack protector based
215 for (Function::iterator I = F->begin(), E = F->end(); I != E; ++I) {
253 /// function.
264 for (Function::iterator I = F->begin(), E = F->end(); I != E; )
[all...] |
| MachineModuleInfo.cpp | 59 Function *Fn; // The containing function of the BasicBlock.
69 /// DeletedAddrLabelsNeedingEmission - This is a per-function list of symbols
72 /// function body.
73 DenseMap<AssertingVH<Function>, std::vector<MCSymbol*> >
92 void takeDeletedSymbolsForFunction(Function *F,
146 takeDeletedSymbolsForFunction(Function *F, std::vector<MCSymbol*> &Result) {
147 DenseMap<AssertingVH<Function>, std::vector<MCSymbol*> >::iterator I =
150 // If there are no entries for the function, just return.
162 // queue it up for later emission when the function is output
[all...] |
| /external/llvm/lib/ExecutionEngine/ |
| ExecutionEngineBindings.cpp | 183 return unwrap(EE)->runFunctionAsMain(unwrap<Function>(F), ArgVec, EnvP);
195 *Result = unwrap(EE)->runFunction(unwrap<Function>(F), ArgVec);
200 unwrap(EE)->freeMachineCodeForFunction(unwrap<Function>(F));
230 if (Function *F = unwrap(EE)->FindFunctionNamed(Name)) {
238 return unwrap(EE)->recompileAndRelinkFunction(unwrap<Function>(Fn));
|
| /external/v8/test/mjsunit/harmony/ |
| proxies-function.js | 33 function CreateFrozen(handler, callTrap, constructTrap) {
34 if (handler.fix === undefined) handler.fix = function() { return {} }
41 // Ensures that checking the "length" property of a function proxy doesn't
44 get : function(r, n) { return n == "length" ? 2 : undefined }
48 // Calling (call, Function.prototype.call, Function.prototype.apply,
49 // Function.prototype.bind).
54 function TestCall(isStrict, callTrap) {
60 get: function(r, k) {
61 return k == "length" ? 2 : Function.prototype[k
[all...] |
| /external/clang/lib/Sema/ |
| SemaTemplateInstantiateDecl.cpp | 459 // If a declaration acquires a function type through a type
462 // function declarator to have function type, the program is
748 // If the enumeration is within a function or method, record the enum
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SimplifyLibCalls.cpp | 11 // optimizations for calls to specific well-known function calls (e.g. runtime
13 // "replace call to library function with simpler code that provides the same
49 Function *Caller;
62 virtual Value *CallOptimizer(Function *Callee, CallInst *CI, IRBuilder<> &B)
105 bool runOnFunction(Function &F);
107 void setDoesNotAccessMemory(Function &F);
108 void setOnlyReadsMemory(Function &F);
109 void setDoesNotThrow(Function &F);
110 void setDoesNotCapture(Function &F, unsigned n);
111 void setDoesNotAlias(Function &F, unsigned n)
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MapMakerTest.java | 21 import com.google.common.base.Function;
51 Function<String, String> computingFunction = new DelayingIdentityLoader(computingLatch);
173 static final class DelayingIdentityLoader<T> implements Function<T, T> {
|
| /external/llvm/include/llvm/ |
| PassAnalysisSupport.h | 35 // Pass infrastructure through the getAnalysisUsage virtual function.
97 /// setPreservesCFG - This function should be called by the pass, iff they do
100 /// 1. Add or remove basic blocks from the function
103 /// This function annotates the AnalysisUsage info object to say that analyses
142 // Find pass that is implementing PI. Initialize pass for Function F.
143 Pass *findImplPass(Pass *P, AnalysisID PI, Function &F);
170 /// getAnalysisIfAvailable<AnalysisType>() - Subclasses use this function to
194 /// getAnalysis<AnalysisType>() - This function is used by subclasses to get
196 /// getAnalysisUsage function.
223 /// getAnalysis<AnalysisType>() - This function is used by subclasses to ge
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| Local.h | 27 class Function;
132 /// SimplifyCFG - This function is used to do simplification of a CFG. For
147 /// DemoteRegToStack - This function takes a virtual register computed by an
157 /// DemotePHIToStack - This function takes a virtual register computed by a phi
249 bool LowerDbgDeclare(Function &F);
260 /// \brief Remove all blocks that can not be reached from the function's entry.
263 bool removeUnreachableBlocks(Function &F);
|
