Searched refs:visit (Results 1 - 25 of 146) sorted by relevance

123456

/macosx-10.10/JavaScriptCore-7600.1.17/heap/
H A DHeapRootVisitor.h43 void visit(JSValue*);
44 void visit(JSValue*, size_t);
45 void visit(JSString**);
46 void visit(JSCell**);
59 inline void HeapRootVisitor::visit(JSValue* slot) function in class:JSC::HeapRootVisitor
64 inline void HeapRootVisitor::visit(JSValue* slot, size_t count) function in class:JSC::HeapRootVisitor
69 inline void HeapRootVisitor::visit(JSString** slot) function in class:JSC::HeapRootVisitor
74 inline void HeapRootVisitor::visit(JSCell** slot) function in class:JSC::HeapRootVisitor
H A DHandleStack.cpp43 void HandleStack::visit(HeapRootVisitor& heapRootVisitor) function in class:JSC::HandleStack
51 heapRootVisitor.visit(block, blockLength);
54 heapRootVisitor.visit(block, m_frame.m_next - block);
H A DWeakSet.h52 void visit(HeapRootVisitor&);
103 inline void WeakSet::visit(HeapRootVisitor& visitor) function in class:JSC::WeakSet
106 block->visit(visitor);
/macosx-10.10/ruby-106/ruby/ext/psych/lib/psych/visitors/
H A Dvisitor.rb5 visit target
14 def visit target method in class:Psych.Visitors.Visitor
H A Ddepth_first.rb11 o.children.each { |x| visit x }
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/page/
H A Dutil_flow.tcl31 while {[array size visit]} {
32 set nodes [array names visit]
33 array unset visit *
69 method visit {n} {
70 set visit($n) .
75 foreach n $nodelist {set visit($n) .}
80 foreach n $args {set visit($n) .}
84 variable visit -array {}
H A Danalysis_peg_realizable.tcl118 $flow visit $p
198 upvar 1 $v visit
200 set id [array startsearch visit]
201 set first [array nextelement visit $id]
202 array donesearch visit $id
204 unset visit($first)
/macosx-10.10/BerkeleyDB-21/db/java/src/com/sleepycat/asm/
H A DAnnotationVisitor.java33 * 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> |
51 void visit(String name, Object value); method in interface:AnnotationVisitor
67 * @return a non null visitor to visit the actual nested annotation value.
77 * @return a non null visitor to visit the actual array value elements. The
H A DClassAdapter.java55 public void visit( method in class:ClassAdapter
63 cv.visit(version, access, name, signature, superName, interfaces);
/macosx-10.10/llvmCore-3425.0.34/include/llvm/Support/
H A DInstVisitor.h32 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(Functio 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...]
/macosx-10.10/CPANInternal-159.1/Tree-Simple-VisitorFactory-0.10/t/
H A D50_Tree_Simple_Visitor_BreadthFirstTraversal_test.t51 can_ok($visitor, 'visit');
77 $visitor->visit();
81 $visitor->visit("Fail");
85 $visitor->visit([]);
89 $visitor->visit(bless({}, "Fail"));
H A D60_Tree_Simple_Visitor_PostOrderTraversal_test.t51 can_ok($visitor, 'visit');
77 $visitor->visit();
81 $visitor->visit("Fail");
85 $visitor->visit([]);
89 $visitor->visit(bless({}, "Fail"));
H A D20_Tree_Simple_Visitor_PathToRoot_test.t59 can_ok($visitor, 'visit');
105 $visitor->visit();
109 $visitor->visit("Fail");
113 $visitor->visit([]);
117 $visitor->visit(bless({}, "Fail"));
H A D40_Tree_Simple_Visitor_GetAllDescendents_test.t51 can_ok($visitor, 'visit');
88 $visitor->visit();
92 $visitor->visit("Fail");
96 $visitor->visit([]);
100 $visitor->visit(bless({}, "Fail"));
H A D75_Tree_Simple_Visitor_CreateDirectoryTree_test.t40 can_ok($visitor, 'visit');
90 can_ok($visitor, 'visit');
146 # check visit
148 $visitor->visit();
152 $visitor->visit("Fail");
156 $visitor->visit([]);
160 $visitor->visit(bless({}, "Fail"));
H A D92_Tree_Simple_Visitor_ToNestedHash_test.t33 can_ok($visitor, 'visit');
48 can_ok($visitor, 'visit');
63 can_ok($visitor, 'visit');
83 can_ok($visitor, 'visit');
102 # check visit
104 $visitor->visit();
108 $visitor->visit("Fail");
112 $visitor->visit([]);
116 $visitor->visit(bless({}, "Fail"));
H A D93_Tree_Simple_Visitor_ToNestedArray_test.t34 can_ok($visitor, 'visit');
49 can_ok($visitor, 'visit');
63 can_ok($visitor, 'visit');
83 can_ok($visitor, 'visit');
103 # check visit
105 $visitor->visit();
109 $visitor->visit("Fail");
113 $visitor->visit([]);
117 $visitor->visit(bless({}, "Fail"));
H A D32_Tree_Simple_Visitor_FindByNodeValue_test.t66 can_ok($visitor, 'visit');
175 # check visit
177 $visitor->visit();
181 $visitor->visit("Fail");
185 $visitor->visit([]);
189 $visitor->visit(bless({}, "Fail"));
197 # try to visit without a UID
199 $visitor->visit($tree);
228 $visitor->visit($tree);
233 $visitor->visit(
[all...]
H A D35_Tree_Simple_Visitor_FindByUID_test.t65 can_ok($visitor, 'visit');
174 # check visit
176 $visitor->visit();
180 $visitor->visit("Fail");
184 $visitor->visit([]);
188 $visitor->visit(bless({}, "Fail"));
196 # try to visit without a UID
198 $visitor->visit($tree);
227 $visitor->visit($tree);
232 $visitor->visit(
[all...]
H A D91_Tree_Simple_Visitor_FromNestedArray_test.t36 can_ok($visitor, 'visit');
71 can_ok($visitor, 'visit');
109 can_ok($visitor, 'visit');
138 # check visit
140 $visitor->visit();
144 $visitor->visit("Fail");
148 $visitor->visit([]);
152 $visitor->visit(bless({}, "Fail"));
179 $visitor->visit(Tree::Simple->new(Tree::Simple->ROOT));
/macosx-10.10/libauto-186/
H A DWriteBarrierIterator.h58 // let the visitor visit the write barrier
59 if (!visitor.visit(zone, wb)) return false;
72 // let the visitor visit the write barrier
73 if (!visitor.visit(zone, wb)) return false;
H A DZoneDump.cpp55 inline bool visit(Zone *zone, Subzone *subzone, usword_t q) { function in struct:Auto::dump_all_blocks_visitor
65 inline bool visit(Zone *zone, Large *large) { function in struct:Auto::dump_all_blocks_visitor
147 inline bool visit(Zone *zone, Subzone *subzone, usword_t q) { function in struct:Auto::allocated_blocks_visitor
157 inline bool visit(Zone *zone, Large *large) { function in struct:Auto::allocated_blocks_visitor
173 scan_registered_threads(^(Thread *thread) { thread->visit(visitor); });
/macosx-10.10/llvmCore-3425.0.34/lib/Analysis/
H A DInstCount.cpp44 void visit##OPCODE(CLASS &) { ++Num##OPCODE##Inst; ++TotalInsts; }
81 visit(F);
/macosx-10.10/emacs-93/emacs/lisp/
H A Djka-compr.el257 (defun jka-compr-write-region (start end file &optional append visit)
259 (visit-file (if (stringp visit) (expand-file-name visit) filename))
260 (info (jka-compr-get-compression-info visit-file))
291 (base-name (file-name-nondirectory visit-file))
353 ((eq visit t)
357 ((stringp visit)
358 (setq buffer-file-name visit)
362 (and (or (eq visit
[all...]
H A Dimage-file.el101 (defun insert-image-file (file &optional visit beg end replace)
108 file visit beg end replace)))
114 (visitingp (and visit (= ibeg (point-min)) (= iend (point-max))))

Completed in 224 milliseconds

123456