A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
simgrid.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
further replace using statements with typedef ones to please sphinx
[simgrid.git]
/
src
/
mc
/
DwarfExpression.cpp
diff --git
a/src/mc/DwarfExpression.cpp
b/src/mc/DwarfExpression.cpp
index
b20366d
..
8c7885b
100644
(file)
--- a/
src/mc/DwarfExpression.cpp
+++ b/
src/mc/DwarfExpression.cpp
@@
-1,5
+1,4
@@
-/* Copyright (c) 2014-2017. The SimGrid Team.
- * All rights reserved. */
+/* Copyright (c) 2014-2018. The SimGrid Team. All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
@@
-7,10
+6,6
@@
#include <cstddef>
#include <cstdint>
#include <cstddef>
#include <cstdint>
-#include <dwarf.h>
-#include <elfutils/libdw.h>
-#include <libunwind.h>
-
#include "src/mc/AddressSpace.hpp"
#include "src/mc/DwarfExpression.hpp"
#include "src/mc/Frame.hpp"
#include "src/mc/AddressSpace.hpp"
#include "src/mc/DwarfExpression.hpp"
#include "src/mc/Frame.hpp"
@@
-31,6
+26,8
@@
void execute(
for (size_t i = 0; i != n; ++i) {
const Dwarf_Op *op = ops + i;
std::uint8_t atom = op->atom;
for (size_t i = 0; i != n; ++i) {
const Dwarf_Op *op = ops + i;
std::uint8_t atom = op->atom;
+ intptr_t first;
+ intptr_t second;
switch (atom) {
switch (atom) {
@@
-204,19
+201,17
@@
void execute(
// and replace the top of the stack with the computed value
// (stack.top() += stack.before_top()).
// and replace the top of the stack with the computed value
// (stack.top() += stack.before_top()).
- case DW_OP_plus:
{
-
intptr_t first
= stack.pop();
-
intptr_t
second = stack.pop();
+ case DW_OP_plus:
+
first
= stack.pop();
+ second = stack.pop();
stack.push(first + second);
break;
stack.push(first + second);
break;
- }
- case DW_OP_mul:
{
-
intptr_t first
= stack.pop();
-
intptr_t
second = stack.pop();
+ case DW_OP_mul:
+
first
= stack.pop();
+ second = stack.pop();
stack.push(first * second);
break;
stack.push(first * second);
break;
- }
case DW_OP_plus_uconst:
stack.top() += op->number;
case DW_OP_plus_uconst:
stack.top() += op->number;
@@
-230,33
+225,29
@@
void execute(
stack.top() = - (intptr_t) stack.top();
break;
stack.top() = - (intptr_t) stack.top();
break;
- case DW_OP_minus:
{
-
intptr_t first
= stack.pop();
-
intptr_t
second = stack.pop();
+ case DW_OP_minus:
+
first
= stack.pop();
+ second = stack.pop();
stack.push(second - first);
break;
stack.push(second - first);
break;
- }
- case DW_OP_and:
{
-
intptr_t first
= stack.pop();
-
intptr_t
second = stack.pop();
+ case DW_OP_and:
+
first
= stack.pop();
+ second = stack.pop();
stack.push(first & second);
break;
stack.push(first & second);
break;
- }
- case DW_OP_or:
{
-
intptr_t first
= stack.pop();
-
intptr_t
second = stack.pop();
+ case DW_OP_or:
+
first
= stack.pop();
+ second = stack.pop();
stack.push(first | second);
break;
stack.push(first | second);
break;
- }
- case DW_OP_xor:
{
-
intptr_t first
= stack.pop();
-
intptr_t
second = stack.pop();
+ case DW_OP_xor:
+
first
= stack.pop();
+ second = stack.pop();
stack.push(first ^ second);
break;
stack.push(first ^ second);
break;
- }
case DW_OP_nop:
break;
case DW_OP_nop:
break;