Searched refs:mem (Results 1 - 25 of 120) sorted by relevance

12345

/openjdk10/hotspot/src/share/vm/opto/
H A Dintrinsicnode.cpp45 Node* mem = phase->transform(in(MemNode::Memory)); local
48 mem = mem->is_MergeMem() ? mem->as_MergeMem()->memory_at(alias_idx) : mem;
49 if (mem != in(MemNode::Memory)) {
50 set_req(MemNode::Memory, mem);
H A Dmemnode.hpp80 virtual Node* find_previous_arraycopy(PhaseTransform* phase, Node* ld_alloc, Node*& mem, bool can_see_stored_value) const { return NULL; } argument
142 static void dump_adr_type(const Node* mem, const TypePtr* adr_type, outputStream *st);
189 virtual Node* find_previous_arraycopy(PhaseTransform* phase, Node* ld_alloc, Node*& mem, bool can_see_stored_value) const;
192 LoadNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const Type *rt, MemOrd mo, ControlDependency control_dependency) argument
193 : MemNode(c,mem,adr,at), _type(rt), _mo(mo), _control_dependency(control_dependency) {
207 static Node* make(PhaseGVN& gvn, Node *c, Node *mem, Node *adr,
293 LoadBNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeInt *ti, MemOrd mo, ControlDependency control_dependency = DependsOnlyOnTest) argument
294 : LoadNode(c, mem, adr, at, ti, mo, control_dependency) {}
307 LoadUBNode(Node* c, Node* mem, Node* adr, const TypePtr* at, const TypeInt* ti, MemOrd mo, ControlDependency control_dependency = DependsOnlyOnTest) argument
308 : LoadNode(c, mem, ad
321 LoadUSNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeInt *ti, MemOrd mo, ControlDependency control_dependency = DependsOnlyOnTest) argument
335 LoadSNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeInt *ti, MemOrd mo, ControlDependency control_dependency = DependsOnlyOnTest) argument
349 LoadINode(Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeInt *ti, MemOrd mo, ControlDependency control_dependency = DependsOnlyOnTest) argument
361 LoadRangeNode(Node *c, Node *mem, Node *adr, const TypeInt *ti = TypeInt::POS) argument
381 LoadLNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeLong *tl, MemOrd mo, ControlDependency control_dependency = DependsOnlyOnTest, bool require_atomic_access = false) argument
404 LoadL_unalignedNode(Node *c, Node *mem, Node *adr, const TypePtr* at, MemOrd mo, ControlDependency control_dependency = DependsOnlyOnTest) argument
413 LoadFNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const Type *t, MemOrd mo, ControlDependency control_dependency = DependsOnlyOnTest) argument
433 LoadDNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const Type *t, MemOrd mo, ControlDependency control_dependency = DependsOnlyOnTest, bool require_atomic_access = false) argument
456 LoadD_unalignedNode(Node *c, Node *mem, Node *adr, const TypePtr* at, MemOrd mo, ControlDependency control_dependency = DependsOnlyOnTest) argument
465 LoadPNode(Node *c, Node *mem, Node *adr, const TypePtr *at, const TypePtr* t, MemOrd mo, ControlDependency control_dependency = DependsOnlyOnTest) argument
478 LoadNNode(Node *c, Node *mem, Node *adr, const TypePtr *at, const Type* t, MemOrd mo, ControlDependency control_dependency = DependsOnlyOnTest) argument
494 LoadKlassNode(Node *c, Node *mem, Node *adr, const TypePtr *at, const TypeKlassPtr *tk, MemOrd mo) argument
510 LoadNKlassNode(Node *c, Node *mem, Node *adr, const TypePtr *at, const TypeNarrowKlass *tk, MemOrd mo) argument
547 StoreNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) argument
551 StoreNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, Node *oop_store, MemOrd mo) argument
616 StoreBNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) argument
627 StoreCNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) argument
638 StoreINode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) argument
656 StoreLNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo, bool require_atomic_access = false) argument
674 StoreFNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) argument
691 StoreDNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo, bool require_atomic_access = false) argument
711 StorePNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) argument
721 StoreNNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) argument
731 StoreNKlassNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) argument
752 StoreCMNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, Node *oop_store, int oop_alias_idx ) argument
773 LoadPLockedNode(Node *c, Node *mem, Node *adr, MemOrd mo) argument
834 StorePConditionalNode( Node *c, Node *mem, Node *adr, Node *val, Node *ll ) argument
845 StoreIConditionalNode( Node *c, Node *mem, Node *adr, Node *val, Node *ii ) argument
856 StoreLConditionalNode( Node *c, Node *mem, Node *adr, Node *val, Node *ll ) argument
866 CompareAndSwapNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
879 CompareAndExchangeNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord, const TypePtr* at, const Type* t) argument
892 CompareAndSwapBNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
899 CompareAndSwapSNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
906 CompareAndSwapINode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
913 CompareAndSwapLNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
920 CompareAndSwapPNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
927 CompareAndSwapNNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
934 WeakCompareAndSwapBNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
941 WeakCompareAndSwapSNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
948 WeakCompareAndSwapINode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
955 WeakCompareAndSwapLNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
962 WeakCompareAndSwapPNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
969 WeakCompareAndSwapNNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, MemNode::MemOrd mem_ord) argument
976 CompareAndExchangeBNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, const TypePtr* at, MemNode::MemOrd mem_ord) argument
984 CompareAndExchangeSNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, const TypePtr* at, MemNode::MemOrd mem_ord) argument
991 CompareAndExchangeLNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, const TypePtr* at, MemNode::MemOrd mem_ord) argument
999 CompareAndExchangeINode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, const TypePtr* at, MemNode::MemOrd mem_ord) argument
1007 CompareAndExchangePNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, const TypePtr* at, const Type* t, MemNode::MemOrd mem_ord) argument
1014 CompareAndExchangeNNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex, const TypePtr* at, const Type* t, MemNode::MemOrd mem_ord) argument
1021 GetAndAddBNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) argument
1028 GetAndAddSNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) argument
1035 GetAndAddINode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) argument
1042 GetAndAddLNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) argument
1049 GetAndSetBNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) argument
1056 GetAndSetSNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) argument
1063 GetAndSetINode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) argument
1070 GetAndSetLNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) argument
1077 GetAndSetPNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at, const Type* t ) argument
1084 GetAndSetNNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at, const Type* t ) argument
1534 Node *mem = _mem->is_top() ? _mm_base : _mem; local
1542 set_memory(Node* mem) argument
1601 PrefetchAllocationNode(Node *mem, Node *adr) argument
[all...]
H A Darraycopynode.cpp164 MergeMemNode* mem = MergeMemNode::make(in_mem); local
202 Node* v = LoadNode::make(*phase, ctl, mem->memory_at(fieldidx), next_src, adr_type, type, bt, MemNode::unordered);
204 Node* s = StoreNode::make(*phase, ctl, mem->memory_at(fieldidx), next_dest, adr_type, v, bt, MemNode::unordered);
206 mem->set_memory_at(fieldidx, s);
209 if (!finish_transform(phase, can_reshape, ctl, mem)) {
214 return mem;
359 Node* mem = phase->C->top(); local
362 mem = start_mem_dest;
367 mem = StoreNode::make(*phase, forward_ctl, mem, adr_des
401 Node* mem = phase->C->top(); local
429 finish_transform(PhaseGVN *phase, bool can_reshape, Node* ctl, Node *mem) argument
526 Node* mem = try_clone_instance(phase, can_reshape, count); local
[all...]
H A Dmemnode.cpp98 void MemNode::dump_adr_type(const Node* mem, const TypePtr* adr_type, outputStream *st) { argument
223 Node *mem = mmem; local
268 mem = (m->is_MergeMem())? m->as_MergeMem()->memory_at(alias_idx) : m;
271 return mem;
307 Node *mem = in(MemNode::Memory); local
308 if (phase->type( mem ) == Type::TOP) return NodeSentinel; // caller will return NULL
309 assert(mem != this, "dead loop in MemNode::Ideal");
311 if (can_reshape && igvn != NULL && igvn->_worklist.member(mem)) {
313 // Delay this mem node transformation until the memory is processed.
326 // Delay this mem nod
507 find_previous_arraycopy(PhaseTransform* phase, Node* ld_alloc, Node*& mem, bool can_see_stored_value) const argument
579 Node* mem = in(MemNode::Memory); // start searching here... local
786 make(PhaseGVN& gvn, Node *ctl, Node *mem, Node *adr, const TypePtr* adr_type, const Type *rt, BasicType bt, MemOrd mo, ControlDependency control_dependency, bool unaligned, bool mismatched) argument
843 make_atomic(Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, const Type* rt, MemOrd mo, ControlDependency control_dependency, bool unaligned, bool mismatched) argument
856 make_atomic(Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, const Type* rt, MemOrd mo, ControlDependency control_dependency, bool unaligned, bool mismatched) argument
901 Node* mem = ac->in(TypeFunc::Memory); local
991 Node* mem = current->in(0)->in(TypeFunc::Memory); local
1107 Node* mem = in(Memory); local
1330 Node* mem = in(Memory); local
1542 Node* mem = in(MemNode::Memory); local
1661 Node* mem = in(MemNode::Memory); local
1869 Node *mem = in(MemNode::Memory); local
1892 Node* mem = in(MemNode::Memory); local
1903 Node* mem = in(MemNode::Memory); local
1924 Node* mem = in(MemNode::Memory); local
1933 Node* mem = in(MemNode::Memory); local
1954 Node* mem = in(MemNode::Memory); local
1963 Node* mem = in(MemNode::Memory); local
1984 Node* mem = in(MemNode::Memory); local
1995 Node* mem = in(MemNode::Memory); local
2011 make(PhaseGVN& gvn, Node* ctl, Node* mem, Node* adr, const TypePtr* at, const TypeKlassPtr* tk) argument
2338 make(PhaseGVN& gvn, Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, Node* val, BasicType bt, MemOrd mo) argument
2376 make_atomic(Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, Node* val, MemOrd mo) argument
2381 make_atomic(Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, Node* val, MemOrd mo) argument
2492 Node* mem = in(MemNode::Memory); local
2665 Node* mem = my_store->as_MergeMem()->memory_at(oop_alias_idx()); local
2699 LoadStoreNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at, const Type* rt, uint required ) argument
2728 LoadStoreConditionalNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex ) argument
2775 Node *mem = in(1); local
2828 clear_memory(Node* ctl, Node* mem, Node* dest, intptr_t start_offset, Node* end_offset, PhaseGVN* phase) argument
2849 clear_memory(Node* ctl, Node* mem, Node* dest, Node* start_offset, Node* end_offset, PhaseGVN* phase) argument
2876 clear_memory(Node* ctl, Node* mem, Node* dest, intptr_t start_offset, intptr_t end_offset, PhaseGVN* phase) argument
3144 Node* mem = in(Memory); local
4143 make(Node* mem) argument
4161 Node* mem = in(i); local
4376 Node* mem = (in(i) != NULL) ? memory_at(i) : base_mem; local
[all...]
H A Dmacro.hpp64 Node* make_load( Node* ctl, Node* mem, Node* base, int offset,
66 Node* make_store(Node* ctl, Node* mem, Node* base, int offset,
88 Node *value_from_mem(Node *mem, Node *ctl, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc);
89 Node *value_from_mem_phi(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc, Node_Stack *value_phis, int level);
105 void insert_mem_bar(Node** ctrl, Node** mem, int opcode, Node* precedent = NULL);
108 Node* make_leaf_call(Node* ctrl, Node* mem,
125 void finish_arraycopy_call(Node* call, Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type);
134 Node** ctrl, MergeMemNode* mem, Node** io,
150 bool generate_block_arraycopy(Node** ctrl, MergeMemNode** mem, Node* io,
158 Node** ctrl, Node* mem, Nod
[all...]
H A DmacroArrayCopy.cpp35 void PhaseMacroExpand::insert_mem_bar(Node** ctrl, Node** mem, int opcode, Node* precedent) { argument
38 mb->init_req(TypeFunc::Memory, *mem);
44 *mem = mem_proj;
66 Node* PhaseMacroExpand::make_leaf_call(Node* ctrl, Node* mem, argument
78 call->init_req(TypeFunc::Memory , mem);
187 void PhaseMacroExpand::finish_arraycopy_call(Node* call, Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type) { argument
197 *mem = MergeMemNode::make(*mem);
198 (*mem)->set_memory_at(alias_idx, newmem);
200 *mem
274 generate_arraycopy(ArrayCopyNode *ac, AllocateArrayNode* alloc, Node** ctrl, MergeMemNode* mem, Node** io, const TypePtr* adr_type, BasicType basic_elem_type, Node* src, Node* src_offset, Node* dest, Node* dest_offset, Node* copy_length, bool disjoint_bases, bool length_never_negative, RegionNode* slow_region) argument
772 Node* mem = merge_mem->memory_at(alias_idx); // memory slice to operate on local
862 generate_block_arraycopy(Node** ctrl, MergeMemNode** mem, Node* io, const TypePtr* adr_type, BasicType basic_elem_type, AllocateNode* alloc, Node* src, Node* src_offset, Node* dest, Node* dest_offset, Node* dest_size, bool dest_uninitialized) argument
938 generate_slow_arraycopy(ArrayCopyNode *ac, Node** ctrl, Node* mem, Node** io, const TypePtr* adr_type, Node* src, Node* src_offset, Node* dest, Node* dest_offset, Node* copy_length, bool dest_uninitialized) argument
991 generate_checkcast_arraycopy(Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type, Node* dest_elem_klass, Node* src, Node* src_offset, Node* dest, Node* dest_offset, Node* copy_length, bool dest_uninitialized) argument
1030 generate_generic_arraycopy(Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type, Node* src, Node* src_offset, Node* dest, Node* dest_offset, Node* copy_length, bool dest_uninitialized) argument
1056 generate_unchecked_arraycopy(Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type, BasicType basic_elem_type, bool disjoint_bases, Node* src, Node* src_offset, Node* dest, Node* dest_offset, Node* copy_length, bool dest_uninitialized) argument
1097 Node* mem = ac->in(TypeFunc::Memory); local
1112 Node* mem = ac->in(TypeFunc::Memory); local
1180 Node* mem = ac->in(TypeFunc::Memory); local
1188 Node* mem = generate_arraycopy(ac, NULL, &ctrl, merge_mem, &io, local
1214 Node* mem = ac->in(TypeFunc::Memory); local
1238 Node* mem = ac->in(TypeFunc::Memory); local
[all...]
H A Dmacro.cpp234 Node *mem = addp->last_out(j); local
235 if (UseCondCardMark && mem->is_Load()) {
236 assert(mem->Opcode() == Op_LoadB, "unexpected code shape");
239 _igvn.replace_node(mem, intcon(0));
242 assert(mem->is_Store(), "store required");
243 _igvn.replace_node(mem, mem->in(MemNode::Memory));
328 static Node *scan_mem_chain(Node *mem, int alias_idx, int offset, Node *start_mem, Node *alloc, PhaseGVN *phase) { argument
329 Node *orig_mem = mem;
333 if (mem
429 make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset, Node* ctl, Node* mem, BasicType ft, const Type *ftype, AllocateNode *alloc) argument
475 value_from_mem_phi(Node *mem, BasicType ft, const Type *phi_type, const TypeOopPtr *adr_t, AllocateNode *alloc, Node_Stack *value_phis, int level) argument
586 Node *mem = sfpt_mem; local
840 Node* mem = sfpt->memory(); local
1095 Node *mem = init->in(TypeFunc::Memory); local
1256 make_load(Node* ctl, Node* mem, Node* base, int offset, const Type* value_type, BasicType bt) argument
1265 make_store(Node* ctl, Node* mem, Node* base, int offset, Node* value, BasicType bt) argument
1335 Node* mem = alloc->in(TypeFunc::Memory); local
1590 Node* mem = new ProjNode(init,TypeFunc::Memory); local
2247 Node* mem = alock->in(TypeFunc::Memory); local
2306 Node* mem = lock->in(TypeFunc::Memory); local
2544 Node* mem = unlock->in(TypeFunc::Memory); local
[all...]
H A DidealKit.cpp338 MergeMemNode* mem = merged_memory(); local
339 Node* p = mem->memory_at(alias_idx);
344 void IdealKit::set_memory(Node* mem, uint alias_idx) { argument
345 merged_memory()->set_memory_at(alias_idx, mem);
359 Node* mem = memory(adr_idx); local
362 ld = LoadLNode::make_atomic(ctl, mem, adr, adr_type, t, MemNode::unordered);
364 ld = LoadNode::make(_gvn, ctl, mem, adr, adr_type, t, bt, MemNode::unordered);
376 Node *mem = memory(adr_idx); local
379 st = StoreLNode::make_atomic(ctl, mem, adr, adr_type, val, mo);
381 st = StoreNode::make(_gvn, ctl, mem, ad
400 Node *mem = memory(adr_idx); local
528 Node* mem = _gvn.transform( new ProjNode(call, TypeFunc::Memory) ); local
574 Node* mem = _gvn.transform( new ProjNode(call, TypeFunc::Memory) ); local
[all...]
/openjdk10/jdk/src/java.desktop/share/native/libjavajpeg/
H A Djcomapi.c38 if (cinfo->mem == NULL)
45 (*cinfo->mem->free_pool) (cinfo, pool);
76 /* NB: mem pointer is NULL if memory mgr failed to initialize. */
77 if (cinfo->mem != NULL)
78 (*cinfo->mem->self_destruct) (cinfo);
79 cinfo->mem = NULL; /* be safe if jpeg_destroy is called twice */
95 (*cinfo->mem->alloc_small) (cinfo, JPOOL_PERMANENT, SIZEOF(JQUANT_TBL));
107 (*cinfo->mem->alloc_small) (cinfo, JPOOL_PERMANENT, SIZEOF(JHUFF_TBL));
H A Djmemmgr.c192 my_mem_ptr mem = (my_mem_ptr) cinfo->mem; local
201 pool_id, mem->total_space_allocated);
203 for (lhdr_ptr = mem->large_list[pool_id]; lhdr_ptr != NULL;
209 for (shdr_ptr = mem->small_list[pool_id]; shdr_ptr != NULL;
264 my_mem_ptr mem = (my_mem_ptr) cinfo->mem; local
282 hdr_ptr = mem->small_list[pool_id];
310 mem->total_space_allocated += min_request + slop;
316 mem
349 my_mem_ptr mem = (my_mem_ptr) cinfo->mem; local
403 my_mem_ptr mem = (my_mem_ptr) cinfo->mem; local
451 my_mem_ptr mem = (my_mem_ptr) cinfo->mem; local
532 my_mem_ptr mem = (my_mem_ptr) cinfo->mem; local
562 my_mem_ptr mem = (my_mem_ptr) cinfo->mem; local
590 my_mem_ptr mem = (my_mem_ptr) cinfo->mem; local
936 my_mem_ptr mem = (my_mem_ptr) cinfo->mem; local
1034 my_mem_ptr mem; local
[all...]
H A Djcinit.c69 (*cinfo->mem->realize_virt_arrays) ((j_common_ptr) cinfo);
/openjdk10/jdk/src/java.base/share/classes/java/lang/invoke/
H A DInfoFromMemberName.java91 Member mem = AccessController.doPrivileged(new PrivilegedAction<>() {
103 lookup.checkAccess(refKind, defc, convertToMemberName(refKind, mem));
107 return expected.cast(mem);
134 private static MemberName convertToMemberName(byte refKind, Member mem) throws IllegalAccessException { argument
135 if (mem instanceof Method) {
137 return new MemberName((Method) mem, wantSpecial);
138 } else if (mem instanceof Constructor) {
139 return new MemberName((Constructor) mem);
140 } else if (mem instanceof Field) {
142 return new MemberName((Field) mem, isSette
[all...]
/openjdk10/jdk/test/javax/swing/JTextArea/TextViewOOM/
H A DTextViewOOM.java66 long mem = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
67 System.err.println("Memory before creating the text: "+mem);
76 mem = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
77 System.err.println("Memory after creating the text: "+mem);
92 mem = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
93 System.err.println("Final memory after everything: " + mem);
/openjdk10/jdk/test/java/lang/invoke/
H A DRevealDirectTest.java210 Member mem = res.get(i);
211 if (!canBeReached(mem, cls) ||
212 res.indexOf(mem) != i ||
213 mem.isSynthetic() ||
214 (names != null && !names.contains(mem.getName()))
303 Member mem = i.next();
304 if (isCallerSensitive(mem) != cond)
310 static boolean isCallerSensitive(Member mem) { argument
311 if (!(mem instanceof AnnotatedElement)) return false;
312 AnnotatedElement ae = (AnnotatedElement) mem;
447 final Member mem; field in class:RevealDirectTest.UnreflectResult
449 UnreflectResult(MethodHandle mh, byte kind, Member mem, int var) argument
456 UnreflectResult(Throwable ex, byte kind, Member mem, int var) argument
470 name(Member mem) argument
474 type(Member mem, byte kind) argument
490 unreflectMember(Lookup lookup, Member mem, int variation) argument
498 unreflectMemberOrThrow(Lookup lookup, Member mem, int variation, byte[] refKind) argument
616 canBeReached(Member mem, Class<?> cls) argument
660 consistent(Member mem, Member mem2) argument
680 testWithMember(Member mem, Lookup lookup, Lookup revLookup, Lookup refLookup, int failureMode) argument
[all...]
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/regexp/joni/
H A DByteCodeMachine.java709 final int mem = code[ip++];
710 pushMemStart(mem, s);
714 final int mem = code[ip++];
715 repeatStk[memStartStk + mem] = s;
719 final int mem = code[ip++];
720 pushMemEnd(mem, s);
724 final int mem = code[ip++];
725 repeatStk[memEndStk + mem] = s;
729 final int mem = code[ip++];
730 final int stkp = getMemStart(mem); /* shoul
749 backrefInvalid(final int mem) argument
753 backrefStart(final int mem) argument
757 backrefEnd(final int mem) argument
761 backref(final int mem) argument
897 memIsInMemp(final int mem, final int num, final int mempp) argument
1089 repeatInc(final int mem, final int si) argument
1117 repeatIncNG(final int mem, final int si) argument
[all...]
/openjdk10/hotspot/src/os_cpu/linux_s390/vm/
H A Datomic_linux_s390.hpp104 " LA 3,%[mem] \n\t" // force data address into ARG2
105 // " LAA %[upd],%[inc],%[mem] \n\t" // increment and get old value
117 , [mem] "+Q" (*dest) // read/write, memory to be updated atomically
125 " LLGF %[old],%[mem] \n\t" // get old value
127 " CS %[old],%[upd],%[mem] \n\t" // try to xchg res with mem
132 , [mem] "+Q" (*dest) // read/write, memory to be updated atomically
155 " LA 3,%[mem] \n\t" // force data address into ARG2
156 // " LAAG %[upd],%[inc],%[mem] \n\t" // increment and get old value
168 , [mem] "
[all...]
/openjdk10/hotspot/test/runtime/NMT/
H A DMallocTrackingVerify.java67 MallocMemory mem = new MallocMemory(addr, size);
68 mallocd_memory.add(mem);
81 for (MallocMemory mem : mallocd_memory) {
82 wb.NMTFree(mem.addr());
H A DMallocStressTest.java189 MallocMemory mem = new MallocMemory(addr, size);
191 MallocStressTest.mallocd_memory.add(mem);
249 MallocMemory mem = free_list.get(index);
250 MallocStressTest.whiteBox.NMTFree(mem.addr());
263 MallocMemory mem = mallocd_memory.remove(n);
264 MallocStressTest.whiteBox.NMTFree(mem.addr());
265 MallocStressTest.mallocd_total -= mem.size();
/openjdk10/hotspot/test/compiler/escapeAnalysis/
H A DTestUnsafePutAddressNullObjMustNotEscape.java46 public static long mem; field in class:TestUnsafePutAddressNullObjMustNotEscape
56 mem = (usafe.allocateMemory(1024) + 8L) & ~7L;
82 // StoreP of null_obj to raw mem triggers assertion in escape analysis
83 usafe.putAddress(mem, 0L);
/openjdk10/hotspot/test/native/memory/
H A Dtest_metachunk.cpp70 MetaWord* mem = metachunk->allocate(alloc_size); local
73 EXPECT_EQ(MetachunkTest::initial_top(metachunk), mem); local
74 EXPECT_EQ(MetachunkTest::top(metachunk), mem + alloc_size);
/openjdk10/hotspot/test/compiler/intrinsics/bmi/
H A DExpr.java72 public int intExpr(MemI mem) { argument
96 public long longExpr(MemL mem) { argument
/openjdk10/jaxws/src/jdk.xml.bind/share/classes/com/sun/tools/internal/xjc/reader/xmlschema/bindinfo/
H A DBIEnum.java97 for( BIEnumMember mem : members.values() )
98 mem.setParent(p);
/openjdk10/jaxws/src/jdk.xml.bind/share/classes/com/sun/tools/internal/xjc/model/
H A DCEnumLeafInfo.java130 for( CEnumConstant mem : members )
131 mem.setParent(this);
227 for (CEnumConstant mem : members) {
228 if(mem.getLexicalValue().equals(literal.value))
229 return type.staticRef(mem.getName());
/openjdk10/langtools/src/jdk.jshell/share/classes/jdk/jshell/
H A DTreeDissector.java165 for (Tree mem : targetClass.getMembers()) {
166 if (mem.getKind() == Tree.Kind.METHOD) {
167 MethodTree mt = (MethodTree) mem;
181 for (Tree mem : targetClass.getMembers()) {
182 if (mem.getKind() == Tree.Kind.METHOD) {
183 MethodTree mt = (MethodTree) mem;
198 for (Tree mem : targetClass.getMembers()) {
199 if (mem.getKind() == Tree.Kind.VARIABLE) {
200 VariableTree vt = (VariableTree) mem;
/openjdk10/test/fmw/gtest/include/gtest/internal/
H A Dgtest-string.h46 # include <mem.h>

Completed in 248 milliseconds

12345