Data Struct for Lang.processing

download Data Struct for Lang.processing

of 11

Transcript of Data Struct for Lang.processing

  • 8/2/2019 Data Struct for Lang.processing

    1/11

    Search data structures

    Allocation data structures-Stacks and Heaps

    Data structure for Language

    Processing

  • 8/2/2019 Data Struct for Lang.processing

    2/11

    Program Address Spacey Any program you run has, associated with it, some memory which is divided

    into:

    y Code Segment

    y Data Segment (Holds Global Data)

    y

    Stack (where the local variables and other temporary information is stored)y Heap

    Code Segment

    Data SegmentStack

    HeapThe Heap

    grows

    downwards

    T

    he Stackgrows upwards

  • 8/2/2019 Data Struct for Lang.processing

    3/11

    Answer: a Stack

    CS-3013 C-term 2008Stacks and Heaps3

    y Stack a linear data structure in which items are added and

    removed in last-in, first-out order.

    y Calling programy Push arguments & return address onto stack

    y After return,pop result off stack

  • 8/2/2019 Data Struct for Lang.processing

    4/11

    Data structure for language

    processing

    y Search data Structure

    y Allocation Data structure- stacks and Heaps

  • 8/2/2019 Data Struct for Lang.processing

    5/11

    Stack (continued)

    Stacks and Heaps5

    y Definition: context the region of the stack that provides theexecution environment of aparticularcall to a function

    y Implementationy Usually, a linear piece of memory and a stack pointer contained in a

    (designated) registery Occasionally, a linked list

    y Recursiony Stack discipline allows multiple contexts for the same function in the stack

    at the same time

  • 8/2/2019 Data Struct for Lang.processing

    6/11

    Stacks in Modern Systems

    Stacks and Heaps6

    y All modern programming languages require a stacky Fortran and Cobol did not (non-recursive)

    y All modern processors provide a designated stack pointer

    registery All modern process address spaces provide room for a stack

    y Able to grow to a large size

    y May grow upward or downward

  • 8/2/2019 Data Struct for Lang.processing

    7/11

    Process Address Space (Typical)

    Stacks and Heaps7

    0x00000000

    0xFFFFFFFF

    Virtual

    address space

    program code(text)

    static data

    heap

    (dynamically allocated)

    stack

    (dynamically allocated)

    PC

    SP

  • 8/2/2019 Data Struct for Lang.processing

    8/11

    Stacks in Multi-threaded Environments

    Stacks and Heaps8

    y Everythread requires its own stacky Separate from all other stacks

    y Each stack may grow separately

    y Address space must be big enough to accommodate stacks for all threads

  • 8/2/2019 Data Struct for Lang.processing

    9/11

    Stacks in Multi-threaded Address

    Space

    Stacks and Heaps9

    0x00000000

    0xFFFFFFFF

    Virtual

    address space

    code

    (text)

    static data

    heap

    thread 1 stack

    PC (T2)

    SP (T2)

    thread 2 stack

    thread 3 stack

    SP (T1)

    SP (T3)

    PC (T1)

    PC (T3)

    SP

    PC

  • 8/2/2019 Data Struct for Lang.processing

    10/11

    Heap

    Stacks and Heaps10

    y A place for allocating memory that is not part oflast-in, first-

    out discipline

    y I.e., dynamically allocated data structures that survive

    function callsy E.g., strings in C

    y new objects in C++, Java, etc.

  • 8/2/2019 Data Struct for Lang.processing

    11/11

    Process Address Space (Typical)

    Stacks and Heaps11

    0x00000000

    0xFFFFFFFF

    Virtual

    address space

    program code(text)

    static data

    heap

    (dynamically allocated)

    stack

    (dynamically allocated)

    PC

    SP


Lecture 10 Notes Linked Lists - Carnegie Mellon University · 2016. 4. 25. · Linked Lists L10.2 1 struct list_node { 2 elem data; 3 struct list_node* next; 4}; 5 typedef struct

Lecture 10 Notes Linked Lists - Carnegie Mellon University · 2016. 4. 25. · Linked Lists L10.2 1 struct list_node { 2 elem data; 3 struct list_node* next; 4}; 5 typedef struct

Structured Data Types array array union union struct struct class class.

Structured Data Types array array union union struct struct class class.

Applications of Structures (1A) · typedef struct aaa {int data; struct aaa *next;} ATYPE ; typedef struct aaa ATYPE; Global Structure Variable Declaration is possible before the

Applications of Structures (1A) · typedef struct aaa {int data; struct aaa *next;} ATYPE ; typedef struct aaa ATYPE; Global Structure Variable Declaration is possible before the

Datentypen: Enum, Array, Struct, Uniondocs.freitagsrunde.org/.../03_TUT2_enum-struct-union.pdf · 2013-09-10 · Ubungsaufgabe: Verwendung von struct Eine Handvoll Farben mit enum

Datentypen: Enum, Array, Struct, Uniondocs.freitagsrunde.org/.../03_TUT2_enum-struct-union.pdf · 2013-09-10 · Ubungsaufgabe: Verwendung von struct Eine Handvoll Farben mit enum

Sentence struct punct

Sentence struct punct

Struct – Struktur Data

Struct – Struktur Data

Lecture 26: Structures / struct s/. 2 Lecture Contents: t Basics of structs t Struct type definition ( struct reserved word) t Struct type definition.

Lecture 26: Structures / struct s/. 2 Lecture Contents: t Basics of structs t Struct type definition ( struct reserved word) t Struct type definition.

Data struct is_chapter1

Data struct is_chapter1

Storage struct

Storage struct

Structured Data Types struct class Structured Data Types array – homogeneous container collections of only one type struct – heterogeneous data type.

Structured Data Types struct class Structured Data Types array – homogeneous container collections of only one type struct – heterogeneous data type.

Data Struct

Data Struct

Control Struct

Control Struct

1 LIST PROCESSING. Senem Kumova Metin2 Self Referential Structures 1/4 struct node { int data; struct node *next; }; struct node a,b; ab a.data=1; b.data=2;

1 LIST PROCESSING. Senem Kumova Metin2 Self Referential Structures 1/4 struct node { int data; struct node *next; }; struct node a,b; ab a.data=1; b.data=2;

Data & Memory Management CS153: Compilers. Records in C: struct Point { int x; int y; }; struct Rect { struct Point ll,lr,ul,ur; }; struct Rect mkSquare(struct.

Data & Memory Management CS153: Compilers. Records in C: struct Point { int x; int y; }; struct Rect { struct Point ll,lr,ul,ur; }; struct Rect mkSquare(struct.

C Programming Lecture 11 : Structure. Data Type struct union enum typedef.

C Programming Lecture 11 : Structure. Data Type struct union enum typedef.

Irvine chapter 10 Structures and macros. A simple point struct used in next program COORD STRUCT X WORD ? Y WORD ? COORD ENDS;; struct requires end-struct.

Irvine chapter 10 Structures and macros. A simple point struct used in next program COORD STRUCT X WORD ? Y WORD ? COORD ENDS;; struct requires end-struct.

Tag Naming Conventions and Data Structures for · PDF fileTag Naming Conventions and Data Structures for Industrial PLCs Page 1 ... the PLC application, ... ST_Analog : STRUCT Process

Tag Naming Conventions and Data Structures for · PDF fileTag Naming Conventions and Data Structures for Industrial PLCs Page 1 ... the PLC application, ... ST_Analog : STRUCT Process

Module 4: Compound data: structures - SCS | UWcs115/coursenotes1/04-struct... · Module 4: Compound data: structures ... Using the design recipe for compound data Step 2: Template.

Module 4: Compound data: structures - SCS | UWcs115/coursenotes1/04-struct... · Module 4: Compound data: structures ... Using the design recipe for compound data Step 2: Template.

Class vs struct for Swift

Class vs struct for Swift

Ogr Struct.

Ogr Struct.