Searched refs:it (Results 1 - 25 of 417) sorted by relevance

1234567891011>>

/barrelfish-master/lib/openssl-1.0.0d/crypto/asn1/
H A Dtasn_new.c67 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it,
69 static void asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
71 static void asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
73 ASN1_VALUE *ASN1_item_new(const ASN1_ITEM *it) argument
76 if (ASN1_item_ex_new(&ret, it) > 0)
83 int ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
85 return asn1_item_ex_combine_new(pval, it, 0);
88 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, argument
94 const ASN1_AUX *aux = it->funcs;
106 if (it
230 asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
268 const ASN1_ITEM *it = ASN1_ITEM_ptr(tt->item); local
325 ASN1_primitive_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
377 asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
[all...]
H A Dtasn_fre.c65 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine);
69 void ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it) argument
71 asn1_item_combine_free(&val, it, 0);
74 void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
76 asn1_item_combine_free(pval, it, 0);
79 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine) argument
84 const ASN1_AUX *aux = it->funcs;
89 if ((it->itype != ASN1_ITYPE_PRIMITIVE) && !*pval)
96 switch(it->itype)
100 if (it
204 ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
[all...]
H A Dx_bignum.c65 * BIGNUM directly. Currently it ignores the sign which isn't a problem since all
72 static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it);
73 static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
75 static int bn_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it);
76 static int bn_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it);
95 static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
102 static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
105 if(it->size & BN_SENSITIVE) BN_clear_free((BIGNUM *)*pval);
110 static int bn_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it) argument
127 int utype, char *free_cont, const ASN1_ITEM *it)
126 bn_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) argument
[all...]
H A Dx_long.c69 static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it);
70 static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
72 static int long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it);
73 static int long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it);
74 static int long_print(BIO *out, ASN1_VALUE **pval, const ASN1_ITEM *it, int indent, const ASN1_PCTX *pctx);
94 static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
96 *(long *)pval = it->size;
100 static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
102 *(long *)pval = it->size;
105 static int long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it) argument
142 long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) argument
175 long_print(BIO *out, ASN1_VALUE **pval, const ASN1_ITEM *it, int indent, const ASN1_PCTX *pctx) argument
[all...]
H A Dtasn_utl.c76 int asn1_get_choice_selector(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
78 int *sel = offset2ptr(*pval, it->utype);
86 int asn1_set_choice_selector(ASN1_VALUE **pval, int value, const ASN1_ITEM *it) argument
89 sel = offset2ptr(*pval, it->utype);
96 * if it is +1 then the count is incremented. If op is 0 count is
101 int asn1_do_lock(ASN1_VALUE **pval, int op, const ASN1_ITEM *it) argument
105 if ((it->itype != ASN1_ITYPE_SEQUENCE)
106 && (it->itype != ASN1_ITYPE_NDEF_SEQUENCE))
108 aux = it->funcs;
119 fprintf(stderr, "%s: Reference Count: %d\n", it
128 asn1_get_enc_ptr(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
139 asn1_enc_init(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
151 asn1_enc_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
165 asn1_enc_save(ASN1_VALUE **pval, const unsigned char *in, int inlen, const ASN1_ITEM *it) argument
185 asn1_enc_restore(int *len, unsigned char **out, ASN1_VALUE **pval, const ASN1_ITEM *it) argument
[all...]
H A Dbio_ndef.c69 * get a BIO from it then any data written through the BIO
89 const ASN1_ITEM *it; member in struct:ndef_aux_st
105 BIO *BIO_new_NDEF(BIO *out, ASN1_VALUE *val, const ASN1_ITEM *it) argument
109 const ASN1_AUX *aux = it->funcs;
138 if (aux->asn1_cb(ASN1_OP_STREAM_PRE, &val, it, &sarg) <= 0)
142 ndef_aux->it = it;
170 derlen = ASN1_item_ndef_i2d(ndef_aux->val, NULL, ndef_aux->it);
174 derlen = ASN1_item_ndef_i2d(ndef_aux->val, &p, ndef_aux->it);
225 aux = ndef_aux->it
[all...]
H A Dtasn_enc.c68 const ASN1_ITEM *it,
77 const ASN1_ITEM *it, int flags);
84 const ASN1_ITEM *it)
86 return asn1_item_flags_i2d(val, out, it, ASN1_TFLG_NDEF);
89 int ASN1_item_i2d(ASN1_VALUE *val, unsigned char **out, const ASN1_ITEM *it) argument
91 return asn1_item_flags_i2d(val, out, it, 0);
104 const ASN1_ITEM *it, int flags)
110 len = ASN1_item_ex_i2d(&val, NULL, it, -1, flags);
117 ASN1_item_ex_i2d(&val, &p, it, -1, flags);
122 return ASN1_item_ex_i2d(&val, out, it,
83 ASN1_item_ndef_i2d(ASN1_VALUE *val, unsigned char **out, const ASN1_ITEM *it) argument
103 asn1_item_flags_i2d(ASN1_VALUE *val, unsigned char **out, const ASN1_ITEM *it, int flags) argument
130 ASN1_item_ex_i2d(ASN1_VALUE **pval, unsigned char **out, const ASN1_ITEM *it, int tag, int aclass) argument
504 asn1_i2d_ex_primitive(ASN1_VALUE **pval, unsigned char **out, const ASN1_ITEM *it, int tag, int aclass) argument
565 asn1_ex_i2c(ASN1_VALUE **pval, unsigned char *cout, int *putype, const ASN1_ITEM *it) argument
[all...]
H A Dtasn_prn.c160 const ASN1_ITEM *it,
168 const ASN1_ITEM *it, int indent,
177 const ASN1_ITEM *it, const ASN1_PCTX *pctx)
185 sname = it->sname;
186 return asn1_item_print_ctx(out, &ifld, indent, it,
191 const ASN1_ITEM *it,
198 const ASN1_AUX *aux = it->funcs;
224 switch(it->itype)
227 if(it->templates)
230 it
176 ASN1_item_print(BIO *out, ASN1_VALUE *ifld, int indent, const ASN1_ITEM *it, const ASN1_PCTX *pctx) argument
190 asn1_item_print_ctx(BIO *out, ASN1_VALUE **fld, int indent, const ASN1_ITEM *it, const char *fname, const char *sname, int nohdr, const ASN1_PCTX *pctx) argument
519 asn1_primitive_print(BIO *out, ASN1_VALUE **fld, const ASN1_ITEM *it, int indent, const char *fname, const char *sname, const ASN1_PCTX *pctx) argument
[all...]
H A Da_i2d_fp.c11 * apply to all code found in this distribution, be it the RC4, RSA,
120 int ASN1_item_i2d_fp(const ASN1_ITEM *it, FILE *out, void *x) argument
131 ret=ASN1_item_i2d_bio(it,b,x);
137 int ASN1_item_i2d_bio(const ASN1_ITEM *it, BIO *out, void *x) argument
142 n = ASN1_item_i2d(x, &b, it);
H A Da_dup.c11 * apply to all code found in this distribution, be it the RC4, RSA,
93 void *ASN1_item_dup(const ASN1_ITEM *it, void *x) argument
102 i=ASN1_item_i2d(x,&b,it);
106 ret=ASN1_item_d2i(NULL,&p,i, it);
H A Dtasn_dec.c92 const ASN1_ITEM *it,
129 const unsigned char **in, long len, const ASN1_ITEM *it)
136 if (ASN1_item_ex_d2i(pval, in, len, it, -1, 0, 0, &c) > 0)
155 const ASN1_ITEM *it,
161 const ASN1_AUX *aux = it->funcs;
178 switch(it->itype)
181 if (it->templates)
196 it->templates, opt, ctx);
198 return asn1_d2i_ex_primitive(pval, in, len, it,
224 if (!(ASN1_tag2bit(otag) & it
128 ASN1_item_d2i(ASN1_VALUE **pval, const unsigned char **in, long len, const ASN1_ITEM *it) argument
154 ASN1_item_ex_d2i(ASN1_VALUE **pval, const unsigned char **in, long len, const ASN1_ITEM *it, int tag, int aclass, char opt, ASN1_TLC *ctx) argument
766 asn1_d2i_ex_primitive(ASN1_VALUE **pval, const unsigned char **in, long inlen, const ASN1_ITEM *it, int tag, int aclass, char opt, ASN1_TLC *ctx) argument
919 asn1_ex_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) argument
[all...]
/barrelfish-master/usr/tests/cxx/
H A Dstl_map.cpp28 for (auto it = mapkeys.begin(); it != mapkeys.end(); ++it) {
29 std::cout << *it << "->" << simple_map[*it] << std::endl;
/barrelfish-master/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/
H A DDefaultViewerBuildingPolicy.java88 for(Iterator it = factories.keySet().iterator(); it.hasNext(); ) {
89 Object key = it.next();
99 for(Iterator it = factories.keySet().iterator(); it.hasNext(); ) {
100 Object key = it.next();
113 for(Iterator it = availableViewerFactories(viewable.getType()).iterator(); it.hasNext(); ) {
114 Object key = it.next();
H A DMultiViewletType.java55 for(Iterator it = viewletTypeCollection.iterator(); it.hasNext();) {
56 addViewletType((ViewletType)it.next());
90 for(Iterator it = viewletTypeCollection.iterator(); it.hasNext();) {
91 ViewletType viewletType = (ViewletType) it.next();
171 for(Iterator it = viewletTypeCollection.iterator(); it.hasNext(); ) {
172 ViewletType type = (ViewletType) it.next();
190 for(Iterator it
[all...]
H A DSparseViewletStore.java35 * <p> Instead of viewable elements, it contains viewlet data. Each
164 for(Iterator it = indices.iterator(); it.hasNext(); ) {
165 Object index = it.next();
186 for(Iterator it = indices.iterator(); it.hasNext(); ) {
187 Object index = it.next();
H A DUpdateEvent.java59 for(Iterator it = elementsUpdating.iterator(); it.hasNext(); ) {
60 CompoundTerm element = (CompoundTerm)it.next();
/barrelfish-master/lib/libc/gen/
H A Dalarm.c45 struct itimerval it, oitv; local
46 struct itimerval *itp = &it;
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dumsterm.tex34 The notation {\it Name/Arity} is used to specify a functor of name
35 {\it Name} with arity {\it Arity}.
42 A Prolog {\it atom} corresponds to an identifier in other languages.
52 A clause {\it body} can either be of the form
62 Each {\it Goal_i} must be a callable term.
80 A {\it callable term} is either a compound term or an atom.
89 where {\it f} is the {\it functor} of the compound term
91 and {\it t_
[all...]
/barrelfish-master/lib/libc/arm/string/
H A Dmemset.S170 it eq
191 it eq
205 it eq
208 it lt
214 it ge
217 it eq
223 it eq
231 it ge
233 it gt
241 it g
[all...]
H A Dstrcmp.S40 it cs
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dextfd.tex36 and ground compound (e.g.\ {\it f(a, b)})
69 {\it Min .. Max}
72 {\it $Min \leq Max$}
73 and it represents
89 give it a default domain -10000000..10000000.
100 ${\it c_i x_i}$
104 ${\it c_i x_i}$
112 Besides that, every subexpression of the form {\it VarA/VarB} must have
114 The system replaces such a subexpression by a new variable {\it X}
115 and adds a new constraint {\it Var
[all...]
H A Dobsman.tex34 % Don't use a style file for sepiachip because latex2html ignores it
141 and ground compound (e.g.\ {\it f(a, b)})
174 {\it Min .. Max}
177 {\it $Min \leq Max$}
178 and it represents
194 give it a default domain -10000000..10000000.
205 ${\it c_i x_i}$
209 ${\it c_i x_i}$
217 Besides that, every subexpression of the form {\it VarA/VarB} must have
219 The system replaces such a subexpression by a new variable {\it
[all...]
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsparutil.tex38 and it currently contains the following predicates:
44 given list in parallel. Note that it cannot work backwards and generate
53 Parallel version of \bipref{between/3}{../bips/lib/util/between-3.html}. Generates integers between {\it From} and
54 {\it To} in parallel. See also \bipref{fork/2}{../bips/kernel/control/fork-2.html}, on which it is based.
60 backwards and it does not cope with aliasing between the {\it In} and
61 the {\it Out} list, since it is implemented on top of \bipref{findall/3}{../bips/kernel/allsols/findall-3.html}.
69 computations in {\it Goal
[all...]
/barrelfish-master/usr/eclipseclp/CPViz/viztool/src/components/
H A DToolBarFactory.java86 Iterator it = buttons.iterator();
88 while (it.hasNext()) {
89 String s = (String)it.next();
/barrelfish-master/usr/eclipseclp/documents/embedding/
H A Dembjava.tex57 knowledge of the {\it java.util}, {\it java.io} and {\it java.net}
147 To test that everything is working as it should be, and to see a quick
150 {\eclipse} from Java and tells it to write a message to {\tt stdout}. The
162 This tells Java where to find the {\eclipse} installation, so it can run
211 Java source file which uses the Java-{\eclipse} Interface so that it can
214 \subsubsection*{Declare a reference to an {\it EclipseConnection} or an {\it EclipseEngine}}
216 {\it EclipseConnectio
[all...]

Completed in 77 milliseconds

1234567891011>>