77 |
|
svr = strdup(svr); |
78 |
|
|
79 |
|
if (mapping == NULL){ |
80 |
– |
printf("New malloc\n"); |
80 |
|
mapping = malloc(sizeof(mapping_t)); |
81 |
|
if (mapping == NULL) return; |
82 |
|
map_ptr = mapping; |
84 |
|
/* See if its already been added */ |
85 |
|
for(map_ptr = mapping; map_ptr != NULL; map_ptr = map_ptr->next){ |
86 |
|
if( (!strcmp(map_ptr->bsd, bsd)) || (!strcmp(map_ptr->svr, svr)) ){ |
88 |
– |
printf("%s matches %s\n", map_ptr->bsd, bsd); |
87 |
|
return; |
88 |
|
} |
89 |
|
map_end_ptr = map_ptr; |
93 |
|
* new mapping_t |
94 |
|
*/ |
95 |
|
map_end_ptr->next = malloc(sizeof(mapping_t)); |
98 |
– |
printf("Second malloc\n"); |
96 |
|
if (map_end_ptr->next == NULL) return; |
97 |
|
map_ptr = map_end_ptr->next; |
98 |
|
} |
99 |
|
|
103 |
– |
printf("Adding %s\n", bsd); |
100 |
|
map_ptr->next = NULL; |
101 |
|
map_ptr->bsd = bsd; |
102 |
|
map_ptr->svr = svr; |
140 |
|
return svr_name; |
141 |
|
} |
142 |
|
} |
147 |
– |
closedir(dirp); |
143 |
|
} |
144 |
+ |
closedir(dirp); |
145 |
|
return NULL; |
146 |
|
} |
147 |
|
|
195 |
|
kstat_io_t kios; |
196 |
|
|
197 |
|
if ((kc = kstat_open()) == NULL) { |
198 |
< |
return NULL; |
198 |
> |
return; |
199 |
|
} |
200 |
|
|
201 |
|
for (ksp = kc->kc_chain; ksp; ksp = ksp->ks_next) { |