]>
Commit | Line | Data |
---|---|---|
0118833a AL |
1 | // -*- mode: cpp; mode: fold -*- |
2 | // Description /*{{{*/ | |
542ec555 | 3 | // $Id: acquire.h,v 1.16 1998/12/04 21:16:49 jgg Exp $ |
0118833a AL |
4 | /* ###################################################################### |
5 | ||
6 | Acquire - File Acquiration | |
7 | ||
8 | This module contians the Acquire system. It is responsible for bringing | |
9 | files into the local pathname space. It deals with URIs for files and | |
10 | URI handlers responsible for downloading or finding the URIs. | |
11 | ||
12 | Each file to download is represented by an Acquire::Item class subclassed | |
13 | into a specialization. The Item class can add itself to several URI | |
14 | acquire queues each prioritized by the download scheduler. When the | |
15 | system is run the proper URI handlers are spawned and the the acquire | |
16 | queues are fed into the handlers by the schedular until the queues are | |
17 | empty. This allows for an Item to be downloaded from an alternate source | |
18 | if the first try turns out to fail. It also alows concurrent downloading | |
19 | of multiple items from multiple sources as well as dynamic balancing | |
20 | of load between the sources. | |
21 | ||
22 | Schedualing of downloads is done on a first ask first get basis. This | |
23 | preserves the order of the download as much as possible. And means the | |
24 | fastest source will tend to process the largest number of files. | |
25 | ||
26 | Internal methods and queues for performing gzip decompression, | |
27 | md5sum hashing and file copying are provided to allow items to apply | |
28 | a number of transformations to the data files they are working with. | |
29 | ||
30 | ##################################################################### */ | |
31 | /*}}}*/ | |
32 | #ifndef PKGLIB_ACQUIRE_H | |
33 | #define PKGLIB_ACQUIRE_H | |
34 | ||
35 | #include <vector> | |
36 | #include <string> | |
37 | ||
38 | #ifdef __GNUG__ | |
39 | #pragma interface "apt-pkg/acquire.h" | |
40 | #endif | |
41 | ||
b98f2859 | 42 | #include <sys/time.h> |
0a8a80e5 AL |
43 | #include <unistd.h> |
44 | ||
8267fe24 | 45 | class pkgAcquireStatus; |
0118833a AL |
46 | class pkgAcquire |
47 | { | |
48 | public: | |
49 | ||
50 | class Item; | |
51 | class Queue; | |
52 | class Worker; | |
53 | struct MethodConfig; | |
8267fe24 | 54 | struct ItemDesc; |
0118833a | 55 | friend Item; |
0a8a80e5 | 56 | friend Queue; |
0118833a AL |
57 | |
58 | protected: | |
59 | ||
0a8a80e5 | 60 | // List of items to fetch |
0118833a | 61 | vector<Item *> Items; |
0a8a80e5 AL |
62 | |
63 | // List of active queues and fetched method configuration parameters | |
0118833a | 64 | Queue *Queues; |
0a8a80e5 | 65 | Worker *Workers; |
0118833a | 66 | MethodConfig *Configs; |
8267fe24 | 67 | pkgAcquireStatus *Log; |
0a8a80e5 | 68 | unsigned long ToFetch; |
8267fe24 | 69 | |
0a8a80e5 AL |
70 | // Configurable parameters for the schedular |
71 | enum {QueueHost,QueueAccess} QueueMode; | |
72 | bool Debug; | |
8b89e57f | 73 | bool Running; |
0118833a AL |
74 | |
75 | void Add(Item *Item); | |
76 | void Remove(Item *Item); | |
0a8a80e5 AL |
77 | void Add(Worker *Work); |
78 | void Remove(Worker *Work); | |
79 | ||
8267fe24 | 80 | void Enqueue(ItemDesc &Item); |
0a8a80e5 | 81 | void Dequeue(Item *Item); |
e331f6ed | 82 | string QueueName(string URI,MethodConfig const *&Config); |
0a8a80e5 AL |
83 | |
84 | // FDSET managers for derived classes | |
85 | void SetFds(int &Fd,fd_set *RSet,fd_set *WSet); | |
86 | void RunFds(fd_set *RSet,fd_set *WSet); | |
93bf083d AL |
87 | |
88 | // A queue calls this when it dequeues an item | |
89 | void Bump(); | |
0118833a AL |
90 | |
91 | public: | |
3b5421b4 | 92 | |
0a8a80e5 AL |
93 | MethodConfig *GetConfig(string Access); |
94 | bool Run(); | |
8267fe24 AL |
95 | |
96 | // Simple iteration mechanism | |
97 | inline Worker *WorkersBegin() {return Workers;}; | |
98 | Worker *WorkerStep(Worker *I); | |
99 | inline Item **ItemsBegin() {return Items.begin();}; | |
100 | inline Item **ItemsEnd() {return Items.end();}; | |
7a7fa5f0 AL |
101 | |
102 | // Cleans out the download dir | |
103 | bool Clean(string Dir); | |
a6568219 AL |
104 | |
105 | // Returns the size of the total download set | |
106 | unsigned long TotalNeeded(); | |
107 | unsigned long FetchNeeded(); | |
0118833a | 108 | |
8267fe24 | 109 | pkgAcquire(pkgAcquireStatus *Log = 0); |
0118833a AL |
110 | ~pkgAcquire(); |
111 | }; | |
112 | ||
8267fe24 AL |
113 | // Description of an Item+URI |
114 | struct pkgAcquire::ItemDesc | |
115 | { | |
116 | string URI; | |
117 | string Description; | |
118 | string ShortDesc; | |
119 | Item *Owner; | |
120 | }; | |
121 | ||
0118833a AL |
122 | // List of possible items queued for download. |
123 | class pkgAcquire::Queue | |
124 | { | |
125 | friend pkgAcquire; | |
126 | Queue *Next; | |
127 | ||
128 | protected: | |
3b5421b4 | 129 | |
0a8a80e5 | 130 | // Queued item |
8267fe24 | 131 | struct QItem : pkgAcquire::ItemDesc |
0a8a80e5 | 132 | { |
8267fe24 | 133 | QItem *Next; |
c88edf1d | 134 | pkgAcquire::Worker *Worker; |
8267fe24 AL |
135 | |
136 | void operator =(pkgAcquire::ItemDesc const &I) | |
137 | { | |
138 | URI = I.URI; | |
139 | Description = I.Description; | |
140 | ShortDesc = I.ShortDesc; | |
141 | Owner = I.Owner; | |
142 | }; | |
143 | }; | |
0a8a80e5 AL |
144 | |
145 | // Name of the queue | |
146 | string Name; | |
147 | ||
148 | // Items queued into this queue | |
149 | QItem *Items; | |
150 | pkgAcquire::Worker *Workers; | |
151 | pkgAcquire *Owner; | |
0118833a AL |
152 | |
153 | public: | |
0a8a80e5 AL |
154 | |
155 | // Put an item into this queue | |
8267fe24 | 156 | void Enqueue(ItemDesc &Item); |
bfd22fc0 | 157 | bool Dequeue(Item *Owner); |
0a8a80e5 | 158 | |
c88edf1d AL |
159 | // Find a Queued item |
160 | QItem *FindItem(string URI,pkgAcquire::Worker *Owner); | |
8267fe24 | 161 | bool ItemStart(QItem *Itm,unsigned long Size); |
c88edf1d AL |
162 | bool ItemDone(QItem *Itm); |
163 | ||
0a8a80e5 AL |
164 | bool Startup(); |
165 | bool Shutdown(); | |
93bf083d | 166 | bool Cycle(); |
be4401bf | 167 | void Bump(); |
0a8a80e5 AL |
168 | |
169 | Queue(string Name,pkgAcquire *Owner); | |
170 | ~Queue(); | |
0118833a AL |
171 | }; |
172 | ||
173 | // Configuration information from each method | |
174 | struct pkgAcquire::MethodConfig | |
175 | { | |
3b5421b4 AL |
176 | MethodConfig *Next; |
177 | ||
0118833a AL |
178 | string Access; |
179 | ||
180 | string Version; | |
181 | bool SingleInstance; | |
0a8a80e5 AL |
182 | bool Pipeline; |
183 | bool SendConfig; | |
e331f6ed AL |
184 | bool LocalOnly; |
185 | ||
0118833a | 186 | MethodConfig(); |
0118833a AL |
187 | }; |
188 | ||
8267fe24 AL |
189 | class pkgAcquireStatus |
190 | { | |
b98f2859 AL |
191 | protected: |
192 | ||
193 | struct timeval Time; | |
194 | struct timeval StartTime; | |
195 | unsigned long LastBytes; | |
196 | double CurrentCPS; | |
197 | unsigned long CurrentBytes; | |
198 | unsigned long TotalBytes; | |
199 | unsigned long FetchedBytes; | |
200 | unsigned long ElapsedTime; | |
d568ed2d AL |
201 | unsigned long TotalItems; |
202 | unsigned long CurrentItems; | |
b98f2859 | 203 | |
8267fe24 AL |
204 | public: |
205 | ||
206 | bool Update; | |
207 | ||
b98f2859 AL |
208 | // Called by items when they have finished a real download |
209 | virtual void Fetched(unsigned long Size,unsigned long ResumePoint); | |
210 | ||
542ec555 AL |
211 | // Called to change media |
212 | virtual bool MediaChange(string Media,string Drive) = 0; | |
213 | ||
8267fe24 AL |
214 | // Each of these is called by the workers when an event occures |
215 | virtual void IMSHit(pkgAcquire::ItemDesc &Itm) {}; | |
216 | virtual void Fetch(pkgAcquire::ItemDesc &Itm) {}; | |
217 | virtual void Done(pkgAcquire::ItemDesc &Itm) {}; | |
542ec555 | 218 | virtual void Fail(pkgAcquire::ItemDesc &Itm) {}; |
b98f2859 AL |
219 | virtual void Pulse(pkgAcquire *Owner); |
220 | virtual void Start(); | |
221 | virtual void Stop(); | |
a6568219 | 222 | |
b98f2859 | 223 | pkgAcquireStatus(); |
8267fe24 AL |
224 | virtual ~pkgAcquireStatus() {}; |
225 | }; | |
226 | ||
0118833a | 227 | #endif |