whoops

hercules_opt/src/pred.rs

@@ -152,9 +152,13 @@ pub fn predication(editor: &mut FunctionEditor, typing: &Vec<TypeID>) {
                 && editor.get_constant(cons).is_false()
             {
                 editor.edit(|mut edit| {
+                    let inv = edit.add_node(Node::Unary {
+                        op: UnaryOperator::Not,
+                        input: first,
+                    });
                     let node = edit.add_node(Node::Binary {
                         op: BinaryOperator::And,
-                        left: first,
+                        left: inv,
                         right: third,
                     });
                     edit = edit.replace_all_uses(id, node)?;
@@ -188,9 +192,13 @@ pub fn predication(editor: &mut FunctionEditor, typing: &Vec<TypeID>) {
                 && editor.get_constant(cons).is_true()
             {
                 editor.edit(|mut edit| {
+                    let inv = edit.add_node(Node::Unary {
+                        op: UnaryOperator::Not,
+                        input: first,
+                    });
                     let node = edit.add_node(Node::Binary {
                         op: BinaryOperator::Or,
-                        left: first,
+                        left: inv,
                         right: second,
                     });
                     edit = edit.replace_all_uses(id, node)?;

juno_samples/rodinia/bfs/src/bfs.jn

@@ -43,7 +43,7 @@ fn bfs<n, m: usize>(graph_nodes: Node[n], source: u32, edges: u32[m]) -> i32[n]
     }
 
     @loop2 for i in 0..n {
-      stop = stop && updated[i];
+      stop = stop && !updated[i];
       if updated[i] {
         mask[i] = true;
         visited[i] = true;