HomeSort by relevance Sort by last modified time
    Searched refs:trp (Results 1 - 3 of 3) sorted by null

  /external/tcpdump/
token.h 33 #define IS_SOURCE_ROUTED(trp) ((trp)->token_shost[0] & 0x80)
34 #define FRAME_TYPE(trp) (((trp)->token_fc & 0xC0) >> 6)
37 #define BROADCAST(trp) ((ntohs((trp)->token_rcf) & 0xE000) >> 13)
38 #define RIF_LENGTH(trp) ((ntohs((trp)->token_rcf) & 0x1f00) >> 8)
39 #define DIRECTION(trp) ((ntohs((trp)->token_rcf) & 0x0080) >> 7
    [all...]
print-token.c 50 extract_token_addrs(const struct token_header *trp, char *fsrc, char *fdst)
52 memcpy(fdst, (const char *)trp->token_dhost, 6);
53 memcpy(fsrc, (const char *)trp->token_shost, 6);
60 token_hdr_print(register const struct token_header *trp, register u_int length,
70 trp->token_ac,
71 trp->token_fc,
103 const struct token_header *trp; local
109 trp = (const struct token_header *)p;
119 extract_token_addrs(trp, (char*)ESRC(&ehdr), (char*)EDST(&ehdr));
122 if (IS_SOURCE_ROUTED(trp)) {
    [all...]
  /external/ceres-solver/docs/
solving.tex 53 \label{eq:trp}
61 It can be shown, that the solution to~\eqref{eq:trp} can be obtained by solving an unconstrained optimization of the form
91 Another strategy for solving the trust region problem~\eqref{eq:trp} was introduced by M. J. D. Powell. The key idea there is to compute two vectors
    [all...]

Completed in 367 milliseconds