boxtec
/
yacy_search_server
mirror of https://github.com/yacy/yacy_search_server
4
1
Fork 0
Code Issues Projects Releases Wiki Activity

performance hacks

Browse Source
pull/1/head
Michael Peter Christen 13 years ago
parent 2fe207f813
commit a1fe65b115
13 changed files with 121 additions and 94 deletions
Show Stats Download Patch File Download Diff File

2
htroot/yacysearch.java
Unescape View File

@ -364,7 +364,7 @@ public class yacysearch {
// check available memory and clean up if necessary // check available memory and clean up if necessary
if ( !MemoryControl.request(8000000L, false) ) { if ( !MemoryControl.request(8000000L, false) ) {
indexSegment.urlMetadata().clearCache(); indexSegment.urlMetadata().clearCache();
SearchEventCache.cleanupEvents(true); SearchEventCache.cleanupEvents(false);
} }
final RankingProfile ranking = sb.getRanking(); final RankingProfile ranking = sb.getRanking();

3
source/de/anomic/tools/crypt.java
Unescape View File

@ -24,8 +24,6 @@
package de.anomic.tools; package de.anomic.tools;
import java.text.SimpleDateFormat;
import java.util.Locale;
import java.util.Random; import java.util.Random;
import net.yacy.kelondro.logging.Log; import net.yacy.kelondro.logging.Log;
@ -57,7 +55,6 @@ public class crypt {
public static final String vDATE = "20030925"; public static final String vDATE = "20030925";
public static final String copyright = "[ 'crypt' v" + vDATE + " by Michael Christen / www.anomic.de ]"; public static final String copyright = "[ 'crypt' v" + vDATE + " by Michael Christen / www.anomic.de ]";
public static final String magicString = "crypt|anomic.de|0"; // magic identifier inside every '.crypt' - file public static final String magicString = "crypt|anomic.de|0"; // magic identifier inside every '.crypt' - file
public static final SimpleDateFormat dateFormatter = new SimpleDateFormat("yyyyMMddHHmmssSSS", Locale.ENGLISH);
String cryptMethod; // one of ["TripleDES", "Blowfish", "DESede", "DES"] String cryptMethod; // one of ["TripleDES", "Blowfish", "DESede", "DES"]
//private static final String defaultMethod = "PBEWithMD5AndDES"; //"DES"; //private static final String defaultMethod = "PBEWithMD5AndDES"; //"DES";

2
source/net/yacy/kelondro/rwi/AbstractIndex.java
Unescape View File

@ -94,6 +94,7 @@ public abstract class AbstractIndex <ReferenceType extends Reference> implements
return c; return c;
} }
@Override
public synchronized TreeSet<ReferenceContainer<ReferenceType>> referenceContainer(final byte[] startHash, final boolean rot, final boolean excludePrivate, int count) throws IOException { public synchronized TreeSet<ReferenceContainer<ReferenceType>> referenceContainer(final byte[] startHash, final boolean rot, final boolean excludePrivate, int count) throws IOException {
// creates a set of indexContainers // creates a set of indexContainers
// this does not use the cache // this does not use the cache
@ -212,7 +213,6 @@ public abstract class AbstractIndex <ReferenceType extends Reference> implements
final HandleSet urlselection, final HandleSet urlselection,
final ReferenceFactory<ReferenceType> termFactory, final ReferenceFactory<ReferenceType> termFactory,
final int maxDistance) throws RowSpaceExceededException { final int maxDistance) throws RowSpaceExceededException {
return new TermSearch<ReferenceType>(this, queryHashes, excludeHashes, urlselection, termFactory, maxDistance); return new TermSearch<ReferenceType>(this, queryHashes, excludeHashes, urlselection, termFactory, maxDistance);
} }

12
source/net/yacy/kelondro/rwi/Index.java
Unescape View File

@ -105,12 +105,20 @@ public interface Index <ReferenceType extends Reference> extends Iterable<Refere
public ReferenceContainer<ReferenceType> get(byte[] termHash, HandleSet referenceselection) throws IOException; public ReferenceContainer<ReferenceType> get(byte[] termHash, HandleSet referenceselection) throws IOException;
/** /**
* delete all references for a word * remove all references for a word
* @param termHash * @param termHash
* @return the deleted references * @return the deleted references
* @throws IOException * @throws IOException
*/ */
public ReferenceContainer<ReferenceType> delete(byte[] termHash) throws IOException; public ReferenceContainer<ReferenceType> remove(byte[] termHash) throws IOException;
/**
* delete all references for a word
* the difference to 'remove' is, that the removed element is not returned
* @param termHash
* @throws IOException
*/
public void delete(byte[] termHash) throws IOException;
/** /**
* remove a specific reference entry * remove a specific reference entry

20
source/net/yacy/kelondro/rwi/IndexCell.java
Unescape View File

@ -343,7 +343,7 @@ public final class IndexCell<ReferenceType extends Reference> extends AbstractBu
* @throws IOException * @throws IOException
*/ */
@Override @Override
public ReferenceContainer<ReferenceType> delete(final byte[] termHash) throws IOException { public ReferenceContainer<ReferenceType> remove(final byte[] termHash) throws IOException {
removeDelayed(); removeDelayed();
ReferenceContainer<ReferenceType> c1 = null; ReferenceContainer<ReferenceType> c1 = null;
try { try {
@ -354,7 +354,7 @@ public final class IndexCell<ReferenceType extends Reference> extends AbstractBu
if (c1 != null) { if (c1 != null) {
this.array.delete(termHash); this.array.delete(termHash);
} }
final ReferenceContainer<ReferenceType> c0 = this.ram.delete(termHash); final ReferenceContainer<ReferenceType> c0 = this.ram.remove(termHash);
if (c1 == null) return c0; if (c1 == null) return c0;
if (c0 == null) return c1; if (c0 == null) return c1;
try { try {
@ -370,6 +370,22 @@ public final class IndexCell<ReferenceType extends Reference> extends AbstractBu
} }
} }
@Override
public void delete(final byte[] termHash) throws IOException {
removeDelayed();
ReferenceContainer<ReferenceType> c1 = null;
try {
c1 = this.array.get(termHash);
} catch (final RowSpaceExceededException e2) {
Log.logException(e2);
}
if (c1 != null) {
this.array.delete(termHash);
}
this.ram.delete(termHash);
return;
}
@Override @Override
public void removeDelayed(final byte[] termHash, final HandleSet urlHashes) { public void removeDelayed(final byte[] termHash, final HandleSet urlHashes) {
HandleSet r; HandleSet r;

11
source/net/yacy/kelondro/rwi/ReferenceContainerCache.java
Unescape View File

@ -462,17 +462,26 @@ public final class ReferenceContainerCache<ReferenceType extends Reference> exte
* @return the indexContainer if the cache contained the container, null otherwise * @return the indexContainer if the cache contained the container, null otherwise
*/ */
@Override @Override
public ReferenceContainer<ReferenceType> delete(final byte[] termHash) { public ReferenceContainer<ReferenceType> remove(final byte[] termHash) {
// returns the index that had been deleted // returns the index that had been deleted
assert this.cache != null; assert this.cache != null;
if (this.cache == null) return null; if (this.cache == null) return null;
return this.cache.remove(new ByteArray(termHash)); return this.cache.remove(new ByteArray(termHash));
} }
@Override
public void delete(final byte[] termHash) {
// returns the index that had been deleted
assert this.cache != null;
if (this.cache == null) return;
this.cache.remove(new ByteArray(termHash));
}
@Override @Override
public void removeDelayed(final byte[] termHash, final byte[] urlHashBytes) { public void removeDelayed(final byte[] termHash, final byte[] urlHashBytes) {
remove(termHash, urlHashBytes); remove(termHash, urlHashBytes);
} }
@Override @Override
public boolean remove(final byte[] termHash, final byte[] urlHashBytes) { public boolean remove(final byte[] termHash, final byte[] urlHashBytes) {
assert this.cache != null; assert this.cache != null;

2
source/net/yacy/peers/dht/Dispatcher.java
Unescape View File

@ -209,7 +209,7 @@ public class Dispatcher {
// but to avoid race conditions return the results from the deletes // but to avoid race conditions return the results from the deletes
rc = new ArrayList<ReferenceContainer<WordReference>>(containers.size()); rc = new ArrayList<ReferenceContainer<WordReference>>(containers.size());
for (final ReferenceContainer<WordReference> c: containers) { for (final ReferenceContainer<WordReference> c: containers) {
container = this.segment.termIndex().delete(c.getTermHash()); // be aware this might be null! container = this.segment.termIndex().remove(c.getTermHash()); // be aware this might be null!
if (container != null && !container.isEmpty()) { if (container != null && !container.isEmpty()) {
if (this.log.isFine()) this.log.logFine("selected " + container.size() + " urls for word '" + ASCII.String(c.getTermHash()) + "'"); if (this.log.isFine()) this.log.logFine("selected " + container.size() + " urls for word '" + ASCII.String(c.getTermHash()) + "'");
rc.add(container); rc.add(container);

2
source/net/yacy/search/Switchboard.java
Unescape View File

@ -1914,7 +1914,7 @@ public final class Switchboard extends serverSwitch
for ( final Segment indexSegment : this.indexSegments ) { for ( final Segment indexSegment : this.indexSegments ) {
indexSegment.urlMetadata().clearCache(); indexSegment.urlMetadata().clearCache();
} }
SearchEventCache.cleanupEvents(true); SearchEventCache.cleanupEvents(false);
this.trail.clear(); this.trail.clear();
} }

52
source/net/yacy/search/query/QueryParams.java
Unescape View File

@ -481,7 +481,7 @@ public final class QueryParams {
return matcher; return matcher;
} }
private String idCacheAnon = null, idCache = null; private volatile String idCacheAnon = null, idCache = null;
final static private char asterisk = '*'; final static private char asterisk = '*';
public String id(final boolean anonymized) { public String id(final boolean anonymized) {
if (anonymized) { if (anonymized) {
@ -489,9 +489,15 @@ public final class QueryParams {
} else { } else {
if (this.idCache != null) return this.idCache; if (this.idCache != null) return this.idCache;
} }
synchronized (this) {
// do a Double-Checked Locking
if (anonymized) {
if (this.idCacheAnon != null) return this.idCacheAnon;
} else {
if (this.idCache != null) return this.idCache;
}
// generate a string that identifies a search so results can be re-used in a cache // generate a string that identifies a search so results can be re-used in a cache
final StringBuilder context = new StringBuilder(120); final StringBuilder context = new StringBuilder(180);
if (anonymized) { if (anonymized) {
context.append(anonymizedQueryHashes(this.queryHashes)); context.append(anonymizedQueryHashes(this.queryHashes));
context.append('-'); context.append('-');
@ -504,32 +510,19 @@ public final class QueryParams {
//context.append(asterisk); //context.append(asterisk);
//context.append(this.domType); //context.append(this.domType);
context.append(asterisk); context.append(asterisk);
context.append(this.contentdom); context.append(this.contentdom).append(asterisk);
context.append(asterisk); context.append(this.zonecode).append(asterisk);
context.append(this.zonecode); context.append(ASCII.String(Word.word2hash(this.ranking.toExternalString()))).append(asterisk);
context.append(asterisk); context.append(Base64Order.enhancedCoder.encodeString(this.prefer.toString())).append(asterisk);
context.append(ASCII.String(Word.word2hash(this.ranking.toExternalString()))); context.append(Base64Order.enhancedCoder.encodeString(this.urlMask.toString())).append(asterisk);
context.append(asterisk); context.append(this.sitehash).append(asterisk);
context.append(Base64Order.enhancedCoder.encodeString(this.prefer.toString())); context.append(this.siteexcludes).append(asterisk);
context.append(asterisk); context.append(this.authorhash).append(asterisk);
context.append(Base64Order.enhancedCoder.encodeString(this.urlMask.toString())); context.append(this.targetlang).append(asterisk);
context.append(asterisk); context.append(this.constraint).append(asterisk);
context.append(this.sitehash); context.append(this.maxDistance).append(asterisk);
context.append(asterisk); context.append(this.modifier.s).append(asterisk);
context.append(this.siteexcludes); context.append(this.lat).append(asterisk).append(this.lon).append(asterisk).append(this.radius).append(asterisk);
context.append(asterisk);
context.append(this.authorhash);
context.append(asterisk);
context.append(this.targetlang);
context.append(asterisk);
context.append(this.constraint);
context.append(asterisk);
context.append(this.maxDistance);
context.append(asterisk);
context.append(this.modifier.s);
context.append(asterisk);
context.append(this.lat).append(asterisk).append(this.lon).append(asterisk).append(this.radius);
context.append(asterisk);
context.append(this.snippetCacheStrategy == null ? "null" : this.snippetCacheStrategy.name()); context.append(this.snippetCacheStrategy == null ? "null" : this.snippetCacheStrategy.name());
String result = context.toString(); String result = context.toString();
if (anonymized) { if (anonymized) {
@ -539,6 +532,7 @@ public final class QueryParams {
} }
return result; return result;
} }
}
/** /**
* make a query anchor tag * make a query anchor tag

4
source/net/yacy/search/query/RWIProcess.java
Unescape View File

@ -643,10 +643,10 @@ public final class RWIProcess extends Thread
// check geo coordinates // check geo coordinates
double lat, lon; double lat, lon;
if (this.query.radius > 0.0d && this.query.lat != 0.0d && this.query.lon != 0.0d && (lat = page.lat()) > 0.0d && (lon = page.lon()) > 0.0d) { if (this.query.radius > 0.0d && this.query.lat != 0.0d && this.query.lon != 0.0d && (lat = page.lat()) != 0.0d && (lon = page.lon()) != 0.0d) {
double latDelta = this.query.lat - lat; double latDelta = this.query.lat - lat;
double lonDelta = this.query.lon - lon; double lonDelta = this.query.lon - lon;
double distance = Math.sqrt(latDelta * latDelta + lonDelta * lonDelta) / 2; // pythagoras double distance = Math.sqrt(latDelta * latDelta + lonDelta * lonDelta); // pythagoras
if (distance > this.query.radius) { if (distance > this.query.radius) {
this.sortout++; this.sortout++;
continue; continue;

6
source/net/yacy/search/query/SearchEvent.java
Unescape View File

@ -82,7 +82,7 @@ public final class SearchEvent
RESULTLIST; RESULTLIST;
} }
public static final int max_results_preparation = 3000; public static final int max_results_preparation = 420000;
// class variables that may be implemented with an abstract class // class variables that may be implemented with an abstract class
private long eventTime; private long eventTime;
@ -118,7 +118,7 @@ public final class SearchEvent
final int burstMultiwordPercent, final int burstMultiwordPercent,
final boolean deleteIfSnippetFail) { final boolean deleteIfSnippetFail) {
if ( MemoryControl.available() < 1024 * 1024 * 100 ) { if ( MemoryControl.available() < 1024 * 1024 * 100 ) {
SearchEventCache.cleanupEvents(true); SearchEventCache.cleanupEvents(false);
} }
this.eventTime = System.currentTimeMillis(); // for lifetime check this.eventTime = System.currentTimeMillis(); // for lifetime check
this.peers = peers; this.peers = peers;
@ -300,7 +300,7 @@ public final class SearchEvent
// store this search to a cache so it can be re-used // store this search to a cache so it can be re-used
if ( MemoryControl.available() < 1024 * 1024 * 100 ) { if ( MemoryControl.available() < 1024 * 1024 * 100 ) {
SearchEventCache.cleanupEvents(true); SearchEventCache.cleanupEvents(false);
} }
SearchEventCache.put(this.query.id(false), this); SearchEventCache.put(this.query.id(false), this);
} }

51
source/net/yacy/search/query/SearchEventCache.java
Unescape View File

@ -30,28 +30,24 @@ import java.util.Iterator;
import java.util.Map; import java.util.Map;
import java.util.SortedMap; import java.util.SortedMap;
import java.util.concurrent.ConcurrentHashMap; import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.ConcurrentMap;
import net.yacy.cora.document.Classification;
import net.yacy.kelondro.logging.Log; import net.yacy.kelondro.logging.Log;
import net.yacy.kelondro.util.MemoryControl; import net.yacy.kelondro.util.MemoryControl;
import net.yacy.peers.SeedDB; import net.yacy.peers.SeedDB;
import net.yacy.repository.LoaderDispatcher; import net.yacy.repository.LoaderDispatcher;
import net.yacy.search.Switchboard; import net.yacy.search.Switchboard;
import net.yacy.search.SwitchboardConstants; import net.yacy.search.SwitchboardConstants;
import net.yacy.search.index.Segment;
import net.yacy.search.ranking.RankingProfile;
import de.anomic.data.WorkTables; import de.anomic.data.WorkTables;
public class SearchEventCache { public class SearchEventCache {
private static ConcurrentMap<String, SearchEvent> lastEvents = new ConcurrentHashMap<String, SearchEvent>(); // a cache for objects from this class: re-use old search requests private volatile static Map<String, SearchEvent> lastEvents = new ConcurrentHashMap<String, SearchEvent>(); // a cache for objects from this class: re-use old search requests
public static final long eventLifetimeBigMem = 600000; // the time an event will stay in the cache when available memory is high, 10 Minutes public static final long eventLifetimeBigMem = 600000; // the time an event will stay in the cache when available memory is high, 10 Minutes
public static final long eventLifetimeMediumMem = 60000; // the time an event will stay in the cache when available memory is medium, 1 Minute public static final long eventLifetimeMediumMem = 60000; // the time an event will stay in the cache when available memory is medium, 1 Minute
public static final long eventLifetimeShortMem = 10000; // the time an event will stay in the cache when memory is low, 10 seconds public static final long eventLifetimeShortMem = 10000; // the time an event will stay in the cache when memory is low, 10 seconds
public static final long memlimitHigh = 600 * 1024 * 1024; // 400 MB public static final long memlimitHigh = 600 * 1024 * 1024; // 400 MB
public static final long memlimitMedium = 200 * 1024 * 1024; // 100 MB public static final long memlimitMedium = 200 * 1024 * 1024; // 100 MB
public static String lastEventID = ""; public volatile static String lastEventID = "";
public static long cacheInsert = 0, cacheHit = 0, cacheMiss = 0, cacheDelete = 0; public static long cacheInsert = 0, cacheHit = 0, cacheMiss = 0, cacheDelete = 0;
public static int size() { public static int size() {
@ -59,7 +55,7 @@ public class SearchEventCache {
} }
public static void put(final String eventID, final SearchEvent event) { public static void put(final String eventID, final SearchEvent event) {
if (MemoryControl.shortStatus()) cleanupEvents(true); if (MemoryControl.shortStatus()) cleanupEvents(false);
lastEventID = eventID; lastEventID = eventID;
final SearchEvent oldEvent = lastEvents.put(eventID, event); final SearchEvent oldEvent = lastEvents.put(eventID, event);
if (oldEvent == null) cacheInsert++; if (oldEvent == null) cacheInsert++;
@ -89,8 +85,6 @@ public class SearchEventCache {
if (event.workerAlive()) { if (event.workerAlive()) {
event.cleanup(); event.cleanup();
} }
}
if (!event.workerAlive()) {
i.remove(); i.remove();
cacheDelete++; cacheDelete++;
} }
@ -98,21 +92,29 @@ public class SearchEventCache {
} }
public static SearchEvent getEvent(final String eventID) { public static SearchEvent getEvent(final String eventID) {
final SearchEvent event = lastEvents.get(eventID); SearchEvent event = lastEvents.get(eventID);
if (event == null) {
synchronized (lastEvents) {
event = lastEvents.get(eventID);
if (event == null) cacheMiss++; else cacheHit++; if (event == null) cacheMiss++; else cacheHit++;
}
cacheMiss++;
} else {
cacheHit++;
}
return event; return event;
} }
public static int countAliveThreads() { public static int countAliveThreads() {
int alive = 0; int alive = 0;
for (final SearchEvent e: SearchEventCache.lastEvents.values()) { for (final SearchEvent e: lastEvents.values()) {
if (e.workerAlive()) alive++; if (e.workerAlive()) alive++;
} }
return alive; return alive;
} }
private static SearchEvent dummyEvent = null; /*
private volatile static SearchEvent dummyEvent = null;
private static SearchEvent getDummyEvent(final WorkTables workTables, final LoaderDispatcher loader, final Segment indexSegment) { private static SearchEvent getDummyEvent(final WorkTables workTables, final LoaderDispatcher loader, final Segment indexSegment) {
Log.logWarning("SearchEventCache", "returning dummy event"); Log.logWarning("SearchEventCache", "returning dummy event");
if (dummyEvent != null) return dummyEvent; if (dummyEvent != null) return dummyEvent;
@ -120,7 +122,7 @@ public class SearchEventCache {
dummyEvent = new SearchEvent(query, null, workTables, null, false, loader, 0, 0, 0, 0, false); dummyEvent = new SearchEvent(query, null, workTables, null, false, loader, 0, 0, 0, 0, false);
return dummyEvent; return dummyEvent;
} }
*/
public static SearchEvent getEvent( public static SearchEvent getEvent(
final QueryParams query, final QueryParams query,
final SeedDB peers, final SeedDB peers,
@ -134,13 +136,12 @@ public class SearchEventCache {
final int burstMultiwordPercent) { final int burstMultiwordPercent) {
final String id = query.id(false); final String id = query.id(false);
SearchEvent event = SearchEventCache.lastEvents.get(id); SearchEvent event = getEvent(id);
if (event == null) cacheMiss++; else cacheHit++;
if (Switchboard.getSwitchboard() != null && !Switchboard.getSwitchboard().crawlQueues.noticeURL.isEmpty() && event != null && System.currentTimeMillis() - event.getEventTime() > 60000) { if (Switchboard.getSwitchboard() != null && !Switchboard.getSwitchboard().crawlQueues.noticeURL.isEmpty() && event != null && System.currentTimeMillis() - event.getEventTime() > 60000) {
// if a local crawl is ongoing, don't use the result from the cache to use possibly more results that come from the current crawl // if a local crawl is ongoing, don't use the result from the cache to use possibly more results that come from the current crawl
// to prevent that this happens during a person switches between the different result pages, a re-search happens no more than // to prevent that this happens during a person switches between the different result pages, a re-search happens no more than
// once a minute // once a minute
SearchEventCache.lastEvents.remove(id); lastEvents.remove(id);
cacheDelete++; cacheDelete++;
event = null; event = null;
} else { } else {
@ -156,26 +157,28 @@ public class SearchEventCache {
// throttling in case of too many search requests // throttling in case of too many search requests
int waitcount = 0; int waitcount = 0;
/*
throttling : while (true) { throttling : while (true) {
final int allowedThreads = (int) Math.max(1, MemoryControl.available() / (query.snippetCacheStrategy == null ? 3 : 30) / 1024 / 1024); final int allowedThreads = (int) Math.max(10, MemoryControl.available() / (query.snippetCacheStrategy == null ? 3 : 30) / 1024 / 1024);
// make room if there are too many search events (they need a lot of RAM) // make room if there are too many search events (they need a lot of RAM)
if (SearchEventCache.lastEvents.size() >= allowedThreads) { if (lastEvents.size() >= allowedThreads) {
Log.logWarning("SearchEventCache", "throttling phase 1: " + SearchEventCache.lastEvents.size() + " in cache; " + countAliveThreads() + " alive; " + allowedThreads + " allowed"); Log.logWarning("SearchEventCache", "throttling phase 1: " + lastEvents.size() + " in cache; " + countAliveThreads() + " alive; " + allowedThreads + " allowed");
cleanupEvents(false); cleanupEvents(false);
} else break throttling; } else break throttling;
// if there are still some then delete just all // if there are still some then delete just all
if (SearchEventCache.lastEvents.size() >= allowedThreads) { if (lastEvents.size() >= allowedThreads) {
Log.logWarning("SearchEventCache", "throttling phase 2: " + SearchEventCache.lastEvents.size() + " in cache; " + countAliveThreads() + " alive; " + allowedThreads + " allowed"); Log.logWarning("SearchEventCache", "throttling phase 2: " + lastEvents.size() + " in cache; " + countAliveThreads() + " alive; " + allowedThreads + " allowed");
cleanupEvents(true); cleanupEvents(true);
} else break throttling; } else break throttling;
// now there might be still events left that are alive // now there might be still events left that are alive
if (countAliveThreads() < allowedThreads) break throttling; if (countAliveThreads() < allowedThreads) break throttling;
// finally we just wait some time until we get access // finally we just wait some time until we get access
Log.logWarning("SearchEventCache", "throttling phase 3: " + SearchEventCache.lastEvents.size() + " in cache; " + countAliveThreads() + " alive; " + allowedThreads + " allowed"); Log.logWarning("SearchEventCache", "throttling phase 3: " + lastEvents.size() + " in cache; " + countAliveThreads() + " alive; " + allowedThreads + " allowed");
try { Thread.sleep(200); } catch (final InterruptedException e) { } try { Thread.sleep(200); } catch (final InterruptedException e) { }
waitcount++; waitcount++;
if (waitcount >= 100) return getDummyEvent(workTables, loader, query.getSegment()); if (waitcount >= 100) return getDummyEvent(workTables, loader, query.getSegment());
} }
*/
if (waitcount > 0) { if (waitcount > 0) {
// do not fetch snippets because that is most time-expensive // do not fetch snippets because that is most time-expensive
@ -183,7 +186,7 @@ public class SearchEventCache {
} }
// check if there are too many other searches alive now // check if there are too many other searches alive now
Log.logInfo("SearchEventCache", "getEvent: " + SearchEventCache.lastEvents.size() + " in cache; " + countAliveThreads() + " alive"); Log.logInfo("SearchEventCache", "getEvent: " + lastEvents.size() + " in cache; " + countAliveThreads() + " alive");
// start a new event // start a new event
final boolean delete = Switchboard.getSwitchboard() == null || Switchboard.getSwitchboard().getConfigBool(SwitchboardConstants.SEARCH_VERIFY_DELETE, true); final boolean delete = Switchboard.getSwitchboard() == null || Switchboard.getSwitchboard().getConfigBool(SwitchboardConstants.SEARCH_VERIFY_DELETE, true);

Write Preview
Loading…
Cancel
Save