Searched refs:new_entry (Results 1 – 6 of 6) sorted by relevance
324 new_entry = NULL; in ramfs_entry_dir_new()328 if ((strcmp(new_entry->fn, dir_buf) == 0) && (new_entry->is_dir == 1)) { in ramfs_entry_dir_new()380 if (new_entry == NULL) { in ramfs_entry_new()385 strcpy(new_entry->fn, fn); in ramfs_entry_new()387 new_entry->data = NULL; in ramfs_entry_new()388 new_entry->size = 0; in ramfs_entry_new()389 new_entry->refs = 0; in ramfs_entry_new()390 new_entry->const_data = 0; in ramfs_entry_new()391 new_entry->is_dir = 0; in ramfs_entry_new()393 new_entry->link_count = 0; in ramfs_entry_new()[all …]
251 ListEntry* new_entry = &buffers_sorted_by_offset_[next_free_entry_]; in CalculateOffsetsIfNeeded() local252 new_entry->offset = candidate_offset; in CalculateOffsetsIfNeeded()253 new_entry->requirements_index = buffer_id; in CalculateOffsetsIfNeeded()260 first_entry = new_entry; in CalculateOffsetsIfNeeded()272 new_entry->next_entry_index = -1; in CalculateOffsetsIfNeeded()280 new_entry->next_entry_index = current_entry->next_entry_index; in CalculateOffsetsIfNeeded()
122 auto* new_entry = new BeamEntry<CTCBeamState>(p, l, this); in AddEntry() local123 beam_entries_.emplace_back(new_entry); in AddEntry()124 return new_entry; in AddEntry()
150 int nghttp2_map_insert(nghttp2_map *map, nghttp2_map_entry *new_entry) in nghttp2_map_insert() argument160 rv = insert(map->table, map->tablelen, new_entry); in nghttp2_map_insert()
1074 struct etharp_q_entry *new_entry; local1076 new_entry = (struct etharp_q_entry *)memp_malloc(MEMP_ARP_QUEUE);1077 if (new_entry != NULL) {1079 new_entry->next = 0;1080 new_entry->p = p;1090 r->next = new_entry;1093 arp_table[i].q = new_entry;
1688 struct nd6_q_entry *new_entry, *r; in nd6_queue_packet() local1738 new_entry = (struct nd6_q_entry *)memp_malloc(MEMP_ND6_QUEUE); in nd6_queue_packet()1739 if ((new_entry == NULL) && (neighbor_cache[neighbor_index].q != NULL)) { in nd6_queue_packet()1745 new_entry = (struct nd6_q_entry *)memp_malloc(MEMP_ND6_QUEUE); in nd6_queue_packet()1747 if (new_entry != NULL) { in nd6_queue_packet()1748 new_entry->next = NULL; in nd6_queue_packet()1749 new_entry->p = p; in nd6_queue_packet()1756 r->next = new_entry; in nd6_queue_packet()1759 neighbor_cache[neighbor_index].q = new_entry; in nd6_queue_packet()
Completed in 12 milliseconds