修改4g拨号为QMI,需要在系统里后台执行quectel-CM

hc

2024-10-22 8ac6c7a54ed1b98d142dce24b11c6de6a1e239a5

 kernel/fs/reiserfs/fix_node.c
..
..
@@ -376,7 +376,6 @@
376
376
 		       int to, int to_bytes, short *snum012, int flow)
377
377
 {
378
378
 	int i;
379
-	int cur_free;
380
379
 	int units;
381
380
 	struct virtual_node *vn = tb->tb_vn;
382
381
 	int total_node_size, max_node_size, current_item_size;
..
..
@@ -438,7 +437,6 @@
438
437
 	/* leaf level */
439
438
 	needed_nodes = 1;
440
439
 	total_node_size = 0;
441
-	cur_free = max_node_size;
442
440
 
443
441
 	/* start from 'from'-th item */
444
442
 	start_item = from;
..
..
@@ -613,9 +611,9 @@
613
611
  *	blk_num	number of blocks that S[h] will be splitted into;
614
612
  *	s012	number of items that fall into splitted nodes.
615
613
  *	lbytes	number of bytes which flow to the left neighbor from the
616
- *              item that is not not shifted entirely
614
+ *              item that is not shifted entirely
617
615
  *	rbytes	number of bytes which flow to the right neighbor from the
618
- *              item that is not not shifted entirely
616
+ *              item that is not shifted entirely
619
617
  *	s1bytes	number of bytes which flow to the first  new node when
620
618
  *              S[0] splits (this number is contained in s012 array)
621
619
  */
..
..
@@ -1734,13 +1732,11 @@
1734
1732
 	 * and Fh is its father.
1735
1733
 	 */
1736
1734
 	struct buffer_head *Sh, *Fh;
1737
-	int maxsize, ret;
1735
+	int ret;
1738
1736
 	int lfree, rfree /* free space in L and R */ ;
1739
1737
 
1740
1738
 	Sh = PATH_H_PBUFFER(tb->tb_path, h);
1741
1739
 	Fh = PATH_H_PPARENT(tb->tb_path, h);
1742
-
1743
-	maxsize = MAX_CHILD_SIZE(Sh);
1744
1740
 
1745
1741
 	/*
1746
1742
 	 * using tb->insert_size[h], which is negative in this case,