From 4fab388c7c923b8b8b6558468a064496b96d1559 Mon Sep 17 00:00:00 2001 From: "M. Pabiszczak" <2+mpabi@noreply.zsl-gitea.mpabi.pl> Date: Mon, 20 Jul 2026 08:36:41 +0200 Subject: [PATCH] meta: add interactive draft URL --- json/card_source.json | 305 ++++++++++++++++++++++++++++++++++++------ 1 file changed, 263 insertions(+), 42 deletions(-) diff --git a/json/card_source.json b/json/card_source.json index 5945af0..6d2c5a4 100644 --- a/json/card_source.json +++ b/json/card_source.json @@ -1,63 +1,284 @@ { - "$schema": "../../../tools/card-layouts/schemas/card-source.schema.json", "schema": "esc-card-source.v1", + "$schema": "../../../tools/card-layouts/schemas/card-source.schema.json", + "schema": "esc-card-source.v1", "card": { - "id": "mpabi-freertos-cpp-16-integration", "series": "freertos-cpp", "series_title": "FreeRTOS C++", "number": "16", "count": "16", "slug": "integration", - "title": "Integrated Real-time Application and Evidence", "topic": "Service graph, startup barrier, IRQ/timer inputs, queue pressure and memory/stack report", "project": "Freestanding C++ nad FreeRTOS", "subject": "Informatyka", - "level": "Rok 2 · L15 · RV32I/Hazard3", "revision_date": "2026-07-19T00:00:00+02:00", "status": "Gotowa", "version": "v00.01", - "uuid": "05b4f486-a27c-455d-a315-f4e51a4c66b3", "author": "M. Pabiszczak", "year": "2026" + "id": "mpabi-freertos-cpp-16-integration", + "series": "freertos-cpp", + "series_title": "FreeRTOS C++", + "number": "16", + "count": "16", + "slug": "integration", + "title": "Integrated Real-time Application and Evidence", + "topic": "Service graph, startup barrier, IRQ/timer inputs, queue pressure and memory/stack report", + "project": "Freestanding C++ nad FreeRTOS", + "subject": "Informatyka", + "level": "Rok 2 · L15 · RV32I/Hazard3", + "revision_date": "2026-07-19T00:00:00+02:00", + "status": "Gotowa", + "version": "v00.01", + "uuid": "05b4f486-a27c-455d-a315-f4e51a4c66b3", + "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 }, - "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": "Integrated Real-time Application and Evidence", "repository_url": "https://zsl-gitea.mpabi.pl/edu-freertos-cpp/lab-rv32i-freertos-integration", - "revision": "v00.01", "issued_on": "2026-07-19T00:00:00+02:00", "series": "FREERTOS-CPP-16", "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 + "category": "KARTA PRACY · INFORMATYKA", + "prepared_by": "M. Pabiszczak", + "prepared_on": "2026-07-19T00:00:00+02:00", + "title": "Integrated Real-time Application and Evidence", + "repository_url": "https://zsl-gitea.mpabi.pl/edu-freertos-cpp/lab-rv32i-freertos-integration", + "revision": "v00.01", + "issued_on": "2026-07-19T00:00:00+02:00", + "series": "FREERTOS-CPP-16", + "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/05b4f486-a27c-455d-a315-f4e51a4c66b3" }, "front_page_scope": { - "title": "Cel karty", "content_tex": "Uczeń składa istniejące wrappery w usługę end-to-end i przedstawia reprodukowalny raport trace, pressure, heap, stack HWM, ISR oraz timer.", - "scope_title": "Zakres karty", "scope_content_tex": "K16 nie dodaje nowego prymitywu. Każdy storage, priority, ownership, queue policy i failure path ma jawny invariant oraz mierzony dowód." + "title": "Cel karty", + "content_tex": "Uczeń składa istniejące wrappery w usługę end-to-end i przedstawia reprodukowalny raport trace, pressure, heap, stack HWM, ISR oraz timer.", + "scope_title": "Zakres karty", + "scope_content_tex": "K16 nie dodaje nowego prymitywu. Każdy storage, priority, ownership, queue policy i failure path ma jawny invariant oraz mierzony dowód." + }, + "side_margin_tree_layout": { + "columns": [ + { + "id": "zawodowe", + "label": "TECH", + "side": "left", + "tree": "WE -> EK -> KW", + "description": "End-to-end ticks, queue depths, heap delta, HWM i trace digest." + }, + { + "id": "ogolne", + "label": "OG", + "side": "right", + "tree": "WE -> EN -> KW", + "description": "Architecture justification, failure policy i reproducible evidence." + } + ] }, - "side_margin_tree_layout": {"columns": [ - {"id": "zawodowe", "label": "TECH", "side": "left", "tree": "WE -> EK -> KW", "description": "End-to-end ticks, queue depths, heap delta, HWM i trace digest."}, - {"id": "ogolne", "label": "OG", "side": "right", "tree": "WE -> EN -> KW", "description": "Architecture justification, failure policy i reproducible evidence."} - ]}, "learning_effects": { - "K16.EN01": {"bloom_level": "Ewaluacja", "label": "Uzasadnienie architektury", "text": "Uczeń uzasadnia service graph, ownership, priority, storage, pressure i failure behavior bez dodawania abstrakcji.", "assessment_criteria": ["K16.KW01"]}, - "K16.EK01": {"bloom_level": "Tworzenie", "label": "Integracja i raport", "text": "Uczeń integruje barrier, IRQ, timer, queues, tasks, GPIO i generuje odtwarzalny memory/stack/trace report.", "assessment_criteria": ["K16.KW01"]} + "K16.EN01": { + "bloom_level": "Ewaluacja", + "label": "Uzasadnienie architektury", + "text": "Uczeń uzasadnia service graph, ownership, priority, storage, pressure i failure behavior bez dodawania abstrakcji.", + "assessment_criteria": [ + "K16.KW01" + ] + }, + "K16.EK01": { + "bloom_level": "Tworzenie", + "label": "Integracja i raport", + "text": "Uczeń integruje barrier, IRQ, timer, queues, tasks, GPIO i generuje odtwarzalny memory/stack/trace report.", + "assessment_criteria": [ + "K16.KW01" + ] + } }, "assessment_criteria": { - "K16.KW01": {"text": "Program kończy się PASS; barrier=0x7, IRQ@1/wake/yield=1, timer@5/10, 3 reports/sum120, queue peaks2/2, seq4 drop i recovery, static delta0, dynamic queue128B, failure bez zmiany heapu, latency6, dodatnie HWM, trace digest c474ac09.", "learning_effects": ["K16.EN01", "K16.EK01"]} + "K16.KW01": { + "text": "Program kończy się PASS; barrier=0x7, IRQ@1/wake/yield=1, timer@5/10, 3 reports/sum120, queue peaks2/2, seq4 drop i recovery, static delta0, dynamic queue128B, failure bez zmiany heapu, latency6, dodatnie HWM, trace digest c474ac09.", + "learning_effects": [ + "K16.EN01", + "K16.EK01" + ] + } }, "educational_requirements": { "K16.WE01": { - "text": "Kompozycja pełnej aplikacji czasu rzeczywistego i pakietu dowodów bez nowego wrappera.", "label": "Integration evidence", "learning_effects": ["K16.EN01", "K16.EK01"], + "text": "Kompozycja pełnej aplikacji czasu rzeczywistego i pakietu dowodów bez nowego wrappera.", + "label": "Integration evidence", + "learning_effects": [ + "K16.EN01", + "K16.EK01" + ], "learning_tree": { - "schema": "we-learning-tree.v1", "policy": "Każda granica i polityka ma invariant, fault injection oraz odtwarzalny measurement.", - "ogolne": [{"effect_ref": "K16.EN01", "display": "EN LOCAL RTOS.ARCH.01", "source": "LOCAL", "official": "RTOS.ARCH", "local": "01", "kind": "EN", "tree_id": "K16.WE01.OG.LOCAL.RTOS.ARCH.01", "text": "Ewaluacja service graph, storage, priority, pressure i failure policy.", "kw": [{"criterion_ref": "K16.KW01", "display": "KW LOCAL RTOS.ARCH.01", "source": "LOCAL", "kind": "KW", "official": "RTOS.ARCH", "local": "01", "text": "Uzasadnia istniejące wrappery i nie dodaje warstwy bez nowego invariant."}]}], - "zawodowe": [{"effect_ref": "K16.EK01", "display": "EK LOCAL DBG.E2E.01", "source": "LOCAL", "official": "DBG.E2E", "local": "01", "kind": "EK", "tree_id": "K16.WE01.TECH.LOCAL.DBG.E2E.01", "text": "Mierzy timestamped pipeline, queue peaks, heap/minimum, HWM i digest.", "kw": [{"criterion_ref": "K16.KW01", "display": "KW LOCAL DBG.E2E.01", "source": "LOCAL", "kind": "KW", "official": "DBG.E2E", "local": "01", "text": "Odtwarza barrier/IRQ/timer/pressure/memory/stack report i PASS."}]}] + "schema": "we-learning-tree.v1", + "policy": "Każda granica i polityka ma invariant, fault injection oraz odtwarzalny measurement.", + "ogolne": [ + { + "effect_ref": "K16.EN01", + "display": "EN LOCAL RTOS.ARCH.01", + "source": "LOCAL", + "official": "RTOS.ARCH", + "local": "01", + "kind": "EN", + "tree_id": "K16.WE01.OG.LOCAL.RTOS.ARCH.01", + "text": "Ewaluacja service graph, storage, priority, pressure i failure policy.", + "kw": [ + { + "criterion_ref": "K16.KW01", + "display": "KW LOCAL RTOS.ARCH.01", + "source": "LOCAL", + "kind": "KW", + "official": "RTOS.ARCH", + "local": "01", + "text": "Uzasadnia istniejące wrappery i nie dodaje warstwy bez nowego invariant." + } + ] + } + ], + "zawodowe": [ + { + "effect_ref": "K16.EK01", + "display": "EK LOCAL DBG.E2E.01", + "source": "LOCAL", + "official": "DBG.E2E", + "local": "01", + "kind": "EK", + "tree_id": "K16.WE01.TECH.LOCAL.DBG.E2E.01", + "text": "Mierzy timestamped pipeline, queue peaks, heap/minimum, HWM i digest.", + "kw": [ + { + "criterion_ref": "K16.KW01", + "display": "KW LOCAL DBG.E2E.01", + "source": "LOCAL", + "kind": "KW", + "official": "DBG.E2E", + "local": "01", + "text": "Odtwarza barrier/IRQ/timer/pressure/memory/stack report i PASS." + } + ] + } + ] } } }, "sections": [ - {"title": "Inventory, barrier i wejścia", "content_kind": "prose", "content_tex": "Zinwentaryzuj static/dynamic storage, uruchom trzy StaticTask przez EventGroup barrier i zmierz realny IRQ oraz dwa timer callbacks.", "educational_requirement_refs": ["K16.WE01"], "learning_effect_refs": ["K16.EK01"], "assessment_criterion_refs": ["K16.KW01"], "area_tree_refs": ["K16.WE01.TECH.LOCAL.DBG.E2E.01"], "steps": [ - {"id": "S01", "title": "Pokaż static delta 0, dynamic queue 128 B i barrier 0x7.", "tree_refs": ["K16.WE01.TECH.LOCAL.DBG.E2E.01"]}, - {"id": "S02", "title": "Pokaż IRQ@1 oraz timer@5/10.", "tree_refs": ["K16.WE01.TECH.LOCAL.DBG.E2E.01"]} - ]}, - {"title": "Pipeline, pressure i recovery", "content_kind": "prose", "content_tex": "Przetwórz trzy sample do sumy 120, wypełnij obie queues do 2, odrzuć seq4 przez drop-newest i przepchnij end marker po zwolnieniu miejsca.", "educational_requirement_refs": ["K16.WE01"], "learning_effect_refs": ["K16.EK01"], "assessment_criterion_refs": ["K16.KW01"], "area_tree_refs": ["K16.WE01.TECH.LOCAL.DBG.E2E.01"], "steps": [ - {"id": "S03", "title": "Udowodnij produced/processed/reported 3 i sum 120.", "tree_refs": ["K16.WE01.TECH.LOCAL.DBG.E2E.01"]}, - {"id": "S04", "title": "Udowodnij peaks 2/2, drop 4 i recovery.", "tree_refs": ["K16.WE01.TECH.LOCAL.DBG.E2E.01"]} - ]}, - {"title": "Failure, stack i reproducible report", "content_kind": "prose", "content_tex": "Wymuś fallible allocation failure bez zmiany heapu, zapisz HWM tasków, latency 6 i 24-event digest c474ac09; uzasadnij każdą granicę.", "educational_requirement_refs": ["K16.WE01"], "learning_effect_refs": ["K16.EN01"], "assessment_criterion_refs": ["K16.KW01"], "area_tree_refs": ["K16.WE01.OG.LOCAL.RTOS.ARCH.01"], "steps": [ - {"id": "S05", "title": "Pokaż failure recovery, HWM i memory minimum.", "tree_refs": ["K16.WE01.OG.LOCAL.RTOS.ARCH.01"]}, - {"id": "S06", "title": "Odtwórz trace i uzasadnij architecture invariants.", "tree_refs": ["K16.WE01.OG.LOCAL.RTOS.ARCH.01"]} - ]} + { + "title": "Inventory, barrier i wejścia", + "content_kind": "prose", + "content_tex": "Zinwentaryzuj static/dynamic storage, uruchom trzy StaticTask przez EventGroup barrier i zmierz realny IRQ oraz dwa timer callbacks.", + "educational_requirement_refs": [ + "K16.WE01" + ], + "learning_effect_refs": [ + "K16.EK01" + ], + "assessment_criterion_refs": [ + "K16.KW01" + ], + "area_tree_refs": [ + "K16.WE01.TECH.LOCAL.DBG.E2E.01" + ], + "steps": [ + { + "id": "S01", + "title": "Pokaż static delta 0, dynamic queue 128 B i barrier 0x7.", + "tree_refs": [ + "K16.WE01.TECH.LOCAL.DBG.E2E.01" + ] + }, + { + "id": "S02", + "title": "Pokaż IRQ@1 oraz timer@5/10.", + "tree_refs": [ + "K16.WE01.TECH.LOCAL.DBG.E2E.01" + ] + } + ] + }, + { + "title": "Pipeline, pressure i recovery", + "content_kind": "prose", + "content_tex": "Przetwórz trzy sample do sumy 120, wypełnij obie queues do 2, odrzuć seq4 przez drop-newest i przepchnij end marker po zwolnieniu miejsca.", + "educational_requirement_refs": [ + "K16.WE01" + ], + "learning_effect_refs": [ + "K16.EK01" + ], + "assessment_criterion_refs": [ + "K16.KW01" + ], + "area_tree_refs": [ + "K16.WE01.TECH.LOCAL.DBG.E2E.01" + ], + "steps": [ + { + "id": "S03", + "title": "Udowodnij produced/processed/reported 3 i sum 120.", + "tree_refs": [ + "K16.WE01.TECH.LOCAL.DBG.E2E.01" + ] + }, + { + "id": "S04", + "title": "Udowodnij peaks 2/2, drop 4 i recovery.", + "tree_refs": [ + "K16.WE01.TECH.LOCAL.DBG.E2E.01" + ] + } + ] + }, + { + "title": "Failure, stack i reproducible report", + "content_kind": "prose", + "content_tex": "Wymuś fallible allocation failure bez zmiany heapu, zapisz HWM tasków, latency 6 i 24-event digest c474ac09; uzasadnij każdą granicę.", + "educational_requirement_refs": [ + "K16.WE01" + ], + "learning_effect_refs": [ + "K16.EN01" + ], + "assessment_criterion_refs": [ + "K16.KW01" + ], + "area_tree_refs": [ + "K16.WE01.OG.LOCAL.RTOS.ARCH.01" + ], + "steps": [ + { + "id": "S05", + "title": "Pokaż failure recovery, HWM i memory minimum.", + "tree_refs": [ + "K16.WE01.OG.LOCAL.RTOS.ARCH.01" + ] + }, + { + "id": "S06", + "title": "Odtwórz trace i uzasadnij architecture invariants.", + "tree_refs": [ + "K16.WE01.OG.LOCAL.RTOS.ARCH.01" + ] + } + ] + } ], - "tasks": {"task01": { - "title": "End-to-end RTOS service i evidence report", "uuid": "05b4f486-a27c-455d-a315-f4e51a4c66b3", - "prompt_tex": "Połącz wcześniejsze wrappery w pipeline barrier/IRQ/timer/queues/tasks/GPIO, wstrzyknij pressure i allocation failure, a następnie wygeneruj memory/stack/trace report.", - "criterion": "Barrier7; IRQ@1 wake/yield1; timer5/10; reports3/sum120; peaks2/2/drop4/recovery; static0/dynamic128/failure-safe; latency6/HWM>0/digest c474ac09; pass=1.", - "educational_requirement_refs": ["K16.WE01"], "learning_effect_refs": ["K16.EN01", "K16.EK01"], "assessment_criterion_ref": "K16.KW01", "links": {"equations": [], "figures": []} - }}, - "tasks_order": ["task01"] + "tasks": { + "task01": { + "title": "End-to-end RTOS service i evidence report", + "uuid": "05b4f486-a27c-455d-a315-f4e51a4c66b3", + "prompt_tex": "Połącz wcześniejsze wrappery w pipeline barrier/IRQ/timer/queues/tasks/GPIO, wstrzyknij pressure i allocation failure, a następnie wygeneruj memory/stack/trace report.", + "criterion": "Barrier7; IRQ@1 wake/yield1; timer5/10; reports3/sum120; peaks2/2/drop4/recovery; static0/dynamic128/failure-safe; latency6/HWM>0/digest c474ac09; pass=1.", + "educational_requirement_refs": [ + "K16.WE01" + ], + "learning_effect_refs": [ + "K16.EN01", + "K16.EK01" + ], + "assessment_criterion_ref": "K16.KW01", + "links": { + "equations": [], + "figures": [] + } + } + }, + "tasks_order": [ + "task01" + ] }