HomeSort by relevance Sort by last modified time
    Searched refs:visit (Results 26 - 50 of 559) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/mesa/src/src/glsl/
ir_variable_refcount.h 66 virtual ir_visitor_status visit(ir_variable *);
67 virtual ir_visitor_status visit(ir_dereference_variable *);
  /external/chromium_org/tools/android/findbugs_plugin/src/org/chromium/tools/findbugs/plugin/
SynchronizedMethodDetector.java 25 public void visit(Code code) { method in class:SynchronizedMethodDetector
32 super.visit(code);
  /external/jarjar/src/main/com/tonicsystems/jarjar/util/
GetNameClassWriter.java 31 public void visit(int version, int access, String name, String signature, String superName, String[] interfaces) { method in class:GetNameClassWriter
33 super.visit(version, access, name, signature, superName, interfaces);
  /external/mesa3d/src/glsl/
ir_variable_refcount.h 66 virtual ir_visitor_status visit(ir_variable *);
67 virtual ir_visitor_status visit(ir_dereference_variable *);
  /external/chromium_org/third_party/angle/src/compiler/translator/
FlagStd140Structs.h 24 virtual bool visitBinary(Visit visit, TIntermBinary *binaryNode);
RewriteElseBlocks.h 24 bool visitAggregate(Visit visit, TIntermAggregate *aggregate);
DetectCallDepth.cpp 12 visit(PreVisit)
33 ASSERT(visit == PreVisit);
37 visit = InVisit;
39 switch (callees[i]->visit) {
63 visit = PostVisit;
69 visit = PreVisit;
86 bool DetectCallDepth::visitAggregate(Visit visit, TIntermAggregate* node)
97 if (visit == PreVisit) {
103 } else if (visit == PostVisit)
    [all...]
OutputHLSL.cpp     [all...]
  /external/chromium_org/tools/android/findbugs_plugin/lib/
chromiumPlugin.jar 
  /external/mockito/cglib-and-asm/src/org/mockito/asm/
AnnotationVisitor.java 33 * A visitor to visit a Java annotation. The methods of this interface must be
34 * called in the following order: (<tt>visit<tt> | <tt>visitEnum<tt> |
54 void visit(String name, Object value); method in interface:AnnotationVisitor
70 * @return a visitor to visit the actual nested annotation value, or
81 * can be passed as value to {@link #visit visit}. This is what
85 * @return a visitor to visit the actual array value elements, or
  /external/smali/util/src/main/java/ds/tree/
VisitorImpl.java 26 abstract public void visit(String key, RadixTreeNode<T> parent, RadixTreeNode<T> node); method in class:VisitorImpl
  /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/parser/
ASTaddr_spec.java 17 return visitor.visit(this, data);
ASTaddress.java 17 return visitor.visit(this, data);
ASTaddress_list.java 17 return visitor.visit(this, data);
ASTangle_addr.java 17 return visitor.visit(this, data);
ASTdomain.java 17 return visitor.visit(this, data);
ASTgroup_body.java 17 return visitor.visit(this, data);
ASTlocal_part.java 17 return visitor.visit(this, data);
ASTmailbox.java 17 return visitor.visit(this, data);
ASTname_addr.java 17 return visitor.visit(this, data);
ASTphrase.java 17 return visitor.visit(this, data);
ASTroute.java 17 return visitor.visit(this, data);
  /external/chromium_org/third_party/jinja2/
visitor.py 17 forwarded by the `visit` method.
20 class name of the node. So a `TryFinally` node visit function would
28 exists for this node. In that case the generic visit function is
34 def visit(self, node, *args, **kwargs): member in class:NodeVisitor
35 """Visit a node."""
44 self.visit(node, *args, **kwargs)
64 value = self.visit(value, *args, **kwargs)
73 new_node = self.visit(old_value, *args, **kwargs)
84 rv = self.visit(node, *args, **kwargs)
  /external/llvm/include/llvm/IR/
InstVisitor.h 32 visit##CLASS_TO_VISIT(static_cast<CLASS_TO_VISIT&>(I))
61 /// CAV.visit(function);
64 /// The defined has 'visit' methods for Instruction, and also for BasicBlock,
84 // use to visit instructions...
88 // Generic visit method - Allow visitation to all instructions in a range
90 void visit(Iterator Start, Iterator End) { function in class:llvm::InstVisitor
92 static_cast<SubClass*>(this)->visit(*Start++);
97 void visit(Module &M) { function in class:llvm::InstVisitor
99 visit(M.begin(), M.end());
101 void visit(Function &F) function in class:llvm::InstVisitor
105 void visit(BasicBlock &BB) { function in class:llvm::InstVisitor
111 void visit(Module *M) { visit(*M); } function in class:llvm::InstVisitor
112 void visit(Function *F) { visit(*F); } function in class:llvm::InstVisitor
113 void visit(BasicBlock *BB) { visit(*BB); } function in class:llvm::InstVisitor
114 RetTy visit(Instruction *I) { return visit(*I); } function in class:llvm::InstVisitor
118 RetTy visit(Instruction &I) { function in class:llvm::InstVisitor
    [all...]
  /external/chromium_org/chrome/browser/history/
typed_url_syncable_service.cc 19 // the size under control we limit the visit array.
45 for (VisitVector::const_iterator visit = visits.begin();
46 visit != visits.end(); ++visit) {
47 if (visit != visits.begin()) {
52 if (previous_visit_time == visit->visit_time.ToInternalValue())
53 DVLOG(1) << "Duplicate visit time encountered";
54 else if (previous_visit_time > visit->visit_time.ToInternalValue())
58 previous_visit_time = visit->visit_time.ToInternalValue();
259 // to make sure we sync up every visit to ensure the proper ordering o
    [all...]

Completed in 728 milliseconds

12 3 4 5 6 7 8 91011>>