| TIP: Click on subject to list as thread! | ANSI |
| echo: | |
|---|---|
| to: | |
| from: | |
| date: | |
| subject: | File name expansion |
Hi..
> accept
> file names, including wildcards, using exactly the same rules as the DOS
> copy command. The output must be a valid path/file name.
Hi...
I don't program in C, but.. dos uses two int 21 functions titled
"findfirst" and "findnext" to do it's searching.. if
you implement a call to those routines with a bit of assembler (Can C have
assembler routines?) you can get the exact same results as dos, bugs &
quirks & all...
Findfirst/findnext have a few strange options to them... any good reference
to dos int 21 calls should be able to help you (Ralf Brown's interrupt list
comes to mind).
Sorry to not be of help, but C isn't my cup of tea... in Pascal I'd just
use the following (Hope you follow pascal... it may help others compose you
a better reply..)
findfirst('*.*',archive,searchrec);
which will find all files '*.*' of type with archive bit set, and load the
data structure searchrec with the first match. Searchrec holds info about
attributes, size, date, time & filename.
I'd then call filndnext(seachrec) until an error occurrs, which flags the
"no more matches" condition.
As you have guessed, findfirst() and findnext() are simply pascal routines to
call dos findfirst and findnext.
Hope this has been of help..
Craig
--- FMail 1.0g
* Origin: Communications Barrier BBS (03) 585 1112, 24hrs (3:632/533)SEEN-BY: 3/103 50/99 78/0 620/243 623/630 632/0 50 107 108 271 304 309 328 SEEN-BY: 632/348 360 393 504 525 530 533 552 998 999 1000 633/371 634/384 388 SEEN-BY: 635/301 502 503 544 637/103 639/252 670/301 711/401 409 410 413 430 SEEN-BY: 711/510 808 809 932 934 712/515 713/888 714/906 800/1 7877/2809 @PATH: 632/533 107 998 635/503 50/99 711/808 809 934 |
|
| SOURCE: echomail via fidonet.ozzmosis.com | |
Email questions or comments to sysop@ipingthereforeiam.com
All parts of this website painstakingly hand-crafted in the U.S.A.!
IPTIA BBS/MUD/Terminal/Game Server List, © 2025 IPTIA Consulting™.