Lines Matching refs:Entry
89 int Host, Host1, Host2, NameIsUnique, Entry, SubEnt;
122 p->RIOError.Entry = -1;
125 for (Entry = 0; Entry < TOTAL_MAP_ENTRIES; Entry++) {
126 MapP = &p->RIOConnectTable[Entry];
133 MapP->Name[5] = '0' + Entry / 10;
134 MapP->Name[6] = '0' + Entry % 10;
139 p->RIOError.Entry = Entry;
161 p->RIOError.Entry = Entry;
197 p->RIOError.Entry = Entry;
203 p->RIOError.Entry = Entry;
206 for (SubEnt = 0; SubEnt < Entry; SubEnt++) {
210 p->RIOError.Entry = Entry;
223 p->RIOError.Entry = Entry;
233 p->RIOError.Entry = Entry;
241 p->RIOError.Entry = Entry;
244 for (SubEnt = 0; SubEnt < Entry; SubEnt++) {
253 p->RIOError.Entry = Entry;
261 p->RIOError.Entry = Entry;
272 p->RIOError.Entry = Entry;
278 p->RIOError.Entry = Entry;
292 for (Entry = 0; Entry < MAX_RUP; Entry++) {
293 memset(&p->RIOHosts[Host].Mapping[Entry], 0, sizeof(struct Map));
301 for (Entry = 0; Entry < TOTAL_MAP_ENTRIES; Entry++) {
302 rio_dprintk(RIO_DEBUG_TABLE, "RIONewTable: Copy table for Host entry %d\n", Entry);
303 MapP = &p->RIOConnectTable[Entry];
349 for (Entry = 0; Entry < TOTAL_MAP_ENTRIES; Entry++) {
350 p->RIOSavedTable[Entry] = p->RIOConnectTable[Entry];
358 for (Entry = 0; Entry < MAX_RUP; Entry++) {
360 p->RIOHosts[Host].Mapping[Entry].Topology[SubEnt].Unit = ROUTE_DISCONNECT;
361 p->RIOHosts[Host].Mapping[Entry].Topology[SubEnt].Link = NO_LINK;
485 rio_dprintk(RIO_DEBUG_TABLE, "Entry is in use and cannot be deleted!\n");
553 rio_dprintk(RIO_DEBUG_TABLE, "Entry nulled.\n");