Searched defs:edge (Results 1 - 17 of 17) sorted by relevance

/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ControlFlow/src/com/sun/hotspot/igv/controlflow/
H A DBlockConnectionWidget.java45 private InputBlockEdge edge; field in class:BlockConnectionWidget
47 public BlockConnectionWidget(ControlFlowScene scene, InputBlockEdge edge) { argument
50 this.edge = edge;
51 this.from = (BlockWidget) scene.findWidget(edge.getFrom());
52 this.to = (BlockWidget) scene.findWidget(edge.getTo());
59 return edge;
H A DControlFlowScene.java273 protected Widget attachEdgeWidget(InputBlockEdge edge) { argument
274 ConnectionWidget w = new BlockConnectionWidget(this, edge);
281 protected void attachEdgeSourceAnchor(InputBlockEdge edge, InputBlock oldSourceNode, InputBlock sourceNode) { argument
282 Widget w = this.findWidget(edge);
289 protected void attachEdgeTargetAnchor(InputBlockEdge edge, InputBlock oldTargetNode, InputBlock targetNode) { argument
290 Widget w = this.findWidget(edge);
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/serialization/
H A DPrinter.java210 private Properties createProperties(InputEdge edge) { argument
212 p.setProperty(Parser.TO_INDEX_PROPERTY, Integer.toString(edge.getToIndex()));
213 p.setProperty(Parser.TO_PROPERTY, Integer.toString(edge.getTo()));
214 p.setProperty(Parser.FROM_PROPERTY, Integer.toString(edge.getFrom()));
/openjdk7/jdk/src/share/native/sun/awt/medialib/
H A Dmlib_ImageAffine.c29 * mlib_ImageAffine - image affine transformation with edge condition
36 * mlib_edge edge)
46 * edge Type of edge condition.
60 * The edge condition can be one of the following:
151 mlib_edge edge,
194 kw, kw, kw1, kw1, edge, mtx, MLIB_SHIFT, MLIB_SHIFT);
285 if (edge == MLIB_EDGE_SRC_PADDED)
286 edge = MLIB_EDGE_DST_NO_WRITE;
288 if (filter != MLIB_NEAREST && edge !
147 mlib_ImageAffine_alltypes(mlib_image *dst, const mlib_image *src, const mlib_d64 *mtx, mlib_filter filter, mlib_edge edge, const void *colormap) argument
340 mlib_ImageAffine(mlib_image *dst, const mlib_image *src, const mlib_d64 *mtx, mlib_filter filter, mlib_edge edge) argument
[all...]
H A Dmlib_ImageConvMxN.c29 * mlib_ImageConvMxN - image convolution with edge condition
41 * mlib_edge edge)
56 * edge Type of edge condition.
66 * The edge condition can be one of the following:
102 mlib_edge edge)
127 return mlib_ImageConvMxN_f(dst, src, kernel, m, n, dm, dn, scale, cmask, edge);
140 mlib_edge edge)
175 edge = MLIB_EDGE_DST_NO_WRITE;
177 if (edge !
93 mlib_ImageConvMxN(mlib_image *dst, const mlib_image *src, const mlib_s32 *kernel, mlib_s32 m, mlib_s32 n, mlib_s32 dm, mlib_s32 dn, mlib_s32 scale, mlib_s32 cmask, mlib_edge edge) argument
131 mlib_ImageConvMxN_f(mlib_image *dst, const mlib_image *src, const void *kernel, mlib_s32 m, mlib_s32 n, mlib_s32 dm, mlib_s32 dn, mlib_s32 scale, mlib_s32 cmask, mlib_edge edge) argument
[all...]
H A Dmlib_ImageConvMxN_Fp.c29 * mlib_ImageConvMxN_Fp - image convolution with edge condition
40 * mlib_edge edge)
52 * edge Type of edge condition.
62 * The edge condition can be one of the following:
143 mlib_edge edge)
153 return mlib_ImageConvMxN_f(dst, src, kernel, m, n, dm, dn, 0, cmask, edge);
135 mlib_ImageConvMxN_Fp(mlib_image *dst, const mlib_image *src, const mlib_d64 *kernel, mlib_s32 m, mlib_s32 n, mlib_s32 dm, mlib_s32 dn, mlib_s32 cmask, mlib_edge edge) argument
H A Dmlib_ImageScanPoly.c47 mlib_edge edge,
131 if ((mlib_s32) edge < 0) { /* process edges */
147 if (edge == MLIB_EDGE_SRC_PADDED) {
375 if (edge == MLIB_EDGE_SRC_PADDED) {
38 mlib_AffineEdges(mlib_affine_param *param, const mlib_image *dst, const mlib_image *src, void *buff_lcl, mlib_s32 buff_size, mlib_s32 kw, mlib_s32 kh, mlib_s32 kw1, mlib_s32 kh1, mlib_edge edge, const mlib_d64 *mtx, mlib_s32 shiftx, mlib_s32 shifty) argument
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/org/objectweb/asm/
H A DFrame.java1272 * @param edge the kind of the {@link Edge} between this label and 'label'.
1277 boolean merge(final ClassWriter cw, final Frame frame, final int edge) { argument
1313 if (edge > 0) {
1322 changed |= merge(cw, edge, frame.inputStack, 0);
/openjdk7/jdk/src/share/native/sun/java2d/opengl/
H A DOGLBufImgOps.c68 // image edge limits:
69 // imgEdge.xy = imgMin.xy (anything < will be treated as edge case)
70 // imgEdge.zw = imgMax.xy (anything > will be treated as edge case)
86 // (placeholder for edge condition code)
135 char edge[100]; local
144 sprintf(edge, "sum = vec4(0.0);");
147 sprintf(edge,
154 kernelMax, target, edge, target);
/openjdk7/jdk/src/share/classes/javax/swing/plaf/metal/
H A DMetalLookAndFeel.java2428 // Insert 12 pixels between the trailing edge of a
2430 // pixels between the trailing edge of a label and the
2433 // 12 pixels between the trailing edge of the longest
2483 private int getButtonAdjustment(JComponent source, int edge) { argument
2486 if (!usingOcean() && (edge == SwingConstants.EAST ||
2487 edge == SwingConstants.SOUTH)) {
2493 else if (edge == SwingConstants.SOUTH) {
/openjdk7/jdk/src/windows/native/sun/java2d/d3d/
H A DD3DShaderGen.c168 // image edge limits:
169 // imgEdge.xy = imgMin.xy (anything < will be treated as edge case)
170 // imgEdge.zw = imgMax.xy (anything > will be treated as edge case)
184 // (placeholder for edge condition code)
212 char *edge; local
221 edge = "float4(0, 0, 0, 0)";
224 edge = "tex2D(baseImage, tc)";
229 kernelMax, edge, kernelMax);
/openjdk7/jdk/src/share/native/sun/java2d/cmm/lcms/
H A Dcmssm.c276 if (sN < 0.0) { // sc < 0 => the s=0 edge is visible
282 else if (sN > sD) { // sc > 1 => the s=1 edge is visible
289 if (tN < 0.0) { // tc < 0 => the t=0 edge is visible
292 // recompute sc for this edge
302 else if (tN > tD) { // tc > 1 => the t=1 edge is visible
306 // recompute sc for this edge
511 cmsLine edge; local
548 LineOf2Points(&edge, &a1, &a2);
551 ClosestLineToLine(&temp, &ray, &edge);
/openjdk7/hotspot/src/share/vm/opto/
H A Descape.hpp101 // nodes and copying the edges from the target of the deferred edge to the
162 PointsToUnknown = 2, // Has edge to phantom_object
163 ArraycopySrc = 4, // Has edge from Arraycopy node
164 ArraycopyDst = 8 // Has edge to Arraycopy node
216 PointsToNode* edge(int e) const { return _edges.at(e); } function in class:PointsToNode
217 bool add_edge(PointsToNode* edge) { return _edges.append_if_missing(edge); } argument
223 // Mark base edge use to distinguish from stored value edge.
309 inline PointsToNode* get() const { return node->edge(
[all...]
H A Dmacro.cpp84 new_in->set_req(0, C->root()); // reset control edge
103 Node* PhaseMacroExpand::opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path) { argument
122 region->init_req(edge, slow_taken); // Capture slow-control
125 region->init_req(edge, fast_taken); // Capture fast-control
356 // or memory edge from Allocate node.
1584 // edge cases is safety first. It is always safe to clear immediately
2228 // Reset lock's memory edge.
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DOldHierarchicalLayoutManager.java78 private Link edge; field in class:OldHierarchicalLayoutManager.NodeData
97 public NodeData(Link edge) { argument
99 this.edge = edge;
100 assert edge != null;
114 return edge;
154 return edge != null;
214 return edge.toString() + "(layer=" + layer + ")";
229 private Link edge; field in class:OldHierarchicalLayoutManager.EdgeData
231 public EdgeData(Link edge) { argument
235 EdgeData(Link edge, boolean rev) argument
[all...]
/openjdk7/jdk/src/share/classes/sun/java2d/loops/
H A DProcessPath.java1707 public Edge edge; field in class:ProcessPath.Point
1825 head = pnt.edge = ne;
1886 // correction of the back links in the double linked edge list
1960 if (pt.prev.edge != null && pt.prev.y <= y) {
1961 activeList.delete(pt.prev.edge);
1962 pt.prev.edge = null;
1969 if (pt.edge != null && pt.next.y <= y) {
1970 activeList.delete(pt.edge);
1971 pt.edge = null;
/openjdk7/jdk/src/share/native/sun/java2d/loops/
H A DProcessPath.c1746 struct _Edge* edge; member in struct:_Point
1941 pnt->edge = head; \
2004 curpt->edge = NULL;
2011 ept->edge = NULL;
2023 if (pt->prev->edge && pt->prev->y <= y) {
2024 DELETE_ACTIVE(activeList, pt->prev->edge);
2025 pt->prev->edge = NULL;
2032 if (pt->edge && pt->next->y <= y) {
2033 DELETE_ACTIVE(activeList, pt->edge);
2034 pt->edge
[all...]

Completed in 805 milliseconds