Mercurial > hg > graal-jvmci-8

comparison src/share/vm/opto/matcher.hpp @ 14456:abec000618bf

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Merge
author kvn
date Tue, 28 Jan 2014 12:25:34 -0800
parents 00f5eff62d18 41b780b43b74
children cd5d10655495
comparison
equal deleted inserted replaced
14269:2a8891e0a082 14456:abec000618bf
450 // piece-by-piece. Only happens when passing doubles into C code or when 450 // piece-by-piece. Only happens when passing doubles into C code or when
451 // calling i2c adapters as the Java calling convention forces doubles to be 451 // calling i2c adapters as the Java calling convention forces doubles to be
452 // aligned. 452 // aligned.
453 static const bool misaligned_doubles_ok; 453 static const bool misaligned_doubles_ok;
454 454
455 // Does the CPU require postalloc expand (see block.cpp for description of
456 // postalloc expand)?
457 static const bool require_postalloc_expand;
458
455 // Perform a platform dependent implicit null fixup. This is needed 459 // Perform a platform dependent implicit null fixup. This is needed
456 // on windows95 to take care of some unusual register constraints. 460 // on windows95 to take care of some unusual register constraints.
457 void pd_implicit_null_fixup(MachNode *load, uint idx); 461 void pd_implicit_null_fixup(MachNode *load, uint idx);
458 462
459 // Advertise here if the CPU requires explicit rounding operations 463 // Advertise here if the CPU requires explicit rounding operations
482 // Check for a following volatile memory barrier without an 486 // Check for a following volatile memory barrier without an
483 // intervening load and thus we don't need a barrier here. We 487 // intervening load and thus we don't need a barrier here. We
484 // retain the Node to act as a compiler ordering barrier. 488 // retain the Node to act as a compiler ordering barrier.
485 static bool post_store_load_barrier(const Node* mb); 489 static bool post_store_load_barrier(const Node* mb);
486 490
491 // Does n lead to an uncommon trap that can cause deoptimization?
492 static bool branches_to_uncommon_trap(const Node *n);
487 493
488 #ifdef ASSERT 494 #ifdef ASSERT
489 void dump_old2new_map(); // machine-independent to machine-dependent 495 void dump_old2new_map(); // machine-independent to machine-dependent
490 496
491 Node* find_old_node(Node* new_node) { 497 Node* find_old_node(Node* new_node) {