sixcooler
14 years ago
parent
8f19fbc46d
commit
69570fda24
@ -1,7 +0,0 @@
|
||||
#!/bin/sh
|
||||
JAVA_ARGS="-Xmx1024m -cp lib/yacycore.jar:lib/jcifs-1.3.15.jar:lib/httpcore-4.0.1.jar de.anomic.data.URLAnalysis"
|
||||
nice -n 19 java $JAVA_ARGS -incell DATA/INDEX/freeworld/SEGMENTS/default used.dump
|
||||
nice -n 19 java $JAVA_ARGS -diffurlcol DATA/INDEX/freeworld/SEGMENTS/default used.dump diffurlcol.dump
|
||||
rm used.dump
|
||||
nice -n 19 java $JAVA_ARGS -copy DATA/INDEX/freeworld/SEGMENTS/default diffurlcol.dump
|
||||
rm diffurlcol.dump
|
||||
@ -1,96 +0,0 @@
|
||||
import java.io.File;
|
||||
import java.io.IOException;
|
||||
import java.util.List;
|
||||
import java.util.regex.Matcher;
|
||||
import java.util.regex.Pattern;
|
||||
|
||||
import org.apache.tools.ant.BuildException;
|
||||
import org.apache.tools.ant.Project;
|
||||
|
||||
import org.eclipse.jgit.api.Git;
|
||||
import org.eclipse.jgit.lib.ObjectId;
|
||||
import org.eclipse.jgit.lib.Repository;
|
||||
import org.eclipse.jgit.revwalk.RevCommit;
|
||||
import org.eclipse.jgit.revwalk.RevTag;
|
||||
import org.eclipse.jgit.revwalk.RevWalk;
|
||||
import org.eclipse.jgit.storage.file.FileRepositoryBuilder;
|
||||
|
||||
|
||||
public class GitRevTask extends org.apache.tools.ant.Task {
|
||||
|
||||
private String repoPath;
|
||||
private String property;
|
||||
|
||||
public void setRepoPath(final String repoPath) {
|
||||
this.repoPath = repoPath;
|
||||
}
|
||||
|
||||
public void setProperty(String property) {
|
||||
this.property = property;
|
||||
}
|
||||
|
||||
public void execute() {
|
||||
if (this.property==null || this.property.length() == 0) {
|
||||
log("svn entries file name property was not set properly",Project.MSG_ERR);
|
||||
return;
|
||||
}
|
||||
|
||||
String revision = null;
|
||||
String lastTag = null;
|
||||
try {
|
||||
final File src = new File(repoPath);
|
||||
final Repository repo = new FileRepositoryBuilder().readEnvironment()
|
||||
.findGitDir(src).build();
|
||||
final ObjectId head = repo.resolve("HEAD");
|
||||
final String gitrev = head.getName().substring(0, 8);
|
||||
|
||||
final Git git = new Git(repo);
|
||||
final List<RevTag> tags = git.tagList().call();
|
||||
|
||||
final RevWalk walk = new RevWalk(repo);
|
||||
walk.markStart(walk.parseCommit(head));
|
||||
int distance = 0;
|
||||
for (final RevCommit commit : walk) {
|
||||
for (final RevTag tag : tags) {
|
||||
if (commit.equals(tag.getObject())) {
|
||||
lastTag = tag.getShortMessage();
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (lastTag == null) lastTag = findRev(commit.getFullMessage());
|
||||
if (lastTag != null || distance++ > 99) break;
|
||||
}
|
||||
walk.dispose();
|
||||
if (lastTag == null) {
|
||||
revision = "dev" + "-" + gitrev;
|
||||
} else {
|
||||
revision = lastTag + "-" + distance + "-" + gitrev;
|
||||
}
|
||||
} catch (IOException e) {
|
||||
// TODO Auto-generated catch block
|
||||
e.printStackTrace();
|
||||
}
|
||||
|
||||
Project theProject = getProject();
|
||||
if (theProject != null) {
|
||||
theProject.setProperty(this.property, lastTag);
|
||||
log("Property '" + this.property + "' set to '" + revision + "'", Project.MSG_VERBOSE);
|
||||
}
|
||||
}
|
||||
|
||||
private String findRev(final String message) {
|
||||
final Pattern pattern = Pattern.compile("trunk@(\\d{4})\\s+");
|
||||
final Matcher matcher = pattern.matcher(message);
|
||||
if (matcher.find()) {
|
||||
return matcher.group(1);
|
||||
}
|
||||
return null;
|
||||
}
|
||||
|
||||
public static void main(String[] args) {
|
||||
GitRevTask gitRevTask = new GitRevTask();
|
||||
gitRevTask.setRepoPath("/home/sgaebel/git/yacy.rc1");
|
||||
|
||||
gitRevTask.execute();
|
||||
}
|
||||
}
|
||||
@ -1 +0,0 @@
|
||||
gitRev=GitRevTask
|
||||
Binary file not shown.
@ -1,37 +0,0 @@
|
||||
This program and the accompanying materials are made available
|
||||
under the terms of the Eclipse Distribution License v1.0 which
|
||||
accompanies this distribution, is reproduced below, and is
|
||||
available at http://www.eclipse.org/org/documents/edl-v10.php
|
||||
|
||||
All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or
|
||||
without modification, are permitted provided that the following
|
||||
conditions are met:
|
||||
|
||||
- Redistributions of source code must retain the above copyright
|
||||
notice, this list of conditions and the following disclaimer.
|
||||
|
||||
- Redistributions in binary form must reproduce the above
|
||||
copyright notice, this list of conditions and the following
|
||||
disclaimer in the documentation and/or other materials provided
|
||||
with the distribution.
|
||||
|
||||
- Neither the name of the Eclipse Foundation, Inc. nor the
|
||||
names of its contributors may be used to endorse or promote
|
||||
products derived from this software without specific prior
|
||||
written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
|
||||
CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||||
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
|
||||
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
||||
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
||||
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
||||
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
||||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
||||
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
||||
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
@ -1,186 +0,0 @@
|
||||
// MemoryControl.java
|
||||
// -------------------------------------------
|
||||
// (C) 2011 by Sebastian Gaebel
|
||||
// first published 22.08.2011 on http://yacy.net
|
||||
//
|
||||
// $LastChangedDate: 2011-08-18 00:24:17 +0200 (Do, 18. Aug 2011) $
|
||||
// $LastChangedRevision: 7883 $
|
||||
// $LastChangedBy: orbiter $
|
||||
//
|
||||
// LICENSE
|
||||
//
|
||||
// This program is free software; you can redistribute it and/or modify
|
||||
// it under the terms of the GNU General Public License as published by
|
||||
// the Free Software Foundation; either version 2 of the License, or
|
||||
// (at your option) any later version.
|
||||
//
|
||||
// This program is distributed in the hope that it will be useful,
|
||||
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
// GNU General Public License for more details.
|
||||
//
|
||||
// You should have received a copy of the GNU General Public License
|
||||
// along with this program; if not, write to the Free Software
|
||||
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
|
||||
package net.yacy.kelondro.util;
|
||||
|
||||
import java.lang.management.ManagementFactory;
|
||||
import java.lang.management.MemoryMXBean;
|
||||
import java.lang.management.MemoryPoolMXBean;
|
||||
import java.lang.management.MemoryUsage;
|
||||
|
||||
public class G1MemoryStrategy extends MemoryStrategy {
|
||||
|
||||
private MemoryPoolMXBean eden, survivor, old;
|
||||
private MemoryMXBean heap;
|
||||
|
||||
public G1MemoryStrategy() {
|
||||
name = "G1 Memory Strategy";
|
||||
error = initPoolBeans();
|
||||
heap = ManagementFactory.getMemoryMXBean();
|
||||
if (lastGC == 0l) gc(10000, "initial gc - to get proper results"); // this is necessary on some GCs / vm
|
||||
if (error) log.logWarning(name + ": not a generational heap");
|
||||
}
|
||||
|
||||
/**
|
||||
* memory that is free without increasing of total memory taken from os
|
||||
* @return bytes
|
||||
*/
|
||||
protected final long free() {
|
||||
return oldUsage(false).getCommitted() - oldUsage(false).getUsed();
|
||||
}
|
||||
|
||||
/**
|
||||
* memory that is available including increasing total memory up to maximum
|
||||
* Smallest of both old and young
|
||||
* @return bytes
|
||||
*/
|
||||
protected final long available() {
|
||||
return oldAvailable();
|
||||
}
|
||||
|
||||
/**
|
||||
* memory that is currently bound in objects
|
||||
* @return used bytes
|
||||
*/
|
||||
protected final long used() {
|
||||
return heap.getHeapMemoryUsage().getUsed();
|
||||
}
|
||||
|
||||
/**
|
||||
* currently allocated memory in the Java virtual machine; may vary over time
|
||||
* @return bytes
|
||||
*/
|
||||
protected final long total() {
|
||||
return heap.getHeapMemoryUsage().getCommitted();
|
||||
}
|
||||
|
||||
/**
|
||||
* maximum memory the Java virtual will allocate machine; may vary over time in some cases
|
||||
* @return bytes
|
||||
*/
|
||||
protected final long maxMemory() {
|
||||
return heap.getHeapMemoryUsage().getMax();
|
||||
}
|
||||
|
||||
/**
|
||||
* checks if a specified amount of bytes are available
|
||||
* after the jvm recycled unused objects
|
||||
*
|
||||
* @param size the requested amount of free memory in bytes
|
||||
* @param force specifies whether ignoring prefered size
|
||||
* @return whether enough memory could be freed (or is free) or not
|
||||
*/
|
||||
protected final boolean request(final long size, final boolean force, boolean shortStatus) {
|
||||
debugOut();
|
||||
if (size == 0l) return true; // does not make sense to check - returning true without setting shortStatus (which also doesn't make sense to me)
|
||||
final boolean unknown = size < 0l; // size < 0 indicate an unknown size - maybe from gziped streams
|
||||
final boolean r = unknown? properState() : size < oldAvailable();
|
||||
shortStatus = !r;
|
||||
return r;
|
||||
}
|
||||
|
||||
/**
|
||||
* @return bytes available to allocate in Tenured Space (Old Generation)
|
||||
*/
|
||||
private final long oldAvailable() {
|
||||
return oldUsage(true).getCommitted() - oldUsage(true).getUsed();
|
||||
}
|
||||
|
||||
/**
|
||||
* G1 works different than traditional generation-stukture.
|
||||
* The heap iss segmented which can be young, survivior or old generation.
|
||||
* For proper running young and survior need to fit into old space
|
||||
*
|
||||
* @return Memory is in proper state
|
||||
*/
|
||||
protected boolean properState() {
|
||||
return (oldUsage(true).getUsed() + survivorUsage(false).getCommitted() + youngUsage(false).getCommitted()) < oldUsage(false).getCommitted();
|
||||
}
|
||||
|
||||
/**
|
||||
* @param collected specifies whether trying to get the memory usage after the jvm recycled unused objects
|
||||
* @return MemoryUsage of Eden Space aka Young Gen
|
||||
*/
|
||||
private MemoryUsage youngUsage(final boolean collected) {
|
||||
if (collected) {
|
||||
final MemoryUsage usage = eden.getCollectionUsage();
|
||||
if (usage != null) return usage;
|
||||
error = true;
|
||||
log.logWarning(name + ": no young colletion usage available");
|
||||
}
|
||||
return eden.getUsage();
|
||||
}
|
||||
|
||||
/**
|
||||
* @param collected specifies whether trying to get the memory usage after the jvm recycled unused objects
|
||||
* @return MemoryUsage of Survivor
|
||||
*/
|
||||
private MemoryUsage survivorUsage(final boolean collected) {
|
||||
if (collected) {
|
||||
final MemoryUsage usage = survivor.getCollectionUsage();
|
||||
if (usage != null) return usage;
|
||||
error = true;
|
||||
log.logWarning(name + ": no survivior colletion usage available");
|
||||
}
|
||||
return survivor.getUsage();
|
||||
}
|
||||
|
||||
/**
|
||||
* @param collected specifies whether trying to get the memory usage after the jvm recycled unused objects
|
||||
* @return MemoryUsage of Old Gen
|
||||
*/
|
||||
private MemoryUsage oldUsage(final boolean collected) {
|
||||
if (collected) {
|
||||
final MemoryUsage usage = old.getCollectionUsage();
|
||||
if (usage != null) return usage;
|
||||
error = true;
|
||||
log.logWarning(name + ": no old colletion usage available");
|
||||
}
|
||||
return old.getUsage();
|
||||
}
|
||||
|
||||
private boolean initPoolBeans() {
|
||||
for (final MemoryPoolMXBean bean : ManagementFactory.getMemoryPoolMXBeans()) {
|
||||
if (!bean.getName().startsWith("G1")) continue; //this strategy is G1 only
|
||||
if (bean.getName().contains("Eden")) {
|
||||
eden = bean;
|
||||
} else if (bean.getName().contains("Survivor")) {
|
||||
survivor = bean;
|
||||
} else if (bean.getName().contains("Old") || bean.getName().contains("Tenured")) {
|
||||
old = bean;
|
||||
}
|
||||
}
|
||||
return eden == null || survivor == null || old == null;
|
||||
}
|
||||
|
||||
private void debugOut() {
|
||||
// System.out.println("young: " + youngUsage(false).getUsed() + " " + youngUsage(false).getCommitted() + " " + youngUsage(false).getMax());
|
||||
// System.out.println("->: " + youngUsage(true).getUsed() + " " + youngUsage(true).getCommitted() + " " + youngUsage(true).getMax());
|
||||
// System.out.println("survivor: " + survivorUsage(false).getUsed() + " " + survivorUsage(false).getCommitted() + " " + survivorUsage(false).getMax());
|
||||
// System.out.println("->: " + survivorUsage(true).getUsed() + " " + survivorUsage(true).getCommitted() + " " + survivorUsage(true).getMax());
|
||||
System.out.println("old: " + oldUsage(false).getUsed() + " " + oldUsage(false).getCommitted() + " " + oldUsage(false).getMax());
|
||||
System.out.println("->: " + oldUsage(true).getUsed() + " " + oldUsage(true).getCommitted() + " " + oldUsage(true).getMax());
|
||||
}
|
||||
}
|
||||
@ -1,12 +0,0 @@
|
||||
anal
|
||||
fuck
|
||||
fucked
|
||||
incest
|
||||
lolita
|
||||
naked
|
||||
porn
|
||||
preteen
|
||||
pre-teen
|
||||
pussy
|
||||
teen
|
||||
teens
|
||||
@ -1,61 +0,0 @@
|
||||
aber
|
||||
als
|
||||
an
|
||||
an
|
||||
auch
|
||||
auf
|
||||
aus
|
||||
aus
|
||||
bei
|
||||
da
|
||||
das
|
||||
dass
|
||||
daß
|
||||
dem
|
||||
den
|
||||
denn
|
||||
der
|
||||
des
|
||||
die
|
||||
du
|
||||
ein
|
||||
eine
|
||||
er
|
||||
es
|
||||
es
|
||||
euch
|
||||
für
|
||||
hat
|
||||
hat
|
||||
ich
|
||||
ihm
|
||||
ihn
|
||||
ihnen
|
||||
ihr
|
||||
im
|
||||
in
|
||||
in
|
||||
ist
|
||||
mehr
|
||||
mir
|
||||
mit
|
||||
nach
|
||||
nicht
|
||||
oder
|
||||
sein
|
||||
seine
|
||||
sich
|
||||
sie
|
||||
sind
|
||||
so
|
||||
und
|
||||
von
|
||||
vor
|
||||
was
|
||||
werden
|
||||
werden
|
||||
wie
|
||||
wird
|
||||
www
|
||||
zu
|
||||
zum
|
||||
Loading…
Reference in new issue