285 lines
9.1 KiB
JSON
285 lines
9.1 KiB
JSON
{
|
|
"$schema": "../../../tools/card-layouts/schemas/card-source.schema.json",
|
|
"schema": "esc-card-source.v1",
|
|
"card": {
|
|
"id": "mpabi-freertos-cpp-08-static-task",
|
|
"series": "freertos-cpp",
|
|
"series_title": "FreeRTOS C++",
|
|
"number": "08",
|
|
"count": "16",
|
|
"slug": "static-task",
|
|
"title": "DynamicTask, StaticTask, deletion and lifetime",
|
|
"topic": "Dynamiczne i statyczne storage taska oraz cleanup wykonywany przez idle",
|
|
"project": "Freestanding C++ nad FreeRTOS",
|
|
"subject": "Informatyka",
|
|
"level": "Rok 2 · L07 · RV32I/Hazard3",
|
|
"revision_date": "2026-07-19T00:00:00+02:00",
|
|
"status": "Gotowa",
|
|
"version": "v00.01",
|
|
"uuid": "d9e45417-a37f-487c-813f-fc7a44d4b4f3",
|
|
"author": "M. Pabiszczak",
|
|
"year": "2026"
|
|
},
|
|
"generated": {
|
|
"tex": "doc/generated/main.tex",
|
|
"html": "web/index.html",
|
|
"html_css": "web/style.css",
|
|
"html_tree_inspector": false,
|
|
"react_app": true
|
|
},
|
|
"template": "templates/karta-klasyczna.json",
|
|
"title_block": {
|
|
"category": "KARTA PRACY · INFORMATYKA",
|
|
"prepared_by": "M. Pabiszczak",
|
|
"prepared_on": "2026-07-19T00:00:00+02:00",
|
|
"title": "DynamicTask, StaticTask, deletion and lifetime",
|
|
"repository_url": "https://zsl-gitea.mpabi.pl/edu-freertos-cpp/lab-rv32i-freertos-static-task",
|
|
"revision": "v00.01",
|
|
"issued_on": "2026-07-19T00:00:00+02:00",
|
|
"series": "FREERTOS-CPP-08",
|
|
"document_type": "karta pracy",
|
|
"tool": "card-layouts",
|
|
"show_qr": false,
|
|
"show_repository_qr": false,
|
|
"height_cm": 2.6,
|
|
"repeat_on_every_page": true,
|
|
"replace_front_matter": true,
|
|
"url": "https://dce7fb9d-7b2f-5d49-96a2-3a30d3070b84.mpabi.pl/d9e45417-a37f-487c-813f-fc7a44d4b4f3"
|
|
},
|
|
"front_page_scope": {
|
|
"title": "Cel karty",
|
|
"content_tex": "Uczeń porównuje identyczne zachowanie taska tworzonego przez xTaskCreate i xTaskCreateStatic, przelicza stack words na bajty oraz mierzy moment odzyskania pamięci dynamicznej.",
|
|
"scope_title": "Zakres karty",
|
|
"scope_content_tex": "StaticTaskStorage pozostaje własnością callera. Self-delete kończy scheduling, lecz dynamiczny TCB i stack odzyskuje dopiero idle; wymuszone delete nie odwija ramek C++."
|
|
},
|
|
"side_margin_tree_layout": {
|
|
"columns": [
|
|
{
|
|
"id": "zawodowe",
|
|
"label": "TECH",
|
|
"side": "left",
|
|
"tree": "WE -> EK -> KW",
|
|
"description": "Adresy, jednostki i pomiar heap_4."
|
|
},
|
|
{
|
|
"id": "ogolne",
|
|
"label": "OG",
|
|
"side": "right",
|
|
"tree": "WE -> EN -> KW",
|
|
"description": "Lifecycle, ownership i granica delete."
|
|
}
|
|
]
|
|
},
|
|
"learning_effects": {
|
|
"K08.EN01": {
|
|
"bloom_level": "Analiza",
|
|
"label": "Lifecycle i ownership",
|
|
"text": "Uczeń rozróżnia logiczne zakończenie taska, cleanup przez idle i własność caller-supplied storage.",
|
|
"assessment_criteria": [
|
|
"K08.KW01"
|
|
]
|
|
},
|
|
"K08.EK01": {
|
|
"bloom_level": "Zastosowanie",
|
|
"label": "Storage i heap",
|
|
"text": "Uczeń przelicza stack words na bajty, klasyfikuje TCB/stack i mierzy dynamiczny koszt oraz zerowy delta statyczny.",
|
|
"assessment_criteria": [
|
|
"K08.KW01"
|
|
]
|
|
}
|
|
},
|
|
"assessment_criteria": {
|
|
"K08.KW01": {
|
|
"text": "Program kończy się PASS; dynamic cost wynosi 1136 B; static create nie zmienia heapu; 256 słów to 1024 B; adresy statyczne odpowiadają caller storage; przed idle pamięć jest zajęta, po idle free wraca do baseline.",
|
|
"learning_effects": [
|
|
"K08.EN01",
|
|
"K08.EK01"
|
|
]
|
|
}
|
|
},
|
|
"educational_requirements": {
|
|
"K08.WE01": {
|
|
"text": "Porównanie dynamicznej i statycznej polityki storage taska oraz pełnej osi życia delete.",
|
|
"label": "Storage taska i cleanup",
|
|
"learning_effects": [
|
|
"K08.EN01",
|
|
"K08.EK01"
|
|
],
|
|
"learning_tree": {
|
|
"schema": "we-learning-tree.v1",
|
|
"policy": "Każda teza o własności i odzyskaniu pamięci ma checkpoint oraz relację liczbową.",
|
|
"ogolne": [
|
|
{
|
|
"effect_ref": "K08.EN01",
|
|
"display": "EN LOCAL RTOS.LIFE.02",
|
|
"source": "LOCAL",
|
|
"official": "RTOS.LIFE",
|
|
"local": "02",
|
|
"kind": "EN",
|
|
"tree_id": "K08.WE01.OG.LOCAL.RTOS.LIFE.02",
|
|
"text": "Analizuje completion, self-delete, idle cleanup i caller ownership.",
|
|
"kw": [
|
|
{
|
|
"criterion_ref": "K08.KW01",
|
|
"display": "KW LOCAL RTOS.LIFE.02",
|
|
"source": "LOCAL",
|
|
"kind": "KW",
|
|
"official": "RTOS.LIFE",
|
|
"local": "02",
|
|
"text": "Wyjaśnia dwa momenty zakończenia i bezpieczny lifetime statycznego storage."
|
|
}
|
|
]
|
|
}
|
|
],
|
|
"zawodowe": [
|
|
{
|
|
"effect_ref": "K08.EK01",
|
|
"display": "EK LOCAL DBG.TASK.02",
|
|
"source": "LOCAL",
|
|
"official": "DBG.TASK",
|
|
"local": "02",
|
|
"kind": "EK",
|
|
"tree_id": "K08.WE01.TECH.LOCAL.DBG.TASK.02",
|
|
"text": "Mierzy heap delta i śledzi dynamiczne oraz statyczne adresy.",
|
|
"kw": [
|
|
{
|
|
"criterion_ref": "K08.KW01",
|
|
"display": "KW LOCAL DBG.TASK.02",
|
|
"source": "LOCAL",
|
|
"kind": "KW",
|
|
"official": "DBG.TASK",
|
|
"local": "02",
|
|
"text": "Dowodzi 1136 B kosztu, 0 B static delta, 256 słów równego 1024 B i exact reclaim."
|
|
}
|
|
]
|
|
}
|
|
]
|
|
}
|
|
}
|
|
},
|
|
"sections": [
|
|
{
|
|
"title": "Jednostki i dwa źródła storage",
|
|
"content_kind": "prose",
|
|
"content_tex": "Oblicz stack bytes, a potem porównaj kernel-allocated TCB/stack z osobnym StaticTaskStorage w .bss.",
|
|
"educational_requirement_refs": [
|
|
"K08.WE01"
|
|
],
|
|
"learning_effect_refs": [
|
|
"K08.EK01"
|
|
],
|
|
"assessment_criterion_refs": [
|
|
"K08.KW01"
|
|
],
|
|
"area_tree_refs": [
|
|
"K08.WE01.TECH.LOCAL.DBG.TASK.02"
|
|
],
|
|
"steps": [
|
|
{
|
|
"id": "S01",
|
|
"title": "Przelicz 256 StackType_t words na 1024 B.",
|
|
"tree_refs": [
|
|
"K08.WE01.TECH.LOCAL.DBG.TASK.02"
|
|
]
|
|
},
|
|
{
|
|
"id": "S02",
|
|
"title": "Sklasyfikuj dynamiczne adresy w ucHeap i statyczne w .bss.",
|
|
"tree_refs": [
|
|
"K08.WE01.TECH.LOCAL.DBG.TASK.02"
|
|
]
|
|
}
|
|
]
|
|
},
|
|
{
|
|
"title": "Dynamiczny koszt kontra static delta",
|
|
"content_kind": "prose",
|
|
"content_tex": "Zmierz baseline, create dynamic i create static. Wyjaśnij TCB oraz narzut heap_4 ponad 1024 B stacka.",
|
|
"educational_requirement_refs": [
|
|
"K08.WE01"
|
|
],
|
|
"learning_effect_refs": [
|
|
"K08.EK01"
|
|
],
|
|
"assessment_criterion_refs": [
|
|
"K08.KW01"
|
|
],
|
|
"area_tree_refs": [
|
|
"K08.WE01.TECH.LOCAL.DBG.TASK.02"
|
|
],
|
|
"steps": [
|
|
{
|
|
"id": "S03",
|
|
"title": "Wyznacz dynamic cost 1136 B i static delta 0 B.",
|
|
"tree_refs": [
|
|
"K08.WE01.TECH.LOCAL.DBG.TASK.02"
|
|
]
|
|
},
|
|
{
|
|
"id": "S04",
|
|
"title": "Potwierdź identyczny wynik workerów 500500.",
|
|
"tree_refs": [
|
|
"K08.WE01.TECH.LOCAL.DBG.TASK.02"
|
|
]
|
|
}
|
|
]
|
|
},
|
|
{
|
|
"title": "Self-delete i cleanup przez idle",
|
|
"content_kind": "prose",
|
|
"content_tex": "Porównaj free przed idle z baseline, pozwól idle wykonać cleanup i potwierdź exact recovery dynamicznego kosztu.",
|
|
"educational_requirement_refs": [
|
|
"K08.WE01"
|
|
],
|
|
"learning_effect_refs": [
|
|
"K08.EN01"
|
|
],
|
|
"assessment_criterion_refs": [
|
|
"K08.KW01"
|
|
],
|
|
"area_tree_refs": [
|
|
"K08.WE01.OG.LOCAL.RTOS.LIFE.02"
|
|
],
|
|
"steps": [
|
|
{
|
|
"id": "S05",
|
|
"title": "Rozdziel completion/null handle od memory reclaim.",
|
|
"tree_refs": [
|
|
"K08.WE01.OG.LOCAL.RTOS.LIFE.02"
|
|
]
|
|
},
|
|
{
|
|
"id": "S06",
|
|
"title": "Uzasadnij caller ownership i granicę destruktorów C++.",
|
|
"tree_refs": [
|
|
"K08.WE01.OG.LOCAL.RTOS.LIFE.02"
|
|
]
|
|
}
|
|
]
|
|
}
|
|
],
|
|
"tasks": {
|
|
"task01": {
|
|
"title": "Dwie polityki storage i pełna oś delete",
|
|
"uuid": "d9e45417-a37f-487c-813f-fc7a44d4b4f3",
|
|
"prompt_tex": "Uruchom dynamiczny i statyczny worker, sklasyfikuj storage, zmierz koszt create oraz udowodnij, że dynamiczną pamięć odzyskuje idle, a statyczna pozostaje u callera.",
|
|
"criterion": "Dynamic 1136 B; static 0 B; 256 words=1024 B; addresses in correct domains; both 500500; before-idle reduced; after-idle baseline; pass=1.",
|
|
"educational_requirement_refs": [
|
|
"K08.WE01"
|
|
],
|
|
"learning_effect_refs": [
|
|
"K08.EN01",
|
|
"K08.EK01"
|
|
],
|
|
"assessment_criterion_ref": "K08.KW01",
|
|
"links": {
|
|
"equations": [],
|
|
"figures": []
|
|
}
|
|
}
|
|
},
|
|
"tasks_order": [
|
|
"task01"
|
|
]
|
|
}
|