Skip to content

Dev dai #8

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
fishheader merged 3 commits into from
Apr 1, 2021
Merged

Dev dai #8

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
a4f05a0
Alter #define ... -> #pragma once; Update Lost Update and IAT Step ex…
Apr 1, 2021
62b8d10
Support \g a, b, c
Apr 1, 2021
fa8b3e3
Merge branch 'dev' into dev-DAI
Apr 1, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 1 addition & 5 deletions contrib/deneva/unified_concurrency_control/alg_dli_identify_chain.h
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,4 @@
//#pragma once
#ifndef TTTS_DENEVA_ALG_DLI_IDENTIFY_CHAIN_H_
#define TTTS_DENEVA_ALG_DLI_IDENTIFY_CHAIN_H_
#pragma once

#include "dli_identify_util.h"
#include "row_prece.h"
Expand Down Expand Up @@ -136,5 +134,3 @@ class AlgManager<ALG, Data, typename std::enable_if_t<ALG == UniAlgs::UNI_DLI_ID
};

}

#endif // TTTS_DENEVA_ALG_DLI_IDENTIFY_CHAIN_H_
1 change: 0 additions & 1 deletion contrib/deneva/unified_concurrency_control/alg_dli_identify_cycle.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -199,4 +199,3 @@ class AlgManager<ALG, Data, typename std::enable_if_t<ALG == UniAlgs::UNI_DLI_ID
};

}

1 change: 0 additions & 1 deletion contrib/deneva/unified_concurrency_control/dli_identify_util.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -247,4 +247,3 @@ static AnomalyType IdentifyAnomalyMultiple(const std::vector<PreceInfo>& preces)
}

}

5 changes: 1 addition & 4 deletions contrib/deneva/unified_concurrency_control/row_prece.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,8 +8,7 @@
*
*/

#ifndef TTTS_DENEVA_ROW_PRECE_H_
#define TTTS_DENEVA_ROW_PRECE_H_
#pragma once

#include <mutex>
#include <unordered_map>
Expand Down Expand Up @@ -359,5 +358,3 @@ class RowManager<ALG, Data, typename std::enable_if_t<ALG == UniAlgs::UNI_DLI_ID
};

}

#endif // TTTS_DENEVA_ROW_PRECE_H_
1 change: 0 additions & 1 deletion contrib/deneva/unified_concurrency_control/txn_dli_identify.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,4 +35,3 @@ class TxnManager<ALG, Data, typename std::enable_if_t<ALG == UniAlgs::UNI_DLI_ID
};

}

27 changes: 18 additions & 9 deletions src/3ts/backend/anomaly_identify.cc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -58,16 +58,25 @@ int main() {
if (index_space != text.npos) {
std::string input = text.substr(index_space);
Printer::TrimSpace(input);
if ("DLI_IDENTIFY_CYCLE" == input) {
printer.SetAlg(ttts::UniAlgs::UNI_DLI_IDENTIFY_CYCLE);
} else if ("DLI_IDENTIFY_CHAIN" == input) {
printer.SetAlg(ttts::UniAlgs::UNI_DLI_IDENTIFY_CHAIN);
} else if ("ALL" == input) {
printer.SetAlg(ttts::UniAlgs::ALL);
} else {

std::vector<std::string> alg_list;
std::vector<ttts::UniAlgs> alg_type_list;
Checker::split(input, alg_list, ",");
// Check the validity of the input
if (input.find("DLI_IDENTIFY_CYCLE") == input.npos && input.find("DLI_IDENTIFY_CHAIN") == input.npos) {
ret = false;
Printer::Print("Unknown Algorithm");
Printer::Print("Unknown Algorithm, please check algorithm's name");
}
// fill and set alg_type_list
for (auto& alg : alg_list) {
if ("DLI_IDENTIFY_CYCLE" == alg) {
alg_type_list.emplace_back(ttts::UniAlgs::UNI_DLI_IDENTIFY_CYCLE);
} else if ("DLI_IDENTIFY_CHAIN" == alg) {
alg_type_list.emplace_back(ttts::UniAlgs::UNI_DLI_IDENTIFY_CHAIN);
}
}
printer.SetAlgs(alg_type_list);
// print set success info
if (ret) {
std::cout << "Set algorithm success" << std::endl;
}
Expand Down Expand Up @@ -103,7 +112,7 @@ int main() {
} else if (text.find("\\A") != text.npos || text.find("authors") != text.npos) {
Printer::PrintAuthorInfo();
} else if (text.find("R") != text.npos || text.find("W") != text.npos) {
checker.ExecAnomalyIdentify(text, printer.Alg());
checker.ExecAnomalyIdentify(text, printer.Algs());
}
}
return 0;
Expand Down
40 changes: 25 additions & 15 deletions src/3ts/backend/anomaly_identify.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,7 @@ class Printer {
public:
Printer() : anomaly_map_{
{"DirtyWrite", "WAT SDA 'R0a W0a W1a R1a W1a R1a C0 C1' Wi[xm]...Wj[xm+1]"},
{"LostUpdate", "WAT SDA 'R0a R1a W0a R0a W0a W1a C1 C0' Ri[xm]...Wj[xm+1]...Wi[xm+2]"},
{"LostUpdate", "WAT SDA 'R0a R1a W0a R0a W0a W1a A1 C0' Ri[xm]...Wj[xm+1]...Wi[xm+2]"},
{"LostSelfUpdate", "WAT SDA 'R0a W0a R0a W1a R0a W1a C0 C1' Wi[xm]...Wj[xm+1]...Ri[xm+1]"},
{"Full-Write", "WAT SDA 'R0a W0a R1a W1a W0a C0 W1a C1' Wi[xm]...Wj[xm+1]...Wi[xm+2]"},
{"Read-WriteSkew1", "WAT DDA 'R0a W0a R0a R1b W0b W1a C0 C1' Ri[xm]...Wj[xm+1]...Wj[yn]...Wi[yn+1]"},
Expand All @@ -38,7 +38,7 @@ class Printer {
{"Write-ReadSkew", "RAT DDA 'R0a W0a R1a W1b R0b R1a C0 C1' Wi[xm]...Rj[xm]...Wj[yn]...Ri[yn]"},
{"StepRAT", "RAT MDA 'R0a R0b W1a R2a R2c W0c C0 C1 C2' ...Wi[xm]...Rj[xm]..., and not include (...Wii[xm]...Wjj[xm+1]...)"},
{"WriteSkew", "IAT DDA 'R0a R0b R1a W0a R1b W1b C1 C0' Ri[xm]...Wj[xm+1]...Rj[yn]...Wi[yn+1]"},
{"StepIAT", "IAT MDA 'R0a R0b R1c W1a W2c C1 C2 W0c C0' ...Ri[xm]...Wj[xm+1]..., and not include (...Wii[xm]...Rjj[xm]...and ...Wiii[xm]...Wjjj[xm+1]...)"}
{"StepIAT", "IAT MDA 'R0a R0b R1c W1a W2c A1 C2 W0c C0' ...Ri[xm]...Wj[xm+1]..., and not include (...Wii[xm]...Rjj[xm]...and ...Wiii[xm]...Wjjj[xm+1]...)"}
}, info_map_{
{"History", "The sequence of operations that produces the data anomaly, one history contains several operations."},
{"Operation", "One operation contains 3 character, such as R0a, first character is operation type, second character is transaction id, third character is data item.\n Operation Type -> Such as R W C A(R: Read, W: Write, C: Commit, A: Aort)\n Transaction ID -> Such as 0 1 2 ...(must be a number and less than 10)\n Data Item -> Such as a b c ...(must be lowercase letter)"},
Expand Down Expand Up @@ -112,7 +112,7 @@ class Printer {
static void PrintHelpInfo() {
std::cout << "List of all 3TS-DAI commands:" << std::endl;
std::cout << "definition (\\d) Output precise definitions of History and Anomaly, including History Operation WAT RAT IAT SDA DDA MDA, such as '\\d WAT'" << std::endl;
std::cout << "algorithm (\\g) Select the algorithm that identifies the exception, including DLI_IDENTIFY_CYCLE DLI_IDENTIFY_CHAIN ALL, such as '\\g DLI_IDENTIFY_1'" << std::endl;
std::cout << "algorithm (\\g) Select the algorithm that identifies the exception, including DLI_IDENTIFY_CYCLE DLI_IDENTIFY_CHAIN, such as '\\g DLI_IDENTIFY_CYCLE'. If you want to compare different algorithms, you can type such as '\\g DLI_IDENTIFY_CYCLE, DLI_IDENTIFY_CHAIN'" << std::endl;
std::cout << "anomaly (\\a) Output history sequence of anomaly, including " << std::endl;
std::cout << " WAT: Dirty Write, Lost Update, Lost Self Update, Full-Write, Read-Write Skew 1, Read-Write Skew 2, Double-Write Skew 1, Double-Write Skew 2, Full-Write Skew, Step WAT" << std::endl;
std::cout << " RAT: Dirty Read, Non-Repeatable Read, Intermediate Read, Read Skew, Read Skew 2, Write-Read Skew, Step RAT" << std::endl;
Expand All @@ -129,20 +129,31 @@ class Printer {
str.erase(itor, str.end());
}

ttts::UniAlgs Alg() const { return alg_; };
void SetAlg(ttts::UniAlgs alg) { alg_ = alg; };
std::vector<ttts::UniAlgs> Algs() const { return alg_type_list_; };
void SetAlgs(std::vector<ttts::UniAlgs> alg_type_list) { alg_type_list_ = alg_type_list; };

std::unordered_map<std::string, std::string> InfoMap() const { return info_map_; };
std::unordered_map<std::string, std::string> AnomalyMap() const { return anomaly_map_; };
private:
ttts::UniAlgs alg_ = ttts::UniAlgs::UNI_DLI_IDENTIFY_CYCLE;
std::vector<ttts::UniAlgs> alg_type_list_ = {ttts::UniAlgs::UNI_DLI_IDENTIFY_CYCLE};
std::unordered_map<std::string, std::string> info_map_;
std::unordered_map<std::string, std::string> anomaly_map_;
};

class Checker {
public:
void ExecAnomalyIdentify(const std::string& text, ttts::UniAlgs alg_type) {
static void split(const std::string& str, std::vector<std::string>& tokens, const std::string delim) {
tokens.clear();
auto start = str.find_first_not_of(delim, 0);
auto position = str.find_first_of(delim, start);
while (position != std::string::npos || start != std::string::npos) {
tokens.emplace_back(std::move(str.substr(start, position - start)));
start = str.find_first_not_of(delim, position);
position = str.find_first_of(delim, start);
}
}

void ExecAnomalyIdentify(const std::string& text, std::vector<ttts::UniAlgs> alg_type_list) {
ttts::History history;
std::istringstream is(text);

Expand All @@ -152,14 +163,13 @@ class Checker {
};

if ((is >> history)) {
if (alg_type == ttts::UniAlgs::UNI_DLI_IDENTIFY_CYCLE) {
get_and_print_anomaly(ttts::ConflictSerializableAlgorithm<true>(), alg_type);
} else if (alg_type == ttts::UniAlgs::UNI_DLI_IDENTIFY_CHAIN) {
ttts::UnifiedHistoryAlgorithm<ttts::UniAlgs::UNI_DLI_IDENTIFY_CHAIN, uint64_t> alg;
get_and_print_anomaly(ttts::UnifiedHistoryAlgorithm<ttts::UniAlgs::UNI_DLI_IDENTIFY_CHAIN, uint64_t>(), alg_type);
} else if (alg_type == ttts::UniAlgs::ALL) {
get_and_print_anomaly(ttts::ConflictSerializableAlgorithm<true>(), ttts::UniAlgs::UNI_DLI_IDENTIFY_CYCLE);
get_and_print_anomaly(ttts::UnifiedHistoryAlgorithm<ttts::UniAlgs::UNI_DLI_IDENTIFY_CHAIN, uint64_t>(), ttts::UniAlgs::UNI_DLI_IDENTIFY_CHAIN);
for (const auto& alg_type : alg_type_list) {
if (alg_type == ttts::UniAlgs::UNI_DLI_IDENTIFY_CYCLE) {
get_and_print_anomaly(ttts::ConflictSerializableAlgorithm<true>(), alg_type);
} else if (alg_type == ttts::UniAlgs::UNI_DLI_IDENTIFY_CHAIN) {
ttts::UnifiedHistoryAlgorithm<ttts::UniAlgs::UNI_DLI_IDENTIFY_CHAIN, uint64_t> alg;
get_and_print_anomaly(ttts::UnifiedHistoryAlgorithm<ttts::UniAlgs::UNI_DLI_IDENTIFY_CHAIN, uint64_t>(), alg_type);
}
}
}
}
Expand Down