Mercurial > hg > graal-compiler

comparison src/share/vm/opto/matcher.cpp @ 164:c436414a719e

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions Summary: Add LoadNKlass and CMoveN nodes, use CmpN and ConN nodes to generate narrow oops compare instructions. Reviewed-by: never, rasbold
author kvn
date Wed, 21 May 2008 13:46:23 -0700
parents 885ed790ecf0
children 7793bd37a336
comparison
equal deleted inserted replaced
163:885ed790ecf0 164:c436414a719e
1766 case Op_LoadC: 1766 case Op_LoadC:
1767 case Op_LoadD: 1767 case Op_LoadD:
1768 case Op_LoadF: 1768 case Op_LoadF:
1769 case Op_LoadI: 1769 case Op_LoadI:
1770 case Op_LoadKlass: 1770 case Op_LoadKlass:
1771 case Op_LoadNKlass:
1771 case Op_LoadL: 1772 case Op_LoadL:
1772 case Op_LoadS: 1773 case Op_LoadS:
1773 case Op_LoadP: 1774 case Op_LoadP:
1774 case Op_LoadN: 1775 case Op_LoadN:
1775 case Op_LoadRange: 1776 case Op_LoadRange:
1897 } 1898 }
1898 case Op_CMoveD: // Convert trinary to binary-tree 1899 case Op_CMoveD: // Convert trinary to binary-tree
1899 case Op_CMoveF: 1900 case Op_CMoveF:
1900 case Op_CMoveI: 1901 case Op_CMoveI:
1901 case Op_CMoveL: 1902 case Op_CMoveL:
1903 case Op_CMoveN:
1902 case Op_CMoveP: { 1904 case Op_CMoveP: {
1903 // Restructure into a binary tree for Matching. It's possible that 1905 // Restructure into a binary tree for Matching. It's possible that
1904 // we could move this code up next to the graph reshaping for IfNodes 1906 // we could move this code up next to the graph reshaping for IfNodes
1905 // or vice-versa, but I do not want to debug this for Ladybird. 1907 // or vice-versa, but I do not want to debug this for Ladybird.
1906 // 10/2/2000 CNC. 1908 // 10/2/2000 CNC.