OpenCoverage

readtokens0.c

Absolute File Name:/home/opencoverage/opencoverage/guest-scripts/coreutils/src/gnulib/lib/readtokens0.c
Switch to Source codePreprocessed file
LineSourceCount
1-
2-
3-
4-
5-
6-
7void-
8readtokens0_init (struct Tokens *t)-
9{-
10 t->n_tok = 0;-
11 t->tok = -
12 ((void *)0)-
13 ;-
14 t->tok_len = -
15 ((void *)0)-
16 ;-
17 _obstack_begin ((&t->o_data), 0, 0, (malloc), (free));-
18 _obstack_begin ((&t->o_tok), 0, 0, (malloc), (free));-
19 _obstack_begin ((&t->o_tok_len), 0, 0, (malloc), (free));-
20}
executed 21 times by 2 tests: end of block
Executed by:
  • sort
  • wc
21
21-
22void-
23readtokens0_free (struct Tokens *t)-
24{-
25 __extension__ ({ struct obstack *__o = (&t->o_data); void *__obj = (void *) (-
26 ((void *)0)-
27 ); if (__obj > (void *) __o->chunk
__obj > (void *) __o->chunkDescription
TRUEnever evaluated
FALSEevaluated 11 times by 1 test
Evaluated by:
  • wc
&& __obj < (void *) __o->chunk_limit
__obj < (void ...o->chunk_limitDescription
TRUEnever evaluated
FALSEnever evaluated
) __o->next_free = __o->object_base = (char *) __obj;
never executed: __o->next_free = __o->object_base = (char *) __obj;
else _obstack_free (__o, __obj);
executed 11 times by 1 test: _obstack_free (__o, __obj);
Executed by:
  • wc
});
0-11
28 __extension__ ({ struct obstack *__o = (&t->o_tok); void *__obj = (void *) (-
29 ((void *)0)-
30 ); if (__obj > (void *) __o->chunk
__obj > (void *) __o->chunkDescription
TRUEnever evaluated
FALSEevaluated 11 times by 1 test
Evaluated by:
  • wc
&& __obj < (void *) __o->chunk_limit
__obj < (void ...o->chunk_limitDescription
TRUEnever evaluated
FALSEnever evaluated
) __o->next_free = __o->object_base = (char *) __obj;
never executed: __o->next_free = __o->object_base = (char *) __obj;
else _obstack_free (__o, __obj);
executed 11 times by 1 test: _obstack_free (__o, __obj);
Executed by:
  • wc
});
0-11
31 __extension__ ({ struct obstack *__o = (&t->o_tok_len); void *__obj = (void *) (-
32 ((void *)0)-
33 ); if (__obj > (void *) __o->chunk
__obj > (void *) __o->chunkDescription
TRUEnever evaluated
FALSEevaluated 11 times by 1 test
Evaluated by:
  • wc
&& __obj < (void *) __o->chunk_limit
__obj < (void ...o->chunk_limitDescription
TRUEnever evaluated
FALSEnever evaluated
) __o->next_free = __o->object_base = (char *) __obj;
never executed: __o->next_free = __o->object_base = (char *) __obj;
else _obstack_free (__o, __obj);
executed 11 times by 1 test: _obstack_free (__o, __obj);
Executed by:
  • wc
});
0-11
34}
executed 11 times by 1 test: end of block
Executed by:
  • wc
11
35-
36-
37-
38static void-
39save_token (struct Tokens *t)-
40{-
41-
42 size_t len = __extension__ ({ struct obstack const *__o = (&t->o_data); (size_t) (__o->next_free - __o->object_base); }) - 1;-
43 char const *s = __extension__ ({ struct obstack *__o1 = (&t->o_data); void *__value = (void *) __o1->object_base; if (__o1->next_free == __value
__o1->next_free == __valueDescription
TRUEnever evaluated
FALSEevaluated 28 times by 2 tests
Evaluated by:
  • sort
  • wc
) __o1->maybe_empty_object = 1;
never executed: __o1->maybe_empty_object = 1;
__o1->next_free = ((sizeof (ptrdiff_t) < sizeof (void *)
sizeof (ptrdif...izeof (void *)Description
TRUEnever evaluated
FALSEevaluated 28 times by 2 tests
Evaluated by:
  • sort
  • wc
? (__o1->object_base) : (char *) 0) + (((__o1->next_free) - (sizeof (ptrdiff_t) < sizeof (void *)
sizeof (ptrdif...izeof (void *)Description
TRUEnever evaluated
FALSEevaluated 28 times by 2 tests
Evaluated by:
  • sort
  • wc
? (__o1->object_base) : (char *) 0) + (__o1->alignment_mask)) & ~(__o1->alignment_mask))); if ((
(size_t) (__o1...) __o1->chunk)Description
TRUEnever evaluated
FALSEevaluated 28 times by 2 tests
Evaluated by:
  • sort
  • wc
size_t) (__o1->next_free - (char *) __o1->chunk) > (size_t) (__o1->chunk_limit - (char *) __o1->chunk)
(size_t) (__o1...) __o1->chunk)Description
TRUEnever evaluated
FALSEevaluated 28 times by 2 tests
Evaluated by:
  • sort
  • wc
) __o1->next_free = __o1->chunk_limit;
never executed: __o1->next_free = __o1->chunk_limit;
__o1->object_base = __o1->next_free; __value; });
0-28
44 __extension__ ({ struct obstack *__o = (&t->o_tok); if (__extension__ ({ struct obstack const *__o1 = (__o); (size_t) (__o1->chunk_limit - __o1->next_free); }) < sizeof (void *)
__extension__ ...izeof (void *)Description
TRUEnever evaluated
FALSEevaluated 28 times by 2 tests
Evaluated by:
  • sort
  • wc
) _obstack_newchunk (__o, sizeof (void *));
never executed: _obstack_newchunk (__o, sizeof (void *));
__extension__ ({ struct obstack *__o1 = (__o); void *__p1 = __o1->next_free; *(const void **) __p1 = (s); __o1->next_free += sizeof (const void *); (void) 0; }); });
0-28
45 __extension__ ({ struct obstack *__o = (&t->o_tok_len); size_t __len = (sizeof len); if (__extension__ ({ struct obstack const *__o1 = (__o); (size_t) (__o1->chunk_limit - __o1->next_free); }) < __len
__extension__ ...e); }) < __lenDescription
TRUEnever evaluated
FALSEevaluated 28 times by 2 tests
Evaluated by:
  • sort
  • wc
) _obstack_newchunk (__o, __len);
never executed: _obstack_newchunk (__o, __len);
memcpy (__o->next_free, &len, __len); __o->next_free += __len; (void) 0; });
0-28
46 t->n_tok++;-
47}
executed 28 times by 2 tests: end of block
Executed by:
  • sort
  • wc
28
48-
49-
50-
51-
52-
53-
54_Bool-
55-
56readtokens0 (FILE *in, struct Tokens *t)-
57{-
58-
59 while (1)-
60 {-
61 int c = fgetc (in);-
62 if (c ==
c == (-1)Description
TRUEevaluated 21 times by 2 tests
Evaluated by:
  • sort
  • wc
FALSEevaluated 46 times by 2 tests
Evaluated by:
  • sort
  • wc
21-46
63 (-1)
c == (-1)Description
TRUEevaluated 21 times by 2 tests
Evaluated by:
  • sort
  • wc
FALSEevaluated 46 times by 2 tests
Evaluated by:
  • sort
  • wc
21-46
64 )-
65 {-
66 size_t len = __extension__ ({ struct obstack const *__o = (&t->o_data); (size_t) (__o->next_free - __o->object_base); });-
67-
68-
69-
70 if (len
lenDescription
TRUEevaluated 6 times by 2 tests
Evaluated by:
  • sort
  • wc
FALSEevaluated 15 times by 2 tests
Evaluated by:
  • sort
  • wc
)
6-15
71 {-
72 __extension__ ({ struct obstack *__o = (&t->o_data); if (__extension__ ({ struct obstack const *__o1 = (__o); (size_t) (__o1->chunk_limit - __o1->next_free); }) < 1
__extension__ ..._free); }) < 1Description
TRUEnever evaluated
FALSEevaluated 6 times by 2 tests
Evaluated by:
  • sort
  • wc
) _obstack_newchunk (__o, 1);
never executed: _obstack_newchunk (__o, 1);
((void) (*((__o)->next_free)++ = ('\0'))); });
0-6
73 save_token (t);-
74 }
executed 6 times by 2 tests: end of block
Executed by:
  • sort
  • wc
6
75-
76 break;
executed 21 times by 2 tests: break;
Executed by:
  • sort
  • wc
21
77 }-
78-
79 __extension__ ({ struct obstack *__o = (&t->o_data); if (__extension__ ({ struct obstack const *__o1 = (__o); (size_t) (__o1->chunk_limit - __o1->next_free); }) < 1
__extension__ ..._free); }) < 1Description
TRUEnever evaluated
FALSEevaluated 46 times by 2 tests
Evaluated by:
  • sort
  • wc
) _obstack_newchunk (__o, 1);
never executed: _obstack_newchunk (__o, 1);
((void) (*((__o)->next_free)++ = (c))); });
0-46
80 if (c == '\0'
c == '\0'Description
TRUEevaluated 22 times by 2 tests
Evaluated by:
  • sort
  • wc
FALSEevaluated 24 times by 2 tests
Evaluated by:
  • sort
  • wc
)
22-24
81 save_token (t);
executed 22 times by 2 tests: save_token (t);
Executed by:
  • sort
  • wc
22
82 }
executed 46 times by 2 tests: end of block
Executed by:
  • sort
  • wc
46
83-
84-
85-
86 __extension__ ({ struct obstack *__o = (&t->o_tok); if (__extension__ ({ struct obstack const *__o1 = (__o); (size_t) (__o1->chunk_limit - __o1->next_free); }) < sizeof (void *)
__extension__ ...izeof (void *)Description
TRUEnever evaluated
FALSEevaluated 21 times by 2 tests
Evaluated by:
  • sort
  • wc
) _obstack_newchunk (__o, sizeof (void *));
never executed: _obstack_newchunk (__o, sizeof (void *));
__extension__ ({ struct obstack *__o1 = (__o); void *__p1 = __o1->next_free; *(const void **) __p1 = (
0-21
87 ((void *)0)-
88 ); __o1->next_free += sizeof (const void *); (void) 0; }); });-
89-
90 t->tok = __extension__ ({ struct obstack *__o1 = (&t->o_tok); void *__value = (void *) __o1->object_base; if (__o1->next_free == __value
__o1->next_free == __valueDescription
TRUEnever evaluated
FALSEevaluated 21 times by 2 tests
Evaluated by:
  • sort
  • wc
) __o1->maybe_empty_object = 1;
never executed: __o1->maybe_empty_object = 1;
__o1->next_free = ((sizeof (ptrdiff_t) < sizeof (void *)
sizeof (ptrdif...izeof (void *)Description
TRUEnever evaluated
FALSEevaluated 21 times by 2 tests
Evaluated by:
  • sort
  • wc
? (__o1->object_base) : (char *) 0) + (((__o1->next_free) - (sizeof (ptrdiff_t) < sizeof (void *)
sizeof (ptrdif...izeof (void *)Description
TRUEnever evaluated
FALSEevaluated 21 times by 2 tests
Evaluated by:
  • sort
  • wc
? (__o1->object_base) : (char *) 0) + (__o1->alignment_mask)) & ~(__o1->alignment_mask))); if ((
(size_t) (__o1...) __o1->chunk)Description
TRUEnever evaluated
FALSEevaluated 21 times by 2 tests
Evaluated by:
  • sort
  • wc
size_t) (__o1->next_free - (char *) __o1->chunk) > (size_t) (__o1->chunk_limit - (char *) __o1->chunk)
(size_t) (__o1...) __o1->chunk)Description
TRUEnever evaluated
FALSEevaluated 21 times by 2 tests
Evaluated by:
  • sort
  • wc
) __o1->next_free = __o1->chunk_limit;
never executed: __o1->next_free = __o1->chunk_limit;
__o1->object_base = __o1->next_free; __value; });
0-21
91 t->tok_len = __extension__ ({ struct obstack *__o1 = (&t->o_tok_len); void *__value = (void *) __o1->object_base; if (__o1->next_free == __value
__o1->next_free == __valueDescription
TRUEevaluated 3 times by 2 tests
Evaluated by:
  • sort
  • wc
FALSEevaluated 18 times by 2 tests
Evaluated by:
  • sort
  • wc
) __o1->maybe_empty_object = 1;
executed 3 times by 2 tests: __o1->maybe_empty_object = 1;
Executed by:
  • sort
  • wc
__o1->next_free = ((sizeof (ptrdiff_t) < sizeof (void *)
sizeof (ptrdif...izeof (void *)Description
TRUEnever evaluated
FALSEevaluated 21 times by 2 tests
Evaluated by:
  • sort
  • wc
? (__o1->object_base) : (char *) 0) + (((__o1->next_free) - (sizeof (ptrdiff_t) < sizeof (void *)
sizeof (ptrdif...izeof (void *)Description
TRUEnever evaluated
FALSEevaluated 21 times by 2 tests
Evaluated by:
  • sort
  • wc
? (__o1->object_base) : (char *) 0) + (__o1->alignment_mask)) & ~(__o1->alignment_mask))); if ((
(size_t) (__o1...) __o1->chunk)Description
TRUEnever evaluated
FALSEevaluated 21 times by 2 tests
Evaluated by:
  • sort
  • wc
size_t) (__o1->next_free - (char *) __o1->chunk) > (size_t) (__o1->chunk_limit - (char *) __o1->chunk)
(size_t) (__o1...) __o1->chunk)Description
TRUEnever evaluated
FALSEevaluated 21 times by 2 tests
Evaluated by:
  • sort
  • wc
) __o1->next_free = __o1->chunk_limit;
never executed: __o1->next_free = __o1->chunk_limit;
__o1->object_base = __o1->next_free; __value; });
0-21
92 return
executed 21 times by 2 tests: return ! ferror (in);
Executed by:
  • sort
  • wc
! ferror (in);
executed 21 times by 2 tests: return ! ferror (in);
Executed by:
  • sort
  • wc
21
93}-
Switch to Source codePreprocessed file

Generated by Squish Coco 4.1.2