private void cleanupFragments(Throwable cause, byte[] fragmented) { if (fragmented != null) { /*P*/ byte[] copy = p_transfer(fragmented); try { getDatabase().deleteFragments(copy, 0, fragmented.length); } catch (Throwable e) { cause.addSuppressed(e); panic(cause); } finally { p_delete(copy); } } }
private void cleanupSplit(Throwable cause, Node newNode, Split split) { if (split != null) { cleanupFragments(cause, split.fragmentedKey()); } try { getDatabase().deleteNode(newNode); } catch (Throwable e) { cause.addSuppressed(e); panic(cause); } }
private void cleanupSplit(Throwable cause, Node newNode, Split split) { if (split != null) { cleanupFragments(cause, split.fragmentedKey()); } try { // No need to prepare for delete because node contents are unreferenced. getDatabase().finishDeleteNode(newNode); } catch (Throwable e) { Utils.suppress(cause, e); panic(cause); } }
private void cleanupSplit(Throwable cause, Node newNode, Split split) { if (split != null) { cleanupFragments(cause, split.fragmentedKey()); } try { // No need to prepare for delete because node contents are unreferenced. getDatabase().finishDeleteNode(newNode); } catch (Throwable e) { Utils.suppress(cause, e); panic(cause); } }
private void cleanupFragments(Throwable cause, byte[] fragmented) { if (fragmented != null) { /*P*/ byte[] copy = p_transfer(fragmented); try { getDatabase().deleteFragments(copy, 0, fragmented.length); } catch (Throwable e) { Utils.suppress(cause, e); panic(cause); } finally { p_delete(copy); } } }
void cleanupFragments(Throwable cause, byte[] fragmented) { if (fragmented != null) { /*P*/ byte[] copy = p_transfer(fragmented, false); try { getDatabase().deleteFragments(copy, 0, fragmented.length); } catch (Throwable e) { Utils.suppress(cause, e); panic(cause); } finally { p_delete(copy); } } }
newChildPos << 3, true); } catch (Throwable e) { panic(e); throw e;
newChildPos << 3, true); } catch (Throwable e) { panic(e); throw e;
newChildPos << 3, true); } catch (Throwable e) { panic(e); throw e;