Use Prolog string buffer marks.

Speaking of unclear documentation, it is not obvious whether it is
necessary for programs calling into Prolog to manually mark and
release strings. I suppose that it should be, if the same logic that
applies to terms apply to strings.

On the other hand, the stack in which the strings are stored belongs
to Prolog, and there is nothing that would prevent Prolog from
cleaning up the strings when called at a later time. I am not sure.
But better safe than sorry, I guess.

The Mark class acts like the Frame class. The constructor and
destructor are equivalent to the PL_STRINGS_MARK and
PL_STRINGS_RELEASE macros.

Unlike for 34c3280, I did not notice any differences in memory usage
after this change. Perhaps that is because it has no effect; perhaps
it is because Prolog's stack is very big.

1 files changed, 3 insertions, 0 deletions

diff --git a/c/episodelistview.cpp b/c/episodelistview.cpp
index d3abf74..d43c3a7 100644
--- a/c/episodelistview.cpp
+++ b/c/episodelistview.cpp
@@ -284,6 +284,7 @@ void EpisodeListView::Update()
 	if (!Pl("episode_data","episode_count",&cEp)) return;
 
 	for (iEp = 1, iItem = 0; iEp <= cEp; iEp++) {
+		Mark m;
 		extern char g_szLimitScreenwriter[];
 		extern int g_bViewTVOriginal, g_bViewWatched;
 
@@ -355,6 +356,7 @@ void EpisodeListView::Update()
 /* Update episode name and rating. */
 void EpisodeListView::UpdateItem(const LVITEM* const pLvi)
 {
+	Mark m;
 	TCHAR* tszName;
 	int iRating;
 	static TCHAR tszRating[3];
@@ -427,6 +429,7 @@ int CALLBACK ElvSort(const LPARAM iItem1, const LPARAM iItem2, const LPARAM lExt
 	    }
 	case ELVSITITLE:
 	    {
+		Mark m;
 		char* sz1,* sz2;
 		int cch, cch1, cch2;
 		if (!Pl("episode_data","episode_title",lvi1.lParam,&sz1))