Searched refs:roots (Results 1 - 25 of 26) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/memory/
H A DsharedHeap.cpp149 OopClosure* roots,
153 // General strong roots.
160 Universe::oops_do(roots);
162 perm_gen()->ref_processor()->weak_oops_do(roots);
166 JNIHandles::oops_do(roots);
170 Threads::possibly_parallel_oops_do(roots, code_roots);
172 Threads::oops_do(roots, code_roots);
176 ObjectSynchronizer::oops_do(roots);
178 FlatProfiler::oops_do(roots);
180 Management::oops_do(roots);
146 process_strong_roots(bool activate_scope, bool collecting_perm_gen, ScanningOption so, OopClosure* roots, CodeBlobClosure* code_roots, OopsInGenClosure* perm_blk) argument
[all...]
H A DsharedHeap.hpp254 // Invoke the "do_oop" method the closure "roots" on all root locations.
255 // If "collecting_perm_gen" is false, then roots that may only contain
258 // permanent generation. The "so" argument determines which of roots
268 OopClosure* roots,
272 // Apply "blk" to all the weak roots of the system. These include
273 // JNI weak roots, the code cache, system dictionary, symbol table,
290 // (such as process strong roots) subsequently.
/openjdk7/hotspot/agent/make/
H A DClosureFinder.java55 private Collection roots; // root class names Collection<String> field in class:ClosureFinder
61 public ClosureFinder(Collection roots, String classPath) { argument
62 this.roots = roots;
91 for (Iterator rootsItr = roots.iterator(); rootsItr.hasNext();) {
223 // a sample main that accepts roots classes in a file and classpath as args
230 List roots = new ArrayList();
239 roots.add(line);
246 ClosureFinder cf = new ClosureFinder(roots, args[1]);
/openjdk7/jdk/src/share/classes/com/sun/tools/hat/internal/server/
H A DAllRootsQuery.java55 Root[] roots = snapshot.getRootsArray();
56 ArraySorter.sort(roots, new Comparer() {
70 for (int i= 0; i < roots.length; i++) {
71 Root root = roots[i];
/openjdk7/jdk/src/share/classes/sun/java2d/pisces/
H A DCurve.java104 int dxRoots(float[] roots, int off) { argument
105 return Helpers.quadraticRoots(dax, dbx, cx, roots, off);
108 int dyRoots(float[] roots, int off) { argument
109 return Helpers.quadraticRoots(day, dby, cy, roots, off);
130 // because the roots of a polynomial are not changed after multiplication
139 // Tries to find the roots of the function ROC(t)-w in [0, 1). It uses
140 // a variant of the false position algorithm to find the roots. False
144 // need the roots of its derivative; however, it's harder to find the
145 // roots of the derivative in this case than it is to find the roots
152 rootsOfROCMinusW(float[] roots, int off, final float w, final float err) argument
[all...]
/openjdk7/jdk/test/com/sun/jdi/
H A DBreakpointTest.java52 Object[] roots = new Object[200000];
54 int index = (int) (Math.random() * roots.length); // BKPT_LINE
57 roots[index] = new Object(); // bkpt here passes
/openjdk7/jdk/src/share/classes/javax/swing/filechooser/
H A DFileSystemView.java141 File[] roots = getRoots();
142 for (File root : roots) {
401 File[] roots = (File[])ShellFolder.get("roots");
403 for (int i = 0; i < roots.length; i++) {
404 if (isFileSystemRoot(roots[i])) {
405 roots[i] = createFileSystemRoot(roots[i]);
408 return roots;
/openjdk7/jdk/src/share/classes/com/sun/tools/hat/internal/model/
H A DSnapshot.java67 private Vector<Root> roots = new Vector<Root>(); field in class:Snapshot
170 r.setIndex(roots.size());
171 roots.addElement(r);
332 for (Root r : roots) {
426 return roots.elements();
430 Root[] res = new Root[roots.size()];
431 roots.toArray(res);
436 return roots.elementAt(i);
/openjdk7/jdk/src/windows/classes/sun/nio/fs/
H A DWindowsFileSystem.java130 // iterate over roots, ignoring those that the security manager denies
156 private final Iterator<Path> roots; field in class:WindowsFileSystem.FileStoreIterator
160 this.roots = getRootDirectories().iterator();
166 if (!roots.hasNext())
168 WindowsPath root = (WindowsPath)roots.next();
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/api/
H A DJavacTaskImpl.java281 ListBuffer<JCCompilationUnit> roots = null;
294 if (roots == null)
295 roots = new ListBuffer<JCCompilationUnit>();
296 roots.append(unit);
305 if (roots == null)
306 roots = new ListBuffer<JCCompilationUnit>();
307 roots.append((JCCompilationUnit)cu);
315 if (roots == null)
319 List<JCCompilationUnit> units = compiler.enterTrees(roots.toList());
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/processing/
H A DJavacProcessingEnvironment.java823 List<JCCompilationUnit> roots; field in class:JavacProcessingEnvironment.Round
857 Round(Context context, List<JCCompilationUnit> roots, List<ClassSymbol> classSymbols) { argument
859 this.roots = roots;
868 getTopLevelClasses(roots).prependList(classSymbols.reverse());
870 packageInfoFiles = getPackageInfoFiles(roots);
885 roots = cleanTrees(prev.roots).appendList(parsedFiles);
894 enterTrees(roots);
1007 private void enterTrees(List<JCCompilationUnit> roots) { argument
1144 doProcessing(Context context, List<JCCompilationUnit> roots, List<ClassSymbol> classSymbols, Iterable<? extends PackageSymbol> pckSymbols) argument
[all...]
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/presentation/rmi/
H A DPresentationManagerImpl.java204 // Use this class and its superclasses (not Object) as initial roots
217 // remove the roots and find roots again
225 private Class[] getInterfaces( Set roots )
227 Class[] classes = new Class[ roots.size() ] ;
228 Iterator iter = roots.iterator() ;
/openjdk7/langtools/src/share/classes/com/sun/tools/apt/main/
H A DAptJavaCompiler.java257 List<JCCompilationUnit> roots = trees.toList();
262 enter.main(roots);
270 apt.main(roots,
/openjdk7/jdk/src/windows/classes/sun/awt/shell/
H A DWin32ShellFolderManager2.java215 private static File[] roots; field in class:Win32ShellFolderManager2
221 * "roots":
246 } else if (key.equals("roots")) {
248 if (roots == null) {
251 roots = new File[] { desktop };
253 roots = (File[])super.get(key);
256 return roots;
/openjdk7/jdk/src/share/classes/javax/swing/
H A DRepaintManager.java779 final java.util.List<Component> roots =
783 collectDirtyComponents(tmpDirtyComponents, dirty, roots);
786 final AtomicInteger count = new AtomicInteger(roots.size());
791 final Component dirtyComponent = roots.get(j);
828 adjustRoots(repaintRoot, roots, i + 1);
829 count.set(roots.size());
853 * Removes any components from roots that are children of
857 java.util.List<Component> roots, int index) {
858 for (int i = roots.size() - 1; i >= index; i--) {
859 Component c = roots
856 adjustRoots(JComponent root, java.util.List<Component> roots, int index) argument
874 collectDirtyComponents(Map<Component,Rectangle> dirtyComponents, Component dirtyComponent, java.util.List<Component> roots) argument
[all...]
H A DJComponent.java5393 * root components here, in the roots vector. Note that there's only one
5403 private final Vector<JComponent> roots = new Vector<JComponent>(1); field in class:JComponent.ReadObjectCallback
5419 for (JComponent root : roots) {
5430 * seen, then add it to the roots <code>Vector</code>.
5437 * existing roots (or it IS an existing root), we're done.
5439 for (JComponent root : roots) {
5448 * existing roots then remove them and add c (the "new root")
5449 * to the roots vector.
5451 for(int i = 0; i < roots.size(); i++) {
5452 JComponent root = roots
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/main/
H A DJavaCompiler.java920 public List<JCCompilationUnit> enterTrees(List<JCCompilationUnit> roots) { argument
923 for (JCCompilationUnit unit: roots) {
929 enter.main(roots);
932 for (JCCompilationUnit unit: roots) {
942 for (JCCompilationUnit unit : roots) {
957 for (JCCompilationUnit unit : roots) {
961 return roots;
1010 public JavaCompiler processAnnotations(List<JCCompilationUnit> roots) { argument
1011 return processAnnotations(roots, List.<String>nil());
1016 * @param roots
1025 processAnnotations(List<JCCompilationUnit> roots, List<String> classnames) argument
[all...]
/openjdk7/jdk/src/share/classes/java/awt/geom/
H A DQuadCurve2D.java839 * array and places the non-complex roots back into the same array,
840 * returning the number of roots. The quadratic solved is represented
850 * @return the number of roots, or <code>-1</code> if the equation is
860 * array and places the non-complex roots into the <code>res</code>
861 * array, returning the number of roots.
872 * @param res the array that contains the non-complex roots
874 * @return the number of roots, or <code>-1</code> if the equation is
882 int roots = 0;
889 res[roots++] = -c / b;
894 // If d < 0.0, then there are no roots
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/xjc/reader/internalizer/
H A DDOMForest.java232 Set<String> roots = getRootDocuments();
233 Source[] sources = new Source[roots.size()];
235 for (String root : roots) {
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalClusterLayoutManager.java203 Set<Vertex> roots = new LayoutGraph(interClusterEdges).findRootVertices();
204 for (Vertex v : roots) {
/openjdk7/jdk/test/java/nio/file/Files/
H A DPassThroughFileSystem.java92 final Iterable<Path> roots = delegate.getRootDirectories();
96 final Iterator<Path> itr = roots.iterator();
/openjdk7/hotspot/src/share/vm/opto/
H A Dgcm.cpp204 bool PhaseCFG::schedule_early(VectorSet &visited, Node_List &roots) { argument
206 Node_Stack nstack(roots.Size() + 8); // (unique >> 1) + 24 from Java2D stats
207 // roots.push(_root); _root will be processed among C->top() inputs
208 roots.push(C->top());
211 while (roots.size() != 0) {
214 Node *nstack_top_n = roots.pop();
257 roots.push(in); // Visit this guy later, using worklist
275 // Process next node on the worklist 'roots'.
284 } // while (roots.size() != 0)
H A Dblock.hpp421 bool schedule_early(VectorSet &visited, Node_List &roots);
/openjdk7/jdk/src/share/classes/com/sun/tools/hat/resources/
H A Dhat.js503 * Returns an Enumeration of all roots.
505 roots: function() {
506 var e = this.snapshot.roots;
/openjdk7/jdk/src/share/classes/sun/awt/geom/
H A DOrder3.java347 int roots = 0;

Completed in 103 milliseconds

12