Searched refs:unique (Results 26 - 48 of 48) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/opto/
H A Dloopopts.cpp60 uint old_unique = C->unique();
709 if( C->unique() > 35000 ) return n; // Method too big
736 tty->print_cr("*** Split-if bails out: %d nodes, region weight %d", C->unique(), weight);
793 if( C->unique() > 35000 ) return; // Method too big
1302 uint new_counter = C->unique();
1591 // Return the (unique) control output node that's in the loop (if it exists.)
1593 Node* unique = NULL; local
1598 if (unique != NULL) {
1601 unique = use;
1604 return unique;
[all...]
H A Descape.cpp39 _nodes(C->comp_arena(), C->unique(), C->unique(), NULL),
118 ideal_nodes.map(C->unique(), NULL); // preallocate space
224 assert(C->unique() == nodes_size(), "no new ideal nodes should be added during ConnectionGraph build");
262 // Now use the escape information to create unique types for
1946 // Returns unique pointed java object or NULL.
2446 uint orig_uniq = C->unique();
2448 assert(orig_uniq == C->unique(), "no new nodes");
2466 uint orig_uniq = C->unique();
2468 assert(orig_uniq == C->unique(), "n
[all...]
H A Dcompile.cpp331 int estimated_worklist_size = unique();
341 assert( next < unique(), "Unique useful nodes < total nodes");
355 uint max_idx = unique();
759 // This is done by a special, unique ReturnNode bound to root.
766 // This is done by a special, unique RethrowNode bound to root.
1058 aliaslevel = 2; // No unique types without escape analysis
1744 int room_to_grow = NodeCountInliningCutoff - unique();
2129 cfg.GlobalCodeMotion(m,unique(),proj_list);
2140 PhaseChaitin regalloc(unique(),cfg,m);
3036 // Allocate stack of size C->unique()/
[all...]
H A Dchaitin.hpp374 PhaseChaitin( uint unique, PhaseCFG &cfg, Matcher &matcher );
H A Dnode.cpp70 assert(Compile::current()->unique() < (UINT_MAX - 1), "Node limit exceeded UINT_MAX");
499 n->set_idx(compile->next_unique()); // Get new unique index as well
554 // Eagerly reclaim unique Node numberings
556 if ((uint)_idx+1 == compile->unique()) {
557 compile->set_unique(compile->unique()-1);
1050 // unique users of specific nodes. Such nodes should be put on IGVN worklist
1053 assert(outcnt() == 1, "match only for unique out");
1694 GrowableArray <Node *> nstack(C->unique());
1799 // Check for visited in the proper space. Numberings are not unique
1806 assert(C->cached_top_node() == n, "TOP node must be unique");
[all...]
H A Dcompile.hpp119 int _index; // unique index, used with MergeMemNode
311 uint _unique; // Counter for unique Node indices
672 uint unique() const { return _unique; } function in class:Compile
844 return unique() > (uint)NodeCountInliningCutoff;
H A Dblock.hpp177 // Since they hold unique node indexes, they do not need reinitialization.
409 void GlobalCodeMotion( Matcher &m, uint unique, Node_List &proj_list );
H A Dmatcher.cpp340 grow_new_node_array(C->unique());
343 int nodes = C->unique(); // save value
983 MStack mstack(max_stack * 2 * 2); // C->unique() * 2 * 2
1663 // It has a unique memory operand. Find corresponding ideal mem node.
1903 // Allocate stack of size C->unique() * 2 to avoid frequent realloc
1904 MStack mstack(C->unique() * 2);
H A Dparse1.cpp605 C->unique(), C->live_nodes(), C->node_arena()->used());
1174 assert(block1->start() != block2->start(), "successors have unique bcis");
1262 _initial_node_count = _compiler->unique();
1273 _nodes_constructed [_initial_bytecode] += (_compiler->unique() - _initial_node_count);
H A Dmacro.cpp81 uint old_unique = C->unique();
83 if (old_unique != C->unique()) {
512 // try to find a phi's unique input
574 NOT_PRODUCT(fail_eliminate = "Allocation does not have unique CheckCastPP";)
2005 // Delete FastLock node also if this Lock node is unique user
H A Doutput.cpp1217 uint node_offset_limit = unique();
1505 // in which case we'll need a pad to make the PcDesc sites unique
1778 _node_bundling_limit = compile.unique();
H A Dblock.cpp402 Node_Stack nstack(a, C->unique() >> 1);
H A Dlibrary_call.cpp526 int nodes = C->unique();
547 C->unique() - nodes);
574 int nodes = C->unique();
596 C->unique() - nodes);
2361 // We will need memory barriers unless we can determine a unique
H A Dcfgnode.cpp587 in = n->in(1); // replaced by unique input
794 Node_Stack stack(a, C->unique() >> 4);
1149 // Find the unique value, discounting top, self-loops, and casts.
1152 // 1) One unique direct input, or
1166 Node* uncasted_input = NULL; // The unique uncasted input (ConstraintCasts removed)
1167 Node* direct_input = NULL; // The unique direct input
1180 // Check for a unique uncasted input
1184 uncasted_input = NodeSentinel; // no unique uncasted input
1186 // Check for a unique direct input
1190 direct_input = NodeSentinel; // no unique direc
[all...]
H A Dsuperword.cpp48 _bb_idx(arena(), (int)(1.10 * phase->C->unique()), 0, 0), // node idx to index in bb
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/
H A DXPathContext.java138 * specified source. If the unique flag is true, a new instance will
148 * @param unique true if the returned DTM must be unique, probably because it
157 public DTM getDTM(javax.xml.transform.Source source, boolean unique, argument
162 return m_dtmManager.getDTM(source, unique, wsfilter,
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/util/
H A DRichDiagnosticFormatter.java226 private boolean unique(TypeVar typevar) { method in class:RichDiagnosticFormatter
384 if (unique(t) ||
/openjdk7/jdk/src/share/classes/java/sql/
H A DDatabaseMetaData.java2271 * table that reference the primary key or the columns representing a unique constraint of the parent table (could be the same or a different table).
2504 * <LI><B>NON_UNIQUE</B> boolean => Can index values be non-unique.
2527 * number of unique values in the index.
2545 * @param unique when true, return only indices for unique values;
2546 * when false, return indices regardless of whether unique or not
2554 boolean unique, boolean approximate)
2553 getIndexInfo(String catalog, String schema, String table, boolean unique, boolean approximate) argument
/openjdk7/jdk/src/share/classes/sun/net/ftp/impl/
H A DFtpClient.java394 * 226 Transfer complete (unique file name:toto.txt.1).
395 * Usually happens when a STOU (store unique) command had been issued.
400 int i = response.indexOf("unique file name:");
403 i += 17; // Length of "unique file name:"
1295 * <code>unique</code> argument, and returns the <code>OutputStream</code>
1303 * If <code>unique</code> is set to <code>true</code>, the resultant file
1304 * is to be created under a name unique to that directory, meaning
1306 * generate a new, unique, file name.
1311 * @param unique <code>true</code> if the remote files should be unique,
1317 putFileStream(String name, boolean unique) argument
1347 putFile(String name, InputStream local, boolean unique) argument
[all...]
/openjdk7/hotspot/src/share/vm/adlc/
H A Dformssel.cpp658 Component *unique = NULL; local
673 unique = comp;
681 unique = comp;
701 assert(unique != NULL, "");
703 // unique def, no uses
705 // // unique def, some uses
707 // unique = NULL;
711 unique = NULL;
713 // unique use, no defs
714 assert(unique !
[all...]
/openjdk7/jdk/test/sun/net/www/ftptest/
H A DFtpCommandHandler.java312 private void doStor(String arg, boolean unique) { argument
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xs/
H A DXMLSchemaValidator.java3401 * for handling unique, key, and keyref.
3846 /** Constructs a unique value store. */
3847 public UniqueValueStore(UniqueOrKey unique) { argument
3848 super(unique);
4093 // initialize value stores for unique fields
4099 // initialize value stores for unique fields
4100 UniqueOrKey unique = (UniqueOrKey) icArray[i];
4101 LocalIDKey toHash = new LocalIDKey(unique, fElementDepth);
4105 uniqueValueStore = new UniqueValueStore(unique);
4161 // hashtable, if id is a <unique> o
[all...]
/openjdk7/jdk/src/share/classes/com/sun/tools/hat/resources/
H A Dhat.js1431 * Returns array of unique elements from the given input
1434 * @param array from which unique elements are returned.
1435 * @param code optional expression (or function) giving unique
1439 function unique(array, code) { function

Completed in 733 milliseconds

12