mirror of
https://github.com/abraunegg/onedrive
synced 2024-06-01 13:32:16 +02:00
4253318835
commit1eff2d7d67
Author: abraunegg <alex.braunegg@gmail.com> Date: Wed Oct 18 19:15:27 2023 +1100 Update PR * Add --source-directory 'path/as/source/' --destination-directory 'path/as/destination' functionality commitad3ddee0ec
Author: abraunegg <alex.braunegg@gmail.com> Date: Wed Oct 18 17:32:24 2023 +1100 Update PR * Add --create-directory * Add --remove-directory commit7dfe6b65b7
Author: abraunegg <alex.braunegg@gmail.com> Date: Wed Oct 18 12:27:03 2023 +1100 Update PR * Update PR commit75c071e56f
Author: abraunegg <alex.braunegg@gmail.com> Date: Wed Oct 18 10:12:05 2023 +1100 Update PR * Update PR commit6db484cdad
Author: abraunegg <alex.braunegg@gmail.com> Date: Mon Oct 16 17:01:25 2023 +1100 Update PR * Update PR commitd893ea5460
Author: abraunegg <alex.braunegg@gmail.com> Date: Wed Oct 11 10:43:50 2023 +1100 Update PR * Update PR commit82bd593bf4
Author: abraunegg <alex.braunegg@gmail.com> Date: Wed Oct 11 09:14:17 2023 +1100 Update PR * Validate and document --auth-files operation commitc551203f4c
Author: abraunegg <alex.braunegg@gmail.com> Date: Wed Oct 11 05:48:22 2023 +1100 Update PR * Add --create-share-link commitfbf63999ff
Author: abraunegg <alex.braunegg@gmail.com> Date: Tue Oct 10 18:39:21 2023 +1100 Update PR * Update PR commit72a4680035
Author: abraunegg <alex.braunegg@gmail.com> Date: Tue Oct 10 17:43:15 2023 +1100 Update PR * Add --get-file-link * Add --modified-by commit0d3fc3ebf2
Author: abraunegg <alex.braunegg@gmail.com> Date: Tue Oct 10 14:28:10 2023 +1100 Add --display-sync-status * Add --display-sync-status commit1f183ca03e
Author: abraunegg <alex.braunegg@gmail.com> Date: Mon Oct 9 08:18:13 2023 +1100 Update PR * Update PR with doc updates commitb0628d7099
Author: abraunegg <alex.braunegg@gmail.com> Date: Sun Oct 8 10:52:52 2023 +1100 Update PR * Update PR commit7e3df956ce
Author: abraunegg <alex.braunegg@gmail.com> Date: Sat Oct 7 05:31:26 2023 +1100 Update PR * Update PR commitc69f2abc4b
Author: abraunegg <alex.braunegg@gmail.com> Date: Sat Oct 7 05:28:28 2023 +1100 Update PR * Update PR commitea1ca33374
Author: abraunegg <alex.braunegg@gmail.com> Date: Fri Oct 6 14:57:51 2023 +1100 Update PR * Update PR commit1503f969df
Author: abraunegg <alex.braunegg@gmail.com> Date: Fri Oct 6 09:19:04 2023 +1100 Update PR * Update PR commit5127464f2c
Author: abraunegg <alex.braunegg@gmail.com> Date: Fri Oct 6 06:48:20 2023 +1100 Change when the integrity check is performed * Change when the integrity check is performed commitc7cc45d95c
Author: abraunegg <alex.braunegg@gmail.com> Date: Thu Oct 5 19:40:05 2023 +1100 Update maxInotifyWatches location * Update maxInotifyWatches location commitc44ad963a6
Author: abraunegg <alex.braunegg@gmail.com> Date: Thu Oct 5 17:41:31 2023 +1100 Update main.d * Fix --version segfault commit51f0ffcb1f
Author: abraunegg <alex.braunegg@gmail.com> Date: Thu Oct 5 17:24:30 2023 +1100 Uplift to v2.5.0-alpha-2 * Uplift to v2.5.0-alpha-2 commitcbe3e6ea84
Author: abraunegg <alex.braunegg@gmail.com> Date: Thu Oct 5 17:17:26 2023 +1100 Clean up before onedrive-v2.5.0-alpha-2 * Clean up before onedrive-v2.5.0-alpha-2
78 lines
2.3 KiB
D
78 lines
2.3 KiB
D
// What is this module called?
|
|
module qxor;
|
|
|
|
// What does this module require to function?
|
|
import std.algorithm;
|
|
import std.digest;
|
|
|
|
// Implementation of the QuickXorHash algorithm in D
|
|
// https://github.com/OneDrive/onedrive-api-docs/blob/live/docs/code-snippets/quickxorhash.md
|
|
struct QuickXor
|
|
{
|
|
private enum int widthInBits = 160;
|
|
private enum size_t lengthInBytes = (widthInBits - 1) / 8 + 1;
|
|
private enum size_t lengthInQWords = (widthInBits - 1) / 64 + 1;
|
|
private enum int bitsInLastCell = widthInBits % 64; // 32
|
|
private enum int shift = 11;
|
|
|
|
private ulong[lengthInQWords] _data;
|
|
private ulong _lengthSoFar;
|
|
private int _shiftSoFar;
|
|
|
|
nothrow @safe void put(scope const(ubyte)[] array...)
|
|
{
|
|
int vectorArrayIndex = _shiftSoFar / 64;
|
|
int vectorOffset = _shiftSoFar % 64;
|
|
immutable size_t iterations = min(array.length, widthInBits);
|
|
|
|
for (size_t i = 0; i < iterations; i++) {
|
|
immutable bool isLastCell = vectorArrayIndex == _data.length - 1;
|
|
immutable int bitsInVectorCell = isLastCell ? bitsInLastCell : 64;
|
|
|
|
if (vectorOffset <= bitsInVectorCell - 8) {
|
|
for (size_t j = i; j < array.length; j += widthInBits) {
|
|
_data[vectorArrayIndex] ^= cast(ulong) array[j] << vectorOffset;
|
|
}
|
|
} else {
|
|
int index1 = vectorArrayIndex;
|
|
int index2 = isLastCell ? 0 : (vectorArrayIndex + 1);
|
|
ubyte low = cast(ubyte) (bitsInVectorCell - vectorOffset);
|
|
|
|
ubyte xoredByte = 0;
|
|
for (size_t j = i; j < array.length; j += widthInBits) {
|
|
xoredByte ^= array[j];
|
|
}
|
|
|
|
_data[index1] ^= cast(ulong) xoredByte << vectorOffset;
|
|
_data[index2] ^= cast(ulong) xoredByte >> low;
|
|
}
|
|
|
|
vectorOffset += shift;
|
|
if (vectorOffset >= bitsInVectorCell) {
|
|
vectorArrayIndex = isLastCell ? 0 : vectorArrayIndex + 1;
|
|
vectorOffset -= bitsInVectorCell;
|
|
}
|
|
}
|
|
|
|
_shiftSoFar = cast(int) (_shiftSoFar + shift * (array.length % widthInBits)) % widthInBits;
|
|
_lengthSoFar += array.length;
|
|
|
|
}
|
|
|
|
nothrow @safe void start()
|
|
{
|
|
_data = _data.init;
|
|
_shiftSoFar = 0;
|
|
_lengthSoFar = 0;
|
|
}
|
|
|
|
nothrow @trusted ubyte[lengthInBytes] finish()
|
|
{
|
|
ubyte[lengthInBytes] tmp;
|
|
tmp[0 .. lengthInBytes] = (cast(ubyte*) _data)[0 .. lengthInBytes];
|
|
for (size_t i = 0; i < 8; i++) {
|
|
tmp[lengthInBytes - 8 + i] ^= (cast(ubyte*) &_lengthSoFar)[i];
|
|
}
|
|
return tmp;
|
|
}
|
|
} |