about summary refs log tree commit diff stats
path: root/subx/apps
diff options
context:
space:
mode:
Diffstat (limited to 'subx/apps')
-rw-r--r--subx/apps/assort.subx2
-rw-r--r--subx/apps/survey.subx1
2 files changed, 3 insertions, 0 deletions
diff --git a/subx/apps/assort.subx b/subx/apps/assort.subx
index 55f0c9a8..cb34120a 100644
--- a/subx/apps/assort.subx
+++ b/subx/apps/assort.subx
@@ -82,6 +82,7 @@ $main:end:
 
 # data structure:
 #   table: (address stream {string, (address stream byte)})     (8 bytes per row)
+# inefficient; uses sequential search for looking up segments by name
 
 convert:  # in : (address buffered-file), out : (address buffered-file) -> <void>
     # pseudocode:
@@ -433,6 +434,7 @@ test-convert:
     5d/pop-to-EBP
     c3/return
 
+# beware: leaks memory (one name per segment read)
 read-segments:  # in : (address buffered-file), table : (address stream {string, (address stream byte)})
     # pseudocode:
     #   var curr-segment = null
diff --git a/subx/apps/survey.subx b/subx/apps/survey.subx
index 579dfbad..cf13b0b2 100644
--- a/subx/apps/survey.subx
+++ b/subx/apps/survey.subx
@@ -106,6 +106,7 @@ $main:end:
 #   segments: (address stream {string, segment-info})     (16 bytes per row)
 #   label-info: {segment-name, segment-offset, address}   (12 bytes)
 #   labels: (address stream {string, label-info})         (16 bytes per row)
+# these are all inefficient; use sequential scans for lookups
 
 convert:  # in : (address buffered-file), out : (address buffered-file) -> <void>
     # pseudocode