Changeset 8ebe212 in mainline
- Timestamp:
- 2018-04-13T12:39:06Z (7 years ago)
- Branches:
- lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export
- Children:
- 18b6a88
- Parents:
- f712a85
- git-author:
- Jiri Svoboda <jiri@…> (2018-04-12 17:38:04)
- git-committer:
- Jiri Svoboda <jiri@…> (2018-04-13 12:39:06)
- Files:
-
- 8 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/genarch/src/ofw/ofw_tree.c
rf712a85 r8ebe212 106 106 * Try to find the disambigued name. 107 107 */ 108 for (ofw_tree_node_t * 108 for (ofw_tree_node_t *cur = node->child; cur; cur = cur->peer) { 109 109 if (str_cmp(cur->da_name, name) == 0) 110 110 return cur; … … 118 118 * are not always fully-qualified. 119 119 */ 120 for (ofw_tree_node_t * 120 for (ofw_tree_node_t *cur = node->child; cur; cur = cur->peer) { 121 121 if (str_cmp(ofw_tree_node_name(cur), name) == 0) 122 122 return cur; … … 138 138 const char *dtype) 139 139 { 140 for (ofw_tree_node_t * 140 for (ofw_tree_node_t *cur = node->child; cur; cur = cur->peer) { 141 141 ofw_tree_property_t *prop = 142 142 ofw_tree_getprop(cur, "device_type"); … … 167 167 phandle handle) 168 168 { 169 for (ofw_tree_node_t * 169 for (ofw_tree_node_t *cur = root; cur; cur = cur->peer) { 170 170 if (cur->node_handle == handle) 171 171 return cur; … … 194 194 const char *dtype) 195 195 { 196 for (ofw_tree_node_t * 196 for (ofw_tree_node_t *cur = node->peer; cur; cur = cur->peer) { 197 197 ofw_tree_property_t *prop = 198 198 ofw_tree_getprop(cur, "device_type"); … … 220 220 const char *name) 221 221 { 222 for (ofw_tree_node_t * 222 for (ofw_tree_node_t *cur = node->peer; cur; cur = cur->peer) { 223 223 ofw_tree_property_t *prop = 224 224 ofw_tree_getprop(cur, "name"); … … 284 284 const char *dtype, ofw_tree_walker_t walker, void *arg) 285 285 { 286 for (ofw_tree_node_t * 286 for (ofw_tree_node_t *cur = node; cur; cur = cur->peer) { 287 287 ofw_tree_property_t *prop = 288 288 ofw_tree_getprop(cur, "device_type"); … … 388 388 char *cur_path = (char *) malloc(PATH_MAX_LEN, 0); 389 389 390 for (ofw_tree_node_t * 390 for (ofw_tree_node_t *cur = node; cur; cur = cur->peer) { 391 391 if ((cur->parent) && (path)) 392 392 snprintf(cur_path, PATH_MAX_LEN, "%s.%s", path, cur->da_name); -
kernel/generic/src/smp/smp_call.c
rf712a85 r8ebe212 222 222 223 223 /* Walk the list manually, so that we can safely remove list items. */ 224 for (link_t * 224 for (link_t *cur = calls_list.head.next, *next = cur->next; 225 225 !list_empty(&calls_list); cur = next, next = cur->next) { 226 226 -
kernel/generic/src/sysinfo/sysinfo.c
rf712a85 r8ebe212 511 511 break; 512 512 case SYSINFO_VAL_VAL: 513 printf(" -> %" PRIun " (%#" PRIxn ")\n", cur->val.val,513 printf(" -> %" PRIun " (%#" PRIxn ")\n", cur->val.val, 514 514 cur->val.val); 515 515 break; … … 519 519 case SYSINFO_VAL_FUNCTION_VAL: 520 520 val = cur->val.gen_val.fn(cur, cur->val.gen_val.data); 521 printf(" -> %" PRIun " (%#" PRIxn ") [generated]\n", val,521 printf(" -> %" PRIun " (%#" PRIxn ") [generated]\n", val, 522 522 val); 523 523 break; -
uspace/app/tester/mm/common.c
rf712a85 r8ebe212 269 269 void fill_block(mem_block_t *block) 270 270 { 271 for (uint8_t * 271 for (uint8_t *pos = block->addr, *end = pos + block->size; 272 272 pos < end; pos++) 273 273 *pos = block_expected_value(block, pos); … … 286 286 void check_block(mem_block_t *block) 287 287 { 288 for (uint8_t * 288 for (uint8_t *pos = block->addr, *end = pos + block->size; 289 289 pos < end; pos++) { 290 290 if (*pos != block_expected_value(block, pos)) { … … 402 402 void fill_area(mem_area_t *area) 403 403 { 404 for (uint8_t * 404 for (uint8_t *pos = area->addr, *end = pos + area->size; 405 405 pos < end; pos++) 406 406 *pos = area_expected_value(area, pos); -
uspace/app/vuhid/main.c
rf712a85 r8ebe212 172 172 { 173 173 printf("Available devices:\n"); 174 for (vuhid_interface_t * 174 for (vuhid_interface_t **i = available_hid_interfaces; *i != NULL; ++i) { 175 175 printf("\t`%s'\t%s\n", (*i)->id, (*i)->name); 176 176 } -
uspace/drv/bus/usb/xhci/hc.c
rf712a85 r8ebe212 87 87 xhci_port_speed_t *speeds = hc->speeds; 88 88 89 for (xhci_extcap_t * 89 for (xhci_extcap_t *ec = hc->xecp; ec; ec = xhci_extcap_next(ec)) { 90 90 xhci_dump_extcap(ec); 91 91 switch (XHCI_REG_RD(ec, XHCI_EC_CAP_ID)) { -
uspace/lib/bithenge/src/script.c
rf712a85 r8ebe212 401 401 const char *name) 402 402 { 403 for (transform_list_t * 403 for (transform_list_t *e = state->transform_list; e; e = e->next) { 404 404 if (!str_cmp(e->name, name)) { 405 405 bithenge_transform_inc_ref(e->transform); -
uspace/lib/c/generic/malloc.c
rf712a85 r8ebe212 874 874 * 875 875 */ 876 void *realloc(void * 876 void *realloc(void *const addr, const size_t size) 877 877 { 878 878 if (size == 0) { … … 988 988 * 989 989 */ 990 void free(void * 990 void free(void *const addr) 991 991 { 992 992 if (addr == NULL) … … 996 996 997 997 /* Calculate the position of the header. */ 998 heap_block_head_t *head 999 =(heap_block_head_t *) (addr - sizeof(heap_block_head_t));998 heap_block_head_t *head = 999 (heap_block_head_t *) (addr - sizeof(heap_block_head_t)); 1000 1000 1001 1001 block_check(head); … … 1012 1012 1013 1013 /* Look at the next block. If it is free, merge the two. */ 1014 heap_block_head_t *next_head 1015 =(heap_block_head_t *) (((void *) head) + head->size);1014 heap_block_head_t *next_head = 1015 (heap_block_head_t *) (((void *) head) + head->size); 1016 1016 1017 1017 if ((void *) next_head < area->end) {
Note:
See TracChangeset
for help on using the changeset viewer.