• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/editors/

Lines Matching refs:num1

33 static void subCommand(const char *cmd, int num1, int num2);
40 static int deleteLines(int num1, int num2);
41 static int printLines(int num1, int num2, int expandFlag);
42 static int writeLines(const char *file, int num1, int num2);
44 static int searchLines(const char *str, int num1, int num2);
88 int len, num1, num2, have1, have2;
132 if (!getNum(&cp, &have1, &num1))
145 num1 = 1;
155 num1 = curNum;
158 num2 = num1;
162 addLines(num1 + 1);
166 deleteLines(num1, num2);
167 addLines(num1);
171 deleteLines(num1, num2);
205 addLines(num1);
221 printLines(num1, num2, TRUE);
225 printLines(num1, num2, FALSE);
270 num1 = lastNum;
272 if (readLines(cp, num1 + 1))
281 subCommand(cp, num1, num2);
294 num1 = 1;
306 writeLines(cp, num1, num2);
339 printf("%d\n", num1);
365 static void subCommand(const char * cmd, int num1, int num2)
372 if ((num1 < 1) || (num2 > lastNum) || (num1 > num2)) {
439 lp = findLine(num1);
450 while (num1 <= num2) {
455 printLines(num1, num1, FALSE);
461 num1++;
491 printLines(num1, num1, FALSE);
496 num1++;
540 printLines(num1, num1, FALSE);
545 num1++;
903 static int writeLines(const char * file, int num1, int num2)
908 if ((num1 < 1) || (num2 > lastNum) || (num1 > num2)) {
926 lp = findLine(num1);
933 while (num1++ <= num2) {
961 static int printLines(int num1, int num2, int expandFlag)
967 if ((num1 < 1) || (num2 > lastNum) || (num1 > num2)) {
972 lp = findLine(num1);
977 while (num1 <= num2) {
980 setCurNum(num1++);
1019 setCurNum(num1++);
1078 static int deleteLines(int num1, int num2)
1083 if ((num1 < 1) || (num2 > lastNum) || (num1 > num2)) {
1088 lp = findLine(num1);
1093 if ((curNum >= num1) && (curNum <= num2)) {
1096 else if (num1 > 1)
1097 setCurNum(num1 - 1);
1102 count = num2 - num1 + 1;
1134 static int searchLines(const char *str, int num1, int num2)
1139 if ((num1 < 1) || (num2 > lastNum) || (num1 > num2)) {
1158 lp = findLine(num1);
1163 while (num1 <= num2) {
1165 return num1;
1167 num1++;