| /scripts/include/ |
| A D | list.h | 320 #define HLIST_HEAD_INIT { .first = NULL }
321 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
389 struct hlist_node *first = h->first; in hlist_add_head() local
391 n->next = first; in hlist_add_head()
392 if (first) in hlist_add_head()
393 first->pprev = &n->next; in hlist_add_head()
394 h->first = n; in hlist_add_head()
395 n->pprev = &h->first; in hlist_add_head()
412 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
424 for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\
|
| A D | list_types.h | 10 struct hlist_node *first; member
|
| /scripts/ |
| A D | headerdep.pl | 124 my $first = shift @$cycle;
138 $first->[1], $first->[0];
|
| A D | git.orderFile | 4 # by diffing the important stuff like header changes first.
|
| A D | subarch.include | 2 # first, and if a usermode build is happening, the "ARCH=um" on the command
|
| A D | dev-needs.sh | 15 parents) of these devices. It does a breadth first search of the dependency
21 It also takes an optional modifier flag as the first parameter to change
|
| A D | get_maintainer.pl | 2503 my $first = $nw[@nw - 3];
2507 if (((length($first) == 1 && $first =~ m/\p{L}/) ||
2508 (length($first) == 2 && substr($first, -1) eq ".")) ||
2511 $name = "$first $middle $last";
|
| A D | checkpatch.pl | 3543 my $first = $1;
3547 if ($first =~ /(?:struct|union|enum)/) {
3552 next if (lc($first) ne lc($second));
3553 next if ($first eq 'long');
3565 if ($first =~ /\b[0-9a-f]{2,}\b/i) {
3566 next if (!exists($allow_repeated_words{lc($first)}));
3570 "Possible repeated word: '$first'\n" . $herecurr) &&
3572 $fixed[$fixlinenr] =~ s/\b$first $second\b/$first/;
6027 my $first = 1;
6031 if ($first) {
[all …]
|
| /scripts/gdb/linux/ |
| A D | modules.py | 93 first = True
97 separator=" " if first else ",",
99 first = False
|
| A D | mapletree.py | 35 def __init__(self, mt, first, end): argument
42 self.index = first
|
| /scripts/dtc/ |
| A D | srcpos.c | 316 char *pos_str, *fresh_fname = NULL, *first, *rest; in srcpos_string_comment() local
343 xasprintf(&first, "%s:%d:%d-%d:%d", fname, in srcpos_string_comment()
347 xasprintf(&first, "%s:%d", fname, in srcpos_string_comment()
355 xasprintf(&pos_str, "%s, %s", first, rest); in srcpos_string_comment()
356 free(first); in srcpos_string_comment()
359 pos_str = first; in srcpos_string_comment()
|
| A D | livetree.c | 67 assert(first->next == NULL); in chain_property()
69 first->next = list; in chain_property()
70 return first; in chain_property()
73 struct property *reverse_properties(struct property *first) in reverse_properties() argument
75 struct property *p = first; in reverse_properties()
261 assert(first->next_sibling == NULL); in chain_node()
263 first->next_sibling = list; in chain_node()
264 return first; in chain_node()
374 assert(first->next == NULL); in chain_reserve_entry()
376 first->next = list; in chain_reserve_entry()
[all …]
|
| A D | dt_to_config | 1046 my $first = 1;
1048 if ($first) {
1051 $first = 0;
1072 my $first = 1;
1074 if ($first) {
1077 $first = 0;
|
| A D | dtc.h | 266 struct property *chain_property(struct property *first, struct property *list);
267 struct property *reverse_properties(struct property *first);
275 struct node *chain_node(struct node *first, struct node *list);
317 struct reserve_info *chain_reserve_entry(struct reserve_info *first,
|
| A D | dtx_diff | 47 If DTx contains the binary blob magic value in the first four bytes,
|
| /scripts/kconfig/tests/preprocess/builtin_func/ |
| A D | Kconfig | 6 # 'warning-if', if the first argument is y, sends the second argument to stderr,
11 # The following is just no-op since the first argument is not y.
|
| /scripts/coccinelle/iterators/ |
| A D | list_entry_update.cocci | 2 /// list_for_each_entry uses its first argument to get from one element of
4 /// The first rule finds such a reassignment and the second rule checks
|
| A D | itnull.cocci | 2 /// Many iterators have the property that the first argument is always bound
|
| /scripts/coccinelle/misc/ |
| A D | array_size.cocci | 5 //# where there is a division of sizeof the array by the sizeof its first
|
| A D | doubleinit.cocci | 53 msg = "%s: first occurrence line %s, second occurrence line %s" % (fld,ps[0].line,pr[0].line)
|
| A D | array_size_dup.cocci | 7 /// From security point of view only first case is relevant. These functions
|
| /scripts/coccinelle/locks/ |
| A D | call_kern.cocci | 5 //# function under the lock in the first place.
|
| /scripts/mod/ |
| A D | modpost.c | 1975 int first = 1; in add_depends() local
1995 buf_printf(b, "%s%s", first ? "" : ",", p); in add_depends()
1996 first = 0; in add_depends()
|
| /scripts/kconfig/ |
| A D | qconf.cc | 418 ConfigItem* item = (ConfigItem*)selectedItems().first(); in updateSelection()
811 if (x >= off && x < off + icon.availableSizes().first().width()) { in mouseReleaseEvent()
|