/openjdk7/jdk/src/share/classes/sun/java2d/loops/ |
H A D | TransformHelper.java | 100 int edges[], int dxoff, int dyoff); 131 int edges[], int dxoff, int dyoff) 137 edges, dxoff, dyoff); 94 Transform(MaskBlit output, SurfaceData src, SurfaceData dst, Composite comp, Region clip, AffineTransform itx, int txtype, int sx1, int sy1, int sx2, int sy2, int dx1, int dy1, int dx2, int dy2, int edges[], int dxoff, int dyoff) argument 125 Transform(MaskBlit output, SurfaceData src, SurfaceData dst, Composite comp, Region clip, AffineTransform itx, int txtype, int sx1, int sy1, int sx2, int sy2, int dx1, int dy1, int dx2, int dy2, int edges[], int dxoff, int dyoff) argument
|
/openjdk7/jdk/src/share/classes/sun/awt/geom/ |
H A D | AreaOp.java | 140 /* Constants to classify edges */ 156 Vector edges = new Vector(); 157 addEdges(edges, left, AreaOp.CTAG_LEFT); 158 addEdges(edges, right, AreaOp.CTAG_RIGHT); 159 edges = pruneEdges(edges); 162 int numcurves = edges.size(); 163 Curve[] curvelist = (Curve[]) edges.toArray(new Curve[numcurves]); 168 return edges; 171 private static void addEdges(Vector edges, Vecto argument 198 pruneEdges(Vector edges) argument [all...] |
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/ |
H A D | InputGraph.java | 41 private ArrayList<InputEdge> edges; field in class:InputGraph 64 edges = new ArrayList<InputEdge>(); 185 return Collections.unmodifiableList(edges); 189 assert edges.contains(c); 190 edges.remove(c); 191 assert !edges.contains(c); 195 assert !edges.contains(c); 196 edges.add(c); 197 assert edges.contains(c); 213 for (InputEdge c : edges) { [all...] |
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Graph.java | 41 private HashMap<Object, Edge<N, E>> edges; field in class:Graph 46 edges = new HashMap<Object, Edge<N, E>>(); 65 edges.put(key, e); 75 return edges.get(key); 79 return Collections.unmodifiableCollection(edges.values()); 87 assert key == null || edges.containsKey(key); 89 edges.remove(key);
|
/openjdk7/jdk/src/share/native/sun/java2d/loops/ |
H A D | DrawParallelogram.c | 104 EdgeInfo edges[8]; local 210 // inner and outer edges so that they are globally sorted 212 // edges for a given Y range then the edges you encounter 214 // If AB are left top and bottom edges of outer parallelogram, 215 // and CD are the right pair of edges, and abcd are the 216 // corresponding inner parallelogram edges then we want them 219 STORE_PGRAM(edges + 2, edges + 4, 235 // ABabcdCD ordering for 8 edges o [all...] |
H A D | MaskFill.c | 108 /* Fills an aligned rectangle with potentially translucent edges. */ 125 /* Convert xy12 into the edge coverage fractions for those edges. */ 276 * of a single pixel column. In practice, many edges may start or 279 * And in other cases, edges may travel sideways through several 420 * Calculates and stores slopes and deltas for all edges of a parallelogram. 424 * edges are leading and trailing) and false for an inner parallelogram 494 * of the scanline. CX1 and CX2 are the left and right edges of the 553 EdgeInfo edges[4]; local 557 if (!storePgram(edges + 0, edges 791 EdgeInfo edges[8]; local [all...] |
/openjdk7/jdk/src/solaris/native/sun/java2d/loops/ |
H A D | mlib_ImageZoom.h | 81 mlib_edge_box edges[4]; member in struct:mlib_work_image 100 mlib_edge_box *edges = param->edges; \ 103 mlib_s32 w1 = edges[0].w; \ 104 mlib_s32 w2 = edges[1].w; \ 105 mlib_s32 w3 = edges[2].w; \ 106 mlib_s32 h1 = edges[0].h; \ 107 mlib_s32 h2 = edges[1].h; \ 108 mlib_s32 h3 = edges[3].h; \ 109 mlib_s32 stride_dp0 = edges[ [all...] |
/openjdk7/jdk/src/share/classes/sun/java2d/pisces/ |
H A D | Renderer.java | 73 if (edges[ecur+YMAX] > cury) { 80 for (int ecur = edgeBuckets[bucket]; ecur != NULL; ecur = (int)edges[ecur+NEXT]) { 95 float curx = edges[ecur+CURX]; 97 edges[ecur+CURX] = curx + edges[ecur+SLOPE]; 98 if (edges[ecur+OR] > 0) { 150 private float[] edges = null; field in class:Renderer 162 edges[eptr+NEXT] = edgeBuckets[bucket]; 295 edges = Helpers.widenArray(edges, pt [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | block.hpp | 120 // input edges to Regions and Phis. 712 // Rearrange blocks into some canonical order, based on edges and their frequencies 717 GrowableArray<CFGEdge *> *edges; member in class:PhaseBlockLayout
|
H A D | idealGraphPrinter.cpp | 41 const char *IdealGraphPrinter::EDGES_ELEMENT = "edges"; 378 void IdealGraphPrinter::visit_node(Node *n, bool edges, VectorSet* temp_set) { argument 380 if (edges) { 630 void IdealGraphPrinter::walk_nodes(Node *start, bool edges, VectorSet* temp_set) { argument 651 visit_node(n, edges, temp_set);
|
H A D | callnode.cpp | 143 ReturnNode::ReturnNode(uint edges, Node *cntrl, Node *i_o, Node *memory, Node *frameptr, Node *retadr ) : Node(edges) { argument 161 // Do we Match on this edge index or not? No edges on return nodes 652 // Do we Match on this edge index or not? Match no edges 953 assert(n == NULL || n->Opcode() == Op_SafePoint, "no other uses of prec edges"); 1072 // Do we Match on this edge index or not? Match no edges 1264 // guarantee that the memory edges were all handled correctly.
|
H A D | callnode.hpp | 119 ReturnNode( uint edges, Node *cntrl, Node *i_o, Node *memory, Node *retadr, Node *frameptr ); 321 SafePointNode(uint edges, JVMState* jvms, argument 324 : MultiNode( edges ), 574 // Collect all the interesting edges from a call for use in 813 // Walks out edges to find it... 819 // Walks out edges to find it...
|
H A D | parse1.cpp | 650 int edges = block->pred_count() - block->preds_parsed() + 1; // +1 for original region local 651 RegionNode *r = new (C) RegionNode(edges+1); 654 r->init_req(edges, control()); 1531 int edges = target->pred_count(); local 1532 if (edges < pnum) edges = pnum; // might be a new path! 1533 RegionNode *r = new (C) RegionNode(edges+1); 1537 // for (int j = 1; j < edges+1; j++) { r->init_req(j, NULL); } 1627 // - the corresponding control edges is top (a dead incoming path) 2074 // Fix edges normall [all...] |
/openjdk7/hotspot/src/cpu/x86/vm/ |
H A D | sharedRuntime_x86_64.cpp | 1545 GrowableArray<MoveOperation*> edges; member in class:ComputeMoveOrder 1592 edges.append(new MoveOperation(src_index, src, dst_index, dst)); 1595 // Walk the edges breaking cycles between moves. The result list 1600 for (int i = 0; i < edges.length(); i++) { 1601 MoveOperation* s = edges.at(i); 1609 for (int i = 0; i < edges.length(); i++) { 1610 edges.at(i)->link(killer); 1619 for (int e = 0; e < edges.length(); e++) { 1620 MoveOperation* s = edges.at(e);
|
/openjdk7/hotspot/src/share/vm/adlc/ |
H A D | formssel.cpp | 601 // String.(compareTo/equals/indexOf) and Arrays.equals use many memorys edges, 867 return AdlcVMDeps::Parms; // Skip the machine-state edges 875 // take 1 control and 1 memory edges. 880 // The AD file writer is shielded from knowledge of these edges. 885 // The AD file writer is shielded from knowledge of these edges. 2093 uint edges = 0; local 2098 edges = ( leaves > consts ) ? leaves - consts : 0; 2102 if( (edges == 0) && (consts == 0) ) { 2104 edges = 1; 2117 return edges; [all...] |