[apt.git] / ftparchive / contents.cc

// -*- mode: cpp; mode: fold -*-
// Description								/*{{{*/
// $Id: contents.cc,v 1.4 2003/02/10 07:34:41 doogie Exp $
/* ######################################################################
   
   contents - Archive contents generator
   
   The GenContents class is a back end for an archive contents generator. 
   It takes a list of per-deb file name and merges it into a memory 
   database of all previous output. This database is stored as a set
   of binary trees linked across directories to form a tree of all files+dirs
   given to it. The tree will also be sorted as it is built up thus 
   removing the massive sort time overhead.
   
   By breaking all the pathnames into components and storing them 
   separately a space saving is realized by not duplicating the string
   over and over again. Ultimately this saving is sacrificed to storage of
   the tree structure itself but the tree structure yields a speed gain
   in the sorting and processing. Ultimately it takes about 5 seconds to
   do 141000 nodes and about 5 meg of ram.

   The tree looks something like:
   
     usr/
      / \             / libslang
   bin/ lib/ --> libc6
        /   \         \ libfoo
   games/  sbin/
   
   The ---> is the DirDown link
   
   
   ##################################################################### */
									/*}}}*/
// Include Files							/*{{{*/
#include <config.h>

#include <apt-pkg/debfile.h>
#include <apt-pkg/dirstream.h>
#include <apt-pkg/error.h>
#include <apt-pkg/fileutl.h>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include "contents.h"

#include <apti18n.h>
									/*}}}*/

// GenContents::~GenContents - Free allocated memory			/*{{{*/
// ---------------------------------------------------------------------
/* Since all our allocations are static big-block allocations all that is 
   needed is to free all of them. */
GenContents::~GenContents()
{
   while (BlockList != 0)
   {
      BigBlock *Old = BlockList;
      BlockList = Old->Next;
      free(Old->Block);
      delete Old;
   }   
}
									/*}}}*/
// GenContents::Mystrdup - Custom strdup				/*{{{*/
// ---------------------------------------------------------------------
/* This strdup also uses a large block allocator to eliminate glibc
   overhead */
char *GenContents::Mystrdup(const char *From)
{
   unsigned int Len = strlen(From) + 1;
   if (StrLeft <= Len)
   {
      StrLeft = 4096*10;
      StrPool = (char *)malloc(StrLeft);
      
      BigBlock *Block = new BigBlock;
      Block->Block = StrPool;
      Block->Next = BlockList;
      BlockList = Block;
   }
   
   memcpy(StrPool,From,Len);
   StrLeft -= Len;
   
   char *Res = StrPool;
   StrPool += Len;
   return Res;
}
									/*}}}*/
// GenContents::Node::operator new - Big block allocator		/*{{{*/
// ---------------------------------------------------------------------
/* This eliminates glibc's malloc overhead by allocating large blocks and
   having a continuous set of Nodes. This takes about 8 bytes off each nodes
   space needs. Freeing is not supported. */
void *GenContents::Node::operator new(size_t Amount,GenContents *Owner)
{
   if (Owner->NodeLeft == 0)
   {
      Owner->NodeLeft = 10000;
      Owner->NodePool = (Node *)malloc(Amount*Owner->NodeLeft);
      BigBlock *Block = new BigBlock;
      Block->Block = Owner->NodePool;
      Block->Next = Owner->BlockList;
      Owner->BlockList = Block;
   }
   
   Owner->NodeLeft--;
   return Owner->NodePool++;
}
									/*}}}*/
// GenContents::Grab - Grab a new node representing Name under Top	/*{{{*/
// ---------------------------------------------------------------------
/* This grabs a new node representing the pathname component Name under
   the node Top. The node is given the name Package. It is assumed that Name
   is inside of top. If a duplicate already entered name is found then 
   a note is made on the Dup list and the previous in-tree node is returned. */
GenContents::Node *GenContents::Grab(GenContents::Node *Top,const char *Name,
			const char *Package)
{
   /* We drop down to the next dir level each call. This simplifies
      the calling routine */
   if (Top->DirDown == 0)
   {
      Node *Item = new(this) Node;
      Item->Path = Mystrdup(Name);
      Item->Package = Package;
      Top->DirDown = Item;
      return Item;
   }
   Top = Top->DirDown;
   
   int Res;
   while (1)
   {
      Res = strcmp(Name,Top->Path);
      
      // Collision!
      if (Res == 0)
      {
	 // See if this the the same package (multi-version dup)
	 if (Top->Package == Package ||
	     strcasecmp(Top->Package,Package) == 0)
	    return Top;
	 
	 // Look for an already existing Dup
	 for (Node *I = Top->Dups; I != 0; I = I->Dups)
	    if (I->Package == Package || 
		strcasecmp(I->Package,Package) == 0)
	       return Top;

	 // Add the dup in
	 Node *Item = new(this) Node;
	 Item->Path = Top->Path;
	 Item->Package = Package;
	 Item->Dups = Top->Dups;
	 Top->Dups = Item;
	 return Top;
      }
      
      // Continue to traverse the tree
      if (Res < 0)
      {
	 if (Top->BTreeLeft == 0)
	    break;
	 Top = Top->BTreeLeft;
      }      
      else
      {
	 if (Top->BTreeRight == 0)
	    break;
	 Top = Top->BTreeRight;
      }      
   }

   // The item was not found in the tree
   Node *Item = new(this) Node;
   Item->Path = Mystrdup(Name);
   Item->Package = Package;
   
   // Link it into the tree
   if (Res < 0)
   {
      Item->BTreeLeft = Top->BTreeLeft;
      Top->BTreeLeft = Item;
   }
   else
   {
      Item->BTreeRight = Top->BTreeRight;
      Top->BTreeRight = Item;
   }
   
   return Item;
}
									/*}}}*/
// GenContents::Add - Add a path to the tree				/*{{{*/
// ---------------------------------------------------------------------
/* This takes a full pathname and adds it into the tree. We split the
   pathname into directory fragments adding each one as we go. Technically
   in output from tar this should result in hitting previous items. */
void GenContents::Add(const char *Dir,const char *Package)
{
   Node *Root = &this->Root;
   
   // Drop leading slashes
   while (*Dir == '/' && *Dir != 0)
      Dir++;
   
   // Run over the string and grab out each bit up to and including a /
   const char *Start = Dir;
   const char *I = Dir;
   while (*I != 0)
   {
      if (*I != '/' || I - Start <= 1)
      {
	 I++;
	 continue;
      }      
      I++;
      
      // Copy the path fragment over
      char Tmp[1024];
      strncpy(Tmp,Start,I - Start);
      Tmp[I - Start] = 0;
      
      // Grab a node for it
      Root = Grab(Root,Tmp,Package);
      
      Start = I;
   }
   
   // The final component if it does not have a trailing /
   if (I - Start >= 1)
      Grab(Root,Start,Package);
}
									/*}}}*/
// GenContents::WriteSpace - Write a given number of white space chars	/*{{{*/
// ---------------------------------------------------------------------
/* We mod 8 it and write tabs where possible. */
void GenContents::WriteSpace(std::string &out, size_t Current, size_t Target)
{
   if (Target <= Current)
      Target = Current + 1;

   /* Now we write tabs so long as the next tab stop would not pass
      the target */
   for (; (Current/8 + 1)*8 < Target; Current = (Current/8 + 1)*8)
      out.append("\t");

   // Fill the last bit with spaces
   for (; Current < Target; Current++)
      out.append(" ");
}
									/*}}}*/
// GenContents::Print - Display the tree				/*{{{*/
// ---------------------------------------------------------------------
/* This is the final result function. It takes the tree and recursively
   calls itself and runs over each section of the tree printing out
   the pathname and the hit packages. We use Buf to build the pathname
   summed over all the directory parents of this node. */
void GenContents::Print(FileFd &Out)
{
   char Buffer[1024];
   Buffer[0] = 0;
   DoPrint(Out,&Root,Buffer);
}
void GenContents::DoPrint(FileFd &Out,GenContents::Node *Top, char *Buf)
{
   if (Top == 0)
      return;

   // Go left
   DoPrint(Out,Top->BTreeLeft,Buf);

   // Print the current dir location and then descend to lower dirs
   char *OldEnd = Buf + strlen(Buf);
   if (Top->Path != 0)
   {
      strcat(Buf,Top->Path);

      // Do not show the item if it is a directory with dups
      if (Top->Path[strlen(Top->Path)-1] != '/' /*|| Top->Dups == 0*/)
      {
	 std::string out = Buf;
	 WriteSpace(out, out.length(), 60);
	 for (Node *I = Top; I != 0; I = I->Dups)
	 {
	    if (I != Top)
	       out.append(",");
	    out.append(I->Package);
	 }
         out.append("\n");
	 Out.Write(out.c_str(), out.length());
      }
   }

   // Go along the directory link
   DoPrint(Out,Top->DirDown,Buf);
   *OldEnd = 0;

   // Go right
   DoPrint(Out,Top->BTreeRight,Buf);  
}
									/*}}}*/
// ContentsExtract Constructor						/*{{{*/
ContentsExtract::ContentsExtract()
   : Data(0), MaxSize(0), CurSize(0)
{
}
									/*}}}*/
// ContentsExtract Destructor						/*{{{*/
ContentsExtract::~ContentsExtract()
{
   free(Data);
}
									/*}}}*/
// ContentsExtract::Read - Read the archive				/*{{{*/
// ---------------------------------------------------------------------
/* */
bool ContentsExtract::Read(debDebFile &Deb)
{
   Reset();
   return Deb.ExtractArchive(*this);
}
									/*}}}*/
// ContentsExtract::DoItem - Extract an item				/*{{{*/
// ---------------------------------------------------------------------
/* This just tacks the name onto the end of our memory buffer */
bool ContentsExtract::DoItem(Item &Itm, int &/*Fd*/)
{
   unsigned long Len = strlen(Itm.Name);
   
   // Strip leading ./'s
   if (Itm.Name[0] == '.' && Itm.Name[1] == '/')
   {
      // == './'
      if (Len == 2)
	 return true;
      
      Len -= 2;
      Itm.Name += 2;
   }

   // Allocate more storage for the string list
   if (CurSize + Len + 2 >= MaxSize || Data == 0)
   {
      if (MaxSize == 0)
	 MaxSize = 512*1024/2;
      char *NewData = (char *)realloc(Data,MaxSize*2);
      if (NewData == 0)
	 return _error->Error(_("realloc - Failed to allocate memory"));
      Data = NewData;
      MaxSize *= 2;
   }
   
   strcpy(Data+CurSize,Itm.Name);   
   CurSize += Len + 1;
   return true;
}
									/*}}}*/
// ContentsExtract::TakeContents - Load the contents data		/*{{{*/
// ---------------------------------------------------------------------
/* */
bool ContentsExtract::TakeContents(const void *NewData,unsigned long long Length)
{
   if (Length == 0)
   {
      CurSize = 0;
      return true;
   }

   // Allocate more storage for the string list
   if (Length + 2 >= MaxSize || Data == 0)
   {
      if (MaxSize == 0)
	 MaxSize = 512*1024/2;
      while (MaxSize*2 <= Length)
	 MaxSize *= 2;
      
      char *NewData = (char *)realloc(Data,MaxSize*2);
      if (NewData == 0)
	 return _error->Error(_("realloc - Failed to allocate memory"));
      Data = NewData;
      MaxSize *= 2;
   }
   memcpy(Data,NewData,Length);
   CurSize = Length;
   
   return Data[CurSize-1] == 0;
}
									/*}}}*/
// ContentsExtract::Add - Read the contents data into the sorter	/*{{{*/
// ---------------------------------------------------------------------
/* */
void ContentsExtract::Add(GenContents &Contents,std::string const &Package)
{
   const char *Start = Data;
   char *Pkg = Contents.Mystrdup(Package.c_str());
   for (const char *I = Data; I < Data + CurSize; I++)
   {
      if (*I == 0)
      {
	 Contents.Add(Start,Pkg);
	 Start = ++I;
      }      
   }   
}
									/*}}}*/
Commit	Line	Data
b2e465d6 AL	1	// -- mode: cpp; mode: fold --
b2e465d6 AL	2	// Description /{{{/
dc738e7a	3	// $Id: contents.cc,v 1.4 2003/02/10 07:34:41 doogie Exp $
b2e465d6 AL	4	/* ######################################################################
	5
	6	contents - Archive contents generator
	7
	8	The GenContents class is a back end for an archive contents generator.
	9	It takes a list of per-deb file name and merges it into a memory
	10	database of all previous output. This database is stored as a set
	11	of binary trees linked across directories to form a tree of all files+dirs
	12	given to it. The tree will also be sorted as it is built up thus
	13	removing the massive sort time overhead.
	14
	15	By breaking all the pathnames into components and storing them
c6474fb6	16	separately a space saving is realized by not duplicating the string
b2e465d6 AL	17	over and over again. Ultimately this saving is sacrificed to storage of
	18	the tree structure itself but the tree structure yields a speed gain
	19	in the sorting and processing. Ultimately it takes about 5 seconds to
	20	do 141000 nodes and about 5 meg of ram.
	21
	22	The tree looks something like:
	23
	24	usr/
	25	/ \ / libslang
	26	bin/ lib/ --> libc6
	27	/ \ \ libfoo
	28	games/ sbin/
	29
	30	The ---> is the DirDown link
	31
	32
	33	##################################################################### */
	34	/}}}/
	35	// Include Files /{{{/
ea542140	36	#include <config.h>
b2e465d6	37
dc7eb288	38	#include <apt-pkg/debfile.h>
453b82a3	39	#include <apt-pkg/dirstream.h>
b2e465d6	40	#include <apt-pkg/error.h>
88593886	41	#include <apt-pkg/fileutl.h>
a00a9b44	42
b2e465d6 AL	43	#include <stdio.h>
	44	#include <stdlib.h>
	45	#include <string.h>
ea542140	46
ea542140	47	#include "contents.h"
a00a9b44 DK	48
a00a9b44 DK	49	#include <apti18n.h>
b2e465d6 AL	50	/}}}/
	51
	52	// GenContents::~GenContents - Free allocated memory /{{{/
	53	// ---------------------------------------------------------------------
	54	/* Since all our allocations are static big-block allocations all that is
	55	needed is to free all of them. */
	56	GenContents::~GenContents()
	57	{
	58	while (BlockList != 0)
	59	{
	60	BigBlock *Old = BlockList;
	61	BlockList = Old->Next;
	62	free(Old->Block);
	63	delete Old;
	64	}
	65	}
	66	/}}}/
	67	// GenContents::Mystrdup - Custom strdup /{{{/
	68	// ---------------------------------------------------------------------
	69	/* This strdup also uses a large block allocator to eliminate glibc
	70	overhead */
	71	char GenContents::Mystrdup(const char From)
	72	{
	73	unsigned int Len = strlen(From) + 1;
	74	if (StrLeft <= Len)
	75	{
	76	StrLeft = 4096*10;
	77	StrPool = (char *)malloc(StrLeft);
	78
	79	BigBlock *Block = new BigBlock;
	80	Block->Block = StrPool;
	81	Block->Next = BlockList;
	82	BlockList = Block;
	83	}
	84
	85	memcpy(StrPool,From,Len);
	86	StrLeft -= Len;
	87
	88	char *Res = StrPool;
	89	StrPool += Len;
	90	return Res;
	91	}
	92	/}}}/
	93	// GenContents::Node::operator new - Big block allocator /{{{/
	94	// ---------------------------------------------------------------------
	95	/* This eliminates glibc's malloc overhead by allocating large blocks and
	96	having a continuous set of Nodes. This takes about 8 bytes off each nodes
	97	space needs. Freeing is not supported. */
	98	void GenContents::Node::operator new(size_t Amount,GenContents Owner)
	99	{
	100	if (Owner->NodeLeft == 0)
	101	{
	102	Owner->NodeLeft = 10000;
	103	Owner->NodePool = (Node )malloc(AmountOwner->NodeLeft);
	104	BigBlock *Block = new BigBlock;
	105	Block->Block = Owner->NodePool;
	106	Block->Next = Owner->BlockList;
	107	Owner->BlockList = Block;
	108	}
	109
	110	Owner->NodeLeft--;
	111	return Owner->NodePool++;
	112	}
	113	/}}}/
114	// GenContents::Grab - Grab a new node representing Name under Top /{{{/
115	// ---------------------------------------------------------------------
116	/* This grabs a new node representing the pathname component Name under
117	the node Top. The node is given the name Package. It is assumed that Name
118	is inside of top. If a duplicate already entered name is found then
119	a note is made on the Dup list and the previous in-tree node is returned. */
120	GenContents::Node GenContents::Grab(GenContents::Node Top,const char *Name,
121	const char *Package)
122	{
123	/* We drop down to the next dir level each call. This simplifies
124	the calling routine */
125	if (Top->DirDown == 0)
126	{
127	Node *Item = new(this) Node;
128	Item->Path = Mystrdup(Name);
129	Item->Package = Package;
130	Top->DirDown = Item;
131	return Item;
132	}
133	Top = Top->DirDown;
134
135	int Res;
136	while (1)
137	{
138	Res = strcmp(Name,Top->Path);
139
140	// Collision!
141	if (Res == 0)
142	{
143	// See if this the the same package (multi-version dup)
144	if (Top->Package == Package \|\|
145	strcasecmp(Top->Package,Package) == 0)
146	return Top;
147
148	// Look for an already existing Dup
149	for (Node *I = Top->Dups; I != 0; I = I->Dups)
150	if (I->Package == Package \|\|
151	strcasecmp(I->Package,Package) == 0)
152	return Top;
153
154	// Add the dup in
155	Node *Item = new(this) Node;
156	Item->Path = Top->Path;
157	Item->Package = Package;
158	Item->Dups = Top->Dups;
159	Top->Dups = Item;
160	return Top;
161	}
162
163	// Continue to traverse the tree
164	if (Res < 0)
165	{
166	if (Top->BTreeLeft == 0)
167	break;
168	Top = Top->BTreeLeft;
169	}
170	else
171	{
172	if (Top->BTreeRight == 0)
173	break;
174	Top = Top->BTreeRight;
175	}
176	}
177
178	// The item was not found in the tree
179	Node *Item = new(this) Node;
180	Item->Path = Mystrdup(Name);
181	Item->Package = Package;
182
183	// Link it into the tree
184	if (Res < 0)
185	{
186	Item->BTreeLeft = Top->BTreeLeft;
187	Top->BTreeLeft = Item;
188	}
189	else
190	{
191	Item->BTreeRight = Top->BTreeRight;
192	Top->BTreeRight = Item;
193	}
194
195	return Item;
196	}
197	/}}}/
198	// GenContents::Add - Add a path to the tree /{{{/
199	// ---------------------------------------------------------------------
200	/* This takes a full pathname and adds it into the tree. We split the
201	pathname into directory fragments adding each one as we go. Technically
202	in output from tar this should result in hitting previous items. */
203	void GenContents::Add(const char Dir,const char Package)
204	{
205	Node *Root = &this->Root;
206
207	// Drop leading slashes
208	while (Dir == '/' && Dir != 0)
209	Dir++;
210
211	// Run over the string and grab out each bit up to and including a /
212	const char *Start = Dir;
213	const char *I = Dir;
214	while (*I != 0)
215	{
216	if (*I != '/' \|\| I - Start <= 1)
217	{
218	I++;
219	continue;
220	}
221	I++;
222
223	// Copy the path fragment over
224	char Tmp[1024];
225	strncpy(Tmp,Start,I - Start);
226	Tmp[I - Start] = 0;
227
228	// Grab a node for it
229	Root = Grab(Root,Tmp,Package);
230
231	Start = I;
232	}
233
234	// The final component if it does not have a trailing /
235	if (I - Start >= 1)
62d8a765	236	Grab(Root,Start,Package);
b2e465d6 AL	237	}
	238	/}}}/
	239	// GenContents::WriteSpace - Write a given number of white space chars /{{{/
	240	// ---------------------------------------------------------------------
	241	/* We mod 8 it and write tabs where possible. */
88593886	242	void GenContents::WriteSpace(std::string &out, size_t Current, size_t Target)
b2e465d6 AL	243	{
	244	if (Target <= Current)
	245	Target = Current + 1;
88593886	246
b2e465d6 AL	247	/* Now we write tabs so long as the next tab stop would not pass
	248	the target */
	249	for (; (Current/8 + 1)8 < Target; Current = (Current/8 + 1)8)
88593886	250	out.append("\t");
b2e465d6 AL	251
	252	// Fill the last bit with spaces
	253	for (; Current < Target; Current++)
88593886	254	out.append(" ");
b2e465d6 AL	255	}
	256	/}}}/
	257	// GenContents::Print - Display the tree /{{{/
	258	// ---------------------------------------------------------------------
	259	/* This is the final result function. It takes the tree and recursively
	260	calls itself and runs over each section of the tree printing out
	261	the pathname and the hit packages. We use Buf to build the pathname
	262	summed over all the directory parents of this node. */
88593886	263	void GenContents::Print(FileFd &Out)
b2e465d6 AL	264	{
b2e465d6 AL	265	char Buffer[1024];
b41fd4ae	266	Buffer[0] = 0;
b2e465d6 AL	267	DoPrint(Out,&Root,Buffer);
b2e465d6 AL	268	}
88593886	269	void GenContents::DoPrint(FileFd &Out,GenContents::Node Top, char Buf)
b2e465d6 AL	270	{
	271	if (Top == 0)
	272	return;
	273
	274	// Go left
	275	DoPrint(Out,Top->BTreeLeft,Buf);
	276
	277	// Print the current dir location and then descend to lower dirs
	278	char *OldEnd = Buf + strlen(Buf);
	279	if (Top->Path != 0)
	280	{
	281	strcat(Buf,Top->Path);
88593886	282
b2e465d6 AL	283	// Do not show the item if it is a directory with dups
	284	if (Top->Path[strlen(Top->Path)-1] != '/' /\|\| Top->Dups == 0/)
	285	{
88593886 DK	286	std::string out = Buf;
88593886 DK	287	WriteSpace(out, out.length(), 60);
b2e465d6 AL	288	for (Node *I = Top; I != 0; I = I->Dups)
	289	{
	290	if (I != Top)
88593886 DK	291	out.append(",");
88593886 DK	292	out.append(I->Package);
b2e465d6	293	}
88593886 DK	294	out.append("\n");
	295	Out.Write(out.c_str(), out.length());
	296	}
	297	}
	298
b2e465d6 AL	299	// Go along the directory link
	300	DoPrint(Out,Top->DirDown,Buf);
	301	*OldEnd = 0;
88593886	302
b2e465d6 AL	303	// Go right
	304	DoPrint(Out,Top->BTreeRight,Buf);
	305	}
	306	/}}}/
bf3ad91f	307	// ContentsExtract Constructor /{{{/
21ea1dbb	308	ContentsExtract::ContentsExtract()
bf3ad91f	309	: Data(0), MaxSize(0), CurSize(0)
21ea1dbb	310	{
bf3ad91f	311	}
21ea1dbb	312	/}}}/
bf3ad91f	313	// ContentsExtract Destructor /{{{/
21ea1dbb MV	314	ContentsExtract::~ContentsExtract()
	315	{
	316	free(Data);
bf3ad91f	317	}
21ea1dbb	318	/}}}/
b2e465d6 AL	319	// ContentsExtract::Read - Read the archive /{{{/
	320	// ---------------------------------------------------------------------
	321	/* */
	322	bool ContentsExtract::Read(debDebFile &Deb)
	323	{
	324	Reset();
dc7eb288	325	return Deb.ExtractArchive(*this);
b2e465d6 AL	326	}
	327	/}}}/
	328	// ContentsExtract::DoItem - Extract an item /{{{/
	329	// ---------------------------------------------------------------------
	330	/* This just tacks the name onto the end of our memory buffer */
65512241	331	bool ContentsExtract::DoItem(Item &Itm, int &/Fd/)
b2e465d6 AL	332	{
	333	unsigned long Len = strlen(Itm.Name);
	334
	335	// Strip leading ./'s
	336	if (Itm.Name[0] == '.' && Itm.Name[1] == '/')
	337	{
	338	// == './'
	339	if (Len == 2)
	340	return true;
	341
	342	Len -= 2;
	343	Itm.Name += 2;
	344	}
	345
	346	// Allocate more storage for the string list
	347	if (CurSize + Len + 2 >= MaxSize \|\| Data == 0)
	348	{
	349	if (MaxSize == 0)
	350	MaxSize = 512*1024/2;
	351	char NewData = (char )realloc(Data,MaxSize*2);
	352	if (NewData == 0)
dc738e7a	353	return _error->Error(_("realloc - Failed to allocate memory"));
b2e465d6 AL	354	Data = NewData;
	355	MaxSize *= 2;
	356	}
	357
	358	strcpy(Data+CurSize,Itm.Name);
	359	CurSize += Len + 1;
	360	return true;
	361	}
	362	/}}}/
	363	// ContentsExtract::TakeContents - Load the contents data /{{{/
	364	// ---------------------------------------------------------------------
	365	/* */
650faab0	366	bool ContentsExtract::TakeContents(const void *NewData,unsigned long long Length)
b2e465d6 AL	367	{
	368	if (Length == 0)
	369	{
	370	CurSize = 0;
	371	return true;
	372	}
	373
	374	// Allocate more storage for the string list
	375	if (Length + 2 >= MaxSize \|\| Data == 0)
	376	{
	377	if (MaxSize == 0)
	378	MaxSize = 512*1024/2;
	379	while (MaxSize*2 <= Length)
	380	MaxSize *= 2;
	381
	382	char NewData = (char )realloc(Data,MaxSize*2);
	383	if (NewData == 0)
dc738e7a	384	return _error->Error(_("realloc - Failed to allocate memory"));
b2e465d6 AL	385	Data = NewData;
	386	MaxSize *= 2;
	387	}
	388	memcpy(Data,NewData,Length);
	389	CurSize = Length;
	390
	391	return Data[CurSize-1] == 0;
	392	}
	393	/}}}/
	394	// ContentsExtract::Add - Read the contents data into the sorter /{{{/
	395	// ---------------------------------------------------------------------
	396	/* */
8f3ba4e8	397	void ContentsExtract::Add(GenContents &Contents,std::string const &Package)
b2e465d6 AL	398	{
	399	const char *Start = Data;
	400	char *Pkg = Contents.Mystrdup(Package.c_str());
	401	for (const char *I = Data; I < Data + CurSize; I++)
	402	{
	403	if (*I == 0)
	404	{
	405	Contents.Add(Start,Pkg);
	406	Start = ++I;
	407	}
	408	}
	409	}
	410	/}}}/