Annotation of researchv10dc/man/manx/getshares.3, revision 1.1.1.1

1.1       root        1: .TH GETSHARES 3 SHARE
                      2: .SH NAME
                      3: getshares \- get shares file entry given uid
                      4: .SH SYNOPSIS
                      5: .B "#include <shares.h>"
                      6: .br
                      7: .sp
                      8: .B "unsigned long getshares(lp, uid, lock)"
                      9: .br
                     10: .B "struct lnode * lp;"
                     11: .br
                     12: .B "int uid;"
                     13: .br
                     14: .B "int lock;"
                     15: .SH DESCRIPTION
                     16: .I Getshares
                     17: finds the shares entry with the same uid as
                     18: .I uid
                     19: and reads it into an area pointed to by
                     20: .IR lp .
                     21: .I lock
                     22: should be non-zero if the shares data-base should be opened for writing.
                     23: Returns zero if no entry exists,
                     24: (in which case all
                     25: .RI non- uid
                     26: fields of
                     27: .I *lp
                     28: will have been cleared),
                     29: or the ``last used'' time of the entry.
                     30: .I lp\->l_uid
                     31: will always have been set to
                     32: .I uid
                     33: on return.
                     34: .SH "SEE ALSO"
                     35: closeshares(3),
                     36: getshput(3),
                     37: openshares(3),
                     38: putshares(3),
                     39: sharesfile(3).
                     40: .SH DIAGNOSTICS
                     41: .I Getshares
                     42: returns 0
                     43: if entry can't be found, or on error.

unix.superglobalmegacorp.com

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.