diff options
| author |  Fred-Barclay <Fred-Barclay@users.noreply.github.com> | 2017-11-19 15:02:42 -0600 |
|---|---|---|
| committer | Fred-Barclay <Fred-Barclay@users.noreply.github.com> | 2017-11-19 15:02:42 -0600 |
| commit | b936e5ab77dfa0b54b2f6f6dd53762a8244e4230 (patch) | |
| tree | edb7237ba54d7c2a85a8531c8901d6466c5e0e4d /src/firemon | |
| parent | More qtox profile tightening (diff) | |
| download | firejail-b936e5ab77dfa0b54b2f6f6dd53762a8244e4230.tar.gz firejail-b936e5ab77dfa0b54b2f6f6dd53762a8244e4230.tar.zst firejail-b936e5ab77dfa0b54b2f6f6dd53762a8244e4230.zip | |
strip trailing whitespace
Diffstat (limited to 'src/firemon')
| -rw-r--r-- | src/firemon/firemon.c | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/src/firemon/firemon.c b/src/firemon/firemon.c index 1f3fdd578..6f7356729 100644 --- a/src/firemon/firemon.c +++ b/src/firemon/firemon.c | |||
| @@ -56,15 +56,15 @@ static void my_handler(int s){ | |||
| 56 | // return -1 if not found | 56 | // return -1 if not found |
| 57 | // | 57 | // |
| 58 | // Example: | 58 | // Example: |
| 59 | //14776:netblue:/usr/bin/firejail /usr/bin/transmission-qt | 59 | //14776:netblue:/usr/bin/firejail /usr/bin/transmission-qt |
| 60 | // 14777:netblue:/usr/bin/firejail /usr/bin/transmission-qt | 60 | // 14777:netblue:/usr/bin/firejail /usr/bin/transmission-qt |
| 61 | // 14792:netblue:/usr/bin/transmission-qt | 61 | // 14792:netblue:/usr/bin/transmission-qt |
| 62 | // We need 14792, the first real sandboxed process | 62 | // We need 14792, the first real sandboxed process |
| 63 | int find_child(int id) { | 63 | int find_child(int id) { |
| 64 | int i; | 64 | int i; |
| 65 | int first_child = -1; | 65 | int first_child = -1; |
| 66 | 66 | ||
| 67 | // find the first child | 67 | // find the first child |
| 68 | for (i = 0; i < max_pids; i++) { | 68 | for (i = 0; i < max_pids; i++) { |
| 69 | if (pids[i].level == 2 && pids[i].parent == id) { | 69 | if (pids[i].level == 2 && pids[i].parent == id) { |
| 70 | first_child = i; | 70 | first_child = i; |
| @@ -74,13 +74,13 @@ int find_child(int id) { | |||
| 74 | 74 | ||
| 75 | if (first_child == -1) | 75 | if (first_child == -1) |
| 76 | return -1; | 76 | return -1; |
| 77 | 77 | ||
| 78 | // find the second child | 78 | // find the second child |
| 79 | for (i = 0; i < max_pids; i++) { | 79 | for (i = 0; i < max_pids; i++) { |
| 80 | if (pids[i].level == 3 && pids[i].parent == first_child) | 80 | if (pids[i].level == 3 && pids[i].parent == first_child) |
| 81 | return i; | 81 | return i; |
| 82 | } | 82 | } |
| 83 | 83 | ||
| 84 | return -1; | 84 | return -1; |
| 85 | } | 85 | } |
| 86 | 86 | ||