Searched refs:at (Results 151 - 175 of 391) sorted by relevance

1234567891011>>

/openjdk7/hotspot/src/share/vm/services/
H A DdiagnosticArgument.hpp55 if(_array->at(i) != NULL) { // Safety check
56 FREE_C_HEAP_ARRAY(char, _array->at(i), mtInternal);
H A DmemoryService.hpp148 return _pools_list->at(index);
152 return _managers_list->at(index);
H A DmemSnapshot.hpp63 MemPointer* p2 = (MemPointer*)_array->at(_pos - 1);
69 MemPointer* p2 = (MemPointer*)_array->at(_pos + 1);
79 MemPointer* p2 = (MemPointer*)_array->at(_pos - 1);
85 MemPointer* p2 = (MemPointer*)_array->at(_pos + 1);
H A DmemoryService.cpp341 assert(major_mgr != NULL, "Should have at least one manager");
344 MemoryPool* pool = _pools_list->at(i);
505 MemoryManager* mgr = _managers_list->at(i);
515 MemoryPool* pool = _pools_list->at(i);
526 MemoryPool* pool = _pools_list->at(i);
560 MemoryPool* pool = _pools_list->at(i);
588 MemoryPool* pool = _pools_list->at(i);
592 MemoryManager* mgr = _managers_list->at(i);
/openjdk7/jdk/test/java/awt/image/ImagingOpsNoExceptionsTest/
H A DImagingOpsNoExceptionsTest.java163 AffineTransform at =
166 new AffineTransformOp(at, null);
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/opto/
H A DBlock.java85 nl.at(i).dump(out);
/openjdk7/jdk/src/share/classes/java/awt/geom/
H A DLine2D.java468 * first end point, {@code (x1,y1)}, in order to point at the
1081 * @param at the specified {@link AffineTransform}
1086 public PathIterator getPathIterator(AffineTransform at) { argument
1087 return new LineIterator(this, at);
1098 * @param at the specified <code>AffineTransform</code>
1108 public PathIterator getPathIterator(AffineTransform at, double flatness) { argument
1109 return new LineIterator(this, at);
/openjdk7/hotspot/src/share/vm/code/
H A DdebugInfoRec.cpp71 DIR_Chunk* that = arr->at(i);
86 // if JVMTI is looking at nmethod codes.
181 monitors->at(index)->write_on(stream());
203 values->at(index)->write_on(stream());
341 ((ObjectValue*) objects->at(i))->set_visited(false);
H A DexceptionHandlerTable.hpp36 // starting at bci.
57 int len() const { return _bci; } // for entry at subtable begin
154 uint at( uint exec_off ) const;
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/comp/
H A DAnnotate.java35 * which is processed at the top level of any set of recursive calls
39 * If you write code that depends on this, you do so at your own risk.
140 Type at = (a.annotationType.type != null ? a.annotationType.type
142 a.type = chk.checkType(a.annotationType.pos(), at, expected);
153 args.head = make.at(args.head.pos).
233 tree = make.at(tree.pos).
/openjdk7/jdk/src/solaris/classes/sun/java2d/xr/
H A DXRCompositeManager.java186 AffineTransform at = (AffineTransform) xform.clone();
188 at.invert();
190 at.setToIdentity();
192 src.validateAsSource(at, -1, -1);
H A DXRRenderer.java304 AffineTransform at;
307 at = null;
312 at = sg2d.transform;
325 ssi.appendPath(s.getPathIterator(at));
/openjdk7/jaxp/src/com/sun/org/apache/bcel/internal/util/
H A DBCELifier.java285 ArrayType at = (ArrayType)type;
287 return "new ArrayType(" + printType(at.getBasicType()) +
288 ", " + at.getDimensions() + ")";
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_FrameMap.hpp277 LIR_Opr at(int i) const { return _args->at(i); } function in class:CallingConvention
286 at(i)->print();
H A Dc1_ValueMap.cpp92 if (entry->nesting() != nesting() && new_entries.at(new_index) != entry->next()) {
98 entry->set_next(new_entries.at(new_index));
307 BlockBegin* block = _loop_blocks.at(i);
356 BlockBegin* start_block = blocks->at(0);
364 BlockBegin* block = blocks->at(i);
H A Dc1_Instruction.cpp320 assert(assigned == true, "should have assigned at least once");
548 _successors.at(i)->remove_predecessor(this);
652 assert(assigned == true, "should have assigned at least once");
695 if (!mark.at(block_id())) {
706 if (!mark.at(block_id())) {
765 if (!liveness.at(index) || new_value->type()->is_illegal()) {
783 bool requires_phi = requires_phi_function.at(index) || (new_value->type()->is_double_word() && requires_phi_function.at(index + 1));
896 for (int i = 0; i < l; i++) closure->block_do(at(i));
901 for (int i = length() - 1; i >= 0; i--) closure->block_do(at(
[all...]
H A Dc1_GraphBuilder.cpp148 assert(method()->bci_block_start().at(cur_bci), "wrong block starts of MethodLivenessAnalyzer");
150 BlockBegin* block = _bci2block->at(cur_bci);
192 assert(entry != NULL && entry == _bci2block->at(h->handler_bci()), "entry must be set");
211 // start a new block at the subroutine entry at mark it with special flag
225 // during bytecode iteration. This would require the creation of a new block at the
233 if (bci_block_start.at(cur_bci)) {
362 mark_loops(_bci2block->at(0), false);
375 assert(_loop_map.at(block->block_id()) == 0, "must not be set yet");
381 assert(is_power_of_2((unsigned int)_loop_map.at(bloc
491 Value at(ciField* field) { function in class:FieldBuffer
[all...]
/openjdk7/hotspot/src/share/vm/prims/
H A DjvmtiImpl.hpp105 GrowableElement* at(int index);
112 // remove the element at index, notify listener
145 JvmtiBreakpoint& at(int index) { return (JvmtiBreakpoint&) *(_cache.at(index)); } function in class:JvmtiBreakpointCache
162 // A JvmtiBreakpoint describes a location (class, method, bci) to break at.
209 // All changes to the GrowableCache occur at a safepoint using VM_ChangeBreakpoints.
211 // Because _bps is only modified at safepoints, its possible to always use the
224 // to insure they only occur at safepoints.
267 // Updated only at safepoints (with listener_fun) when the cache is moved.
518 // the holding of the Service_lock), and will be enqueued at tha
[all...]
H A DmethodComparator.cpp116 if (! bci_map.old_and_new_locations_same(fwd_jmps.at(i*2), fwd_jmps.at(i*2+1))) {
119 fwd_jmps.at(i*2), bci_map.new_bci_for_old(fwd_jmps.at(i*2)),
120 fwd_jmps.at(i*2+1)));
158 // Check if the names of classes, field/method names and signatures at these indexes
170 // Check if the names of classes, field/method names and signatures at these indexes
295 // We could use get_index_u1 and get_constant_u1, but it's simpler to grab both bytes at once:
299 // We could use get_index_u2 and get_constant_u2, but it's simpler to grab all four bytes at once:
/openjdk7/jdk/src/share/classes/java/net/
H A DURI.java157 * has a path (though it may be empty) and a scheme-specific-part (which at
623 * a commercial-at character (<tt>'@'</tt>). Any character not in the
639 * commercial-at character (<tt>'@'</tt>), is quoted. </p></li>
708 * categories, and not equal to the commercial-at character
714 * commercial-at character (<tt>'@'</tt>), is quoted. </p></li>
1179 * commercial-at character (<tt>'@'</tt>) and characters in the
1295 * character (<tt>'/'</tt>), the commercial-at character (<tt>'@'</tt>),
2175 // Looking at "." or ".." ?
2282 // We're already at this segment, so just skip to its end
2390 // hence we can insert a "." segment at tha
2862 private boolean at(int start, int end, char c) { method in class:URI.Parser
2869 private boolean at(int start, int end, String s) { method in class:URI.Parser
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DKeyIndex.java10 * You may obtain a copy of the License at
109 // duplicates can be eliminated easily at this stage.
110 } else if (node != nodes.at(nodes.cardinality() - 1)) {
225 _dom.getNodeHandle(_nodes.at(_position++)) : DTMAxisIterator.END;
577 _node = _nodes.at(_position);
764 // If at most one key value or at most one string argument to id
766 // stored at _nodes directly. This relies on the fact that the
771 nodeHandle = returnNode(_nodes.at(_position));
829 // value. If at mos
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/
H A DmarkSweep.cpp74 // All klasses on the revisit stack are marked at this point.
94 // All strongly reachable oops have been marked at this point;
128 // Process ObjArrays one at a time to avoid marking stack bloat.
141 // We preserve the mark which should be replaced at the end and the location
143 // currently at that address but it will be after phase4
257 guarantee((size_t)_live_oops->length() == _live_oops_index, "should be at end of live oops");
272 oop obj = _live_oops->at((int)_live_oops_index);
274 guarantee(_live_oops_size->at((int)_live_oops_index) == size, "should be the same size");
321 HeapWord* old_oop = _last_gc_live_oops->at(i);
322 size_t sz = _last_gc_live_oops_size->at(
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dcfgnode.hpp131 // Determine if CMoveNode::is_cmove_id can be used at this join point.
140 PhiNode( Node *r, const Type *t, const TypePtr* at = NULL,
145 _adr_type(at),
157 static PhiNode* make( Node* r, Node* x, const Type *t, const TypePtr* at = NULL );
160 PhiNode* split_out_instance(const TypePtr* at, PhaseIterGVN *igvn) const;
210 void verify_adr_type(VectorSet& visited, const TypePtr* at) const;
287 // there is no evidence at all that the contrary case has ever occurred.
H A Descape.cpp124 Node* n = ideal_nodes.at(next);
183 PointsToNode* ptn = ptnodes_worklist.at(next);
208 JavaObjectNode* ptn = non_escaped_worklist.at(next);
252 Node* n = alloc_worklist.at(next);
710 const Type* at = _igvn->type(adr); local
711 if (!adr->is_top() && at->isa_ptr()) {
712 assert(at == Type::TOP || at == TypePtr::NULL_PTR ||
713 at->isa_ptr() != NULL, "expecting a pointer");
805 // it's fields will be marked as NoEscape at leas
856 const Type* at = d->field_at(i); local
950 const Type* at = d->field_at(i); local
994 const Type* at = d->field_at(i); local
2519 const Type *at = igvn->type(result->in(MemNode::Address)); local
2584 const Type *at = igvn->type(result->in(0)->in(MemNode::Address)); local
3049 const Type *at = igvn->type(mem->in(MemNode::Address)); local
[all...]
/openjdk7/jdk/src/share/native/sun/awt/image/cvutils/
H A DREADME64 <img_dcm8.h> Decode DirectColorModel pixels with at
70 <img_noscale.h> Don't scale input data at all
75 <img_nodither.h> No encoding at all (only for 24-bit images)
116 Some platforms may manipulate masks 8-bits at a time and others
117 may manipulate them 32-bits at a time.
131 scan line at a time, then return 0 to indicate that successive
164 Called at the end of the image conversion function to perform any
171 Called at the end of the processing for a given row to allow
173 data into place a row at a time (for instance under X11, you
180 buffer. If the data is being buffered a scan line at
[all...]

Completed in 121 milliseconds

1234567891011>>