2
1

libxml2-1-reallocation-failures.patch 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101
  1. From d7958b21e7f8c447a26bb2436f08402b2c308be4 Mon Sep 17 00:00:00 2001
  2. From: Chris Evans <scarybeasts@gmail.com>
  3. Date: Wed, 23 Mar 2011 00:13:06 +0000
  4. Subject: Fix some potential problems on reallocation failures
  5. The count was incremented before the allocation
  6. and not fixed in case of failure
  7. * xpath.c: corrects a few instances where the available count of some
  8. structure is updated before we know the allocation actually
  9. succeeds
  10. ---
  11. diff --git a/xpath.c b/xpath.c
  12. index 8b56189..608fe00 100644
  13. --- a/xpath.c
  14. +++ b/xpath.c
  15. @@ -3522,13 +3522,13 @@ xmlXPathNodeSetAddNs(xmlNodeSetPtr cur, xmlNodePtr node, xmlNsPtr ns) {
  16. } else if (cur->nodeNr == cur->nodeMax) {
  17. xmlNodePtr *temp;
  18. - cur->nodeMax *= 2;
  19. - temp = (xmlNodePtr *) xmlRealloc(cur->nodeTab, cur->nodeMax *
  20. + temp = (xmlNodePtr *) xmlRealloc(cur->nodeTab, cur->nodeMax * 2 *
  21. sizeof(xmlNodePtr));
  22. if (temp == NULL) {
  23. xmlXPathErrMemory(NULL, "growing nodeset\n");
  24. return;
  25. }
  26. + cur->nodeMax *= 2;
  27. cur->nodeTab = temp;
  28. }
  29. cur->nodeTab[cur->nodeNr++] = xmlXPathNodeSetDupNs(node, ns);
  30. @@ -3627,14 +3627,14 @@ xmlXPathNodeSetAddUnique(xmlNodeSetPtr cur, xmlNodePtr val) {
  31. } else if (cur->nodeNr == cur->nodeMax) {
  32. xmlNodePtr *temp;
  33. - cur->nodeMax *= 2;
  34. - temp = (xmlNodePtr *) xmlRealloc(cur->nodeTab, cur->nodeMax *
  35. + temp = (xmlNodePtr *) xmlRealloc(cur->nodeTab, cur->nodeMax * 2 *
  36. sizeof(xmlNodePtr));
  37. if (temp == NULL) {
  38. xmlXPathErrMemory(NULL, "growing nodeset\n");
  39. return;
  40. }
  41. cur->nodeTab = temp;
  42. + cur->nodeMax *= 2;
  43. }
  44. if (val->type == XML_NAMESPACE_DECL) {
  45. xmlNsPtr ns = (xmlNsPtr) val;
  46. @@ -3738,14 +3738,14 @@ xmlXPathNodeSetMerge(xmlNodeSetPtr val1, xmlNodeSetPtr val2) {
  47. } else if (val1->nodeNr == val1->nodeMax) {
  48. xmlNodePtr *temp;
  49. - val1->nodeMax *= 2;
  50. - temp = (xmlNodePtr *) xmlRealloc(val1->nodeTab, val1->nodeMax *
  51. + temp = (xmlNodePtr *) xmlRealloc(val1->nodeTab, val1->nodeMax * 2 *
  52. sizeof(xmlNodePtr));
  53. if (temp == NULL) {
  54. xmlXPathErrMemory(NULL, "merging nodeset\n");
  55. return(NULL);
  56. }
  57. val1->nodeTab = temp;
  58. + val1->nodeMax *= 2;
  59. }
  60. if (n2->type == XML_NAMESPACE_DECL) {
  61. xmlNsPtr ns = (xmlNsPtr) n2;
  62. @@ -3907,14 +3907,14 @@ xmlXPathNodeSetMergeAndClear(xmlNodeSetPtr set1, xmlNodeSetPtr set2,
  63. } else if (set1->nodeNr >= set1->nodeMax) {
  64. xmlNodePtr *temp;
  65. - set1->nodeMax *= 2;
  66. temp = (xmlNodePtr *) xmlRealloc(
  67. - set1->nodeTab, set1->nodeMax * sizeof(xmlNodePtr));
  68. + set1->nodeTab, set1->nodeMax * 2 * sizeof(xmlNodePtr));
  69. if (temp == NULL) {
  70. xmlXPathErrMemory(NULL, "merging nodeset\n");
  71. return(NULL);
  72. }
  73. set1->nodeTab = temp;
  74. + set1->nodeMax *= 2;
  75. }
  76. if (n2->type == XML_NAMESPACE_DECL) {
  77. xmlNsPtr ns = (xmlNsPtr) n2;
  78. @@ -3991,14 +3991,14 @@ xmlXPathNodeSetMergeAndClearNoDupls(xmlNodeSetPtr set1, xmlNodeSetPtr set2,
  79. } else if (set1->nodeNr >= set1->nodeMax) {
  80. xmlNodePtr *temp;
  81. - set1->nodeMax *= 2;
  82. temp = (xmlNodePtr *) xmlRealloc(
  83. - set1->nodeTab, set1->nodeMax * sizeof(xmlNodePtr));
  84. + set1->nodeTab, set1->nodeMax * 2 * sizeof(xmlNodePtr));
  85. if (temp == NULL) {
  86. xmlXPathErrMemory(NULL, "merging nodeset\n");
  87. return(NULL);
  88. }
  89. set1->nodeTab = temp;
  90. + set1->nodeMax *= 2;
  91. }
  92. set1->nodeTab[set1->nodeNr++] = n2;
  93. }
  94. --
  95. cgit v0.9