| xs/case_lwrtab.c | |||
|---|---|---|---|
| Criterion | Covered | Total | % |
| statement | 0 | 6 | 0.0 |
| branch | 0 | 4 | 0.0 |
| condition | n/a | ||
| subroutine | n/a | ||
| pod | n/a | ||
| total | 0 | 10 | 0.0 |
| line | stmt | bran | cond | sub | pod | time | code |
|---|---|---|---|---|---|---|---|
| 1 | /* | ||||||
| 2 | * reimplementation of Daniel Bernstein's byte library. | ||||||
| 3 | * placed in the public domain by Uwe Ohse, uwe@ohse.de. | ||||||
| 4 | */ | ||||||
| 5 | #include "case.h" | ||||||
| 6 | char case_lwrtab[256]; | ||||||
| 7 | int case_init_lwrdone; | ||||||
| 8 | |||||||
| 9 | 0 | void case_init_lwrtab(void) | |||||
| 10 | { | ||||||
| 11 | unsigned int i; | ||||||
| 12 | 0 | 0 | for (i=0;i<256;i++) { | ||||
| 13 | 0 | 0 | if (i>='A' && i<='Z') case_lwrtab[i]=i-'A'+'a'; | ||||
| 14 | 0 | else case_lwrtab[i]=i; | |||||
| 15 | } | ||||||
| 16 | 0 | case_init_lwrdone=1; | |||||
| 17 | 0 | } |