shaba/systemd-stable
1
1
Fork 0
mirror of https://github.com/systemd/systemd-stable.git synced 2024-12-22 13:33:56 +03:00
Code
f21e2ecb8b
systemd-stable/coccinelle/strempty.cocci

61 lines
948 B
Plaintext
Raw Normal View History

Add Coccinelle patch for strempty() usage
2015-09-30 13:23:57 +03:00
@@
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
/* Avoid running this transformation on the strempty function itself */
position p : script:python() { p[0].current_element != "strempty" };
Add Coccinelle patch for strempty() usage
2015-09-30 13:23:57 +03:00
expression s;
@@
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
(
- s@p ?: ""
Add Coccinelle patch for strempty() usage
2015-09-30 13:23:57 +03:00
+ strempty(s)
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
|
- s@p ? s : ""
Add Coccinelle patch for strempty() usage
2015-09-30 13:23:57 +03:00
+ strempty(s)
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
)
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
@@
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
position p : script:python() { p[0].current_element != "strempty" };
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
expression s;
@@
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
- if (!s@p)
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
- s = "";
+ s = strempty(s);
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
@@
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
position p : script:python() { p[0].current_element != "strnull" };
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
expression s;
@@
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
(
- s@p ?: "(null)"
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
+ strnull(s)
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
|
- s@p ? s : "(null)"
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
+ strnull(s)
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
)
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
@@
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
position p : script:python() { p[0].current_element != "strnull" };
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
expression s;
@@
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
- if (!s@p)
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
- s = "(null)";
+ s = strnull(s);
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
@@
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
position p : script:python() { p[0].current_element != "strna" };
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
expression s;
@@
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
(
- s@p ?: "n/a"
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
+ strna(s)
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
|
- s@p ? s : "n/a"
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
+ strna(s)
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
)
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
@@
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
position p : script:python() { p[0].current_element != "strna" };
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
expression s;
@@
coccinelle: ignore function transformations causing recursion For example, following transformation: - isempty(s) ? NULL : s + empty_to_null(s) would get applied to the empty_to_null function itself as well, causing an infinite recursion, like: --- src/basic/string-util.h +++ /tmp/cocci-output-307-9f76e6-string-util.h @@ -50,11 +50,11 @@ static inline bool isempty(const char *p } static inline const char *empty_to_null(const char *p) { - return isempty(p) ? NULL : p; + return empty_to_null(p); } Let's avoid that by checking the current match position
2019-04-28 18:13:29 +03:00
- if (!s@p)
cocci: use strempty() at more places This shortens the code by a few lines.
2018-01-10 19:11:19 +03:00
- s = "n/a";
+ s = strna(s);
Copy Permalink