Home
last modified time | relevance | path

Searched refs:nextentry (Results 1 – 25 of 121) sorted by relevance

12345

/dports/graphics/intergif/igsrc/src/
H A Driemann.c56 nextentry = dict[ nextentry >> 16 ]; \
64 nextentry = dict[ nextentry >> 16 ]; \
80 UInt nextentry; in Riemann_Decompress() local
190 nextentry = dict[ nextentry >> 16 ]; in Riemann_Decompress()
196 nextentry = dict[ nextentry >> 16 ]; in Riemann_Decompress()
202 nextentry = dict[ nextentry >> 16 ]; in Riemann_Decompress()
208 nextentry = dict[ nextentry >> 16 ]; in Riemann_Decompress()
255 nextentry = dict[ nextentry >> 16 ]; in Riemann_Decompress()
261 nextentry = dict[ nextentry >> 16 ]; in Riemann_Decompress()
267 nextentry = dict[ nextentry >> 16 ]; in Riemann_Decompress()
[all …]
/dports/archivers/libpar2/libpar2-0.4/
H A Dverificationhashtable.h320 if (0 == nextentry) in FindMatch()
330 nextentry = VerificationHashEntry::Search(nextentry, hash); in FindMatch()
331 if (0 == nextentry) in FindMatch()
358 return nextentry; in FindMatch()
379 return nextentry; in FindMatch()
391 return nextentry; in FindMatch()
399 nextentry = 0; in FindMatch()
428 while (nextentry && (nextentry->IsSet() || in FindMatch()
433 nextentry = nextentry->Same(); in FindMatch()
437 if (nextentry == 0) in FindMatch()
[all …]
/dports/news/nget/nget-0.27.1/par2/
H A Dverificationhashtable.h320 if (0 == nextentry) in FindMatch()
330 nextentry = VerificationHashEntry::Search(nextentry, hash); in FindMatch()
331 if (0 == nextentry) in FindMatch()
358 return nextentry; in FindMatch()
379 return nextentry; in FindMatch()
391 return nextentry; in FindMatch()
399 nextentry = 0; in FindMatch()
428 while (nextentry && (nextentry->IsSet() || in FindMatch()
433 nextentry = nextentry->Same(); in FindMatch()
437 if (nextentry == 0) in FindMatch()
[all …]
/dports/news/nzbget/nzbget-21.1/lib/par2/
H A Dverificationhashtable.h323 if (0 == nextentry) in FindMatch()
333 nextentry = VerificationHashEntry::Search(nextentry, hash); in FindMatch()
334 if (0 == nextentry) in FindMatch()
361 return nextentry; in FindMatch()
382 return nextentry; in FindMatch()
394 return nextentry; in FindMatch()
402 nextentry = 0; in FindMatch()
431 while (nextentry && (nextentry->IsSet() || in FindMatch()
436 nextentry = nextentry->Same(); in FindMatch()
440 if (nextentry == 0) in FindMatch()
[all …]
/dports/archivers/par2cmdline/par2cmdline-0.8.1/src/
H A Dverificationhashtable.h345 if (0 == nextentry) in FindMatch()
355 nextentry = VerificationHashEntry::Search(nextentry, hash); in FindMatch()
356 if (0 == nextentry) in FindMatch()
360 if (nextentry->Same() == 0) in FindMatch()
383 return nextentry; in FindMatch()
404 return nextentry; in FindMatch()
416 return nextentry; in FindMatch()
424 nextentry = 0; in FindMatch()
453 while (nextentry && (nextentry->IsSet() || in FindMatch()
458 nextentry = nextentry->Same(); in FindMatch()
[all …]
/dports/games/shockolate/systemshock-0.8.2-43-ga9eb1b93/src/GameSrc/
H A Dobjects.c486 ObjHashElemID firstentry, nextentry; in ObjGetHashElem() local
514 entry = nextentry; in ObjGetHashElem()
526 objHashTable[nextentry].next = 0; in ObjGetHashElem()
540 ObjHashElemID nextentry; in ObjGetHashElemFromChain() local
554 entry = nextentry; in ObjGetHashElemFromChain()
566 objHashTable[nextentry].next = 0; in ObjGetHashElemFromChain()
579 ObjHashElemID entry, nextentry; in ObjDeleteHashElem() local
593 ObjFreeHashEntry(nextentry); in ObjDeleteHashElem()
599 while (nextentry != 0) { in ObjDeleteHashElem()
602 ObjFreeHashEntry(nextentry); in ObjDeleteHashElem()
[all …]
/dports/devel/rvm/rvm-1.20/rvm/
H A Drvm_debug.c153 if (ADDR_INVALID_OR_NULL(hdr->nextentry))
165 if ((hdr->nextentry == hdr->preventry) && (hdr->nextentry == hdr))
180 if (ADDR_INVALID_OR_NULL(hdr->nextentry))
189 entry = hdr->nextentry;
213 if (ADDR_INVALID_OR_NULL(entry->nextentry))
221 entry = entry->nextentry;
290 entry = hdr->nextentry;
306 entry = entry->nextentry;
1216 if (ADDR_INVALID_OR_NULL(hdr->nextentry))
1228 entry = hdr->nextentry;
[all …]
/dports/devel/rvm/rvm-1.20/tests/
H A Drvm_basher.c278 entry->nextentry = NULL;
298 victim = fromptr->nextentry;
303 if (victim->nextentry)
306 victim->preventry->nextentry = victim->nextentry;
307 victim->preventry = victim->nextentry = NULL;
325 victim->nextentry = toptr;
426 block = (block_t *)alloc_list.nextentry; in pick_random()
428 block = (block_t *)block->links.nextentry; in pick_random()
434 block = (block_t *)alloc_list.nextentry; in pick_random()
436 block = (block_t *)block->links.nextentry; in pick_random()
[all …]
/dports/net/unfs3/unfs3-0.9.22/
H A Dreaddir.c151 entry[i - 1].nextentry = &entry[i];
177 entry[i].nextentry = NULL;
184 entry[i - 1].nextentry = NULL;
/dports/games/jfsw/jfsw-c434002/jfmact/
H A Dscriplib.c103 while (section->entries->nextentry != section->entries) { in SCRIPT_FreeSection()
104 e = section->entries->nextentry; in SCRIPT_FreeSection()
127 (e)->nextentry = (e); \
179 for (e = section->entries; le != e; le=e,e=e->nextentry) in SCRIPT_EntryExists()
208 while (e2->nextentry != e2) e2=e2->nextentry; in SCRIPT_AddEntry()
209 e2->nextentry = e; in SCRIPT_AddEntry()
512 for (e = s->entries; le != e; le=e,e=e->nextentry) c++; in SCRIPT_NumberEntries()
527 for (e = s->entries; which>0 && le != e; le=e, e=e->nextentry, which--) ; in SCRIPT_Entry()
/dports/games/NBlood/NBlood-a1689a4/source/mact/src/
H A Dscriplib.cpp99 while (section->entries->nextentry != section->entries) in SCRIPT_FreeSection()
101 e = section->entries->nextentry; in SCRIPT_FreeSection()
129 (e)->nextentry = (e); \
184 for (e = section->entries; le != e; le=e,e=e->nextentry) in SCRIPT_EntryExists()
217 while (e2->nextentry != e2) e2=e2->nextentry; in SCRIPT_AddEntry()
218 e2->nextentry = e; in SCRIPT_AddEntry()
553 for (e = s->entries; le != e; le=e,e=e->nextentry) c++; in SCRIPT_NumberEntries()
568 for (e = s->entries; which>0 && le != e; le=e, e=e->nextentry, which--) ; in SCRIPT_Entry()
/dports/biology/treepuzzle/tree-puzzle-5.2/src/
H A Dconsensus.c175 uli nextentry; /* temp vaiable for split amount numbiparts */ in makenewsplitentries() local
188 nextentry = *in_numbiparts; in makenewsplitentries()
220 if (nextentry == maxbipartstmp) { /* reserve more memory */ in makenewsplitentries()
233 splitfreqstmp[2*nextentry] = 1; /* frequency */ in makenewsplitentries()
234 splitfreqstmp[2*nextentry+1] = nextentry; /* index for sorting */ in makenewsplitentries()
236 splitpatternstmp[nextentry*splitlength + i] = splitcomptemp[i]; in makenewsplitentries()
237 splitsizestmp[nextentry] = bpsize; in makenewsplitentries()
238 nextentry++; in makenewsplitentries()
243 *in_numbiparts = nextentry; in makenewsplitentries()
/dports/www/bluefish/bluefish-2.2.12/src/
H A Dundo_redo.c103 unreentry_t *nextentry = entry->next; in unregroup_destroy() local
105 entry = nextentry; in unregroup_destroy()
129 unreentry_t *entry, *nextentry; in unregroup_activate() local
139 nextentry = (unreentry_t *)bf_elist_prev((unreentry_t *)entry); in unregroup_activate()
141 nextentry = (unreentry_t *)bf_elist_next((unreentry_t *)entry); in unregroup_activate()
144 if (!noscroll && !nextentry) { in unregroup_activate()
158 entry = nextentry; in unregroup_activate()
/dports/emulators/vice/vice-3.5/src/
H A Dsocket.c245 static const int nextentry[] = { in get_new_pool_entry() local
250 next_free = nextentry[*PoolUsage & 0x0f]; in get_new_pool_entry()
252 next_free = nextentry[(*PoolUsage >> 4) & 0x0f]; in get_new_pool_entry()
256 next_free = nextentry[(*PoolUsage >> 8) & 0x0f]; in get_new_pool_entry()
260 next_free = nextentry[(*PoolUsage >> 12) & 0x0f]; in get_new_pool_entry()
/dports/emulators/libretro-vice/vice-libretro-5725415/vice/src/
H A Dsocket.c240 static int nextentry[] = { in get_new_pool_entry() local
245 next_free = nextentry[*PoolUsage & 0x0f]; in get_new_pool_entry()
247 next_free = nextentry[(*PoolUsage >> 4) & 0x0f]; in get_new_pool_entry()
251 next_free = nextentry[(*PoolUsage >> 8) & 0x0f]; in get_new_pool_entry()
255 next_free = nextentry[(*PoolUsage >> 12) & 0x0f]; in get_new_pool_entry()
/dports/databases/postgresql96-server/postgresql-9.6.24/src/backend/tsearch/
H A Ddict_thesaurus.c34 struct LexemeInfo *nextentry; member
99 ptr->entries->nextentry = NULL; in newLexeme()
331 newwrds[*nnw].entries->nextentry = NULL; in addCompiledLexeme()
482 ptrwrds->entries->nextentry = newwrds->entries; in compileTheLexeme()
712 newin[i] = newin[i]->nextentry; in findVariant()
732 newin[i] = newin[i]->nextentry; in findVariant()
754 newin[i] = newin[i]->nextentry; in findVariant()
/dports/databases/postgresql96-plpython/postgresql-9.6.24/src/backend/tsearch/
H A Ddict_thesaurus.c34 struct LexemeInfo *nextentry; member
99 ptr->entries->nextentry = NULL; in newLexeme()
331 newwrds[*nnw].entries->nextentry = NULL; in addCompiledLexeme()
482 ptrwrds->entries->nextentry = newwrds->entries; in compileTheLexeme()
712 newin[i] = newin[i]->nextentry; in findVariant()
732 newin[i] = newin[i]->nextentry; in findVariant()
754 newin[i] = newin[i]->nextentry; in findVariant()
/dports/databases/postgresql96-pltcl/postgresql-9.6.24/src/backend/tsearch/
H A Ddict_thesaurus.c34 struct LexemeInfo *nextentry; member
99 ptr->entries->nextentry = NULL; in newLexeme()
331 newwrds[*nnw].entries->nextentry = NULL; in addCompiledLexeme()
482 ptrwrds->entries->nextentry = newwrds->entries; in compileTheLexeme()
712 newin[i] = newin[i]->nextentry; in findVariant()
732 newin[i] = newin[i]->nextentry; in findVariant()
754 newin[i] = newin[i]->nextentry; in findVariant()
/dports/databases/postgresql10-plperl/postgresql-10.19/src/backend/tsearch/
H A Ddict_thesaurus.c35 struct LexemeInfo *nextentry; member
100 ptr->entries->nextentry = NULL; in newLexeme()
332 newwrds[*nnw].entries->nextentry = NULL; in addCompiledLexeme()
483 ptrwrds->entries->nextentry = newwrds->entries; in compileTheLexeme()
713 newin[i] = newin[i]->nextentry; in findVariant()
733 newin[i] = newin[i]->nextentry; in findVariant()
755 newin[i] = newin[i]->nextentry; in findVariant()
/dports/databases/postgresql11-client/postgresql-11.14/src/backend/tsearch/
H A Ddict_thesaurus.c35 struct LexemeInfo *nextentry; member
100 ptr->entries->nextentry = NULL; in newLexeme()
332 newwrds[*nnw].entries->nextentry = NULL; in addCompiledLexeme()
483 ptrwrds->entries->nextentry = newwrds->entries; in compileTheLexeme()
713 newin[i] = newin[i]->nextentry; in findVariant()
733 newin[i] = newin[i]->nextentry; in findVariant()
755 newin[i] = newin[i]->nextentry; in findVariant()
/dports/databases/postgresql10-pltcl/postgresql-10.19/src/backend/tsearch/
H A Ddict_thesaurus.c35 struct LexemeInfo *nextentry; member
100 ptr->entries->nextentry = NULL; in newLexeme()
332 newwrds[*nnw].entries->nextentry = NULL; in addCompiledLexeme()
483 ptrwrds->entries->nextentry = newwrds->entries; in compileTheLexeme()
713 newin[i] = newin[i]->nextentry; in findVariant()
733 newin[i] = newin[i]->nextentry; in findVariant()
755 newin[i] = newin[i]->nextentry; in findVariant()
/dports/databases/postgresql10-docs/postgresql-10.19/src/backend/tsearch/
H A Ddict_thesaurus.c35 struct LexemeInfo *nextentry; member
100 ptr->entries->nextentry = NULL; in newLexeme()
332 newwrds[*nnw].entries->nextentry = NULL; in addCompiledLexeme()
483 ptrwrds->entries->nextentry = newwrds->entries; in compileTheLexeme()
713 newin[i] = newin[i]->nextentry; in findVariant()
733 newin[i] = newin[i]->nextentry; in findVariant()
755 newin[i] = newin[i]->nextentry; in findVariant()
/dports/databases/postgresql10-contrib/postgresql-10.19/src/backend/tsearch/
H A Ddict_thesaurus.c35 struct LexemeInfo *nextentry; member
100 ptr->entries->nextentry = NULL; in newLexeme()
332 newwrds[*nnw].entries->nextentry = NULL; in addCompiledLexeme()
483 ptrwrds->entries->nextentry = newwrds->entries; in compileTheLexeme()
713 newin[i] = newin[i]->nextentry; in findVariant()
733 newin[i] = newin[i]->nextentry; in findVariant()
755 newin[i] = newin[i]->nextentry; in findVariant()
/dports/databases/postgresql10-client/postgresql-10.19/src/backend/tsearch/
H A Ddict_thesaurus.c35 struct LexemeInfo *nextentry; member
100 ptr->entries->nextentry = NULL; in newLexeme()
332 newwrds[*nnw].entries->nextentry = NULL; in addCompiledLexeme()
483 ptrwrds->entries->nextentry = newwrds->entries; in compileTheLexeme()
713 newin[i] = newin[i]->nextentry; in findVariant()
733 newin[i] = newin[i]->nextentry; in findVariant()
755 newin[i] = newin[i]->nextentry; in findVariant()
/dports/databases/postgresql10-plpython/postgresql-10.19/src/backend/tsearch/
H A Ddict_thesaurus.c35 struct LexemeInfo *nextentry; member
100 ptr->entries->nextentry = NULL; in newLexeme()
332 newwrds[*nnw].entries->nextentry = NULL; in addCompiledLexeme()
483 ptrwrds->entries->nextentry = newwrds->entries; in compileTheLexeme()
713 newin[i] = newin[i]->nextentry; in findVariant()
733 newin[i] = newin[i]->nextentry; in findVariant()
755 newin[i] = newin[i]->nextentry; in findVariant()

12345