| package org.apache.lucene.index; |
| |
| /* |
| * Licensed to the Apache Software Foundation (ASF) under one or more |
| * contributor license agreements. See the NOTICE file distributed with |
| * this work for additional information regarding copyright ownership. |
| * The ASF licenses this file to You 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. |
| */ |
| |
| import java.util.ArrayList; |
| import java.util.HashMap; |
| import java.util.LinkedHashMap; |
| import java.util.List; |
| import java.util.Map; |
| import java.util.concurrent.atomic.AtomicInteger; |
| import java.util.concurrent.atomic.AtomicLong; |
| |
| import org.apache.lucene.search.Query; |
| import org.apache.lucene.util.RamUsageEstimator; |
| |
| /* Holds buffered deletes and updates, by docID, term or query for a |
| * single segment. This is used to hold buffered pending |
| * deletes and updates against the to-be-flushed segment. Once the |
| * deletes and updates are pushed (on flush in DocumentsWriter), they |
| * are converted to a FrozenDeletes instance. */ |
| |
| // NOTE: instances of this class are accessed either via a private |
| // instance on DocumentWriterPerThread, or via sync'd code by |
| // DocumentsWriterDeleteQueue |
| |
| class BufferedUpdates { |
| |
| /* Rough logic: HashMap has an array[Entry] w/ varying |
| load factor (say 2 * POINTER). Entry is object w/ Term |
| key, Integer val, int hash, Entry next |
| (OBJ_HEADER + 3*POINTER + INT). Term is object w/ |
| String field and String text (OBJ_HEADER + 2*POINTER). |
| Term's field is String (OBJ_HEADER + 4*INT + POINTER + |
| OBJ_HEADER + string.length*CHAR). |
| Term's text is String (OBJ_HEADER + 4*INT + POINTER + |
| OBJ_HEADER + string.length*CHAR). Integer is |
| OBJ_HEADER + INT. */ |
| final static int BYTES_PER_DEL_TERM = 9*RamUsageEstimator.NUM_BYTES_OBJECT_REF + 7*RamUsageEstimator.NUM_BYTES_OBJECT_HEADER + 10*RamUsageEstimator.NUM_BYTES_INT; |
| |
| /* Rough logic: del docIDs are List<Integer>. Say list |
| allocates ~2X size (2*POINTER). Integer is OBJ_HEADER |
| + int */ |
| final static int BYTES_PER_DEL_DOCID = 2*RamUsageEstimator.NUM_BYTES_OBJECT_REF + RamUsageEstimator.NUM_BYTES_OBJECT_HEADER + RamUsageEstimator.NUM_BYTES_INT; |
| |
| /* Rough logic: HashMap has an array[Entry] w/ varying |
| load factor (say 2 * POINTER). Entry is object w/ |
| Query key, Integer val, int hash, Entry next |
| (OBJ_HEADER + 3*POINTER + INT). Query we often |
| undercount (say 24 bytes). Integer is OBJ_HEADER + INT. */ |
| final static int BYTES_PER_DEL_QUERY = 5*RamUsageEstimator.NUM_BYTES_OBJECT_REF + 2*RamUsageEstimator.NUM_BYTES_OBJECT_HEADER + 2*RamUsageEstimator.NUM_BYTES_INT + 24; |
| |
| /* Rough logic: NumericUpdate calculates its actual size, |
| * including the update Term and DV field (String). The |
| * per-field map holds a reference to the updated field, and |
| * therefore we only account for the object reference and |
| * map space itself. This is incremented when we first see |
| * an updated field. |
| * |
| * HashMap has an array[Entry] w/ varying load |
| * factor (say 2*POINTER). Entry is an object w/ String key, |
| * LinkedHashMap val, int hash, Entry next (OBJ_HEADER + 3*POINTER + INT). |
| * |
| * LinkedHashMap (val) is counted as OBJ_HEADER, array[Entry] ref + header, 4*INT, 1*FLOAT, |
| * Set (entrySet) (2*OBJ_HEADER + ARRAY_HEADER + 2*POINTER + 4*INT + FLOAT) |
| */ |
| final static int BYTES_PER_NUMERIC_FIELD_ENTRY = |
| 7*RamUsageEstimator.NUM_BYTES_OBJECT_REF + 3*RamUsageEstimator.NUM_BYTES_OBJECT_HEADER + |
| RamUsageEstimator.NUM_BYTES_ARRAY_HEADER + 5*RamUsageEstimator.NUM_BYTES_INT + RamUsageEstimator.NUM_BYTES_FLOAT; |
| |
| /* Rough logic: Incremented when we see another Term for an already updated |
| * field. |
| * LinkedHashMap has an array[Entry] w/ varying load factor |
| * (say 2*POINTER). Entry is an object w/ Term key, NumericUpdate val, |
| * int hash, Entry next, Entry before, Entry after (OBJ_HEADER + 5*POINTER + INT). |
| * |
| * Term (key) is counted only as POINTER. |
| * NumericUpdate (val) counts its own size and isn't accounted for here. |
| */ |
| final static int BYTES_PER_NUMERIC_UPDATE_ENTRY = 7*RamUsageEstimator.NUM_BYTES_OBJECT_REF + RamUsageEstimator.NUM_BYTES_OBJECT_HEADER + RamUsageEstimator.NUM_BYTES_INT; |
| |
| final AtomicInteger numTermDeletes = new AtomicInteger(); |
| final AtomicInteger numNumericUpdates = new AtomicInteger(); |
| final Map<Term,Integer> terms = new HashMap<Term,Integer>(); |
| final Map<Query,Integer> queries = new HashMap<Query,Integer>(); |
| final List<Integer> docIDs = new ArrayList<Integer>(); |
| |
| // Map<dvField,Map<updateTerm,NumericUpdate>> |
| // For each field we keep an ordered list of NumericUpdates, key'd by the |
| // update Term. LinkedHashMap guarantees we will later traverse the map in |
| // insertion order (so that if two terms affect the same document, the last |
| // one that came in wins), and helps us detect faster if the same Term is |
| // used to update the same field multiple times (so we later traverse it |
| // only once). |
| final Map<String,LinkedHashMap<Term,NumericUpdate>> numericUpdates = new HashMap<String,LinkedHashMap<Term,NumericUpdate>>(); |
| |
| public static final Integer MAX_INT = Integer.valueOf(Integer.MAX_VALUE); |
| |
| final AtomicLong bytesUsed; |
| |
| private final static boolean VERBOSE_DELETES = false; |
| |
| long gen; |
| |
| public BufferedUpdates() { |
| this.bytesUsed = new AtomicLong(); |
| } |
| |
| @Override |
| public String toString() { |
| if (VERBOSE_DELETES) { |
| return "gen=" + gen + " numTerms=" + numTermDeletes + ", terms=" + terms |
| + ", queries=" + queries + ", docIDs=" + docIDs + ", numericUpdates=" + numericUpdates |
| + ", bytesUsed=" + bytesUsed; |
| } else { |
| String s = "gen=" + gen; |
| if (numTermDeletes.get() != 0) { |
| s += " " + numTermDeletes.get() + " deleted terms (unique count=" + terms.size() + ")"; |
| } |
| if (queries.size() != 0) { |
| s += " " + queries.size() + " deleted queries"; |
| } |
| if (docIDs.size() != 0) { |
| s += " " + docIDs.size() + " deleted docIDs"; |
| } |
| if (numNumericUpdates.get() != 0) { |
| s += " " + numNumericUpdates.get() + " numeric updates (unique count=" + numericUpdates.size() + ")"; |
| } |
| if (bytesUsed.get() != 0) { |
| s += " bytesUsed=" + bytesUsed.get(); |
| } |
| |
| return s; |
| } |
| } |
| |
| public void addQuery(Query query, int docIDUpto) { |
| Integer current = queries.put(query, docIDUpto); |
| // increment bytes used only if the query wasn't added so far. |
| if (current == null) { |
| bytesUsed.addAndGet(BYTES_PER_DEL_QUERY); |
| } |
| } |
| |
| public void addDocID(int docID) { |
| docIDs.add(Integer.valueOf(docID)); |
| bytesUsed.addAndGet(BYTES_PER_DEL_DOCID); |
| } |
| |
| public void addTerm(Term term, int docIDUpto) { |
| Integer current = terms.get(term); |
| if (current != null && docIDUpto < current) { |
| // Only record the new number if it's greater than the |
| // current one. This is important because if multiple |
| // threads are replacing the same doc at nearly the |
| // same time, it's possible that one thread that got a |
| // higher docID is scheduled before the other |
| // threads. If we blindly replace than we can |
| // incorrectly get both docs indexed. |
| return; |
| } |
| |
| terms.put(term, Integer.valueOf(docIDUpto)); |
| // note that if current != null then it means there's already a buffered |
| // delete on that term, therefore we seem to over-count. this over-counting |
| // is done to respect IndexWriterConfig.setMaxBufferedDeleteTerms. |
| numTermDeletes.incrementAndGet(); |
| if (current == null) { |
| bytesUsed.addAndGet(BYTES_PER_DEL_TERM + term.bytes.length + (RamUsageEstimator.NUM_BYTES_CHAR * term.field().length())); |
| } |
| } |
| |
| public void addNumericUpdate(NumericUpdate update, int docIDUpto) { |
| LinkedHashMap<Term,NumericUpdate> fieldUpdates = numericUpdates.get(update.field); |
| if (fieldUpdates == null) { |
| fieldUpdates = new LinkedHashMap<Term,NumericUpdate>(); |
| numericUpdates.put(update.field, fieldUpdates); |
| bytesUsed.addAndGet(BYTES_PER_NUMERIC_FIELD_ENTRY); |
| } |
| final NumericUpdate current = fieldUpdates.get(update.term); |
| if (current != null && docIDUpto < current.docIDUpto) { |
| // Only record the new number if it's greater than or equal to the current |
| // one. This is important because if multiple threads are replacing the |
| // same doc at nearly the same time, it's possible that one thread that |
| // got a higher docID is scheduled before the other threads. |
| return; |
| } |
| |
| update.docIDUpto = docIDUpto; |
| // since it's a LinkedHashMap, we must first remove the Term entry so that |
| // it's added last (we're interested in insertion-order). |
| if (current != null) { |
| fieldUpdates.remove(update.term); |
| } |
| fieldUpdates.put(update.term, update); |
| numNumericUpdates.incrementAndGet(); |
| if (current == null) { |
| bytesUsed.addAndGet(BYTES_PER_NUMERIC_UPDATE_ENTRY + update.sizeInBytes()); |
| } |
| } |
| |
| void clear() { |
| terms.clear(); |
| queries.clear(); |
| docIDs.clear(); |
| numericUpdates.clear(); |
| numTermDeletes.set(0); |
| numNumericUpdates.set(0); |
| bytesUsed.set(0); |
| } |
| |
| boolean any() { |
| return terms.size() > 0 || docIDs.size() > 0 || queries.size() > 0 || numericUpdates.size() > 0; |
| } |
| } |