richter 00/06/25 22:00:27
Modified: . Tag: Embperl2 Embperl.xs epdom.c
Log:
Embperl 2 - memory management
Revision Changes Path
No revision
No revision
1.26.2.21 +2 -2 embperl/Embperl.xs
Index: Embperl.xs
===================================================================
RCS file: /home/cvs/embperl/Embperl.xs,v
retrieving revision 1.26.2.20
retrieving revision 1.26.2.21
diff -u -r1.26.2.20 -r1.26.2.21
--- Embperl.xs 2000/06/11 18:58:13 1.26.2.20
+++ Embperl.xs 2000/06/26 05:00:24 1.26.2.21
@@ -666,7 +666,7 @@
Node_replaceChildWithCDATA (DomTree_self(xDomTree), -1, xOldChild, s, l,
(pCurrReq -> nCurrEscMode & 3)== 3?1 + (pCurrReq -> nCurrEscMode & 4):pCurrReq ->
nCurrEscMode, nflgModified | nflgReturn) ;
pCurrReq -> nCurrEscMode = pCurrReq -> nEscMode ;
pCurrReq -> bEscModeSet = -1 ;
- SvREFCNT_inc (sText) ;
+ /*SvREFCNT_inc (sText) ;*/
ST(0) = sText ;
XSRETURN(1) ;
@@ -716,7 +716,7 @@
pCurrReq -> nCurrEscMode = pCurrReq -> nEscMode ;
pCurrReq -> bEscModeSet = -1 ;
SvREFCNT_inc (sText) ;
- ST(0) = sText ;
+ /* ST(0) = sText ;*/
XSRETURN(1) ;
1.1.2.39 +6 -4 embperl/Attic/epdom.c
Index: epdom.c
===================================================================
RCS file: /home/cvs/embperl/Attic/epdom.c,v
retrieving revision 1.1.2.38
retrieving revision 1.1.2.39
diff -u -r1.1.2.38 -r1.1.2.39
--- epdom.c 2000/06/25 19:49:11 1.1.2.38
+++ epdom.c 2000/06/26 05:00:25 1.1.2.39
@@ -461,7 +461,7 @@
while (numLookup-- > 0)
{
tNodePad * pPad = *pLookup ;
- if (pPad && pPad -> nType == ntypPad && xDomTree == pPad -> xDomTree)
+ if (pPad && pPad -> nType == (tNodeType)ntypPad && xDomTree == pPad ->
xDomTree)
{
dom_free (pPad) ;
}
@@ -546,7 +546,7 @@
(pDomTree -> pOrder)[n].xFromNode = xChild ;
(pDomTree -> pOrder)[n].xToNode = 0 ;
if (pCurrReq -> bDebug & dbgParse)
- lprintf (pCurrReq, "[%d]Checkpoint: Node=%d OrderIndex %d\n", pCurrReq ->
nPid, xChild, n) ;
+ lprintf (pCurrReq, "[%d]Checkpoint: Node=%d OrderIndex %d SVs=%d\n", pCurrReq
-> nPid, xChild, n, sv_count) ;
}
@@ -566,7 +566,7 @@
(pDomTree -> pOrder)[n].xFromNode = xFromNode ;
(pDomTree -> pOrder)[n].xToNode = xToNode ;
if (pCurrReq -> bDebug & dbgParse)
- lprintf (pCurrReq, "[%d]Checkpoint: Node=%d -> %d OrderIndex %d\n", pCurrReq
-> nPid, xFromNode, xToNode, n) ;
+ lprintf (pCurrReq, "[%d]Checkpoint: Node=%d -> %d OrderIndex %d SVs=%d\n",
pCurrReq -> nPid, xFromNode, xToNode, n, sv_count) ;
}
@@ -1284,6 +1284,7 @@
struct tNodeData * pOldChild = Node_self (pDomTree, xOldChild) ;
tNode xOrgChild = xOldChild ;
+ lprintf (pCurrReq, "rp--> SVs=%d %s\n", sv_count, sText) ;
xCheckpointCache[nCheckpointCache++] = xOldChild ;
@@ -1314,6 +1315,7 @@
pOldChild -> xChilds = 0 ;
pOldChild -> bFlags |= bFlags ;
+ lprintf (pCurrReq, "rp<-- SVs=%d\n", sv_count) ;
return xOldChild ;
}
@@ -1665,7 +1667,7 @@
if (pCurrReq -> bDebug & dbgParse)
- lprintf (r, "[%d]toString: Node=%d type=%d flags=%x text=>%s<= (#%d)\n", r
-> nPid, pNode -> xNdx, pNode -> nType, pNode -> bFlags, Ndx2String (pNode -> nText),
pNode -> nText) ;
+ lprintf (r, "[%d]toString: Node=%d type=%d flags=%x text=>%s<= (#%d)
SVs=%d\n", r -> nPid, pNode -> xNdx, pNode -> nType, pNode -> bFlags, Ndx2String
(pNode -> nText), pNode -> nText, sv_count) ;
if (pNode -> bFlags & nflgIgnore)
;
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
