Searched refs:left (Results 26 - 38 of 38) sorted by relevance

12

/gem5/src/systemc/ext/dt/misc/
H A Dsc_concatref.hh41 mixed mode concatenations on the left and right sides of an assignment.
125 initialize(sc_value_base &left, sc_value_base &right) argument
127 bool left_xz; // True if x's and/or z's found in left.
130 m_left_p = (sc_value_base *)&left;
133 m_len = left.concat_length(&left_xz) + m_len_r;
139 initialize(const sc_value_base &left, const sc_value_base &right) argument
141 bool left_xz; // True if x's and/or z's found in left.
144 m_left_p = (sc_value_base *)&left;
147 m_len = left.concat_length(&left_xz) + m_len_r;
/gem5/src/base/
H A Dinet.hh125 bool operator==(const EthAddr &left, const EthAddr &right);
210 bool operator==(const IpAddress &left, const IpAddress &right);
230 bool operator==(const IpNetmask &left, const IpNetmask &right);
250 bool operator==(const IpWithPort &left, const IpWithPort &right);
H A Dcprintf_formats.hh133 out.setf(std::ios::left);
236 out.setf(std::ios::left);
/gem5/src/cpu/
H A Dtiming_expr.cc126 uint64_t left_value = left->eval(context);
H A Dexetrace.cc118 outs << setw(26) << left;
/gem5/ext/googletest/googletest/src/
H A Dgtest.cc1028 std::vector<EditType> CalculateOptimalEdits(const std::vector<size_t>& left, argument
1031 left.size() + 1, std::vector<double>(right.size() + 1));
1033 left.size() + 1, std::vector<EditType>(right.size() + 1));
1040 // Populate for empty left.
1046 for (size_t l_i = 0; l_i < left.size(); ++l_i) {
1048 if (left[l_i] == right[r_i]) {
1075 for (size_t l_i = left.size(), r_i = right.size(); l_i > 0 || r_i > 0;) {
1105 const std::vector<std::string>& left,
1110 for (size_t i = 0; i < left.size(); ++i) {
1111 left_ids.push_back(intern_table.GetId(left[
1104 CalculateOptimalEdits( const std::vector<std::string>& left, const std::vector<std::string>& right) argument
1203 CreateUnifiedDiff(const std::vector<std::string>& left, const std::vector<std::string>& right, size_t context) argument
[all...]
/gem5/ext/googletest/googletest/include/gtest/internal/
H A Dgtest-internal.h175 // Returns the optimal edits to go from 'left' to 'right'.
182 const std::vector<size_t>& left, const std::vector<size_t>& right);
186 const std::vector<std::string>& left,
190 GTEST_API_ std::string CreateUnifiedDiff(const std::vector<std::string>& left,
196 // Calculate the diff between 'left' and 'right' and return it in unified diff
199 // in left + right.
200 GTEST_API_ std::string DiffStrings(const std::string& left,
/gem5/ext/systemc/src/sysc/datatypes/int/
H A Dsc_nbcommon.inc2737 // reversing is "read bits out of d from left to right and push
2743 // Deletions will start from the left end and move one position
2754 // Insertion to digit will always occur at the left end.
2759 // Deletions will start from the left end and move one position
2885 // reversing is "read bits out of d from left to right and push
2891 // Deletions will start from the left end and move one position
2902 // Insertion to digit will always occur at the left end.
2907 // Deletions will start from the left end and move one position
H A Dsc_nbutils.cpp249 int src_i; // Index in src_p now accessing (left to right).
250 int src_n; // Length of source that is left in bits.
251 int word_i; // Bit within word now accessing (left to right).
286 // We stride right to left through the source in BITS_PER_DIGIT chunks.
287 // Each of those chunks is processed from left to right a bit at a time.
384 int src_i; // Index in src_p now accessing (left to right).
385 int src_n; // Length of source that is left in bits.
386 int word_i; // Bit within word now accessing (left to right).
421 // We stride right to left through the source in BITS_PER_DIGIT chunks.
422 // Each of those chunks is processed from left t
[all...]
/gem5/configs/common/cores/arm/
H A DHPI.py116 def bin(op, left, right):
120 ret.left = left(env)
497 ('left', un('SignExtend32To64', int_reg(src(4)))),
500 bin('SLessThan', ref('left'), literal(0)),
502 ('left_size', un('SizeInBits', un('Abs', ref('left')))),
520 ('left', un('SignExtend32To64', int_reg(src(0)))),
523 bin('SLessThan', ref('left'), literal(0)),
525 ('left_size', un('SizeInBits', un('Abs', ref('left')))),
782 ('left', int_re
[all...]
/gem5/src/systemc/dt/int/
H A Dsc_nbutils.cc263 int src_i; // Index in src_p now accessing (left to right).
264 int src_n; // Length of source that is left in bits.
265 int word_i; // Bit within word now accessing (left to right).
299 // We stride right to left through the source in BITS_PER_DIGIT chunks.
300 // Each of those chunks is processed from left to right a bit at a time.
392 int src_i; // Index in src_p now accessing (left to right).
393 int src_n; // Length of source that is left in bits.
394 int word_i; // Bit within word now accessing (left to right).
426 // We stride right to left through the source in BITS_PER_DIGIT chunks.
427 // Each of those chunks is processed from left t
[all...]
/gem5/ext/googletest/googletest/test/
H A Dgtest_unittest.cc3479 const char* left; member in struct:__anon65::Case
3509 for (const Case* c = kCases; c->left; ++c) {
3511 EditsToString(CalculateOptimalEdits(CharsToIndices(c->left),
3513 << "Left <" << c->left << "> Right <" << c->right << "> Edits <"
3515 CharsToIndices(c->left), CharsToIndices(c->right))) << ">";
3516 EXPECT_TRUE(c->expected_diff == CreateUnifiedDiff(CharsToLines(c->left),
3518 << "Left <" << c->left << "> Right <" << c->right << "> Diff <"
3519 << CreateUnifiedDiff(CharsToLines(c->left), CharsToLines(c->right))
3576 const std::string left(
3581 EqFailure("left", "righ
[all...]
/gem5/ext/googletest/googlemock/include/gmock/
H A Dgmock-matchers.h2758 typename LhsStlContainer::const_iterator left = lhs_stl_container.begin(); local
2760 for (size_t i = 0; i != actual_size; ++i, ++left, ++right) {
2761 const InnerMatcherArg value_pair(*left, *right);
2768 UniversalPrint(*left, listener->stream());
3275 // adds 1 to that number; returns false if incrementing the graph left it

Completed in 90 milliseconds

12