mirror of
https://github.com/overcuriousity/autopsy-flatpak.git
synced 2025-07-09 06:39:33 +00:00

Conflicts: HashDatabase/src/org/sleuthkit/autopsy/hashdatabase/HashDbSearchAction.java HashDatabase/src/org/sleuthkit/autopsy/hashdatabase/HashDbSearchManager.java HashDatabase/src/org/sleuthkit/autopsy/hashdatabase/HashDbSearchPanel.java HashDatabase/src/org/sleuthkit/autopsy/hashdatabase/HashDbSearchResultFactory.java HashDatabase/src/org/sleuthkit/autopsy/hashdatabase/HashDbSearcher.java HashDatabase/src/org/sleuthkit/autopsy/hashdatabase/layer.xml
95 lines
3.4 KiB
Java
95 lines
3.4 KiB
Java
/*
|
|
* Autopsy Forensic Browser
|
|
*
|
|
* Copyright 2011 Basis Technology Corp.
|
|
* Contact: carrier <at> sleuthkit <dot> org
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
package org.sleuthkit.autopsy.hashdatabase;
|
|
|
|
import java.util.ArrayList;
|
|
import java.util.Collection;
|
|
import java.util.LinkedHashMap;
|
|
import java.util.List;
|
|
import java.util.Map;
|
|
import javax.swing.JOptionPane;
|
|
import org.openide.nodes.AbstractNode;
|
|
import org.openide.nodes.Children;
|
|
import org.openide.nodes.Node;
|
|
import org.openide.windows.TopComponent;
|
|
import org.sleuthkit.autopsy.corecomponents.DataResultTopComponent;
|
|
import org.sleuthkit.autopsy.datamodel.AbstractFsContentNode;
|
|
import org.sleuthkit.datamodel.FsContent;
|
|
|
|
/**
|
|
* Interface/Node manager for hash searching. The manager takes in the raw
|
|
* map of MD5 hashes to files, flattens the map, and sends it to the HashDbSearchResultFactory.
|
|
*/
|
|
public class HashDbSearchManager {
|
|
Map<String, List<FsContent>> map;
|
|
List<KeyValueContent> kvContents;
|
|
|
|
public HashDbSearchManager(Map<String, List<FsContent>> map) {
|
|
this.map = map;
|
|
init();
|
|
}
|
|
|
|
/**
|
|
* Initializes the flattened map of KeyValues. Each map in a KeyValue is a
|
|
* row in the table, with the String as it's column name and the Object
|
|
* as it's value in the row.
|
|
*/
|
|
private void init() {
|
|
if(!map.isEmpty()) {
|
|
kvContents = new ArrayList<KeyValueContent>();
|
|
int id = 0;
|
|
for(String s : map.keySet()) {
|
|
for(FsContent file : map.get(s)) {
|
|
Map<String, Object> keyMap = new LinkedHashMap<String, Object>();
|
|
keyMap.put("MD5 Hash", s);
|
|
AbstractFsContentNode.fillPropertyMap(keyMap, file);
|
|
KeyValueContent kv = new KeyValueContent(file.getName(), keyMap, ++id, file);
|
|
kvContents.add(kv);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Takes the key values, creates nodes through the HashDbSearchResultFactory, and
|
|
* displays it in the TopComponet.
|
|
*/
|
|
public void execute() {
|
|
if(!map.isEmpty()) {
|
|
Collection<KeyValueContent> kvCollection = kvContents;
|
|
Node rootNode = null;
|
|
|
|
if (kvCollection.size() > 0) {
|
|
Children childKeyValueContentNodes =
|
|
Children.create(new HashDbSearchResultFactory(kvCollection), true);
|
|
|
|
rootNode = new AbstractNode(childKeyValueContentNodes);
|
|
} else {
|
|
rootNode = Node.EMPTY;
|
|
}
|
|
|
|
final String pathText = "MD5 Hash Search";
|
|
TopComponent searchResultWin = DataResultTopComponent.createInstance("MD5 Hash Search", pathText, rootNode, kvCollection.size());
|
|
searchResultWin.requestActive();
|
|
} else {
|
|
JOptionPane.showMessageDialog(null, "No results were found.");
|
|
}
|
|
}
|
|
}
|