Searched defs:next (Results 151 - 175 of 294) sorted by relevance

1234567891011>>

/forgerock/opendj-v3/opendj-server-legacy/src/test/java/org/opends/server/backends/pluggable/
H A DOnDiskMergeImporterTest.java360 while (source.next())
424 public boolean next() method in class:OnDiskMergeImporterTest.IteratorCursorAdapter
428 entry = it.next();
/forgerock/web-agents-v4/source/
H A Dnaming_valid.c31 struct url_valid_table *next; member in struct:url_valid_table
45 delete_url_validation_table(&t->next);
93 e->next = NULL;
273 /* find next valid index value to fail-over to */
H A Dpolicy_xml.c77 t->next = NULL;
96 action_decision->next = NULL;
363 delete_am_action_decision_list(&t->next);
373 delete_am_policy_result_list(&t->next);
394 struct am_policy_result *next = NULL; local
399 even_tail->next = iterator;
406 odd_tail->next = iterator;
410 next = iterator->next;
411 iterator->next
[all...]
H A Dutility.h102 struct am_cookie *next; member in struct:am_cookie
108 struct am_action_decision *next; member in struct:am_action_decision
121 struct am_policy_result *next; member in struct:am_policy_result
H A Dshared.c47 int prev, next; member in struct:freelist
79 for (i = pool->freelist_hdrs[hdr_offset]; i != FREELIST_END; i = FREELIST_FROM_CHUNK(AM_GET_POINTER(pool, i))->next) {
105 for (i = pool->freelist_hdrs[hdr_offset]; i != FREELIST_END; i = FREELIST_FROM_CHUNK(AM_GET_POINTER(pool, i))->next) {
108 fprintf(stdout, "\tchunk %u [%lu] (%d,%d)\n", i, (unsigned long)chunk->size, fl->prev, fl->next);
128 fl->next = pool->freelist_hdrs[hdr_offset];
129 if (fl->next != FREELIST_END) {
130 FREELIST_FROM_CHUNK(AM_GET_POINTER(pool, fl->next))->prev = AM_GET_OFFSET(pool, chunk);
149 FREELIST_FROM_CHUNK(AM_GET_POINTER(pool, fl->prev))->next = fl->next;
151 pool->freelist_hdrs[hdr_offset] = fl->next;
[all...]
H A Dthread.c56 struct am_threadpool_work *next; member in struct:am_threadpool_work
76 struct am_threadpool_active *next; member in struct:am_threadpool::am_threadpool_active
94 worker_pool->head = work->next;
146 for (b = &pool->active; (a = *b) != NULL; b = &a->next) {
148 *b = a->next;
228 pool->head = cur->next;
232 active.next = pool->active;
383 cur->next = NULL;
390 worker_pool->tail->next = cur;
428 for (active = worker_pool->active; active != NULL; active = active->next) {
[all...]
/forgerock/web-agents-v4/zlib/
H A Dinflate.c38 * - Use local copies of stream next and avail values, as well as local bit
122 state->lencode = state->distcode = state->next = state->codes;
272 static code *next; local
280 next = fixed;
281 lenfix = next;
283 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
288 distfix = next;
290 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
463 next = strm->next_in; \
474 strm->next_in = next; \
610 z_const unsigned char FAR *next; /* next input */ local
[all...]
H A Dinflate.h115 code FAR *next; /* next available space in codes[] */ member in struct:inflate_state
H A Ddeflate.c69 finish_started, /* finish started, need only more output at next deflate */
332 z_const unsigned char *next; local
360 next = strm->next_in;
385 strm->next_in = next;
877 * return OK instead of BUF_ERROR at next call of deflate:
912 s->last_flush = -1; /* avoid BUF_ERROR next call, see above */
915 /* If flush != Z_NO_FLUSH && avail_out == 0, the next call
918 * empty block here, this will be done at next call. This also
942 s->last_flush = -1; /* avoid BUF_ERROR at next call, see above */
1199 /* Skip to next matc
[all...]
H A Dzlib.h86 z_const Bytef *next_in; /* next input byte */
90 Bytef *next_out; /* next output byte should be put there */
259 processing will resume at this point for the next call of deflate().
287 that is three bits plus filler bits to the next byte, followed by four bytes
300 seven bits of the current block are held to be written as the next byte after
301 the next deflate block is completed. In this case, the decompressor may not
303 the data provided so far to the compressor. It may need to wait for the next
405 resume at this point for the next call of inflate().
424 stop if and when it gets to the next deflate block boundary. When decoding
670 effect only at the next cal
1672 unsigned char *next; member in struct:gzFile_s
[all...]
/forgerock/openam/openam-core/src/main/java/com/iplanet/ums/
H A DSearchResults.java201 * Returns the next entry in the search results.
207 public PersistentObject next() throws UMSException { method in class:SearchResults
267 entry = next();
357 testResults.next();
509 * public Object next() { PersistentObject po = null; try { po =
510 * SearchResults.this.next(); } catch ( Exception ignored) { } return po; }
/forgerock/openam/openam-core/src/main/java/org/forgerock/openam/session/service/access/persistence/caching/
H A DInMemoryInternalSessionCacheStep.java86 public InternalSession getBySessionID(final SessionID sessionID, final InternalSessionStore next) argument
91 return next.getBySessionID(sessionID);
97 public InternalSession getByHandle(final String sessionHandle, final InternalSessionStore next) argument
102 return next.getByHandle(sessionHandle);
108 public InternalSession getByRestrictedID(final SessionID sessionID, final InternalSessionStore next) argument
113 return next.getByRestrictedID(sessionID);
119 public void store(final InternalSession session, final InternalSessionStore next) argument
124 next.store(session);
145 public void remove(final InternalSession session, final InternalSessionStore next) throws SessionPersistenceException { argument
149 next
[all...]
/forgerock/opendj2/src/server/org/opends/server/replication/server/changelog/je/
H A DReplicationDB.java108 * When not null, the next change with a ts different from
234 // wait for the next change of time
371 // First record is a counter record .. go next
377 // There cannot be 2 counter record next to each other,
435 // There cannot be 2 counter record next to each other,
585 // Move backward so that the first call to next() points to this greater csn
731 * Get the next CSN in the database from this Cursor.
733 * @return The next CSN in the database from this cursor.
761 public boolean next() throws ChangelogException method in class:ReplicationDB.ReplServerDBCursor
805 * can do at this point except trying to continue with the next
[all...]
/forgerock/opendj2-hg/src/server/org/opends/server/replication/server/changelog/je/
H A DReplicationDB.java108 * When not null, the next change with a ts different from
234 // wait for the next change of time
371 // First record is a counter record .. go next
377 // There cannot be 2 counter record next to each other,
435 // There cannot be 2 counter record next to each other,
585 // Move backward so that the first call to next() points to this greater csn
731 * Get the next CSN in the database from this Cursor.
733 * @return The next CSN in the database from this cursor.
761 public boolean next() throws ChangelogException method in class:ReplicationDB.ReplServerDBCursor
805 * can do at this point except trying to continue with the next
[all...]
/forgerock/opendj-v3/opendj-server-legacy/src/main/java/org/opends/server/backends/pluggable/
H A DDN2ID.java218 while (cursor.next());
281 * Decorator overriding the next() behavior to iterate through children of the entry pointed by the given cursor at
300 public boolean next() method in class:DN2ID.ChildrenCursor
304 delegate.next();
307 // Go to the next sibling
320 * Decorator overriding the next() behavior to iterate through subordinates of the entry pointed by the given cursor
335 public boolean next() method in class:DN2ID.SubtreeCursor
337 return delegate.next() && delegate.getKey().compareTo(limit) < 0;
379 public boolean next() method in class:DN2ID.TreeVisitorCursor
381 if (delegate.next())
[all...]
H A DEntryIDSet.java408 public EntryID next() method in class:EntryIDSet.IDSetIterator
663 needSort |= pos > 0 && l.iterator().next().longValue() < n[pos - 1];
H A DTracedStorage.java121 public boolean next() method in class:TracedStorage.TracedCursor
123 traceEnter("next");
124 boolean found = cursor.next();
125 traceLeave("next", "found", found);
/forgerock/opendj2/src/server/org/opends/server/replication/server/changelog/file/
H A DLog.java606 final LogFile<K, V> logFile = entriesToPurge.next().getValue();
1001 public boolean next() throws ChangelogException method in class:Log.LogCursor
1010 final boolean hasNext = currentCursor.next();
1019 return currentCursor.next();
1121 /** An empty cursor, that always return null records and false to {@code next()} method. */
1133 public boolean next() method in class:Log.EmptyLogCursor
1174 * beginning of the file, in bytes, at which the next read occurs.
/forgerock/opendj2-hg/src/server/org/opends/server/replication/server/changelog/file/
H A DLog.java606 final LogFile<K, V> logFile = entriesToPurge.next().getValue();
1001 public boolean next() throws ChangelogException method in class:Log.LogCursor
1010 final boolean hasNext = currentCursor.next();
1019 return currentCursor.next();
1121 /** An empty cursor, that always return null records and false to {@code next()} method. */
1133 public boolean next() method in class:Log.EmptyLogCursor
1174 * beginning of the file, in bytes, at which the next read occurs.
/forgerock/openam-v13/openam-core/src/main/java/com/sun/identity/entitlement/opensso/
H A DCache.java323 for (Entry e = tab[i]; (e != null) && !found; e = e.next) {
367 for (Entry e = tab[index]; (e != null) && !found; e = e.next) {
396 e = e.next) {
437 old = old.next;
440 e.next = newMap[index];
481 for (Entry e = tab[index]; e != null; e = e.next) {
537 for (Entry e = tab[index], prev = null; e != null; prev = e, e = e.next)
541 prev.next = e.next;
543 tab[index] = e.next;
989 Entry next; field in class:Cache.Entry
994 Entry(int hash, Object key, Object value, Entry next) argument
1009 changeValues(int hash, Object key, Object value, Entry next) argument
1126 public Object next() { method in class:Cache.Enumerator
[all...]
/forgerock/openam-v13/openam-shared/src/main/java/com/iplanet/am/util/
H A DCache.java301 for (Entry e = tab[i]; e != null; e = e.next) {
340 for (Entry e = tab[index]; e != null; e = e.next) {
362 for (Entry e = tab[index]; e != null; e = e.next) {
391 old = old.next;
394 e.next = newMap[index];
431 for (Entry e = tab[index]; e != null; e = e.next) {
474 for (Entry e = tab[index], prev = null; e != null; prev = e, e = e.next)
478 prev.next = e.next;
480 tab[index] = e.next;
872 Entry next; field in class:Cache.Entry
879 Entry(int hash, Object key, Object value, Entry next) argument
893 changeValues(int hash, Object key, Object value, Entry next) argument
1007 public Object next() { method in class:Cache.Enumerator
[all...]
/forgerock/web-agents-v4/source/varnish/
H A Dagent.c56 struct header *next; member in struct:header
67 struct request *next; member in struct:request
133 delete_request_list(&t->next);
178 h->next = NULL;
645 request_list = e->next;
649 while (tmp->next && tmp->next != e) {
650 tmp = tmp->next;
652 if (tmp->next) {
653 tmp->next
[all...]
/forgerock/openam/openam-shared/src/main/java/com/iplanet/am/util/
H A DCache.java301 for (Entry e = tab[i]; e != null; e = e.next) {
340 for (Entry e = tab[index]; e != null; e = e.next) {
362 for (Entry e = tab[index]; e != null; e = e.next) {
391 old = old.next;
394 e.next = newMap[index];
431 for (Entry e = tab[index]; e != null; e = e.next) {
474 for (Entry e = tab[index], prev = null; e != null; prev = e, e = e.next)
478 prev.next = e.next;
480 tab[index] = e.next;
872 Entry next; field in class:Cache.Entry
879 Entry(int hash, Object key, Object value, Entry next) argument
893 changeValues(int hash, Object key, Object value, Entry next) argument
1007 public Object next() { method in class:Cache.Enumerator
[all...]
/forgerock/openam/openam-core/src/main/java/com/sun/identity/entitlement/opensso/
H A DCache.java323 for (Entry e = tab[i]; (e != null) && !found; e = e.next) {
367 for (Entry e = tab[index]; (e != null) && !found; e = e.next) {
396 e = e.next) {
437 old = old.next;
440 e.next = newMap[index];
481 for (Entry e = tab[index]; e != null; e = e.next) {
537 for (Entry e = tab[index], prev = null; e != null; prev = e, e = e.next)
541 prev.next = e.next;
543 tab[index] = e.next;
989 Entry next; field in class:Cache.Entry
994 Entry(int hash, Object key, Object value, Entry next) argument
1009 changeValues(int hash, Object key, Object value, Entry next) argument
1126 public Object next() { method in class:Cache.Enumerator
[all...]
/forgerock/opendj2/src/server/org/opends/server/backends/jeb/
H A DEntryContainer.java1193 // a request for the next page in paged results. So we skip
1259 // The cookie contains the DN of the next entry to be returned.
1387 // Move to the next record.
1452 // The cookie contains the ID of the next entry to be returned.
1496 EntryID id = iterator.next();
1933 // Get the next DN.
2488 current = current.next;
2570 current = current.next;
2577 // Get the next DN.
2589 current = head.next;
2647 MovedEntry next; field in class:EntryContainer.MovedEntry
[all...]

Completed in 189 milliseconds

1234567891011>>