From fa243a30308f8427ea186ee8ad67ad7625648458 Mon Sep 17 00:00:00 2001 From: vidush Date: Fri, 9 Feb 2024 09:53:38 -0500 Subject: [PATCH] fix --- gibbon-compiler/src/Gibbon/Passes/Cursorize.hs | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/gibbon-compiler/src/Gibbon/Passes/Cursorize.hs b/gibbon-compiler/src/Gibbon/Passes/Cursorize.hs index 652a38aa6..a371a8eb1 100644 --- a/gibbon-compiler/src/Gibbon/Passes/Cursorize.hs +++ b/gibbon-compiler/src/Gibbon/Passes/Cursorize.hs @@ -59,14 +59,14 @@ becomes Leaf -> let n = readScalar "Int" (lin + 1) wt = writeTag lout Leaf wi = writeInt wt (n+1) - in (lin + 9, (lout, wi)) + in (end_rin, end_rout, lin + 9, (lout, wi)) Node -> ... Every packed input becomes a read cursor. And it takes additional output cursors for every packed type in the return value. Every packed return value becomes a (Cursor,Cursor) i.e (start,end). And it returns additional end_of_read cursors if the functions "traverses" it's input (more details in the paper). - + -}