gctest3 java s i 8 after head new node heapsize 80 76
play

GCtest3.java.s: i=8, after head = new Node, heapsize = 80, 76 bytes - PowerPoint PPT Presentation

Jul 20, 2023 •366 likes •426 views

GCtest3.java.s: i=8, after head = new Node, heapsize = 80, 76 bytes used GC_last_ptrmap 0xA0 Lptrmap_Foo_testing 0x00 0x1C 0xA4 0x04 1 0xA8 0x08 1 0xAC 0x0C 1 0xB0 0x44 F 0 0x10 0x14 0xB4 Lptrmap_Foo_testing_array 0x14 1

  1. GCtest3.java.s: i=8, after head = new Node, heapsize = 80, 76 bytes used GC_last_ptrmap 0xA0 Lptrmap_Foo_testing 0x00 0x1C 0xA4 0x04 1 0xA8 0x08 1 0xAC 0x0C 1 0xB0 0x44 F 0 0x10 0x14 0xB4 Lptrmap_Foo_testing_array 0x14 1 0xB8 0x18 0 0xBC memory Lptrmap_main 0x1C 0 0xC0 direction 0x20 0 0xC4 0x24 0 0xC8 i = 8 0x28 0 0xCC 0x30 F 0 0x2C 0 0xD0 Ldesc_Node 0x30 101 0xD4 i: 8 0x34 2 $fp_testing 0xD8 gc_key: 1 i = 9 0x38 0x3C 0xDC $fp_main 0x30 F 0 Ldesc_Node_array 0x3C 0 0xE0 $ra_main 0x40 1 0xE4 retval: Ldesc_Foo 0x44 100 0xE8 this: i = 10 0x48 1 $fp_main 0xEC gc_key: 0 0x30 F 0 0x4C 0x50 Ldesc_Foo_array 0x50 1 0x54 0x58 i = 10 i = 9 i = 8 0x44 F 0 0x30 F 0 0x30 F 0 0x30 F 0

  2. GCtest3.java.s: i=7, at head = new Node, heapsize = 80, after mark GC_last_ptrmap 0xA0 Lptrmap_Foo_testing 0x00 0x1C 0xA4 0x04 1 0xA8 0x08 1 0xAC 0x0C 1 0xB0 0x44 T 0 0x10 0x14 0xB4 Lptrmap_Foo_testing_array 0x14 1 0xB8 0x18 0 0xBC memory Lptrmap_main 0x1C 0 0xC0 direction 0x20 0 0xC4 0x24 0 0xC8 i = 8 0x28 0 0xCC 0x30 T 0 0x2C 0 0xD0 Ldesc_Node 0x30 101 0xD4 i: 7 0x34 2 $fp_testing 0xD8 gc_key: 1 i = 9 0x38 0x3C 0xDC $fp_main 0x30 F 0 Ldesc_Node_array 0x3C 0 0xE0 $ra_main 0x40 1 0xE4 retval: Ldesc_Foo 0x44 100 0xE8 this: i = 10 0x48 1 $fp_main 0xEC gc_key: 0 0x30 F 0 0x4C 0x50 Ldesc_Foo_array 0x50 1 0x54 0x58 i = 10 i = 9 i = 8 0x44 T 0 0x30 F 0 0x30 F 0 0x30 T 0

  3. GCtest3.java.s: i=7, at head = new Node, heapsize = 80, after sweep GC_last_ptrmap 0xA0 Lptrmap_Foo_testing 0x00 0x1C 0xA4 0x04 1 0xA8 0x08 1 0xAC 0x0C 1 0xB0 0x44 F 0 0x10 0x14 0xB4 Lptrmap_Foo_testing_array 0x14 1 0xB8 0x18 0 0xBC memory Lptrmap_main 0x1C 0 0xC0 direction 0x20 0 0xC4 0x24 0 0xC8 i = 8 0x28 0 0xCC 0x30 F 0 0x2C 0 0xD0 Ldesc_Node 0x30 101 0xD4 i: 7 0x34 2 $fp_testing 0xD8 gc_key: 1 i = 9 0x38 0x3C 0xDC $fp_main 0x30 F 0 Ldesc_Node_array 0x3C 0 0xE0 $ra_main 0x40 1 0xE4 retval: Ldesc_Foo 0x44 100 0xE8 this: i = 10 0x48 1 $fp_main 0xEC gc_key: 0 0x30 F 0x... 0x4C 0x50 Ldesc_Foo_array 0x50 1 0x54 GC_freelist 0x58 i = 10 i = 9 i = 8 0x44 F 0 0x30 F 0x... 0x30 F 0 0x30 F 0

  4. GCtest3.java.s: i=7, after head = new Node, heapsize = 80 GC_last_ptrmap 0xA0 Lptrmap_Foo_testing 0x00 0x1C 0xA4 0x04 1 0xA8 0x08 1 0xAC 0x0C 1 0xB0 0x44 F 0 0x10 0x14 0xB4 Lptrmap_Foo_testing_array 0x14 1 0xB8 0x18 0 0xBC memory i = 7 Lptrmap_main 0x1C 0 0xC0 direction 0x30 F 0x... 0x20 0 0xC4 0x24 0 0xC8 i = 8 0x28 0 0xCC 0x30 F 0 0x2C 0 0xD0 Ldesc_Node 0x30 101 0xD4 i: 7 0x34 2 $fp_testing 0xD8 gc_key: 1 i = 9 0x38 0x3C 0xDC $fp_main 0x30 F 0 Ldesc_Node_array 0x3C 0 0xE0 $ra_main 0x40 1 0xE4 retval: Ldesc_Foo 0x44 100 0xE8 this: 0x48 1 $fp_main 0xEC gc_key: 0 0x4C 0x50 Ldesc_Foo_array 0x50 1 0x54 GC_freelist 0x58 i = 7 i = 9 i = 8 0x44 F 0 0x30 F 0 0x30 F 0 0x30 F 0

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

GCtest3.java.s: i=8, after head = new Node, heapsize = 80, 76 bytes used $fp_main 0xEC 0

GCtest3.java.s: i=8, after head = new Node, heapsize = 80, 76 bytes used $fp_main 0xEC 0

GCtest3.java.s: i=8, after head = new Node, heapsize = 80, 76 bytes used $fp_main 0xEC 0 Ldesc_Foo_array 0x58 1 0xE8 $ra_0 0x54 0x58 0xE4 $fp_0 0x50 1 $fp_testing 0xE0 1 Ldesc_Foo 0x4C 100 0xDC 0x4C F 0 0x48 1 0xD8

349 views • 5 slides
Java LinkedList Sept. 16, 2016 1 Doubly linked lists next prev element head Each node has

Java LinkedList Sept. 16, 2016 1 Doubly linked lists next prev element head Each node has

COMP 250 Lecture 5 doubly linked lists Java LinkedList Sept. 16, 2016 1 Doubly linked lists next prev element head Each node has a reference to the next node and to the previous node. tail 2 class DNode< E > { DNode< E

818 views • 25 slides
NODE.JS ANTI-PATTERNS and bad practices ADOPTION OF NODE.JS KEEPS GROWING CHAMPIONS Walmart,

NODE.JS ANTI-PATTERNS and bad practices ADOPTION OF NODE.JS KEEPS GROWING CHAMPIONS Walmart,

NODE.JS ANTI-PATTERNS and bad practices ADOPTION OF NODE.JS KEEPS GROWING CHAMPIONS Walmart, eBay, PayPal, Intuit, Netflix, LinkedIn, Microsoft, Uber, Yahoo ... JAVA NODE.JS .NET NODE.JS ... NODE.JS The clash of paradigms leads to

2.21k views • 193 slides
Using JavaFX Scene graphs Stage and scenes Core Node classes 1 History of Java FX Swing

Using JavaFX Scene graphs Stage and scenes Core Node classes 1 History of Java FX Swing

Using JavaFX Scene graphs Stage and scenes Core Node classes 1 History of Java FX Swing Java 6 (2007) Java 1.0 (1996) Java 1.1 (1998) Cross-platform Cross-platform Cross-platform Java implementation of Java wrappers for

403 views • 16 slides
Node.js on the JVM Node.js on the JVM JavaScript Evented I/O & more JavaScript Evented I/O

Node.js on the JVM Node.js on the JVM JavaScript Evented I/O & more JavaScript Evented I/O

Node.js on the JVM Node.js on the JVM JavaScript Evented I/O & more JavaScript Evented I/O & more for the Java Enterprise Ecosystem for the Java Enterprise Ecosystem Niko Kbler ( @dasniko ) {JavaScript} Training I'm to hire! I'm

677 views • 43 slides
Anonymity and Censorship Resistance Entry node Middle node Exit node Tor user Tor Node Tor

Anonymity and Censorship Resistance Entry node Middle node Exit node Tor user Tor Node Tor

Anonymity and Censorship Resistance Entry node Middle node Exit node Tor user Tor Node Tor Node Tor Node Tor Node Tor Node Tor Node Tor Node Tor Node Tor Node Tor Node Tor Node Tor Network Encrypted tunnel Web server Unencrypted

575 views • 36 slides
1 Agenda Quick'Intro' Node.js:'The'Beginning' What'Is'Node.js? Why'Use'Node.js?

1 Agenda Quick'Intro' Node.js:'The'Beginning' What'Is'Node.js? Why'Use'Node.js?

1 Agenda Quick'Intro' Node.js:'The'Beginning' What'Is'Node.js? Why'Use'Node.js? Installing'Node.js 2 Node.js is a platform for building applications What%makes%Node.js%so%special?

808 views • 33 slides
GridFTP redirection Currently, all GridFTP requests are streamed through the Head node

GridFTP redirection Currently, all GridFTP requests are streamed through the Head node

GridFTP redirection Currently, all GridFTP requests are streamed through the Head node Same for PUT This is obviously not ideal 1. GET /SFN 2. Fetch via RFIO Client Head Disk 3. Serve file GridFTP redirection Based on the

263 views • 13 slides
JAVA Java vs. Java Java Language Specification

JAVA Java vs. Java Java Language Specification

BR 10/05 JAVA Java vs. Java Java Language Specification http://java.sun.com/docs/books/jls/second_edition/html/j.title.doc.html Java programming language is compiled into java byte code Java Virtual Machine Specification

1.07k views • 44 slides
doubly linked lists Sept. 20/21, 2017 1 Singly linked list head tail 2 Doubly linked list

doubly linked lists Sept. 20/21, 2017 1 Singly linked list head tail 2 Doubly linked list

COMP 250 Lecture 6 doubly linked lists Sept. 20/21, 2017 1 Singly linked list head tail 2 Doubly linked list next prev element head Each node has a reference to the next node and to the previous node . tail 3 class DNode< E

516 views • 32 slides
Dev Lab: Node + Express What is Node? Node.js = JavaScript + File I/O + A Package Manager or:

Dev Lab: Node + Express What is Node? Node.js = JavaScript + File I/O + A Package Manager or:

Dev Lab: Node + Express What is Node? Node.js = JavaScript + File I/O + A Package Manager or: Node.js = JavaScript - A Web Browser Whats it like? Single-threaded Asynchronous & non-blocking Great for real-time applications

493 views • 24 slides
Node.js Primer Introduction Your Guides Richard Key @busyrich Head of Technical Training

Node.js Primer Introduction Your Guides Richard Key @busyrich Head of Technical Training

Node.js Primer Introduction Your Guides Richard Key @busyrich Head of Technical Training & Support Modulus >7yrs Web Development Experience Degrees in Game Design & Programming JavaScript Ninja Taron Foxworth @anaptfox

1.86k views • 126 slides
Warmup Exercise while (node != NULL) { ! Consider a binary tree if (node->m_data == value) {

Warmup Exercise while (node != NULL) { ! Consider a binary tree if (node->m_data == value) {

Warmup Exercise while (node != NULL) { ! Consider a binary tree if (node->m_data == value) { ! return node; ! Left & right pointers } else if (node->m_data < value){ ! Integer value keys CIS 371 node = node->m_right; !

558 views • 17 slides
Node.js Workshop Tom Hughes-Croucher Chief Evangelist / Node Tech Lead @sh1mmer tom@joyent.com

Node.js Workshop Tom Hughes-Croucher Chief Evangelist / Node Tech Lead @sh1mmer tom@joyent.com

Node.js Workshop Tom Hughes-Croucher Chief Evangelist / Node Tech Lead @sh1mmer tom@joyent.com Overview Introduction Why Server-Side JavaScript? What is Node? Using Node Understanding Node Node Ecosystem Programming

2.1k views • 173 slides
Multi-core in JVM/Java Concurrent programming in java Prior Java 5 Java 5 (2006)

Multi-core in JVM/Java Concurrent programming in java Prior Java 5 Java 5 (2006)

Multi-core in JVM/Java Concurrent programming in java Prior Java 5 Java 5 (2006) Java 7 (2010) Other topics Basic concurrency in Java Java Memory Model describes how threads interact through memory Single thread

812 views • 34 slides
Java Java Basics Java Program Statements Java Review Conditional statements

Java Java Basics Java Program Statements Java Review Conditional statements

Java Java Basics Java Program Statements Java Review Conditional statements Repetition statements (loops) Writing Classes in Java Selim Aksoy Class definitions Bilkent University Encapsulation and Java modifiers

346 views • 11 slides
Year 11 Information Evening Preparing for GCSEs Tuesday 10 October 2017 Y11 Information Evening

Year 11 Information Evening Preparing for GCSEs Tuesday 10 October 2017 Y11 Information Evening

Year 11 Information Evening Preparing for GCSEs Tuesday 10 October 2017 Y11 Information Evening Staff Students Kieran McGrane Jim Balkwill Grace, Lucy, Ellen & Sam (English) David Cockburn John Dolman Lauren, Francesca & Katrina

1.29k views • 72 slides
MDJ- 2018 MDS Consensus Criteria for ET (Deuschl et al.1998) Inclusion: Bilateral, largely

MDJ- 2018 MDS Consensus Criteria for ET (Deuschl et al.1998) Inclusion: Bilateral, largely

Tremor : an update Prof. Kailash Bhatia I Institute of Neurology, Queen Square, London MDJ- 2018 MDS Consensus Criteria for ET (Deuschl et al.1998) Inclusion: Bilateral, largely symmetrical postural or kinetic tremor involving hands and

880 views • 54 slides
Agenda: Construct Validity and the CEFR 1. Mediation according to the CEFR-Companion Volume 2.

Agenda: Construct Validity and the CEFR 1. Mediation according to the CEFR-Companion Volume 2.

Judith Mader, Rudi Camerer TEASIG WEBINAR 9 September, 2020 1 Agenda: Construct Validity and the CEFR 1. Mediation according to the CEFR-Companion Volume 2. Two constructs for testing mediation 3. Suggested criteria, item types and assessment

747 views • 22 slides
Natural Language Processing Classification III Dan Klein UC Berkeley 1 Classification 2

Natural Language Processing Classification III Dan Klein UC Berkeley 1 Classification 2

Natural Language Processing Classification III Dan Klein UC Berkeley 1 Classification 2 Linear Models: Perceptron The perceptron algorithm Iteratively processes the training set, reacting to training errors Can be thought of as

599 views • 41 slides
CS-184: Computer Graphics Lecture #7: BSP and AABB Trees Brandon Wang and Prof. James OBrien

CS-184: Computer Graphics Lecture #7: BSP and AABB Trees Brandon Wang and Prof. James OBrien

CS-184: Computer Graphics Lecture #7: BSP and AABB Trees Brandon Wang and Prof. James OBrien University of California, Berkeley V2013-S-07-1.0 1 Announcements Assignment 2: Soon... 2 2 Sunday, February 24, 13 BSP-Trees Binary Space

416 views • 19 slides
Learning algorithms using logic (inductive logic programming) input output cat c dog d bear

Learning algorithms using logic (inductive logic programming) input output cat c dog d bear

Learning algorithms using logic (inductive logic programming) input output cat c dog d bear ? input output cat c dog d bear b def f(a): return a[0] input output cat c dog d bear b def f(a): return head(a) input output cat c

923 views • 64 slides
A S P O Determination of necessary plant instrumentation, equipment and materials Joint

A S P O Determination of necessary plant instrumentation, equipment and materials Joint

A S P O Determination of necessary plant instrumentation, equipment and materials Joint IAEA-ICTP Essential Knowladge Workshop on Nuclear Power Plant Design Safety Updated IAEA Safety Standards 9- 20 October 2017 Presented by Ivica Basic

523 views • 34 slides
Stable Sets in Graphs with Bounded Odd Cycle Packing Number Tony Huynh (Monash) joint with

Stable Sets in Graphs with Bounded Odd Cycle Packing Number Tony Huynh (Monash) joint with

Stable Sets in Graphs with Bounded Odd Cycle Packing Number Tony Huynh (Monash) joint with Michele Conforti, Samuel Fiorini, Gwena el Joret, and Stefan Weltge Maximum Weight Stable Set Tony Huynh Stable Sets in Graphs with Bounded Odd Cycle

794 views • 77 slides

More recommend