@@ -523,14 +523,14 @@ std::shared_ptr<ExecutableCode> LLVMCodeBuilder::finalize()
523
523
// If there's enough space, use the allocated memory
524
524
m_builder.SetInsertPoint (ifBlock);
525
525
llvm::Value *itemPtr = getListItem (listPtr, size, func);
526
- createInitialValueStore (arg.second , itemPtr, type);
526
+ createReusedValueStore (arg.second , itemPtr, type);
527
527
m_builder.CreateStore (m_builder.CreateAdd (size, m_builder.getInt64 (1 )), listPtr.sizePtr );
528
528
m_builder.CreateBr (nextBlock);
529
529
530
530
// Otherwise call appendEmpty()
531
531
m_builder.SetInsertPoint (elseBlock);
532
532
itemPtr = m_builder.CreateCall (resolve_list_append_empty (), listPtr.ptr );
533
- createInitialValueStore (arg.second , itemPtr, type);
533
+ createReusedValueStore (arg.second , itemPtr, type);
534
534
m_builder.CreateStore (m_builder.getInt1 (true ), listPtr.dataPtrDirty );
535
535
m_builder.CreateBr (nextBlock);
536
536
@@ -555,8 +555,8 @@ std::shared_ptr<ExecutableCode> LLVMCodeBuilder::finalize()
555
555
// Insert
556
556
llvm::Value *index = m_builder.CreateFPToUI (castValue (indexArg.second , indexArg.first ), m_builder.getInt64Ty ());
557
557
llvm::Value *itemPtr = m_builder.CreateCall (resolve_list_insert_empty (), { listPtr.ptr , index });
558
- createInitialValueStore (valueArg.second , itemPtr, type);
559
558
// TODO: Implement list type prediction
559
+ createReusedValueStore (valueArg.second , itemPtr, type);
560
560
break ;
561
561
}
562
562
0 commit comments