Mercurial > hg > truffle

comparison src/share/vm/opto/matcher.hpp @ 17812:a7d4d4655766

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