Searched refs:zbr (Results 1 - 28 of 28) sorted by relevance

/linux-4.4.14/fs/ubifs/
H A Dtnc_misc.c141 const struct ubifs_zbranch *zbr = &znode->zbranch[0]; ubifs_search_zbranch() local
147 cmp = keys_cmp(c, key, &zbr[mid].key); ubifs_search_zbranch()
163 ubifs_assert(keys_cmp(c, key, &zbr[0].key) < 0); ubifs_search_zbranch()
165 ubifs_assert(keys_cmp(c, key, &zbr[*n].key) > 0); ubifs_search_zbranch()
167 ubifs_assert(keys_cmp(c, key, &zbr[*n + 1].key) < 0); ubifs_search_zbranch()
306 struct ubifs_zbranch *zbr = &znode->zbranch[i]; read_znode() local
308 key_read(c, &br->key, &zbr->key); read_znode()
309 zbr->lnum = le32_to_cpu(br->lnum); read_znode()
310 zbr->offs = le32_to_cpu(br->offs); read_znode()
311 zbr->len = le32_to_cpu(br->len); read_znode()
312 zbr->znode = NULL; read_znode()
316 if (zbr->lnum < c->main_first || read_znode()
317 zbr->lnum >= c->leb_cnt || zbr->offs < 0 || read_znode()
318 zbr->offs + zbr->len > c->leb_size || zbr->offs & 7) { read_znode()
324 switch (key_type(c, &zbr->key)) { read_znode()
332 i, key_type(c, &zbr->key)); read_znode()
340 type = key_type(c, &zbr->key); read_znode()
342 if (zbr->len != c->ranges[type].len) { read_znode()
344 type, zbr->len); read_znode()
349 } else if (zbr->len < c->ranges[type].min_len || read_znode()
350 zbr->len > c->ranges[type].max_len) { read_znode()
352 type, zbr->len); read_znode()
398 * @zbr: znode branch
402 * This function loads znode pointed to by @zbr into the TNC cache and
407 struct ubifs_zbranch *zbr, ubifs_load_znode()
413 ubifs_assert(!zbr->znode); ubifs_load_znode()
422 err = read_znode(c, zbr->lnum, zbr->offs, zbr->len, znode); ubifs_load_znode()
436 zbr->znode = znode; ubifs_load_znode()
451 * @zbr: key and position of the node
454 * This function reads a node defined by @zbr from the flash media. Returns
458 int ubifs_tnc_read_node(struct ubifs_info *c, struct ubifs_zbranch *zbr, ubifs_tnc_read_node() argument
461 union ubifs_key key1, *key = &zbr->key; ubifs_tnc_read_node()
466 * 'zbr' has to point to on-flash node. The node may sit in a bud and ubifs_tnc_read_node()
469 wbuf = ubifs_get_wbuf(c, zbr->lnum); ubifs_tnc_read_node()
471 err = ubifs_read_node_wbuf(wbuf, node, type, zbr->len, ubifs_tnc_read_node()
472 zbr->lnum, zbr->offs); ubifs_tnc_read_node()
474 err = ubifs_read_node(c, node, type, zbr->len, zbr->lnum, ubifs_tnc_read_node()
475 zbr->offs); ubifs_tnc_read_node()
486 zbr->lnum, zbr->offs); ubifs_tnc_read_node()
406 ubifs_load_znode(struct ubifs_info *c, struct ubifs_zbranch *zbr, struct ubifs_znode *parent, int iip) ubifs_load_znode() argument
H A Dtnc.c121 struct ubifs_zbranch *zbr; insert_old_idx_znode() local
123 zbr = &znode->parent->zbranch[znode->iip]; insert_old_idx_znode()
124 if (zbr->len) insert_old_idx_znode()
125 return insert_old_idx(c, zbr->lnum, zbr->offs); insert_old_idx_znode()
146 struct ubifs_zbranch *zbr; ins_clr_old_idx_znode() local
148 zbr = &znode->parent->zbranch[znode->iip]; ins_clr_old_idx_znode()
149 if (zbr->len) { ins_clr_old_idx_znode()
150 err = insert_old_idx(c, zbr->lnum, zbr->offs); ins_clr_old_idx_znode()
153 zbr->lnum = 0; ins_clr_old_idx_znode()
154 zbr->offs = 0; ins_clr_old_idx_znode()
155 zbr->len = 0; ins_clr_old_idx_znode()
218 struct ubifs_zbranch *zbr = &zn->zbranch[i]; copy_znode() local
220 if (zbr->znode) copy_znode()
221 zbr->znode->parent = zn; copy_znode()
246 * @zbr: branch of znode to check
251 struct ubifs_zbranch *zbr) dirty_cow_znode()
253 struct ubifs_znode *znode = zbr->znode; dirty_cow_znode()
263 err = add_idx_dirt(c, zbr->lnum, zbr->len); dirty_cow_znode()
274 if (zbr->len) { dirty_cow_znode()
275 err = insert_old_idx(c, zbr->lnum, zbr->offs); dirty_cow_znode()
278 err = add_idx_dirt(c, zbr->lnum, zbr->len); dirty_cow_znode()
282 zbr->znode = zn; dirty_cow_znode()
283 zbr->lnum = 0; dirty_cow_znode()
284 zbr->offs = 0; dirty_cow_znode()
285 zbr->len = 0; dirty_cow_znode()
295 * @zbr: zbranch of leaf node
312 static int lnc_add(struct ubifs_info *c, struct ubifs_zbranch *zbr, lnc_add() argument
319 ubifs_assert(!zbr->leaf); lnc_add()
320 ubifs_assert(zbr->len != 0); lnc_add()
321 ubifs_assert(is_hash_key(c, &zbr->key)); lnc_add()
330 lnc_node = kmemdup(node, zbr->len, GFP_NOFS); lnc_add()
335 zbr->leaf = lnc_node; lnc_add()
342 * @zbr: zbranch of leaf node
348 static int lnc_add_directly(struct ubifs_info *c, struct ubifs_zbranch *zbr, lnc_add_directly() argument
353 ubifs_assert(!zbr->leaf); lnc_add_directly()
354 ubifs_assert(zbr->len != 0); lnc_add_directly()
363 zbr->leaf = node; lnc_add_directly()
369 * @zbr: zbranch of leaf node
372 static void lnc_free(struct ubifs_zbranch *zbr) lnc_free() argument
374 if (!zbr->leaf) lnc_free()
376 kfree(zbr->leaf); lnc_free()
377 zbr->leaf = NULL; lnc_free()
383 * @zbr: key and position of the node
386 * This function reads a "hashed" node defined by @zbr from the leaf node cache
391 static int tnc_read_node_nm(struct ubifs_info *c, struct ubifs_zbranch *zbr, tnc_read_node_nm() argument
396 ubifs_assert(is_hash_key(c, &zbr->key)); tnc_read_node_nm()
398 if (zbr->leaf) { tnc_read_node_nm()
400 ubifs_assert(zbr->len != 0); tnc_read_node_nm()
401 memcpy(node, zbr->leaf, zbr->len); tnc_read_node_nm()
405 err = ubifs_tnc_read_node(c, zbr, node); tnc_read_node_nm()
410 err = lnc_add(c, zbr, node); tnc_read_node_nm()
480 * @zbr: position of node
487 struct ubifs_zbranch *zbr, void *node) fallible_read_node()
491 dbg_tnck(key, "LEB %d:%d, key ", zbr->lnum, zbr->offs); fallible_read_node()
493 ret = try_read_node(c, node, key_type(c, key), zbr->len, zbr->lnum, fallible_read_node()
494 zbr->offs); fallible_read_node()
506 zbr->lnum, zbr->offs, zbr->len); fallible_read_node()
513 * @zbr: zbranch of dent
516 * This function checks if xentry/direntry referred by zbranch @zbr matches name
518 * @zbr is less than @nm, and %NAME_GREATER if it is greater than @nm. In case
521 static int matches_name(struct ubifs_info *c, struct ubifs_zbranch *zbr, matches_name() argument
528 if (!zbr->leaf) { matches_name()
529 dent = kmalloc(zbr->len, GFP_NOFS); matches_name()
533 err = ubifs_tnc_read_node(c, zbr, dent); matches_name()
538 err = lnc_add_directly(c, zbr, dent); matches_name()
542 dent = zbr->leaf; matches_name()
574 struct ubifs_zbranch *zbr; get_znode() local
576 zbr = &znode->zbranch[n]; get_znode()
577 if (zbr->znode) get_znode()
578 znode = zbr->znode; get_znode()
580 znode = ubifs_load_znode(c, zbr, znode, n); get_znode()
796 * @zbr: zbranch of dent
800 * panic if the direntry/xentry referred by @zbr does not exist on the media.
802 * This function checks if xentry/direntry referred by zbranch @zbr matches name
803 * @nm. Returns %NAME_MATCHES it does, %NAME_LESS if the name referred by @zbr
805 * if xentry/direntry referred by @zbr does not exist on the media. A negative
809 struct ubifs_zbranch *zbr, fallible_matches_name()
816 if (!zbr->leaf) { fallible_matches_name()
817 dent = kmalloc(zbr->len, GFP_NOFS); fallible_matches_name()
821 err = fallible_read_node(c, &zbr->key, zbr, dent); fallible_matches_name()
831 err = lnc_add_directly(c, zbr, dent); fallible_matches_name()
835 dent = zbr->leaf; fallible_matches_name()
991 * @zbr: zbranch of dent
997 static int matches_position(struct ubifs_zbranch *zbr, int lnum, int offs) matches_position() argument
999 if (zbr->lnum == lnum && zbr->offs == offs) matches_position()
1114 struct ubifs_zbranch *zbr; dirty_cow_bottom_up() local
1120 zbr = &zp->zbranch[path[--p]]; dirty_cow_bottom_up()
1121 znode = dirty_cow_znode(c, zbr); dirty_cow_bottom_up()
1178 struct ubifs_zbranch *zbr; ubifs_lookup_level0() local
1187 zbr = &znode->zbranch[*n]; ubifs_lookup_level0()
1189 if (zbr->znode) { ubifs_lookup_level0()
1191 znode = zbr->znode; ubifs_lookup_level0()
1196 znode = ubifs_load_znode(c, zbr, znode, *n); ubifs_lookup_level0()
1317 struct ubifs_zbranch *zbr; lookup_level0_dirty() local
1326 zbr = &znode->zbranch[*n]; lookup_level0_dirty()
1328 if (zbr->znode) { lookup_level0_dirty()
1330 znode = dirty_cow_znode(c, zbr); lookup_level0_dirty()
1337 znode = ubifs_load_znode(c, zbr, znode, *n); lookup_level0_dirty()
1340 znode = dirty_cow_znode(c, zbr); lookup_level0_dirty()
1434 struct ubifs_zbranch zbr, *zt; ubifs_tnc_locate() local
1464 zbr = znode->zbranch[n]; ubifs_tnc_locate()
1468 if (ubifs_get_wbuf(c, zbr.lnum)) { ubifs_tnc_locate()
1470 err = ubifs_tnc_read_node(c, &zbr, node); ubifs_tnc_locate()
1474 err = fallible_read_node(c, key, &zbr, node); ubifs_tnc_locate()
1475 if (err <= 0 || maybe_leb_gced(c, zbr.lnum, gc_seq1)) { ubifs_tnc_locate()
1534 struct ubifs_zbranch *zbr; ubifs_tnc_get_bu_keys() local
1542 zbr = &znode->zbranch[n]; ubifs_tnc_get_bu_keys()
1543 key = &zbr->key; ubifs_tnc_get_bu_keys()
1552 lnum = zbr->lnum; ubifs_tnc_get_bu_keys()
1553 offs = ALIGN(zbr->offs + zbr->len, 8); ubifs_tnc_get_bu_keys()
1554 len = zbr->len; ubifs_tnc_get_bu_keys()
1564 if (zbr->lnum != lnum || zbr->offs != offs) ubifs_tnc_get_bu_keys()
1566 offs += ALIGN(zbr->len, 8); ubifs_tnc_get_bu_keys()
1567 len = ALIGN(len, 8) + zbr->len; ubifs_tnc_get_bu_keys()
1579 bu->zbranch[bu->cnt++] = *zbr; ubifs_tnc_get_bu_keys()
1674 * @zbr: zbranch of data node to validate
1679 struct ubifs_zbranch *zbr) validate_data_node()
1691 err = ubifs_check_node(c, buf, zbr->lnum, zbr->offs, 0, 0); validate_data_node()
1698 if (len != zbr->len) { validate_data_node()
1699 ubifs_err(c, "bad node length %d, expected %d", len, zbr->len); validate_data_node()
1705 if (!keys_eq(c, &zbr->key, &key1)) { validate_data_node()
1707 zbr->lnum, zbr->offs); validate_data_node()
1708 dbg_tnck(&zbr->key, "looked for key "); validate_data_node()
1718 ubifs_err(c, "bad node at LEB %d:%d", zbr->lnum, zbr->offs); validate_data_node()
1897 * @zbr: zbranch to insert
1906 const struct ubifs_zbranch *zbr, int n) insert_zbranch()
1918 if (zbr->znode) insert_zbranch()
1919 zbr->znode->iip = n; insert_zbranch()
1924 znode->zbranch[n] = *zbr; insert_zbranch()
1949 * @zbr: branch to insert
1952 * This function inserts a new node described by @zbr into znode @znode. If
1958 struct ubifs_zbranch *zbr, int n) tnc_insert()
1962 union ubifs_key *key = &zbr->key, *key1; tnc_insert()
1973 insert_zbranch(znode, zbr, n); tnc_insert()
2055 zbr->znode->parent = zn; tnc_insert()
2082 insert_zbranch(zi, zbr, n); tnc_insert()
2093 zbr->key = zn->zbranch[0].key; tnc_insert()
2094 zbr->znode = zn; tnc_insert()
2095 zbr->lnum = 0; tnc_insert()
2096 zbr->offs = 0; tnc_insert()
2097 zbr->len = 0; tnc_insert()
2159 struct ubifs_zbranch zbr; ubifs_tnc_add() local
2161 zbr.znode = NULL; ubifs_tnc_add()
2162 zbr.lnum = lnum; ubifs_tnc_add()
2163 zbr.offs = offs; ubifs_tnc_add()
2164 zbr.len = len; ubifs_tnc_add()
2165 key_copy(c, key, &zbr.key); ubifs_tnc_add()
2166 err = tnc_insert(c, znode, &zbr, n + 1); ubifs_tnc_add()
2168 struct ubifs_zbranch *zbr = &znode->zbranch[n]; ubifs_tnc_add() local
2170 lnc_free(zbr); ubifs_tnc_add()
2171 err = ubifs_add_dirt(c, zbr->lnum, zbr->len); ubifs_tnc_add()
2172 zbr->lnum = lnum; ubifs_tnc_add()
2173 zbr->offs = offs; ubifs_tnc_add()
2174 zbr->len = len; ubifs_tnc_add()
2214 struct ubifs_zbranch *zbr = &znode->zbranch[n]; ubifs_tnc_replace() local
2217 if (zbr->lnum == old_lnum && zbr->offs == old_offs) { ubifs_tnc_replace()
2218 lnc_free(zbr); ubifs_tnc_replace()
2219 err = ubifs_add_dirt(c, zbr->lnum, zbr->len); ubifs_tnc_replace()
2222 zbr->lnum = lnum; ubifs_tnc_replace()
2223 zbr->offs = offs; ubifs_tnc_replace()
2224 zbr->len = len; ubifs_tnc_replace()
2245 zbr = &znode->zbranch[n]; ubifs_tnc_replace()
2246 lnc_free(zbr); ubifs_tnc_replace()
2247 err = ubifs_add_dirt(c, zbr->lnum, ubifs_tnc_replace()
2248 zbr->len); ubifs_tnc_replace()
2251 zbr->lnum = lnum; ubifs_tnc_replace()
2252 zbr->offs = offs; ubifs_tnc_replace()
2253 zbr->len = len; ubifs_tnc_replace()
2318 struct ubifs_zbranch *zbr = &znode->zbranch[n]; ubifs_tnc_add_nm() local
2320 lnc_free(zbr); ubifs_tnc_add_nm()
2321 err = ubifs_add_dirt(c, zbr->lnum, zbr->len); ubifs_tnc_add_nm()
2322 zbr->lnum = lnum; ubifs_tnc_add_nm()
2323 zbr->offs = offs; ubifs_tnc_add_nm()
2324 zbr->len = len; ubifs_tnc_add_nm()
2330 struct ubifs_zbranch zbr; ubifs_tnc_add_nm() local
2332 zbr.znode = NULL; ubifs_tnc_add_nm()
2333 zbr.lnum = lnum; ubifs_tnc_add_nm()
2334 zbr.offs = offs; ubifs_tnc_add_nm()
2335 zbr.len = len; ubifs_tnc_add_nm()
2336 key_copy(c, key, &zbr.key); ubifs_tnc_add_nm()
2337 err = tnc_insert(c, znode, &zbr, n + 1); ubifs_tnc_add_nm()
2375 struct ubifs_zbranch *zbr; tnc_delete() local
2384 zbr = &znode->zbranch[n]; tnc_delete()
2385 lnc_free(zbr); tnc_delete()
2387 err = ubifs_add_dirt(c, zbr->lnum, zbr->len); tnc_delete()
2444 zbr = &znode->zbranch[0]; tnc_delete()
2448 znode = dirty_cow_znode(c, zbr); tnc_delete()
2459 c->zroot.lnum = zbr->lnum; tnc_delete()
2460 c->zroot.offs = zbr->offs; tnc_delete()
2461 c->zroot.len = zbr->len; tnc_delete()
2755 struct ubifs_zbranch *zbr; ubifs_tnc_next_ent() local
2798 zbr = &znode->zbranch[n]; ubifs_tnc_next_ent()
2799 dent = kmalloc(zbr->len, GFP_NOFS); ubifs_tnc_next_ent()
2809 dkey = &zbr->key; ubifs_tnc_next_ent()
2816 err = tnc_read_node_nm(c, zbr, dent); ubifs_tnc_next_ent()
3130 struct ubifs_zbranch *zbr; is_leaf_node_in_tnc() local
3140 zbr = &znode->zbranch[n]; is_leaf_node_in_tnc()
3141 if (lnum == zbr->lnum && offs == zbr->offs) is_leaf_node_in_tnc()
3160 zbr = &znode->zbranch[n]; is_leaf_node_in_tnc()
3161 if (lnum == zbr->lnum && offs == zbr->offs) is_leaf_node_in_tnc()
3176 zbr = &znode->zbranch[n]; is_leaf_node_in_tnc()
3177 if (lnum == zbr->lnum && offs == zbr->offs) is_leaf_node_in_tnc()
250 dirty_cow_znode(struct ubifs_info *c, struct ubifs_zbranch *zbr) dirty_cow_znode() argument
486 fallible_read_node(struct ubifs_info *c, const union ubifs_key *key, struct ubifs_zbranch *zbr, void *node) fallible_read_node() argument
808 fallible_matches_name(struct ubifs_info *c, struct ubifs_zbranch *zbr, const struct qstr *nm) fallible_matches_name() argument
1678 validate_data_node(struct ubifs_info *c, void *buf, struct ubifs_zbranch *zbr) validate_data_node() argument
1905 insert_zbranch(struct ubifs_znode *znode, const struct ubifs_zbranch *zbr, int n) insert_zbranch() argument
1957 tnc_insert(struct ubifs_info *c, struct ubifs_znode *znode, struct ubifs_zbranch *zbr, int n) tnc_insert() argument
H A Dtnc_commit.c49 struct ubifs_zbranch *zbr = &znode->zbranch[i]; make_idx_node() local
51 key_write_idx(c, &zbr->key, &br->key); make_idx_node()
52 br->lnum = cpu_to_le32(zbr->lnum); make_idx_node()
53 br->offs = cpu_to_le32(zbr->offs); make_idx_node()
54 br->len = cpu_to_le32(zbr->len); make_idx_node()
55 if (!zbr->lnum || !zbr->len) { make_idx_node()
58 if (zbr->znode) make_idx_node()
59 ubifs_dump_znode(c, zbr->znode); make_idx_node()
73 struct ubifs_zbranch *zbr; make_idx_node() local
75 zbr = &zp->zbranch[znode->iip]; make_idx_node()
76 zbr->lnum = lnum; make_idx_node()
77 zbr->offs = offs; make_idx_node()
78 zbr->len = len; make_idx_node()
462 struct ubifs_zbranch *zbr; layout_in_empty_space() local
466 zbr = &zp->zbranch[i]; layout_in_empty_space()
467 zbr->lnum = lnum; layout_in_empty_space()
468 zbr->offs = offs; layout_in_empty_space()
469 zbr->len = len; layout_in_empty_space()
584 struct ubifs_zbranch *zbr = &znode->zbranch[i]; find_first_dirty() local
586 if (zbr->znode && ubifs_zn_dirty(zbr->znode)) { find_first_dirty()
587 znode = zbr->znode; find_first_dirty()
612 struct ubifs_zbranch *zbr = &znode->zbranch[n]; find_next_dirty() local
614 if (zbr->znode && ubifs_zn_dirty(zbr->znode)) find_next_dirty()
615 return find_first_dirty(zbr->znode); find_next_dirty()
851 struct ubifs_zbranch *zbr = &znode->zbranch[i]; write_index() local
853 key_write_idx(c, &zbr->key, &br->key); write_index()
854 br->lnum = cpu_to_le32(zbr->lnum); write_index()
855 br->offs = cpu_to_le32(zbr->offs); write_index()
856 br->len = cpu_to_le32(zbr->len); write_index()
857 if (!zbr->lnum || !zbr->len) { write_index()
860 if (zbr->znode) write_index()
861 ubifs_dump_znode(c, zbr->znode); write_index()
H A Ddebug.c854 const struct ubifs_zbranch *zbr; ubifs_dump_znode() local
859 zbr = &znode->parent->zbranch[znode->iip]; ubifs_dump_znode()
861 zbr = &c->zroot; ubifs_dump_znode()
864 znode, zbr->lnum, zbr->offs, zbr->len, znode->parent, znode->iip, ubifs_dump_znode()
874 zbr = &znode->zbranch[n]; ubifs_dump_znode()
877 n, zbr->znode, zbr->lnum, zbr->offs, zbr->len, ubifs_dump_znode()
878 dbg_snprintf_key(c, &zbr->key, key_buf, ubifs_dump_znode()
882 n, zbr->znode, zbr->lnum, zbr->offs, zbr->len, ubifs_dump_znode()
883 dbg_snprintf_key(c, &zbr->key, key_buf, ubifs_dump_znode()
1260 * @zbr: zbranch which points to this znode
1262 * This function makes sure that znode referred to by @zbr is all right.
1265 static int dbg_check_znode(struct ubifs_info *c, struct ubifs_zbranch *zbr) dbg_check_znode() argument
1267 struct ubifs_znode *znode = zbr->znode; dbg_check_znode()
1284 if (zbr->len == 0) dbg_check_znode()
1322 err = ubifs_search_zbranch(c, zp, &zbr->key, &n); dbg_check_znode()
1348 min = &zbr->key; dbg_check_znode()
1372 if (zbr != &c->zroot) { dbg_check_znode()
1485 struct ubifs_zbranch *zbr; dbg_check_tnc() local
1488 zbr = &c->zroot; dbg_check_tnc()
1490 zbr = &znode->parent->zbranch[znode->iip]; dbg_check_tnc()
1492 err = dbg_check_znode(c, zbr); dbg_check_tnc()
1567 struct ubifs_zbranch *zbr; dbg_walk_index() local
1588 zbr = &znode->zbranch[0]; dbg_walk_index()
1589 child = zbr->znode; dbg_walk_index()
1591 child = ubifs_load_znode(c, zbr, znode, 0); dbg_walk_index()
1596 zbr->znode = child; dbg_walk_index()
1619 zbr = &znode->zbranch[idx]; dbg_walk_index()
1620 err = leaf_cb(c, zbr, priv); dbg_walk_index()
1623 err, zbr->lnum, zbr->offs); dbg_walk_index()
1636 zbr = &znode->zbranch[idx]; dbg_walk_index()
1637 child = zbr->znode; dbg_walk_index()
1639 child = ubifs_load_znode(c, zbr, znode, idx); dbg_walk_index()
1644 zbr->znode = child; dbg_walk_index()
1656 zbr = &znode->zbranch[0]; dbg_walk_index()
1657 child = zbr->znode; dbg_walk_index()
1659 child = ubifs_load_znode(c, zbr, znode, 0); dbg_walk_index()
1664 zbr->znode = child; dbg_walk_index()
1675 zbr = &znode->parent->zbranch[znode->iip]; dbg_walk_index()
1677 zbr = &c->zroot; dbg_walk_index()
1678 ubifs_msg(c, "dump of znode at LEB %d:%d", zbr->lnum, zbr->offs); dbg_walk_index()
1913 struct ubifs_zbranch *zbr; read_add_inode() local
1932 zbr = &znode->zbranch[n]; read_add_inode()
1933 if (zbr->len < UBIFS_INO_NODE_SZ) { read_add_inode()
1935 (unsigned long)inum, zbr->len); read_add_inode()
1939 ino = kmalloc(zbr->len, GFP_NOFS); read_add_inode()
1943 err = ubifs_tnc_read_node(c, zbr, ino); read_add_inode()
1946 zbr->lnum, zbr->offs, err); read_add_inode()
1965 * @zbr: zbranch of the leaf node to check
1978 static int check_leaf(struct ubifs_info *c, struct ubifs_zbranch *zbr, check_leaf() argument
1984 int err, type = key_type(c, &zbr->key); check_leaf()
1987 if (zbr->len < UBIFS_CH_SZ) { check_leaf()
1989 zbr->len, zbr->lnum, zbr->offs); check_leaf()
1993 node = kmalloc(zbr->len, GFP_NOFS); check_leaf()
1997 err = ubifs_tnc_read_node(c, zbr, node); check_leaf()
2000 zbr->lnum, zbr->offs, err); check_leaf()
2018 type, zbr->lnum, zbr->offs); check_leaf()
2035 ubifs_assert(zbr->len >= UBIFS_DATA_NODE_SZ); check_leaf()
2056 zbr->lnum, zbr->offs, fscki->size); check_leaf()
2065 ubifs_assert(zbr->len >= UBIFS_DENT_NODE_SZ); check_leaf()
2114 ubifs_msg(c, "dump of node at LEB %d:%d", zbr->lnum, zbr->offs); check_leaf()
2148 struct ubifs_zbranch *zbr; check_inodes() local
2233 zbr = &znode->zbranch[n]; check_inodes()
2234 ino = kmalloc(zbr->len, GFP_NOFS); check_inodes()
2238 err = ubifs_tnc_read_node(c, zbr, ino); check_inodes()
2241 zbr->lnum, zbr->offs, err); check_inodes()
2247 (unsigned long)fscki->inum, zbr->lnum, zbr->offs); check_inodes()
H A Dorphan.c823 static int dbg_orphan_check(struct ubifs_info *c, struct ubifs_zbranch *zbr, dbg_orphan_check() argument
830 inum = key_inum(c, &zbr->key); dbg_orphan_check()
833 if (key_type(c, &zbr->key) != UBIFS_INO_KEY) dbg_orphan_check()
835 (unsigned long)inum, key_type(c, &zbr->key)); dbg_orphan_check()
838 err = ubifs_tnc_read_node(c, zbr, ci->node); dbg_orphan_check()
H A Ddebug.h28 struct ubifs_zbranch *zbr, void *priv);
H A Dubifs.h1629 struct ubifs_zbranch *zbr,
1631 int ubifs_tnc_read_node(struct ubifs_info *c, struct ubifs_zbranch *zbr,
/linux-4.4.14/drivers/w1/slaves/
H A Dw1_smem.c4 * Copyright (c) 2004 Evgeniy Polyakov <zbr@ioremap.net>
35 MODULE_AUTHOR("Evgeniy Polyakov <zbr@ioremap.net>");
H A Dw1_therm.c4 * Copyright (c) 2004 Evgeniy Polyakov <zbr@ioremap.net>
38 MODULE_AUTHOR("Evgeniy Polyakov <zbr@ioremap.net>");
/linux-4.4.14/drivers/w1/
H A Dw1_int.h4 * Copyright (c) 2004 Evgeniy Polyakov <zbr@ioremap.net>
H A Dw1_log.h4 * Copyright (c) 2004 Evgeniy Polyakov <zbr@ioremap.net>
H A Dw1_family.h4 * Copyright (c) 2004 Evgeniy Polyakov <zbr@ioremap.net>
H A Dw1_family.c4 * Copyright (c) 2004 Evgeniy Polyakov <zbr@ioremap.net>
H A Dw1_netlink.h4 * Copyright (c) 2003 Evgeniy Polyakov <zbr@ioremap.net>
H A Dw1_int.c4 * Copyright (c) 2004 Evgeniy Polyakov <zbr@ioremap.net>
H A Dw1.h4 * Copyright (c) 2004 Evgeniy Polyakov <zbr@ioremap.net>
H A Dw1_io.c4 * Copyright (c) 2004 Evgeniy Polyakov <zbr@ioremap.net>
H A Dw1.c4 * Copyright (c) 2004 Evgeniy Polyakov <zbr@ioremap.net>
45 MODULE_AUTHOR("Evgeniy Polyakov <zbr@ioremap.net>");
H A Dw1_netlink.c4 * Copyright (c) 2003 Evgeniy Polyakov <zbr@ioremap.net>
/linux-4.4.14/Documentation/connector/
H A Dcn_test.c4 * 2004+ Copyright (c) Evgeniy Polyakov <zbr@ioremap.net>
200 MODULE_AUTHOR("Evgeniy Polyakov <zbr@ioremap.net>");
H A Ducon.c4 * Copyright (c) 2004+ Evgeniy Polyakov <zbr@ioremap.net>
/linux-4.4.14/drivers/w1/masters/
H A Dmatrox_w1.c4 * Copyright (c) 2004 Evgeniy Polyakov <zbr@ioremap.net>
42 MODULE_AUTHOR("Evgeniy Polyakov <zbr@ioremap.net>");
H A Dds2490.c4 * Copyright (c) 2004 Evgeniy Polyakov <zbr@ioremap.net>
1089 MODULE_AUTHOR("Evgeniy Polyakov <zbr@ioremap.net>");
/linux-4.4.14/include/linux/
H A Dconnector.h4 * 2004-2005 Copyright (c) Evgeniy Polyakov <zbr@ioremap.net>
/linux-4.4.14/include/uapi/linux/
H A Dconnector.h4 * 2004-2005 Copyright (c) Evgeniy Polyakov <zbr@ioremap.net>
/linux-4.4.14/drivers/connector/
H A Dcn_queue.c4 * 2004+ Copyright (c) Evgeniy Polyakov <zbr@ioremap.net>
H A Dconnector.c4 * 2004+ Copyright (c) Evgeniy Polyakov <zbr@ioremap.net>
37 MODULE_AUTHOR("Evgeniy Polyakov <zbr@ioremap.net>");
/linux-4.4.14/net/netfilter/
H A Dxt_osf.c2 * Copyright (c) 2003+ Evgeniy Polyakov <zbr@ioremap.net>
424 MODULE_AUTHOR("Evgeniy Polyakov <zbr@ioremap.net>");

Completed in 869 milliseconds