NetBSD Cross-Reference & Source Code Search Engine

Home	Sort by: relevance \| last modified time \| path

Full Search

in project(s):

Definition

Symbol

File Path

History

| | Help

Searched defs:fstack_1_count (Results 1 - 4 of 4) sorted by relevancy

/src/usr.bin/sort/
msort.c	`96 static int fstack_count, fstack_1_count, fstack_2_count; variable in typeref:typename:int 108 if (fstack_1_count == MERGE_FNUM) { 123 fstack_1_count = 0; 125 fstack_1[fstack_1_count].fp = mfp; 126 fstack_1[fstack_1_count].get = geteasy; 127 fstack_1_count++; 155 int count = fstack_1_count + fstack_2_count; 175 while (i > 0 && fstack_1_count > 0) 176 fstack[--i] = fstack_1[--fstack_1_count];`
msort.c	`96 static int fstack_count, fstack_1_count, fstack_2_count; variable in typeref:typename:int 108 if (fstack_1_count == MERGE_FNUM) { 123 fstack_1_count = 0; 125 fstack_1[fstack_1_count].fp = mfp; 126 fstack_1[fstack_1_count].get = geteasy; 127 fstack_1_count++; 155 int count = fstack_1_count + fstack_2_count; 175 while (i > 0 && fstack_1_count > 0) 176 fstack[--i] = fstack_1[--fstack_1_count];`
msort.c	`96 static int fstack_count, fstack_1_count, fstack_2_count; variable in typeref:typename:int 108 if (fstack_1_count == MERGE_FNUM) { 123 fstack_1_count = 0; 125 fstack_1[fstack_1_count].fp = mfp; 126 fstack_1[fstack_1_count].get = geteasy; 127 fstack_1_count++; 155 int count = fstack_1_count + fstack_2_count; 175 while (i > 0 && fstack_1_count > 0) 176 fstack[--i] = fstack_1[--fstack_1_count];`
msort.c	`96 static int fstack_count, fstack_1_count, fstack_2_count; variable in typeref:typename:int 108 if (fstack_1_count == MERGE_FNUM) { 123 fstack_1_count = 0; 125 fstack_1[fstack_1_count].fp = mfp; 126 fstack_1[fstack_1_count].get = geteasy; 127 fstack_1_count++; 155 int count = fstack_1_count + fstack_2_count; 175 while (i > 0 && fstack_1_count > 0) 176 fstack[--i] = fstack_1[--fstack_1_count];`

Completed in 41 milliseconds